Adaptative method to smooth discrete curves proposed as a final step for edge detection

Image and Vision Computing

Volumn 19, Issue 3, 2001, Pages 145-152

  Petit, E ^a   Lemoine, J ^a   Djeziri, S ^b  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^b UNIVERSITÉ DU QUÉBEC À TROIS RIVIÈRES   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; IMAGE ANALYSIS; IMAGE QUALITY; INTERPOLATION; OPTIMIZATION;

CONTOUR SMOOTHING;

EDGE DETECTION;

EID: 0035254747     PISSN: 02628856     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0262-8856(00)00063-9     Document Type: Article

References (30)

1. Tikhonov A.N. Regularisation of incorrectly posed problems. Sov. Math. Dokl. 4:1963;1624-1627.
2. D. Mumford, J. Shah, Boundary detection by minimizing functionals, Proceedings of IEEE Conference on Computer Vision Pattern Recognition, 1985, pp. 22-26.17.
3. Lee D., Pavlidis T. One-dimensional regularization with discontinuities. IEEE Trans. PAMI. 10:(6):1988;822-829.
4. Chen M., Chin R.T. Partial smoothing splines for noisy boundaries with corners. IEEE Trans. PAMI. 15-11:1993;1208-1216.
5. Sharayha B., Anderson D. Optimal estimation of contour properties by cross-validated regularisation. IEEE Trans. PAMI. 11:(6):1989;600-610.
6. T. Boult, J. Kender, Visual surface reconstruction using sparse depth data, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 1986, pp. 68-76.
7. Bartels R., Beatty J., Barsky B. An Introduction to Splines for use in Computer Graphics and Geometric Modelling. 1987;Morgan Kaufmann, Los Altos, CA.
8. P. Saint-Marc, G. Medioni, B-spline contour representation and symmetry detection, Proceedings of European Conference on Computer Vision, 1990, pp. 604-606.
9. Ramer U. An iterative procedure for the polygonal approximation of plane curves. Comput. Graphics Image Process. 1:1972;244-256.
10. Duda R.O., Hart P.E. Pattern Classification and Scene Analysis. 1973;Wiley, New York. pp. 328-329.
11. Pavlidis T., Horowitz S.L. Segmentation of planes curves. IEEE Trans. Comput. C-23:1974;860-870.
12. Davis L.S. Shape matching using relaxation techniques. IEEE Trans. PAMI. 1:1979;60-72.
13. Slansky J., Gonzalez V. Fast polygonal approximation of digitized curves. Pattern Recogn. 12:1980;327-331.
14. Badi'i F., Peikari B. Functional approximation of planar curves via adaptive segmentation. Int. J. Syst. Sci. 13:(6):1982;667-674.
15. Kurozomi Y., Davis W.A. Polygonal approximation by the minmax method. Comput. Graphics Image Process. 19:1982;248-264.
16. Roberge J. A data reduction algorithm for planar curves. Comput. Vision, Graphics Image Process. 29:1985;168-195.
17. Dunham J.G. Optimum uniform piecewise linear approximation of planar curves. IEEE Trans. PAMI. 8:(1):1986;67-75.
18. Ray Kr.B., Ray Ku.S. A new approach to polygonal approximation. Pattern Recogn. Lett. 12:1991;229-234.
19. Rosenfeld A., Johnston E. Angle detection on digital curves. IEEE Trans. Comput. C-22:1973;875-878.
20. Rosenfeld A., Weszka J.S. An improved method of angle detection on digital curves. IEEE Trans. Comput. C-24:1975;940-941.
21. Freeman H., Davis L.S. A corner-finding algorithm for chain-coded curves. IEEE Trans. Comput. C-26:1977;297-303.
22. Sankar P.V., Sharma C.V. A parallel procedure for the detection of dominant points on a digital curve. Comput. Graphics Image Process. 7:1978;403-412.
23. Wu W., Wang M.J. Detecting the dominant points by the curvature based polygonal approximation. Comput. Vision Graphics Image Process. 55:(2):1993;79-88.
24. Guéziec A., Ayache N. Lissage et reconnaissance de courbes gauches bruitées. Traitement du Signal. 9:(6):1992;473-490.
25. The C., Chin R.T. On the detection of dominant points on digital curves. IEEE Trans. PAMI. 11:(8):1989;859-872.
26. Dony R. Calcul des parties cachées: approximation des courbes par la méthode de Bézier et des B-splines. 1990;Masson, Paris.
27. Craven P., Wahb G. Smoothing noisy data with spline functions-Estimating the correct degree of smoothing by the method of generalized cross-validation. Numerische Mathematik. 31:1979;377-403.
28. Stone M. Cross-validatory choice and assessment of statistical prediction. J. R. Stat. Soc. 36:(2):1974;111-147.
29. Kohler R.R. A segmentation based on thresholding. Comput. Graphics Image Process. 15:1981;319-338.
30. S. Djeziri, E. Petit, J. Lemoine, Un algorithme de croissance de régions par déformation géométrique de contours, Proc. 9éme Congréss RFIA-AFCET, 1994, pp. 715-720.