Fast decomposition of digital curves into polygons using the Haar transform

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 21, Issue 8, 1999, Pages 786-790

  Davis, T J ^a  

^a CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE ANALYSIS; IMAGE QUALITY; MATHEMATICAL TRANSFORMATIONS;

HAAR TRANSFORMS;

COMPUTATIONAL GEOMETRY;

EID: 0032691099     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.784293     Document Type: Article

References (20)

1. K.G. Beauchamp, Walsh Functions and Their Applications. New York: Academic Press, 1975.
2. A. Blake and A. Zisserman, Visual Reconstruction. MIT Press, 1987.
3. D.B. Cooper and N. Yalabik, On the Computational Cost of Approximating and Recognising Noise-Perturbed Straight Lines and Quadratic Arcs in the Plane,IEEE Trans. Computers, vol. 25, no. 10, pp. 1,020-1,032, Oct. 1976.
4. M.A. Fischler and H.C. Wolf, Locating Perceptually Salient Points on Planar Curves,IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 2, pp. 113-129, Feb. 1994.
5. J. Hu and H. Yan, Polygonal Approximation of Digital Curves Based on the Principles of Perceptual Organisation,Pattern Recognition, vol. 30, no. 5, pp. 701-718, 1997.
6. D.G. Lowe, Three-Dimensional Object Recognition from Single Two-Dimensional Images,Artificial Intelligence, vol. 31, pp. 355-395, 1987.
7. D.G. Lowe, Organisation of Smooth Image Curves at Multiple Scales,Int'l J. Computer Vision, vol. 3, no. 2, pp. 119-130, 1989.
8. U. Montanari, A Note on Minimal Length Polygonal Approximation to a Digitized Contour,Comm. ACM, vol 13, no.1, pp. 41-47, 1970.
9. T. Pavlidis and S. Horowitz, Segmentation of Plane Curves,IEEE Trans. Computers, vol. 23, no. 8, pp. 860-870, Aug. 1974.
10. A. Pikaz and I. Dinstein, Using Simple Decomposition for Smoothing and Feature Point Detection of Noisy Digital Curves,IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 8, pp. 808-813, Aug. 1994.
11. P.L. Rosin, Non-Parametric Multiscale Curve Smoothing,Int'l J. Pattern Recognition and Artificial Intelligence, vol. 8, no. 6, pp. 1,381-1,406, 1994.
12. P.L. Rosin and G.A.W. West, Segmentation of Edges into Lines and Arcs,Image and Vision Computing, vol. 7, no. 2, pp. 109-114, 1989.
13. P.L. Rosin and G.A.W. West, Nonparametric Segmentation of Curves into Various Representations,IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 12, pp. 1,140-1,153, Dec. 1995.
14. D. Sarkar, A Simple Algorithm for Detection of Significant Vertices for Polygonal Approximations of Chain-Coded Curves,Pattern Recognition Letters, vol. 14, pp. 959-964, 1993.
15. J.E. Shore, On the Application of Haar Functions,IEEE Trans. Comm., vol. 21, no. 3, pp. 209-216, 1973.
16. G.A.W. West and P.L. Rosin, Techniques for Segmenting Image Curves into Meaningful Descriptions,Pattern Recognition, vol. 24, no. 7, pp. 643-652, 1991.
17. D.M. Wuescher and K.L. Boyer, Robust Contour Decomposition Using a Constant Curvature Criterion,IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 1, pp. 41-51, Jan. 1991.
18. D. Yu and H. Yan, An Efficient Algorithm for Smoothing, Linearization and Detection of Structural Feature Points of Binary Image Contours,Pattern Recognition, vol. 30, no. 1, pp. 57-69, 1997.
19. X. Zhang and D. Zhao, A Parallel Algorithm for Detecting Dominant Points on Multiple Digital Curves,Pattern Recognition, vol. 30, no. 2, pp. 239-244, 1997.
20. P. Zhu and P.M. Chirlian, On Critical Point Detection of Digital Shapes,IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 737-748, Aug. 1995.