File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1049/el:19950319
- Scopus: eid_2-s2.0-0029275475
- WOS: WOS:A1995QQ51700022
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Polygonal approximation of digital curve by graduate iterative merging
Title | Polygonal approximation of digital curve by graduate iterative merging |
---|---|
Authors | |
Keywords | Computer graphics Edge detection Pattern recognition |
Issue Date | 1995 |
Publisher | The 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? |
Abstract | The 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 Identifier | http://hdl.handle.net/10722/206366 |
ISSN | 2023 Impact Factor: 0.7 2023 SCImago Journal Rankings: 0.323 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ku, KM | - |
dc.contributor.author | Chiu, PPK | - |
dc.date.accessioned | 2014-10-24T01:38:17Z | - |
dc.date.available | 2014-10-24T01:38:17Z | - |
dc.date.issued | 1995 | - |
dc.identifier.citation | Electronics Letters, 1995, v. 31 n. 6, p. 444-446 | - |
dc.identifier.issn | 0013-5194 | - |
dc.identifier.uri | http://hdl.handle.net/10722/206366 | - |
dc.description.abstract | The 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.language | eng | - |
dc.publisher | The Institution of Engineering and Technology. The Journal's web site is located at http://www.ieedl.org/EL | - |
dc.relation.ispartof | Electronics 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.subject | Computer graphics | - |
dc.subject | Edge detection | - |
dc.subject | Pattern recognition | - |
dc.title | Polygonal approximation of digital curve by graduate iterative merging | en_US |
dc.type | Article | en_US |
dc.identifier.email | Ku, KM: kmku@hku.hk | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1049/el:19950319 | - |
dc.identifier.scopus | eid_2-s2.0-0029275475 | - |
dc.identifier.volume | 31 | - |
dc.identifier.issue | 6 | - |
dc.identifier.spage | 444 | - |
dc.identifier.epage | 446 | - |
dc.identifier.isi | WOS:A1995QQ51700022 | - |
dc.publisher.place | United Kingdom | - |
dc.identifier.issnl | 0013-5194 | - |