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 COMPOSITETREE_H
32 #define COMPOSITETREE_H
34 #include "constants.h"
40 class CompositeIndex : public NNIndex
45 const Matrix<float> dataset;
50 CompositeIndex(const Matrix<float>& inputData, const CompositeIndexParams& params = CompositeIndexParams() ) : dataset(inputData)
52 KDTreeIndexParams kdtree_params(params.trees);
53 KMeansIndexParams kmeans_params(params.branching, params.iterations, params.centers_init, params.cb_index);
55 kdtree = new KDTreeIndex(inputData,kdtree_params);
56 kmeans = new KMeansIndex(inputData,kmeans_params);
60 virtual ~CompositeIndex()
67 flann_algorithm_t getType() const
84 int usedMemory() const
86 return kmeans->usedMemory()+kdtree->usedMemory();
91 logger.info("Building kmeans tree...\n");
93 logger.info("Building kdtree tree...\n");
98 void saveIndex(FILE* /*stream*/)
104 void loadIndex(FILE* /*stream*/)
109 void findNeighbors(ResultSet& result, const float* vec, const SearchParams& searchParams)
111 kmeans->findNeighbors(result,vec,searchParams);
112 kdtree->findNeighbors(result,vec,searchParams);
116 // Params estimateSearchParams(float precision, Dataset<float>* testset = NULL)
128 #endif //COMPOSITETREE_H