Optimal matching of closed contours with line segments and arcs

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

In this paper, a planar contour consisting of line segments and circular arcs is described in analytic form, and the contour matching problem is formulated as an optimization problem based on the criterion of minimax (or so-called minimal zone) errors. An iterative descent algorithm is developed to solve the multimodal and non-differentiable optimization problem, the solution of which reports the out-of-profile error and determines the scale and pose of the shape.

Original languageEnglish
Pages (from-to)567-574
Number of pages8
JournalPattern Recognition Letters
Volume18
Issue number6
DOIs
StatePublished - Jun 1997

Keywords

  • Decent algorithm
  • Minimax error
  • Optimization
  • Shape representation

Cite this