Fast Decomposition of Digital Curves into Polygons Using the Haar Transform

The perimeters of features in digital images are decomposed into sets of straight lines using the Haar transform. The Haar basis functions preserve sharp changes in direction along the perimeter while still allowing smoothing. The coefficients of the Haar transform are simply related to the error between the polygonal decomposition and the true perimeter. The Haar transform can be calculated efficiently with a computational overhead linear in the number of data points.

[1]  Ugo Montanari,et al.  A note on minimal length polygonal approximation to a digitized contour , 1970, CACM.

[2]  Debranjan Sarkar.  A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves , 1993, Pattern Recognit. Lett..

[3]  Kim L. Boyer,et al.  Robust Contour Decomposition Using a Constant Curvature Criterion , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.

[5]  Pengfei Zhu,et al.  On Critical Point Detection of Digital Shapes , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Its'hak Dinstein,et al.  Using Simple Decomposition for Smoothing and Feature Point Detection of Noisy Digital Curves , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Paul L. Rosin,et al.  Techniques for segmenting image curves into meaningful descriptions , 1991, Pattern Recognit..

[8]  David G. Lowe,et al.  Three-Dimensional Object Recognition from Single Two-Dimensional Images , 1987, Artif. Intell..

[9]  Donggang Yu,et al.  An efficient algorithm for smoothing, linearization and detection of structural feature points of binary image contours , 1997, Pattern Recognit..

[10]  Andrew Blake,et al.  Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.

[11]  Martin A. Fischler,et al.  Locating Perceptually Salient Points on Planar Curves , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  L. Debnath,et al.  Walsh Functions and Their Applications , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  J. Shore.  On the Application of Haar Functions , 1973, IEEE Trans. Commun..

[14]  Hong Yan,et al.  Polygonal approximation of digital curves based on the principles of perceptual organization , 1997, Pattern Recognit..

[15]  David B. Cooper,et al.  On the Computational Cost of Approximating and Recognizing Noise-Perturbed Straight Lines and Quadratic Arcs in the Plane , 1976, IEEE Transactions on Computers.

[16]  Geoff A. W. West,et al.  Nonparametric Segmentation of Curves into Various Representations , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Xintong Zhang,et al.  A parallel algorithm for detecting dominant points on multiple digital curves , 1997, Pattern Recognit..

[18]  Paul L. Rosin.  Non-Parametric Multiscale Curve Smoothing , 1994, Int. J. Pattern Recognit. Artif. Intell..

[19]  Geoff A. W. West,et al.  Segmentation of edges into lines and arcs , 1989, Image Vis. Comput..