CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2008 vol.30 Issue No.01 - January
Issue No.01 - January (2008 vol.30)
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a vector space, in which distances can be measured efficiently. Each embedding is treated as a classifier that predicts for any three objects X, A, B whether X is closer to A or to B. It is shown that a linear combination of such embeddingbased classifiers naturally corresponds to an embedding and a distance measure. Based on this property, the BoostMap method reduces the problem of embedding construction to the classical boosting problem of combining many weak classifiers into an optimized strong classifier. The classification accuracy of the resulting strong classifier is a direct measure of the amount of nearest neighbor structure preserved by the embedding. An important property of BoostMap is that the embedding optimization criterion is equally valid in both metric and non-metric spaces. Performance is evaluated in databases of hand images, handwritten digits, and time series. In all cases, BoostMap significantly improves retrieval efficiency with small losses in accuracy compared to brute-force search. Moreover, BoostMap significantly outperforms existing nearest neighbor retrieval methods, such as Lipschitz embeddings, FastMap, and VP-trees.
Indexing methods, embedding methods, similarity matching, multimedia databases, nearest neighbor retrieval, nearest neighbor classification, non-Euclidean spaces
Jonathan Alon, Stan Sclaroff, George Kollios, "BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.30, no. 1, pp. 89-104, January 2008, doi:10.1109/TPAMI.2007.1140