A boundary concavity code to support dominant point detection

被引:36
作者
Cronin, TM [1 ]
机构
[1] CECOM, RDEC, Intelligence & Informat Warfare Directorate, AMSEL,RD,IW,TP, Ft Monmouth, NJ 07703 USA
关键词
dominant points; curve segmentation; convexity; shape representation; polygonal approximation;
D O I
10.1016/S0167-8655(99)00025-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A symbolic algorithm is described to detect dominant points of a simple closed boundary. First, a concavity code is constructed from the Freeman chain code to classify the degree of concavity or convexity of boundary coordinates. Then, dominant points are extracted by discarding shallow curvature sequences of the concavity code, by appealing to a technique called error budgeting. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:617 / 634
页数:18
相关论文
共 18 条
[1]   ON DETECTING DOMINANT POINTS [J].
ANSARI, N ;
DELP, EJ .
PATTERN RECOGNITION, 1991, 24 (05) :441-451
[2]   NONPARAMETRIC DOMINANT POINT DETECTION [J].
ANSARI, N ;
HUANG, KW .
PATTERN RECOGNITION, 1991, 24 (09) :849-862
[3]   SOME INFORMATIONAL ASPECTS OF VISUAL PERCEPTION [J].
ATTNEAVE, F .
PSYCHOLOGICAL REVIEW, 1954, 61 (03) :183-193
[4]  
CHOO C, 1992, 26 AS C SIGN SYST CO, P717
[5]   Another look at the dominant point detection of digital curves [J].
Cornic, P .
PATTERN RECOGNITION LETTERS, 1997, 18 (01) :13-25
[6]   AUTOMATED REASONING WITH CONTOUR MAPS [J].
CRONIN, T .
COMPUTERS & GEOSCIENCES, 1995, 21 (05) :609-618
[7]  
FREEMAN H, 1977, IEEE T COMPUT, V26, P297, DOI 10.1109/TC.1977.1674825
[8]   TOWARDS A HIERARCHICAL CONTOUR DESCRIPTION VIA DOMINANT POINT DETECTION [J].
HELD, A ;
ABE, K ;
ARCELLI, C .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1994, 24 (06) :942-949
[9]   An examination of algorithms for the detection of critical points on digital cartographic lines [J].
Li, ZL .
CARTOGRAPHIC JOURNAL, 1995, 32 (02) :121-125
[10]  
OROURKE J, 1998, COMMUNICATION