资源论文A Linear Time Histogram Metric for Improved SIFT Matching

A Linear Time Histogram Metric for Improved SIFT Matching

2020-03-30 | |  80 |   49 |   0

Abstract

We present a new metric between histograms such as SIFT descriptors and a linear time algorithm for its computation. It is common practice to use the L2 metric for comparing SIFT descriptors. This prac- tice assumes that SIFT bins are aligned, an assumption which is often not correct due to quantization, distortion, occlusion etc. In this paper we present a new Earth Mover’s Distance (EMD) vari- ant. We show that it is a metric (unlike the original EMD [1] which is a metric only for normalized histograms). Moreover, it is a natural ex- tension of the L1 metric. Second, we propose a linear time algorithm for the computation of the EMD variant, with a robust ground distance for oriented gradients. Finally, extensive experimental results on the Miko- la jczyk and Schmid dataset [2] show that our method outperforms state of the art distances.

上一篇:Temporal Surface Tracking Using Mesh Evolution

下一篇:Automatic Generator of Minimal Problem Solvers

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...