1 /***********************************************************************
2 * Software License Agreement (BSD License)
4 * Copyright 2008-2009 Marius Muja (mariusm@cs.ubc.ca). All rights reserved.
5 * Copyright 2008-2009 David G. Lowe (lowe@cs.ubc.ca). All rights reserved.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 *************************************************************************/
31 #ifndef GROUND_TRUTH_H
32 #define GROUND_TRUTH_H
41 void find_nearest(const Matrix<T>& dataset, T* query, int* matches, int nn, int skip = 0)
45 T* query_end = query + dataset.cols;
47 long* match = new long[n];
50 dists[0] = flann_dist(query, query_end, dataset[0]);
54 for (int i=1;i<dataset.rows;++i) {
55 T tmp = flann_dist(query, query_end, dataset[i]);
61 else if (tmp < dists[dcnt-1]) {
68 while (j>=1 && dists[j]<dists[j-1]) {
69 swap(dists[j],dists[j-1]);
70 swap(match[j],match[j-1]);
75 for (int i=0;i<nn;++i) {
76 matches[i] = match[i+skip];
85 void compute_ground_truth(const Matrix<T>& dataset, const Matrix<T>& testset, Matrix<int>& matches, int skip=0)
87 for (int i=0;i<testset.rows;++i) {
88 find_nearest(dataset, testset[i], matches[i], matches.cols, skip);
95 #endif //GROUND_TRUTH_H