A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Elements of information theory
Elements of information theory
Pattern Recognition Letters
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Dimensionality reduction for similarity searching in dynamic databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Indexing large metric spaces for similarity search queries
ACM Transactions on Database Systems (TODS)
Improved Boosting Algorithms Using Confidence-rated Predictions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Dimensionality reduction and similarity computation by inner product approximations
Proceedings of the ninth international conference on Information and knowledge management
ACM Computing Surveys (CSUR)
Clustering for Approximate Similarity Search in High-Dimensional Spaces
IEEE Transactions on Knowledge and Data Engineering
Comparing Images Using the Hausdorff Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
VQ-index: an index structure for similarity searching in multimedia databases
Proceedings of the tenth ACM international conference on Multimedia
Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Approximate similarity retrieval with M-trees
The VLDB Journal — The International Journal on Very Large Data Bases
Properties of Embedding Methods for Similarity Searching in Metric Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Cluster-preserving Embedding of Proteins
Cluster-preserving Embedding of Proteins
Fast Pose Estimation with Parameter-Sensitive Hashing
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Indexing multi-dimensional time-series with support for multiple distance measures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Pattern Analysis and Machine Intelligence
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
FloatBoost Learning and Statistical Face Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic 2D Hand Tracking in Video Sequences
WACV-MOTION '05 Proceedings of the Seventh IEEE Workshops on Application of Computer Vision (WACV/MOTION'05) - Volume 1 - Volume 01
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient Nearest Neighbor Classification Using a Cascade of Approximate Similarity Measures
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Boosting Nearest Neighbor Classi.ers for Multiclass Recognition
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03
Online and Offline Character Recognition Using Alignment to Prototypes
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
Learning embeddings for indexing, retrieval, and classification, with applications to object and shape recognition in image databases
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The geometry of graphs and some of its algorithmic applications
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
BoostMap: a method for efficient approximate similarity rankings
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Learning a discriminative classifier using shape context distances
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Nearest neighbor search methods for handshape recognition
Proceedings of the 1st international conference on PErvasive Technologies Related to Assistive Environments
Viewpoint Invariant Pedestrian Recognition with an Ensemble of Localized Features
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I
Image categorization combining neighborhood methods and boosting
LS-MMRM '09 Proceedings of the First ACM workshop on Large-scale multimedia retrieval and mining
A database-based framework for gesture recognition
Personal and Ubiquitous Computing
Indexing inexact proximity search with distance regression in pivot space
Proceedings of the Third International Conference on SImilarity Search and APplications
Enhancing Clustering Quality through Landmark-Based Dimensionality Reduction
ACM Transactions on Knowledge Discovery from Data (TKDD)
Versatile probability-based indexing for approximate similarity search
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Distributed similarity estimation using derived dimensions
The VLDB Journal — The International Journal on Very Large Data Bases
Boosting k-NN for Categorization of Natural Scenes
International Journal of Computer Vision
Semi-supervised object recognition based on Connected Image Transformations
Expert Systems with Applications: An International Journal
| Hi-index | 0.15 |
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.