A LINEAR ALGORITHM FOR SEGMENTATION OF DIGITAL CURVES

被引：108

作者：

DEBLEDRENNESSON, I ^{[1
]}

REVEILLES, JP ^{[1
]}

机构：

[1] UNIV LOUIS PASTEUR STRASBOURG 1,COMP SCI RES CTR,STRASBOURG,FRANCE

来源：

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE | 1995年 / 9卷 / 04期

关键词：

DIGITAL LINE; DIGITAL CURVE; DIOPHANTINE INEQUALITY; POLYGONALIZATION; SEGMENTATION;

D O I：

10.1142/S0218001495000249

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A new very efficient linear algorithm for the segmentation of 8-connected digital curves is given. The simplicity comes from a definition of digital lines using a linear double diophantine inequality. A complete Pascal source code is given.

引用

页码：635 / 662

页数：28

共 10 条

[1]

BERSTEL J, 1993, LIENS938 EC NORM SUP

[2] DISCRETE CONVEXITY - DEFINITION, PARAMETRIZATION, AND COMPATIBILITY WITH CONTINUOUS CONVEXITY [J].

CHASSERY, JM .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1983, 21 (03) :326-344

[3]

DORST L, 1991, CONT MATH, V119, P169

[4]

FREEMAN H, 1970, BOUNDARY ENCODING PR, P241

[5]

KOVALESKY VA, 1990, 10TH P INT C PATT RE

[6]

KROPASCH WG, COMMUNICATION

[7]

RAVEILLES JP, 1991, THESIS STRASBOURG

[8] DIGITAL STRAIGHT LINE SEGMENTS [J].

ROSENFELD, A .

IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (12) :1264-1269

[9] GEOMETRIC INTERPRETATION OF EUCLID ALGORITHM AND RECOGNITION OF SEGMENTS [J].

TROESCH, A .

THEORETICAL COMPUTER SCIENCE, 1993, 115 (02) :291-319

[10] ON THE CHAIN CODE OF A LINE [J].

WU, LD .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1982, 4 (03) :347-353

← 1 →