This Article 
 Bibliographic References 
 Add to: 
Using Simple Decomposition for Smoothing and Feature Point Detection of Noisy Digital Curves
August 1994 (vol. 16 no. 8)
pp. 808-813

This correspondence presents an algorithm for smoothed polygonal approximation of noisy digital planar curves, and feature point detection. The resulting smoothed polygonal representation preserves the signs of the curvature function of the curve. The algorithm is based on a simple decomposition of noisy digital curves into a minimal number of convex and concave sections. The location of each separation point is optimized, yielding the minimal possible distance between the smoothed approximation and the original curve. Curve points within a convex (concave) section are discarded if their angle signs do not agree with the section sign, and if the resulted deviations from the curve are less than a threshold /spl epsi/, which is derived automatically. Inflection points are curve points between pairs of convex-concave sections, and cusps are curve points between pairs of convex-convex or concave-concave sections. Corners and points of local minimal curvature are detected by applying the algorithm to respective total curvature graphs. The detection of the feature points is based on properties of pairs of sections that are determined in an adaptive manner, rather than on properties of single points that are based on a fixed-size neighborhood. The detection is therefore reliable and robust. Complexity analysis and experimental results are presented.

[1] H. Asada and M. Brady, "The curvature primal sketch,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-8, no. 1, pp. 2-14, 1986.
[2] F. Attneave, "Some informational aspects of visual perception,"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. Intell., vol. 13, pp. 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, "Optimum uniform piecewise linear approximation of planar curves,"IEEE Trans., vol. PAMI-8, no. 1, pp. 66-75, Jan. 1986.
[7] M.A. Fischler and R. C. Bolles, "Perceptual organization and curve partitioning,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-8, no. 1, pp. 100-105, 1986.
[8] H. Freeman and L. S. Davis, "A corner-finding algorithm for chaincoded 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. Conf. 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. Montanari, "A note on the minimal length polygonal approximation to a digitized contour,"Communs. Ass. Comput. Mach., vol. 13, no. 1, pp. 41-47, 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] T. Pavlidis,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. Dept., 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 comers 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 objects in two and three dimensions by matching noisy characteristic curves,"Int. J. Robotics Res., vol. 6, no. 2, pp. 29-44, 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.

Index Terms:
computational complexity; feature extraction; image processing; decomposition; smoothing; feature point detection; noisy digital curves; smoothed polygonal approximation; curvature function; planar curves; separation point; smoothed approximation; inflection points; curve points; convex-concave sections; cusps; concave-concave sections; convex-convex sections; local minimal curvature; total curvature graphs; complexity analysis
A. Pikaz, I. Disntein, "Using Simple Decomposition for Smoothing and Feature Point Detection of Noisy Digital Curves," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 8, pp. 808-813, Aug. 1994, doi:10.1109/34.308476
Usage of this product signifies your acceptance of the Terms of Use.