DC FieldValueLanguage
dc.contributor.authorMelter, Roberten
dc.contributor.authorStojmenović, Ivanen
dc.contributor.authorŽunić, Jovišaen
dc.date.accessioned2020-05-01T20:29:04Z-
dc.date.available2020-05-01T20:29:04Z-
dc.date.issued1993-01-01en
dc.identifier.issn0167-8655en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1982-
dc.description.abstractIn 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.publisherElsevier-
dc.relationNATO Collaborative Research Grant CRG 900840-
dc.relationNSERC, Grant OGPIN007-
dc.relation.ispartofPattern Recognition Lettersen
dc.titleA new characterization of digital lines by least square fitsen
dc.typeArticleen
dc.identifier.doi10.1016/0167-8655(93)90080-Wen
dc.identifier.scopus2-s2.0-38249005601en
dc.relation.firstpage83en
dc.relation.lastpage88en
dc.relation.issue2en
dc.relation.volume14en
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
item.openairetypeArticle-
crisitem.author.orcid0000-0002-1271-4153-
Show simple item record

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.