Learning robust similarity measures for 3D partial shape retrieval

30Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.

Your institution provides access to this article.

Abstract

In this paper, we propose a novel approach to learning robust ground distance functions of the Earth Mover's distance to make it appropriate for quantifying the partial similarity between two feature-sets. First, we define the ground distance as a monotonic transformation of commonly used feature-to-feature base distance (or similarity) measures, so that in computing the Earth Mover's distance, the algorithm could better turn its focus on the feature pairs that are correctly matched, while being less affected by irrelevant ones. As a result, the proposed method is especially suited for 3D partial shape retrieval where occlusion and clutter are serious problems. We prove that when the transformation satisfies certain conditions, the metric property of the base distance is sufficient to guarantee the ground distance is a metric (and so is the Earth Mover's distance), which makes fast shape retrieval on large databases technically possible. Second, we propose a discriminative learning framework to optimize the transformation function based on the real Adaboost algorithm. The optimization is performed in the space of the piecewise constant approximations of the transformation without making any parametric assumption. Finally, extensive experiments on 3D partial shape retrieval convincingly demonstrate the effectiveness of the proposed techniques. © 2009 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Liu, Y., Wang, X. L., Wang, H. Y., Zha, H., & Qin, H. (2010). Learning robust similarity measures for 3D partial shape retrieval. International Journal of Computer Vision, 89(2–3), 408–431. https://doi.org/10.1007/s11263-009-0298-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free