template struct cvflann::HistIntersectionDistance

Overview

#include <dist.h>

template <class T>
struct HistIntersectionDistance
{
    // typedefs

    typedef T ElementType;
    typedef True is_kdtree_distance;
    typedef True is_vector_space_distance;
    typedef Accumulator<T>::Type ResultType;

    // methods

    template <
        typename U,
        typename V
        >
    ResultType
    accum_dist(
        const U& a,
        const V& b,
        int
        ) const;

    template <
        typename Iterator1,
        typename Iterator2
        >
    ResultType
    operator()(
        Iterator1 a,
        Iterator2 b,
        size_t size,
        ResultType worst_dist = -1
        ) const;
};

Detailed Documentation

Methods

template <
    typename U,
    typename V
    >
ResultType
accum_dist(
    const U& a,
    const V& b,
    int
    ) const

Partial distance, used by the kd-tree.

template <
    typename Iterator1,
    typename Iterator2
    >
ResultType
operator()(
    Iterator1 a,
    Iterator2 b,
    size_t size,
    ResultType worst_dist = -1
    ) const

Compute the histogram intersection distance