Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)

SSPR /SPR 2006: Structural, Syntactic, and Statistical Pattern Recognition pp 243-251

Aligning Concave and Convex Shapes

  • Silke Jänichen
  • Petra Perner
Conference paper

DOI: 10.1007/11815921_26

Volume 4109 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Jänichen S., Perner P. (2006) Aligning Concave and Convex Shapes. In: Yeung DY., Kwok J.T., Fred A., Roli F., de Ridder D. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2006. Lecture Notes in Computer Science, vol 4109. Springer, Berlin, Heidelberg

Abstract

There are plenty of different algorithms for aligning pairs of 2D-shapes and point-sets. They mainly concern the establishment of correspon-dences and the detection of outliers. All of them assume that the aligned shapes are quite similar and belonging to the same class of shapes. But special problems arise if we have to align shapes that are very different, for example aligning concave shapes to convex ones. In such cases it is indispensable to take into account the order of the point-sets and to enforce legal sets of correspondences; otherwise the calculated distances are incorrect. We present our novel shape alignment algorithm which can handle such cases also. The algorithm establishes legal one-to-one point correspondences between arbitrary shapes, represented as ordered sets of 2D-points and returns a distance measure which runs between 0 and 1.

Keywords

Shape Alignment Correspondence Problem Aligning Convex to Concave Shapes and vise-versa 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Silke Jänichen
    • 1
  • Petra Perner
    • 1
  1. 1.Institute of Computer Vision and applied Computer SciencesIBaILeipzig