A NEW CHARACTERIZATION OF DIGITAL LINES BY LEAST-SQUARE FITS

被引：17
|
作者：
MELTER, RA
STOJMENOVIC, I
ZUNIC, J
机构：
[1] UNIV OTTAWA,DEPT COMP SCI,OTTAWA K1N 9B4,ONTARIO,CANADA
[2] UNIV NOVI SAD,FAC ENGN,INST BAS APPL DISC,YU-21000 NOVI SAD,YUGOSLAVIA
来源：
PATTERN RECOGNITION LETTERS | 1993年 / 14卷 / 02期
基金：
加拿大自然科学与工程研究理事会;
关键词：
D O I：
10.1016/0167-8655(93)90080-W
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper we prove that digital line segments and their least square line fits are in one-to-one correspondence and give a new simple representation (x1,n,b0,b1) of a digital line segment, where x1 and n are the x-coordinate of the left endpoint and the number of digital points, respectively, while b0 and b1 are the coefficients of the least square line fit Y=b0+b1X for the given digital line segment. An O(n log n) time algorithm for obtaining a digital line segment from its least square line fit is described.
引用
收藏
页码：83 / 88
页数：6
相关论文
共 50 条
12345