Paper
23 October 2000 Multiscale discretization of shape contours
Lakshman Prasad, Ramana L. Rao
Author Affiliations +
Abstract
We present an efficient multi-scale shape approximation scheme by adaptively and sparsely discretizing its continuous (or densely sampled) contour by means of points. The notion of shape is intimately related to the notion of contour and, therefore, the efficient representation of the contour of a shape is vital to a computational understanding of the shape. Any discretization of a planar smooth curve by points is equivalent to a piecewise constant approximation of its parameterized X and Y coordinate. Using the Haar wavelet transform for the piecewise approximation yields a hierarchical scheme in which the size of the approximating point set is traded off against the morphological accuracy of the approximation. Our algorithm compresses the representation of the initial shape contour to a sparse sequence of points in the plane defining the vertices of the shape's polygonal approximation. Furthermore, it is possible to control the overall resolution of the approximation by a single, scale- independent parameter.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Lakshman Prasad and Ramana L. Rao "Multiscale discretization of shape contours", Proc. SPIE 4117, Vision Geometry IX, (23 October 2000); https://doi.org/10.1117/12.404822
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Wavelets

Discrete wavelet transforms

Wavelet transforms

Tolerancing

Image understanding

Video coding

Computer programming

Back to Top