Using Simple Decomposition for Smoothing and Feature Point Detection of Noisy Digital Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 16, Issue 8, 1994, Pages 808-813

  Pikaz, Arie ^a   Dinstein, Its'hak ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

digital curve decomposition; feature extraction; Image processing; shape analysis

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL SIGNAL PROCESSING; IMAGE ANALYSIS; IMAGE UNDERSTANDING; PATTERN RECOGNITION; SIGNAL DETECTION; SIGNAL FILTERING AND PREDICTION;

FEATURE EXTRACTION; FEATURE POINT DETECTION; NOISY DIGITAL CURVES; POLYGONAL REPRESENTATION; SHAPE ANALYSIS; SMOOTHING;

IMAGE PROCESSING;

EID: 0028485819     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.308476     Document Type: Article

References (22)

1. H. Asada and M. Brady, “The curvature primal sketch,” IEEE Trans. Patt. Anal. Mach. Intell. vol. PAMI-8, no. 1, pp. 2–14, Jan. 1986.
2. F. Attneave, “Some informational aspects of visual percejtlion,” Psychological Rev., vol. 61, no. 3, pp. 183–193, May 1954.
3. A. Bengtsson and J.O. Eklund, “Shape representation by multiscale contour approximation,” IEEE Trans. Patt. Anal. Mach. lntell., vol. 13, 85–93, Jan. 1991.
4. A. Bruckstein, A.M. Katzir Nir, M. Lindenbaum, and M. Porat, “Similarity-invariant signatures for partially occluded planar shapes,” Int. J. Comput. Vision, vol. 7, pp. 271–285, 1992.
5. L. S. Davis, “Understanding shape: Angles and sides,” IEEE Trans. Comput., vol. C-26, no. 3, pp. 236–242, Mar. 1977.
6. J. G. Dunham, “Ojtlimum piecewise linear approximation of planar curves,” IEEE Patt. Anal. Mach. Intell. vol. PAMI-8, no. 1, pp. 67–75, Jan. 1986.
7. M. A. Fischler and R.C. Bolles, “Percejtlual organization and curve partitioning,” IEEE Trans. Patt. Anal. Mach. Intell., vol. PAMI-8, no. 1, Jan. 1986.
8. H. Freeman and L. S. Davis, “A corner-finding algorithm for chain-coded coded curves,” IEEE Trans. Comput., vol. C-26, pp. 297–303, Mar. 1977.
9. H. Joon Han, “Detection of convex and concave discontinuous points in a plane curve,” Proc. 3rd Int. Conl. Comput. Vision, 1990, pp. 71–74.
10. Y. Kurozumi and A. W. Davis, “Polygonal approximation by the minimax method,” Comput. Graphics Image Processing, vol. 19, pp. 248–264, 1982.
11. U. Montanan, “A note on minimal length polygonal approximation to a digitized contour,” Commun. ACM, vol. 13, no. 1, pp. 41–47, Jan. 1970.
12. T. Pavlidis, “Algorithms for shape analysis of contours and waveforms,” IEEE Trans. Patt. Anal. Mach. Intell. vol. PAMI-2, no. 4, pp. 301–312, July 1980.
13. Structural Pattern Recognition. New York: Springer-Verlag, 1980.
14. A. Pikaz, “Topics on recognition and processing of digital planar curves” (in Hebrew), M.Sc. thesis, Computer Sci. Dejtl., Ben-Gurion Univ., Beer-Sheva, Israel, Oct. 1992.
15. F. P. Preparata and M.I. Shamos, Computational Geometry: An introduction. New York: Springer-Verlag, 1985.
16. A. Rattarangsi and R. Chin, “Scale-based detection of corners of planar curves,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 14, pp. 430–449, Apr. 1992.
17. A. Rosenfeld and E. Johnston, “Angle detection on digital curve,” IEEE Trans. Comput. vol. C-22, pp. 875–878, Sept. 1973.
18. A. Rosenfeld and J. S. Weszka, “An improved method of angle detection on digital curves,” IEEE Trans. Comput., vol. C-24, pp. 940–941, Sept. 1975.
19. J. T. Schwartz and M. Sharir, “Identification of partially obscured objects in two and three dimensions by matching noisy characteristic curves,” Int. J. Robotics Res., vol. 6, no. 2, pp. 29–44, Summer 1987.
20. J. Sklansky, R.L. Chazin, and B.J. Hansen, “Minimum-perimeter polygons of digitized silhouettes,” IEEE Trans. Comput., vol. C-21, no. 3, pp. 260–268, Mar. 1972.
21. C.-H. Teh and R. T. Chin, “On the detection of dominant points on digital curves,” IEEE Patt. Anal. Mach. Intell. vol. 11, pp. 859–872, Aug. 1989.
22. I. Tomek, “Two algorithms for piecewise-linear continuous approximation of functions of one variable,” IEEE Trans. Comput., vol. C-23, pp. 445–448, Apr. 1974.