Segmentation of planar curves into circular arcs and line segments

Jen Ming Chen, Jose A. Ventura, Chih Hang Wu

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

In many applications, like shape analysis, it is necessary to decompose an object contour into straight-line segments and circular arcs, because many man-made objects (especially machined parts) are composed of these two types of geometric entities. This paper presents a procedure for segmenting a planar curve into lines and arcs, in which the number of entities (or break points) of the curve is given. This procedure can be divided into two stages: (1) to obtain a starting set of break points, and determine the approximation functions (lines and arcs) for the data intervals that are separated by the break points; and (2) to adjust the break points until the error norm is locally minimized. The first stage is based on the detection of significant changes in curvature using the chain-code and differential chain-code techniques, and the second stage is an optimization curve/line fitting scheme. A computational comparison with a modified dynamic programming (MDP) approach shows that the proposed procedure obtains near optimal solutions (relative errors less than 1%) for all the test problems, and requires less than 1.2% of the computational time needed by the MDP approach.

Original languageEnglish (US)
Pages (from-to)71-83
Number of pages13
JournalImage and Vision Computing
Volume14
Issue number1
DOIs
StatePublished - Feb 1996

Fingerprint

Dynamic programming

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Vision and Pattern Recognition

Cite this

Chen, Jen Ming ; Ventura, Jose A. ; Wu, Chih Hang. / Segmentation of planar curves into circular arcs and line segments. In: Image and Vision Computing. 1996 ; Vol. 14, No. 1. pp. 71-83.
@article{217f512937cd420888e253a668ec6510,
title = "Segmentation of planar curves into circular arcs and line segments",
abstract = "In many applications, like shape analysis, it is necessary to decompose an object contour into straight-line segments and circular arcs, because many man-made objects (especially machined parts) are composed of these two types of geometric entities. This paper presents a procedure for segmenting a planar curve into lines and arcs, in which the number of entities (or break points) of the curve is given. This procedure can be divided into two stages: (1) to obtain a starting set of break points, and determine the approximation functions (lines and arcs) for the data intervals that are separated by the break points; and (2) to adjust the break points until the error norm is locally minimized. The first stage is based on the detection of significant changes in curvature using the chain-code and differential chain-code techniques, and the second stage is an optimization curve/line fitting scheme. A computational comparison with a modified dynamic programming (MDP) approach shows that the proposed procedure obtains near optimal solutions (relative errors less than 1{\%}) for all the test problems, and requires less than 1.2{\%} of the computational time needed by the MDP approach.",
author = "Chen, {Jen Ming} and Ventura, {Jose A.} and Wu, {Chih Hang}",
year = "1996",
month = "2",
doi = "10.1016/0262-8856(95)01042-4",
language = "English (US)",
volume = "14",
pages = "71--83",
journal = "Image and Vision Computing",
issn = "0262-8856",
publisher = "Elsevier Limited",
number = "1",

}

Segmentation of planar curves into circular arcs and line segments. / Chen, Jen Ming; Ventura, Jose A.; Wu, Chih Hang.

In: Image and Vision Computing, Vol. 14, No. 1, 02.1996, p. 71-83.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Segmentation of planar curves into circular arcs and line segments

AU - Chen, Jen Ming

AU - Ventura, Jose A.

AU - Wu, Chih Hang

PY - 1996/2

Y1 - 1996/2

N2 - In many applications, like shape analysis, it is necessary to decompose an object contour into straight-line segments and circular arcs, because many man-made objects (especially machined parts) are composed of these two types of geometric entities. This paper presents a procedure for segmenting a planar curve into lines and arcs, in which the number of entities (or break points) of the curve is given. This procedure can be divided into two stages: (1) to obtain a starting set of break points, and determine the approximation functions (lines and arcs) for the data intervals that are separated by the break points; and (2) to adjust the break points until the error norm is locally minimized. The first stage is based on the detection of significant changes in curvature using the chain-code and differential chain-code techniques, and the second stage is an optimization curve/line fitting scheme. A computational comparison with a modified dynamic programming (MDP) approach shows that the proposed procedure obtains near optimal solutions (relative errors less than 1%) for all the test problems, and requires less than 1.2% of the computational time needed by the MDP approach.

AB - In many applications, like shape analysis, it is necessary to decompose an object contour into straight-line segments and circular arcs, because many man-made objects (especially machined parts) are composed of these two types of geometric entities. This paper presents a procedure for segmenting a planar curve into lines and arcs, in which the number of entities (or break points) of the curve is given. This procedure can be divided into two stages: (1) to obtain a starting set of break points, and determine the approximation functions (lines and arcs) for the data intervals that are separated by the break points; and (2) to adjust the break points until the error norm is locally minimized. The first stage is based on the detection of significant changes in curvature using the chain-code and differential chain-code techniques, and the second stage is an optimization curve/line fitting scheme. A computational comparison with a modified dynamic programming (MDP) approach shows that the proposed procedure obtains near optimal solutions (relative errors less than 1%) for all the test problems, and requires less than 1.2% of the computational time needed by the MDP approach.

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

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

U2 - 10.1016/0262-8856(95)01042-4

DO - 10.1016/0262-8856(95)01042-4

M3 - Article

AN - SCOPUS:0030080578

VL - 14

SP - 71

EP - 83

JO - Image and Vision Computing

JF - Image and Vision Computing

SN - 0262-8856

IS - 1

ER -