Equilateral polygon approximation of closed contours

Fernando R. Rannou, Jens Gregor

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Numerous algorithms have been suggested for computing polygonal approximations of closed contours. We present an algorithm which as a unique feature creates polygons which are equilateral, that is, whose edges are all of the same length. This allows one-dimensional shape descriptions to be derived using the interior polygon angles. Conceptually, the algorithm is an optimization framework for finding the minimum energy configuration of a mechanical system of particles and springs that represent the contour points, the polygon vertices and their interaction. In practice, the dominant points are detected on the Gaussian smoothed contour and used to seed an initial polygon. Nonlinear programming is then used to minimize the system energy subject to the constraint that adjacent vertices must be equidistant. The objective function is the sum of a curvature weighted distance between each vertex and a set of contour points associated therewith. Experimental results are given for closed contours obtained from grey-scale images.

Original languageEnglish (US)
Pages (from-to)1105-1115
Number of pages11
JournalPattern Recognition
Volume29
Issue number7
DOIs
StatePublished - Jan 1 1996

Fingerprint

Nonlinear programming
Seed

All Science Journal Classification (ASJC) codes

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

Cite this

Equilateral polygon approximation of closed contours. / Rannou, Fernando R.; Gregor, Jens.

In: Pattern Recognition, Vol. 29, No. 7, 01.01.1996, p. 1105-1115.

Research output: Contribution to journalArticle

Rannou, Fernando R. ; Gregor, Jens. / Equilateral polygon approximation of closed contours. In: Pattern Recognition. 1996 ; Vol. 29, No. 7. pp. 1105-1115.
@article{14c3510170c64b3c8ffdaa3747857186,
title = "Equilateral polygon approximation of closed contours",
abstract = "Numerous algorithms have been suggested for computing polygonal approximations of closed contours. We present an algorithm which as a unique feature creates polygons which are equilateral, that is, whose edges are all of the same length. This allows one-dimensional shape descriptions to be derived using the interior polygon angles. Conceptually, the algorithm is an optimization framework for finding the minimum energy configuration of a mechanical system of particles and springs that represent the contour points, the polygon vertices and their interaction. In practice, the dominant points are detected on the Gaussian smoothed contour and used to seed an initial polygon. Nonlinear programming is then used to minimize the system energy subject to the constraint that adjacent vertices must be equidistant. The objective function is the sum of a curvature weighted distance between each vertex and a set of contour points associated therewith. Experimental results are given for closed contours obtained from grey-scale images.",
author = "Rannou, {Fernando R.} and Jens Gregor",
year = "1996",
month = "1",
day = "1",
doi = "10.1016/0031-3203(95)00153-0",
language = "English (US)",
volume = "29",
pages = "1105--1115",
journal = "Pattern Recognition",
issn = "0031-3203",
publisher = "Elsevier Limited",
number = "7",

}

TY - JOUR

T1 - Equilateral polygon approximation of closed contours

AU - Rannou, Fernando R.

AU - Gregor, Jens

PY - 1996/1/1

Y1 - 1996/1/1

N2 - Numerous algorithms have been suggested for computing polygonal approximations of closed contours. We present an algorithm which as a unique feature creates polygons which are equilateral, that is, whose edges are all of the same length. This allows one-dimensional shape descriptions to be derived using the interior polygon angles. Conceptually, the algorithm is an optimization framework for finding the minimum energy configuration of a mechanical system of particles and springs that represent the contour points, the polygon vertices and their interaction. In practice, the dominant points are detected on the Gaussian smoothed contour and used to seed an initial polygon. Nonlinear programming is then used to minimize the system energy subject to the constraint that adjacent vertices must be equidistant. The objective function is the sum of a curvature weighted distance between each vertex and a set of contour points associated therewith. Experimental results are given for closed contours obtained from grey-scale images.

AB - Numerous algorithms have been suggested for computing polygonal approximations of closed contours. We present an algorithm which as a unique feature creates polygons which are equilateral, that is, whose edges are all of the same length. This allows one-dimensional shape descriptions to be derived using the interior polygon angles. Conceptually, the algorithm is an optimization framework for finding the minimum energy configuration of a mechanical system of particles and springs that represent the contour points, the polygon vertices and their interaction. In practice, the dominant points are detected on the Gaussian smoothed contour and used to seed an initial polygon. Nonlinear programming is then used to minimize the system energy subject to the constraint that adjacent vertices must be equidistant. The objective function is the sum of a curvature weighted distance between each vertex and a set of contour points associated therewith. Experimental results are given for closed contours obtained from grey-scale images.

UR - http://www.scopus.com/inward/record.url?scp=0030196744&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030196744&partnerID=8YFLogxK

U2 - 10.1016/0031-3203(95)00153-0

DO - 10.1016/0031-3203(95)00153-0

M3 - Article

VL - 29

SP - 1105

EP - 1115

JO - Pattern Recognition

JF - Pattern Recognition

SN - 0031-3203

IS - 7

ER -