Multigrid Convergence of Calculated Features in Image Analysis
Journal of Mathematical Imaging and Vision
The minimum perimeter polygon and its application
Proceedings of the 6th Workshop on Theoretical Foundations of Computer Vision
Digital Straight Line Segments
IEEE Transactions on Computers
Multigrid Convergence of Geometric Features
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
| Hi-index | 0.00 |
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.