#include <kdtree_single_index.h>
Inherits cvflann::NNIndex< Distance >.
Classes | |
| struct | Interval |
| struct | Node |
Public Types | |
| typedef Distance::ElementType | ElementType |
| typedef Distance::ResultType | DistanceType |
Public Member Functions | |
| KDTreeSingleIndex (const Matrix< ElementType > &inputData, const IndexParams ¶ms=KDTreeSingleIndexParams(), Distance d=Distance()) | |
| KDTreeSingleIndex (const KDTreeSingleIndex &) | |
| KDTreeSingleIndex & | operator= (const KDTreeSingleIndex &) |
| ~KDTreeSingleIndex () | |
| void | buildIndex () |
| flann_algorithm_t | getType () const |
| void | saveIndex (FILE *stream) |
| Saves the index to a stream. | |
| void | loadIndex (FILE *stream) |
| Loads the index from a stream. | |
| size_t | size () const |
| size_t | veclen () const |
| int | usedMemory () const |
| void | knnSearch (const Matrix< ElementType > &queries, Matrix< int > &indices, Matrix< DistanceType > &dists, int knn, const SearchParams ¶ms) |
| Perform k-nearest neighbor search. | |
| IndexParams | getParameters () const |
| void | findNeighbors (ResultSet< DistanceType > &result, const ElementType *vec, const SearchParams &searchParams) |
| virtual int | radiusSearch (const Matrix< ElementType > &query, Matrix< int > &indices, Matrix< DistanceType > &dists, float radius, const SearchParams ¶ms) |
| Perform radius search. | |
Randomized kd-tree index
Contains the k-d trees and other information for indexing a set of points for nearest-neighbor matching.
| typedef Distance::ElementType cvflann::KDTreeSingleIndex< Distance >::ElementType |
Reimplemented from cvflann::NNIndex< Distance >.
| typedef Distance::ResultType cvflann::KDTreeSingleIndex< Distance >::DistanceType |
Reimplemented from cvflann::NNIndex< Distance >.
| cvflann::KDTreeSingleIndex< Distance >::KDTreeSingleIndex | ( | const Matrix< ElementType > & | inputData, |
| const IndexParams & | params = KDTreeSingleIndexParams(), |
||
| Distance | d = Distance() |
||
| ) |
KDTree constructor
Params: inputData = dataset with the input features params = parameters passed to the kdtree algorithm
| cvflann::KDTreeSingleIndex< Distance >::KDTreeSingleIndex | ( | const KDTreeSingleIndex< Distance > & | ) |
| cvflann::KDTreeSingleIndex< Distance >::~KDTreeSingleIndex | ( | ) |
Standard destructor
| KDTreeSingleIndex& cvflann::KDTreeSingleIndex< Distance >::operator= | ( | const KDTreeSingleIndex< Distance > & | ) |
| void cvflann::KDTreeSingleIndex< Distance >::buildIndex | ( | ) | [virtual] |
Builds the index
Implements cvflann::NNIndex< Distance >.
| flann_algorithm_t cvflann::KDTreeSingleIndex< Distance >::getType | ( | ) | const [virtual] |
Implements cvflann::NNIndex< Distance >.
| void cvflann::KDTreeSingleIndex< Distance >::saveIndex | ( | FILE * | stream | ) | [virtual] |
Saves the index to a stream.
| stream | The stream to save the index to |
Implements cvflann::NNIndex< Distance >.
| void cvflann::KDTreeSingleIndex< Distance >::loadIndex | ( | FILE * | stream | ) | [virtual] |
Loads the index from a stream.
| stream | The stream from which the index is loaded |
Implements cvflann::NNIndex< Distance >.
| size_t cvflann::KDTreeSingleIndex< Distance >::size | ( | ) | const [virtual] |
Returns size of index.
Implements cvflann::NNIndex< Distance >.
| size_t cvflann::KDTreeSingleIndex< Distance >::veclen | ( | ) | const [virtual] |
Returns the length of an index feature.
Implements cvflann::NNIndex< Distance >.
| int cvflann::KDTreeSingleIndex< Distance >::usedMemory | ( | ) | const [virtual] |
Computes the inde memory usage Returns: memory used by the index
Implements cvflann::NNIndex< Distance >.
| void cvflann::KDTreeSingleIndex< Distance >::knnSearch | ( | const Matrix< ElementType > & | queries, |
| Matrix< int > & | indices, | ||
| Matrix< DistanceType > & | dists, | ||
| int | knn, | ||
| const SearchParams & | params | ||
| ) | [virtual] |
Perform k-nearest neighbor search.
| [in] | queries | The query points for which to find the nearest neighbors |
| [out] | indices | The indices of the nearest neighbors found |
| [out] | dists | Distances to the nearest neighbors found |
| [in] | knn | Number of nearest neighbors to return |
| [in] | params | Search parameters |
Reimplemented from cvflann::NNIndex< Distance >.
| IndexParams cvflann::KDTreeSingleIndex< Distance >::getParameters | ( | ) | const [virtual] |
Implements cvflann::NNIndex< Distance >.
| void cvflann::KDTreeSingleIndex< Distance >::findNeighbors | ( | ResultSet< DistanceType > & | result, |
| const ElementType * | vec, | ||
| const SearchParams & | searchParams | ||
| ) | [virtual] |
Find set of nearest neighbors to vec. Their indices are stored inside the result object.
Params: result = the result object in which the indices of the nearest-neighbors are stored vec = the vector for which to search the nearest neighbors maxCheck = the maximum number of restarts (in a best-bin-first manner)
Implements cvflann::NNIndex< Distance >.
| virtual int cvflann::NNIndex< Distance >::radiusSearch | ( | const Matrix< ElementType > & | query, |
| Matrix< int > & | indices, | ||
| Matrix< DistanceType > & | dists, | ||
| float | radius, | ||
| const SearchParams & | params | ||
| ) | [virtual, inherited] |
Perform radius search.
| [in] | query | The query point |
| [out] | indices | The indinces of the neighbors found within the given radius |
| [out] | dists | The distances to the nearest neighbors found |
| [in] | radius | The radius used for search |
| [in] | params | Search parameters |
Reimplemented in cvflann::Index< Distance >, cvflann::Index< L1< ElementType > >, and cvflann::Index< L2< ElementType > >.