File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Polygonal approximation of digital curve by graduate iterative merging

TitlePolygonal approximation of digital curve by graduate iterative merging
Authors
KeywordsComputer graphics
Edge detection
Pattern recognition
Issue Date1995
PublisherThe Institution of Engineering and Technology. The Journal's web site is located at http://www.ieedl.org/EL
Citation
Electronics Letters, 1995, v. 31 n. 6, p. 444-446 How to Cite?
AbstractThe authors present a graduate iterative merging algorithm for polygon approximation. The algorithm always gives a minimum area difference between the curve and the polygon with the minimum number of breakpoints. Realisation of the algorithm is compared with other algorithms as tested on good and noisy images and the performance is very close to that of a human viewer.
Persistent Identifierhttp://hdl.handle.net/10722/206366
ISSN
2023 Impact Factor: 0.7
2023 SCImago Journal Rankings: 0.323
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorKu, KM-
dc.contributor.authorChiu, PPK-
dc.date.accessioned2014-10-24T01:38:17Z-
dc.date.available2014-10-24T01:38:17Z-
dc.date.issued1995-
dc.identifier.citationElectronics Letters, 1995, v. 31 n. 6, p. 444-446-
dc.identifier.issn0013-5194-
dc.identifier.urihttp://hdl.handle.net/10722/206366-
dc.description.abstractThe authors present a graduate iterative merging algorithm for polygon approximation. The algorithm always gives a minimum area difference between the curve and the polygon with the minimum number of breakpoints. Realisation of the algorithm is compared with other algorithms as tested on good and noisy images and the performance is very close to that of a human viewer.-
dc.languageeng-
dc.publisherThe Institution of Engineering and Technology. The Journal's web site is located at http://www.ieedl.org/EL-
dc.relation.ispartofElectronics Letters-
dc.rights“This paper is a postprint of a paper submitted to and accepted for publication in Electronics Letters and is subject to IET copyright [http://www.ietdl.org/journals/doc/IEEDRL-home/info/support/copyinf.jsp]. The copy of record is available at IET Digital Library URL” Pre-print to be removed on publication-
dc.subjectComputer graphics-
dc.subjectEdge detection-
dc.subjectPattern recognition-
dc.titlePolygonal approximation of digital curve by graduate iterative mergingen_US
dc.typeArticleen_US
dc.identifier.emailKu, KM: kmku@hku.hk-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1049/el:19950319-
dc.identifier.scopuseid_2-s2.0-0029275475-
dc.identifier.volume31-
dc.identifier.issue6-
dc.identifier.spage444-
dc.identifier.epage446-
dc.identifier.isiWOS:A1995QQ51700022-
dc.publisher.placeUnited Kingdom-
dc.identifier.issnl0013-5194-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats