Fast correspondence-based system for shape retrieval

  • Authors:
  • Boaz J. Super

  • Affiliations:
  • Computer Vision and Robotics Laboratory, Department of Computer Science, University of Illinois at Chicago, 851 South Morgan Street (M/C 152), Chicago, IL

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2004

Quantified Score

Hi-index 0.10

Visualization

Abstract

Several recently published shape retrieval systems have achieved high accuracy on a benchmark 1400-shape dataset. However, some of these systems have high pairwise shape matching costs due to their use of structural matching or flexible correspondence. The purpose of this paper is to demonstrate that a relatively simple shape retrieval system based on fixed point correspondences can achieve accuracy comparable with the two most accurate prior systems, at significantly higher speed. High accuracy is achieved by using a stable curve normalization procedure and example-based retrieval. High speed is achieved by three techniques: single key-point alignment, fixed correspondences, and PCA-based dimensionality reduction. The system is completely automatic and does not require that the database shapes have class labels.