Efficient retrieval of similar shapes

  • Authors:
  • Davood Rafiei;Alberto O. Mendelzon

  • Affiliations:
  • Department of Computing Science, University of Alberta, Alberta, Canada/ E-mail: drafiei@cs.ualberta.ca;Department of Computer Science, University of Toronto, Toronto, Canada/ E-mail: mendel@cs.toronto.edu

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose an indexing technique for the fast retrieval of objects in 2D images based on similarity between their boundary shapes. Our technique is robust in the presence of noise and supports several important notions of similarity including optimal matches irrespective of variations in orientation and/or position. Our method can also handle size-invariant matches using a normalization technique, although optimality is not guaranteed here. We implemented our method and performed experiments on real (hand-written digits) data. Our experimental results showed the superiority of our method compared to search based on sequential scanning, which is the only obvious competitor. The performance gain of our method increases with any increase in the number or the size of shapes.