MULTISCALE DISCRETIZATION OF SHAPE CONTOURS
We present an efficient multi-scale scheme to adaptively approximate the continuous (or densely sampled) contour of a planar shape at varying resolutions. The notion of shape is intimately related to the notion of contour, and the efficient representation of the contour of a shape is vital to a computational understanding of the shape. Any polygonal approximation of a planar smooth curve is equivalent to a piecewise constant approximation of the parameterized X and Y coordinate functions of a discrete point set obtained by densely sampling the curve. 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.
- Research Organization:
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- US Department of Energy (US)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 764071
- Report Number(s):
- LA-UR-00-2852; TRN: AH200102%%7
- Resource Relation:
- Conference: SPIE, SAN DIEGO, CA (US), 07/30/2000--08/04/2000; Other Information: PBD: 1 Sep 2000
- Country of Publication:
- United States
- Language:
- English
Similar Records
Multiscale characterization and analysis of shapes
Control point algorithms for contour processing and shape analysis