#include <FlannIndex.h>
|
std::vector< unsigned int > | addPoints (const cv::Mat &features) |
|
void | buildKDTreeIndex (const cv::Mat &features, int trees=4, bool useDistanceL1=false, float rebalancingFactor=2.0f) |
|
void | buildKDTreeSingleIndex (const cv::Mat &features, int leafMaxSize=10, bool reorder=true, bool useDistanceL1=false, float rebalancingFactor=2.0f) |
|
void | buildLinearIndex (const cv::Mat &features, bool useDistanceL1=false, float rebalancingFactor=2.0f) |
|
void | buildLSHIndex (const cv::Mat &features, unsigned int table_number=12, unsigned int key_size=20, unsigned int multi_probe_level=2, float rebalancingFactor=2.0f) |
|
int | featuresDim () const |
|
int | featuresType () const |
|
| FlannIndex () |
|
unsigned int | indexedFeatures () const |
|
bool | isBuilt () |
|
void | knnSearch (const cv::Mat &query, cv::Mat &indices, cv::Mat &dists, int knn, int checks=32, float eps=0.0, bool sorted=true) const |
|
unsigned long | memoryUsed () const |
|
void | radiusSearch (const cv::Mat &query, std::vector< std::vector< size_t > > &indices, std::vector< std::vector< float > > &dists, float radius, int maxNeighbors=0, int checks=32, float eps=0.0, bool sorted=true) const |
|
void | release () |
|
void | removePoint (unsigned int index) |
|
virtual | ~FlannIndex () |
|
Definition at line 37 of file FlannIndex.h.
rtabmap::FlannIndex::FlannIndex |
( |
| ) |
|
rtabmap::FlannIndex::~FlannIndex |
( |
| ) |
|
|
virtual |
std::vector< unsigned int > rtabmap::FlannIndex::addPoints |
( |
const cv::Mat & |
features | ) |
|
void rtabmap::FlannIndex::buildKDTreeIndex |
( |
const cv::Mat & |
features, |
|
|
int |
trees = 4 , |
|
|
bool |
useDistanceL1 = false , |
|
|
float |
rebalancingFactor = 2.0f |
|
) |
| |
void rtabmap::FlannIndex::buildKDTreeSingleIndex |
( |
const cv::Mat & |
features, |
|
|
int |
leafMaxSize = 10 , |
|
|
bool |
reorder = true , |
|
|
bool |
useDistanceL1 = false , |
|
|
float |
rebalancingFactor = 2.0f |
|
) |
| |
void rtabmap::FlannIndex::buildLinearIndex |
( |
const cv::Mat & |
features, |
|
|
bool |
useDistanceL1 = false , |
|
|
float |
rebalancingFactor = 2.0f |
|
) |
| |
void rtabmap::FlannIndex::buildLSHIndex |
( |
const cv::Mat & |
features, |
|
|
unsigned int |
table_number = 12 , |
|
|
unsigned int |
key_size = 20 , |
|
|
unsigned int |
multi_probe_level = 2 , |
|
|
float |
rebalancingFactor = 2.0f |
|
) |
| |
int rtabmap::FlannIndex::featuresDim |
( |
| ) |
const |
|
inline |
int rtabmap::FlannIndex::featuresType |
( |
| ) |
const |
|
inline |
unsigned int rtabmap::FlannIndex::indexedFeatures |
( |
| ) |
const |
bool rtabmap::FlannIndex::isBuilt |
( |
| ) |
|
void rtabmap::FlannIndex::knnSearch |
( |
const cv::Mat & |
query, |
|
|
cv::Mat & |
indices, |
|
|
cv::Mat & |
dists, |
|
|
int |
knn, |
|
|
int |
checks = 32 , |
|
|
float |
eps = 0.0 , |
|
|
bool |
sorted = true |
|
) |
| const |
unsigned long rtabmap::FlannIndex::memoryUsed |
( |
| ) |
const |
void rtabmap::FlannIndex::radiusSearch |
( |
const cv::Mat & |
query, |
|
|
std::vector< std::vector< size_t > > & |
indices, |
|
|
std::vector< std::vector< float > > & |
dists, |
|
|
float |
radius, |
|
|
int |
maxNeighbors = 0 , |
|
|
int |
checks = 32 , |
|
|
float |
eps = 0.0 , |
|
|
bool |
sorted = true |
|
) |
| const |
void rtabmap::FlannIndex::release |
( |
| ) |
|
void rtabmap::FlannIndex::removePoint |
( |
unsigned int |
index | ) |
|
std::map<int, cv::Mat> rtabmap::FlannIndex::addedDescriptors_ |
|
private |
int rtabmap::FlannIndex::featuresDim_ |
|
private |
int rtabmap::FlannIndex::featuresType_ |
|
private |
void* rtabmap::FlannIndex::index_ |
|
private |
bool rtabmap::FlannIndex::isLSH_ |
|
private |
unsigned int rtabmap::FlannIndex::nextIndex_ |
|
private |
float rtabmap::FlannIndex::rebalancingFactor_ |
|
private |
std::list<int> rtabmap::FlannIndex::removedIndexes_ |
|
private |
bool rtabmap::FlannIndex::useDistanceL1_ |
|
private |
The documentation for this class was generated from the following files: