Fast Similarity Search for Learned Metrics

@article{Kulis2009FastSS,
  title={Fast Similarity Search for Learned Metrics},
  author={B. Kulis and P. Jain and K. Grauman},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={2009},
  volume={31},
  pages={2143-2157}
}
  • B. Kulis, P. Jain, K. Grauman
  • Published 2009
  • Mathematics, Computer Science, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • We introduce a method that enables scalable similarity search for learned metrics. Given pairwise similarity and dissimilarity constraints between some examples, we learn a Mahalanobis distance function that captures the examples' underlying relationships well. To allow sublinear time similarity search under the learned metric, we show how to encode the learned metric parameterization into randomized locality-sensitive hash functions. We further formulate an indirect solution that enables… CONTINUE READING
    264 Citations
    Fast image search for learned metrics
    • P. Jain, B. Kulis, K. Grauman
    • Mathematics, Computer Science
    • 2008 IEEE Conference on Computer Vision and Pattern Recognition
    • 2008
    • 299
    • PDF
    Kernelized Locality-Sensitive Hashing
    • B. Kulis, K. Grauman
    • Mathematics, Medicine
    • IEEE Transactions on Pattern Analysis and Machine Intelligence
    • 2012
    • 304
    • PDF
    Semi-supervised spectral hashing for fast similarity search
    • 13
    Binary code learning via optimal class representations
    Hashing with Angular Reconstructive Embeddings
    • 69
    Supervised hashing with latent factor models
    • 185
    • PDF
    Hashing with Cauchy Graph
    • 1
    Adaptive hash retrieval with kernel based similarity
    • 39
    • PDF
    Hashing with Graphs
    • 863
    • PDF
    Semi-Supervised SimHash for Efficient Document Similarity Search
    • 21
    • PDF

    References

    SHOWING 1-10 OF 71 REFERENCES
    Fast image search for learned metrics
    • P. Jain, B. Kulis, K. Grauman
    • Mathematics, Computer Science
    • 2008 IEEE Conference on Computer Vision and Pattern Recognition
    • 2008
    • 299
    • PDF
    Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
    • 72
    • PDF
    BoostMap: A method for efficient approximate similarity rankings
    • 75
    • PDF
    The Pyramid Match Kernel: Efficient Learning with Sets of Features
    • 377
    • PDF
    Fast pose estimation with parameter-sensitive hashing
    • 906
    • PDF
    Approximate Correspondences in High Dimensions
    • 122
    • PDF
    Distance Metric Learning with Application to Clustering with Side-Information
    • 2,852
    • PDF
    Metric Learning by Collapsing Classes
    • 704
    • PDF
    Learning Globally-Consistent Local Distance Functions for Shape-Based Image Retrieval and Classification
    • 379
    • PDF
    Information-theoretic metric learning
    • 1,732
    • PDF