Segmentation of digital plane curves: A dynamic focusing approach

被引：18

作者：

Ichoku, C ^{[1
]}

Deffontaines, B ^{[1
]}

Chorowicz, J ^{[1
]}

机构：

[1] UNIV PARIS 06,LAB GEOL GEOMORPHOL STRUCT & TELEDETECT,URA CNRS 1759,F-75252 PARIS 05,FRANCE

来源：

PATTERN RECOGNITION LETTERS | 1996年 / 17卷 / 07期

关键词：

digital plane curves; dynamic focusing algorithm; line fitting; arc fitting; segmentation;

D O I：

10.1016/0167-8655(96)00015-3

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We present a dynamic focusing algorithm for the segmentation of plane curves into straight lines and circular arcs. The algorithm holds one end of a curve fixed and scans it from the other until it focuses on a segment which fits either a straight line or a circular are. This segment is identified and the process is repeated in the same way for the rest of the curve. It is a very simple and versatile technique and works well on all types of curves regardless of the degree of curvature smoothness.

引用

页码：741 / 750

页数：10

共 15 条

[1]

Albano A., 1974, COMP GRAPH INFO PROC, V3, P23, DOI [10.1016/0146-664X(74)90008-2, DOI 10.1016/0146-664X(74)90008-2CGIPBG0146-664X]

[2] SEGMENTATION OF TWO-DIMENSIONAL BOUNDARIES USING THE CHAIN CODE [J].

BARUCH, O ;

LOEW, MH .

PATTERN RECOGNITION, 1988, 21 (06) :581-589

[3]

Davis L. S., 1991, Pattern Recognition and Image Processing in Physics. Proceedings of the Thirty-Seventh Scottish Universities Summer School in Physics. A NATO Advanced Study Institute, P101

[4]

ETEMADI A, 1992, P 4 INT C IM PROC IT, P311

[5] DETERMINING PERCEPTUALLY SIGNIFICANT POINTS ON NOISY BOUNDARY CURVES [J].

ILLING, DP ;

FAIRNEY, PT .

PATTERN RECOGNITION LETTERS, 1991, 12 (09) :557-564

[6] SEGMENTATION OF PLANE CURVES [J].

PAVLIDIS, T ;

HOROWITZ, SL .

IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (08) :860-870

[7] FITTING DIGITAL CURVE USING CIRCULAR ARCS [J].

PEI, SC ;

HORNG, JH .

PATTERN RECOGNITION, 1995, 28 (01) :107-116

[8] OPTIMAL POLYGONAL-APPROXIMATION OF DIGITAL CURVES [J].

PIKAZ, A ;

DINSTEIN, I .

PATTERN RECOGNITION, 1995, 28 (03) :373-379

[9]

Ramer U., 1972, Comput Graph Image Process, V1, P244, DOI DOI 10.1016/S0146-664X(72)80017-0

[10] A NEW SPLIT-AND-MERGE TECHNIQUE FOR POLYGONAL-APPROXIMATION OF CHAIN CODED CURVES [J].

RAY, BK ;

RAY, KS .

PATTERN RECOGNITION LETTERS, 1995, 16 (02) :161-169

← 1 2 →