A NEW METHOD OF ANALYSIS FOR DISCRETE STRAIGHT-LINES

被引:5
作者
CHATTOPADHYAY, S [1 ]
DAS, PP [1 ]
机构
[1] INDIAN INST TECHNOL,DEPT COMP SCI & ENGN,KHARAGPUR 721302,W BENGAL,INDIA
关键词
DISCRETE GEOMETRY; DISCRETE STRAIGHT LINE SEGMENTS; DOMAIN OF DIGITIZATION; RECONSTRUCTION;
D O I
10.1016/0167-8655(91)90072-T
中图分类号
TP18 [人工智能理论];
学科分类号
081104 [模式识别与智能系统]; 0812 [计算机科学与技术]; 0835 [软件工程]; 1405 [智能科学与技术];
摘要
The problem of finding the set of all continuous straight lines which lead to the same digitization is quite well known and has been studied in [1,2,3]. In this paper, we propose a new method of analysis which is simple and straightforward but is shown to be as powerful as the other techniques. Moreover, our scheme, being algebraic in nature, can be generalized to more complex shapes and figures and thus has a wider applicability.
引用
收藏
页码:747 / 755
页数:9
相关论文
共 5 条
[1]
ANDERSON TA, 1983, CS83120 WASH STAT U
[2]
CHATTOPADHYAY S, UNPUB COMPUTER VISIO
[3]
DORST L, 1984, IEEE T PATTERN ANAL, V6, P450, DOI 10.1109/TPAMI.1984.4767550
[4]
DORST L, 1986, THESIS DELFT U TECHN
[5]
DIGITAL STRAIGHT-LINES AND CONVEXITY OF DIGITAL REGIONS [J].
KIM, CE ;
ROSENFELD, A .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1982, 4 (02) :149-153