DC Field | Value | Language |
---|---|---|
dc.contributor.author | Melter, Robert | en |
dc.contributor.author | Stojmenović, Ivan | en |
dc.contributor.author | Žunić, Joviša | en |
dc.date.accessioned | 2020-05-01T20:29:04Z | - |
dc.date.available | 2020-05-01T20:29:04Z | - |
dc.date.issued | 1993-01-01 | en |
dc.identifier.issn | 0167-8655 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1982 | - |
dc.description.abstract | 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. | en |
dc.publisher | Elsevier | - |
dc.relation | NATO Collaborative Research Grant CRG 900840 | - |
dc.relation | NSERC, Grant OGPIN007 | - |
dc.relation.ispartof | Pattern Recognition Letters | en |
dc.title | A new characterization of digital lines by least square fits | en |
dc.type | Article | en |
dc.identifier.doi | 10.1016/0167-8655(93)90080-W | en |
dc.identifier.scopus | 2-s2.0-38249005601 | en |
dc.relation.firstpage | 83 | en |
dc.relation.lastpage | 88 | en |
dc.relation.issue | 2 | en |
dc.relation.volume | 14 | en |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | No Fulltext | - |
item.openairetype | Article | - |
crisitem.author.orcid | 0000-0002-1271-4153 | - |
SCOPUSTM
Citations
27
checked on Oct 15, 2024
Page view(s)
21
checked on Oct 15, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.