Deformable 2D Shape Matching Based on Shape Contexts and Dynamic Programming

  • Authors:
  • Iasonas Oikonomidis;Antonis A. Argyros

  • Affiliations:
  • Institute of Computer Science, Forth, and Computer Science Department, University of Crete,;Institute of Computer Science, Forth, and Computer Science Department, University of Crete,

  • Venue:
  • ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part II
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a method for matching closed, 2D shapes (2D object silhouettes) that are represented as an ordered collection of shape contexts [1]. Matching is performed using a recent method that computes the optimal alignment of two cyclic strings in sub-cubic runtime. Thus, the proposed method is suitable for efficient, near real-time matching of closed shapes. The method is qualitatively and quantitatively evaluated using several datasets. An application of the method for joint detection in human figures is also presented.