A spectral matching for shape retrieval using pairwise critical points

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The matching and retrieval of shapes is an important challenge in computer vision. A large number of shape similarity approaches have been developed. In this paper, we employ two approaches for improving shape retrieval. First, we use angle gradient to extract contour's critical points, this is a simple approach which decrease the computational cost while retain spatial information of shapes. Second, we present a pairwise similarity measure, which is a quadratic assignment problem. This problem is approximately solved by spectral technique. This method is tested on standard MPEG-7 shape database using the standard performance evaluation scheme. The experimental results indicate that the proposed method outperforms the closely relate method. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Pan, Z., Xiao, G., Chen, K., & Li, Z. (2011). A spectral matching for shape retrieval using pairwise critical points. In Advances in Intelligent and Soft Computing (Vol. 122, pp. 475–482). https://doi.org/10.1007/978-3-642-25664-6_55

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