#include <opencv2/flann/dist.h>
Public Types | |
typedef T | ElementType |
typedef True | is_kdtree_distance |
typedef True | is_vector_space_distance |
typedef Accumulator< T >::Type | ResultType |
Public Member Functions | |
MinkowskiDistance (int order_) | |
template<typename U , typename V > | |
ResultType | accum_dist (const U &a, const V &b, int) const |
Partial distance, used by the kd-tree. More... | |
template<typename Iterator1 , typename Iterator2 > | |
ResultType | operator() (Iterator1 a, Iterator2 b, size_t size, ResultType worst_dist=-1) const |
Compute the Minkowsky (L_p) distance between two vectors. More... | |
Public Attributes | |
int | order |
typedef T cvflann::MinkowskiDistance< T >::ElementType |
typedef True cvflann::MinkowskiDistance< T >::is_kdtree_distance |
typedef True cvflann::MinkowskiDistance< T >::is_vector_space_distance |
typedef Accumulator<T>::Type cvflann::MinkowskiDistance< T >::ResultType |
|
inline |
|
inline |
Partial distance, used by the kd-tree.
References cvflann::abs(), and cv::pow().
|
inline |
Compute the Minkowsky (L_p) distance between two vectors.
This is highly optimised, with loop unrolling, as it is one of the most expensive inner loops.
The computation of squared root at the end is omitted for efficiency.
References cvflann::abs(), and cv::pow().
int cvflann::MinkowskiDistance< T >::order |