public static class opencv_core.KDTree extends Pointer
| Modifier and Type | Class and Description |
|---|---|
static class |
opencv_core.KDTree.Node
The node of the search tree.
|
Pointer.CustomDeallocator, Pointer.Deallocator, Pointer.NativeDeallocator| Constructor and Description |
|---|
opencv_core.KDTree()
the default constructor
|
opencv_core.KDTree(int size) |
opencv_core.KDTree(opencv_core.Mat points) |
opencv_core.KDTree(opencv_core.Mat points,
boolean copyAndReorderPoints)
the full constructor that builds the search tree
|
opencv_core.KDTree(opencv_core.Mat points,
opencv_core.Mat _labels) |
opencv_core.KDTree(opencv_core.Mat points,
opencv_core.Mat _labels,
boolean copyAndReorderPoints)
the full constructor that builds the search tree
|
opencv_core.KDTree(Pointer p) |
| Modifier and Type | Method and Description |
|---|---|
void |
build(opencv_core.Mat points) |
void |
build(opencv_core.Mat points,
boolean copyAndReorderPoints)
builds the search tree
|
void |
build(opencv_core.Mat points,
opencv_core.Mat labels) |
void |
build(opencv_core.Mat points,
opencv_core.Mat labels,
boolean copyAndReorderPoints)
builds the search tree
|
int |
dims()
returns the search space dimensionality
|
int |
findNearest(opencv_core.Mat vec,
int K,
int Emax,
opencv_core.Mat neighborsIdx) |
int |
findNearest(opencv_core.Mat vec,
int K,
int Emax,
opencv_core.Mat neighborsIdx,
opencv_core.Mat neighbors,
opencv_core.Mat dist,
opencv_core.Mat labels)
finds the K nearest neighbors of "vec" while looking at Emax (at most) leaves
|
void |
findOrthoRange(opencv_core.Mat minBounds,
opencv_core.Mat maxBounds,
opencv_core.Mat neighborsIdx) |
void |
findOrthoRange(opencv_core.Mat minBounds,
opencv_core.Mat maxBounds,
opencv_core.Mat neighborsIdx,
opencv_core.Mat neighbors,
opencv_core.Mat labels)
finds all the points from the initial set that belong to the specified box
|
FloatPointer |
getPoint(int ptidx) |
float[] |
getPoint(int ptidx,
int[] label) |
FloatBuffer |
getPoint(int ptidx,
IntBuffer label) |
FloatPointer |
getPoint(int ptidx,
IntPointer label)
return a vector with the specified index
|
void |
getPoints(opencv_core.Mat idx,
opencv_core.Mat pts) |
void |
getPoints(opencv_core.Mat idx,
opencv_core.Mat pts,
opencv_core.Mat labels)
returns vectors with the specified indices
|
IntPointer |
labels()
the parallel array of labels.
|
opencv_core.KDTree |
labels(IntPointer labels) |
int |
maxDepth()
maximum depth of the search tree.
|
opencv_core.KDTree |
maxDepth(int maxDepth) |
opencv_core.KDTree.Node |
nodes()
all the tree nodes
|
opencv_core.KDTree |
nodes(opencv_core.KDTree.Node nodes) |
int |
normType()
type of the distance (cv::NORM_L1 or cv::NORM_L2) used for search.
|
opencv_core.KDTree |
normType(int normType) |
opencv_core.Mat |
points()
all the points.
|
opencv_core.KDTree |
points(opencv_core.Mat points) |
opencv_core.KDTree |
position(int position) |
address, asBuffer, asByteBuffer, capacity, capacity, deallocate, deallocate, deallocateReferences, deallocator, deallocator, equals, fill, hashCode, isNull, limit, limit, memchr, memcmp, memcpy, memmove, memset, offsetof, position, put, setNull, sizeof, toString, withDeallocator, zeropublic opencv_core.KDTree(Pointer p)
public opencv_core.KDTree(int size)
public opencv_core.KDTree()
public opencv_core.KDTree(opencv_core.Mat points, boolean copyAndReorderPoints)
public opencv_core.KDTree(opencv_core.Mat points)
public opencv_core.KDTree(opencv_core.Mat points, opencv_core.Mat _labels, boolean copyAndReorderPoints)
public opencv_core.KDTree(opencv_core.Mat points, opencv_core.Mat _labels)
public opencv_core.KDTree position(int position)
public void build(opencv_core.Mat points, boolean copyAndReorderPoints)
public void build(opencv_core.Mat points)
public void build(opencv_core.Mat points, opencv_core.Mat labels, boolean copyAndReorderPoints)
public void build(opencv_core.Mat points, opencv_core.Mat labels)
public int findNearest(opencv_core.Mat vec, int K, int Emax, opencv_core.Mat neighborsIdx, opencv_core.Mat neighbors, opencv_core.Mat dist, opencv_core.Mat labels)
public int findNearest(opencv_core.Mat vec, int K, int Emax, opencv_core.Mat neighborsIdx)
public void findOrthoRange(opencv_core.Mat minBounds, opencv_core.Mat maxBounds, opencv_core.Mat neighborsIdx, opencv_core.Mat neighbors, opencv_core.Mat labels)
public void findOrthoRange(opencv_core.Mat minBounds, opencv_core.Mat maxBounds, opencv_core.Mat neighborsIdx)
public void getPoints(opencv_core.Mat idx, opencv_core.Mat pts, opencv_core.Mat labels)
public void getPoints(opencv_core.Mat idx, opencv_core.Mat pts)
public FloatPointer getPoint(int ptidx, IntPointer label)
public FloatPointer getPoint(int ptidx)
public FloatBuffer getPoint(int ptidx, IntBuffer label)
public float[] getPoint(int ptidx,
int[] label)
public int dims()
public opencv_core.KDTree.Node nodes()
public opencv_core.KDTree nodes(opencv_core.KDTree.Node nodes)
public opencv_core.Mat points()
public opencv_core.KDTree points(opencv_core.Mat points)
public IntPointer labels()
public opencv_core.KDTree labels(IntPointer labels)
public int maxDepth()
public opencv_core.KDTree maxDepth(int maxDepth)
public int normType()
public opencv_core.KDTree normType(int normType)
Copyright © 2014. All Rights Reserved.