EDGE LINKING BY USING CAUSAL NEIGHBORHOOD WINDOW

被引:10
作者
XIE, M
机构
[1] INRIA Sophia Antipolis, 06561 Valbonne, 2004, Route des Lucioles
关键词
EDGE LINKING;
D O I
10.1016/0167-8655(92)90121-F
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A novel edge linking algorithm will be presented in this paper. We shall make use of two concepts: (a) the concept of horizontal edge element and (b) the concept of causal neighborhood window for realizing the edge linking. On the basis of these two concepts, the proposed algorithm will carry out (in one pass on the edge map) the edge linking by performing two operations which are the contour chain creation and the contour chain extension. For the illustration of the applicability of our algorithm, some experimental results with real images will be shown.
引用
收藏
页码:647 / 656
页数:10
相关论文
共 9 条
  • [1] AGGARWAL JD, 1977, COMPUTER METHODS IMA
  • [2] [Anonymous], 1989, FUNDAMENTALS DIGITAL
  • [3] Ballard DH, 1982, COMPUTER VISION
  • [4] A SINGLE-PASS, CHAIN GENERATING ALGORITHM FOR REGION BOUNDARIES
    CHAKRAVARTY, I
    [J]. COMPUTER GRAPHICS AND IMAGE PROCESSING, 1981, 15 (02): : 182 - 193
  • [5] DERICHE R, 1987, INT J COMPUTER VISIO
  • [6] GIRAUDON G, 1987, IEEE WORKSHOP COMPUT, P228
  • [7] A CONTOUR TRACING ALGORITHM THAT PRESERVES COMMON BOUNDARIES BETWEEN REGIONS
    LIOW, YT
    [J]. CVGIP-IMAGE UNDERSTANDING, 1991, 53 (03): : 313 - 321
  • [8] RAMESH V, 1989, SPIE INTELLIGENT R 8, V1192, P147
  • [9] XIE M, 1988, IRISA429 RES REP