Distance learning for similarity estimation

Jie Yu, Jaume Amores, Nicu Sebe, Petia Radeva, Qi Tian

    Research output: Contribution to journalArticleResearchpeer-review

    70 Citations (Scopus)

    Abstract

    In this paper, we present a general guideline to find a better distance measure for similarity estimation based on statistical analysis of distribution models and distance functions. A new set of distance measures are derived from the harmonic distance, the geometric distance, and their generalized variants according to the Maximum Likelihood theory. These measures can provide a more accurate feature model than the classical Euclidean and Manhattan distances. We also find that the feature elements are often from heterogeneous sources that may have different influence on similarity estimation. Therefore, the assumption of single isotropic distribution model is often inappropriate. To alleviate this problem, we use a boosted distance measure framework that finds multiple distance measures which fit the distribution of selected feature elements best for accurate similarity estimation. The new distance measures for similarity estimation are tested on two applications: stereo matching and motion tracking in video sequences. The performance of boosted distance measure is further evaluated on several benchmark data sets from the UCI repository and two image retrieval applications. In all the experiments, robust results are obtained based on the proposed methods. © 2008 IEEE.
    Original languageEnglish
    Pages (from-to)451-462
    JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
    Volume30
    Issue number3
    DOIs
    Publication statusPublished - 1 Mar 2008

    Keywords

    • Algorithms
    • Artificial intelligence
    • Image classification
    • Information retrieval
    • Pattern recognition

    Fingerprint Dive into the research topics of 'Distance learning for similarity estimation'. Together they form a unique fingerprint.

  • Cite this