by Asano, T, Kawamura, Y, Klette, R and Obokata, K
Abstract:
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a minimum-length polygon in this approximating sausage. The length of this polygon is taken as an estimator for the length of the curve being the (unknown) preimage of the given digital curve. Assuming finer and finer grid resolution it is shown that this estimator converges to the true perimeter of an r-compact polygonal convex bounded set. This theorem provides theoretical evidence for practical convergence of the proposed method towards a ‘correct’ estimation of the length of a curve. The validity of the scheme has been verified through experiments on various convex and non-convex curves. Experimental comparisons with two existing schemes have also been made.
Reference:
Minimum-length polygons in approximation sausages (Asano, T, Kawamura, Y, Klette, R and Obokata, K), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Verlag, volume 2059, 2001.
Bibtex Entry:
@inproceedings{asano2001minimum-lengthsausages,
author = "Asano, T and Kawamura, Y and Klette, R and Obokata, K",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "103--112",
publisher = "Springer Verlag",
title = "Minimum-length polygons in approximation sausages",
volume = "2059",
year = "2001",
abstract = "The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a minimum-length polygon in this approximating sausage. The length of this polygon is taken as an estimator for the length of the curve being the (unknown) preimage of the given digital curve. Assuming finer and finer grid resolution it is shown that this estimator converges to the true perimeter of an r-compact polygonal convex bounded set. This theorem provides theoretical evidence for practical convergence of the proposed method towards a ‘correct’ estimation of the length of a curve. The validity of the scheme has been verified through experiments on various convex and non-convex curves. Experimental comparisons with two existing schemes have also been made.",
isbn = "3540421203",
isbn = "9783540421207",
issn = "0302-9743",
eissn = "1611-3349",
keyword = "Digital curves",
keyword = "Digital geometry",
keyword = "Length estimation",
keyword = "Multigrid convergence",
language = "eng",
}