dc.contributor.author |
Klette, Reinhard |
en |
dc.contributor.author |
Yip, Ben |
en |
dc.date.accessioned |
2008-08-21T01:56:08Z |
en |
dc.date.available |
2008-08-21T01:56:08Z |
en |
dc.date.issued |
1999 |
en |
dc.identifier.citation |
Communication and Information Technology Research Technical Report 54, (1999) |
en |
dc.identifier.issn |
1178-3691 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/2728 |
en |
dc.description |
You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the original CITR web site; http://citr.auckland.ac.nz/techreports/ under terms that include this permission. All other rights are reserved by the author(s). |
en |
dc.description.abstract |
The paper discusses one of the elementary subjects in image analysis: how to measure the length of a digital curve? A digital curve in the plane is defined to be a cycle given either as an alternating sequence of vertices and edges, or an alternating sequence of edges and squares. The paper reports about two length estimators, ones based on the partition of a frontier of a simply-connected isothetic polygon into digital straight segments, and one based on calculating the minimum-length polygon within an open boundary of a simply-connected isothetic polygon. Both techniques are known to be implementations of convergent estimators of the perimeter of bounded, polygonal or smooth convex sets in the euclidean plane. For each technique a linear-time algorithm is specified, and both algorithms are compared with respect to convergence speed and number of generated segments. The experiments show convergent behavior also for perimeters of non-convex bounded subsets of the euclidean plane. |
en |
dc.publisher |
CITR, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
Communication and Information Technology Research (CITR) Technical Report Series |
en |
dc.rights |
Copyright CITR, The University of Auckland. You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the original CITR web site under terms that include this permission. All other rights are reserved by the author(s). |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://citr.auckland.ac.nz/techreports/1999/CITR-TR-54.pdf |
en |
dc.title |
The Length of Digital Curves |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |