A multiresolution algorithm for rotation-invariant matching of planar shapes

Dmitry Chetverikov, Attila Lerch

Research output: Contribution to journalArticle

14 Citations (Scopus)


Real-time recognition of planar shapes is usually based on either invariant shape features or contour matching. Contour matching is a precise but time-consuming operation. In this letter we present a simple but efficient multiresolution technique that considerably speeds up the process by using shape pyramids as an aid to matching. The proposed algorithm is tested with a large set of test shapes. Finally, the algorithm is compared to a composite shape recognition technique that combines a feature based pre-selector and a conventional contour matching algorithm.

Original languageEnglish
Pages (from-to)669-676
Number of pages8
JournalPattern Recognition Letters
Issue number9
Publication statusPublished - Sep 1992



  • Shape matching
  • pyramid

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this