This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Adaptive Reduction Procedure for the Piecewise Linear Approximation of Digitized Curves
September 1989 (vol. 11 no. 9)
pp. 967-973

A new algorithm is presented for the piecewise linear approximation of two-dimensional digitized curves against a square grid. The algorithm utilizes an adaptive reduction procedure in two approximation phases to select the critical points of a digitized curve such that the deviation, from the digitized curve to its final approximated curve, is bounded by a uniform error tolerance. The time complexity of this algorithm is O(m/sup 2/) rather than O(n/sup 2/) on the theoretical plane. In the experiments of fixing the initial and the final processing points, the performance of the algorithm has been compared to those of three prominent other algorithms regarding the required number of critical points and the total execution time of the program. Of the four algorithms compared, the present algorithm consistently has the shortest execution time of the program, and it tends most to require as few critical points as the optimum algorithm that was tested.

[1] T. Pavlidis, "A review of algorithms for shape analysis,"Comput. Graphics Image Processing, vol. 7, pp. 243-258, 1978.
[2] T. Pavlidis, "Algorithms for shape analysis of contours and waveforms,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-2, pp. 301- 312, July 1980.
[3] U. Ramer, "An iterative procedure for the polygonal approximation of plane curves,"Comput. Graphics Image Processing, vol. 1, pp. 244-256, 1972.
[4] T. Pavlidis and S. L. Horowitz, "Segmentation of plane curves,"IEEE Trans. Comput., vol. C-23, pp. 860-870, Aug. 1974.
[5] K. Reumann and A. P. M. Witkam, "Optimizing curve segmentation in computer graphics," inProc. Int. Comput. Symp., A. Gunther, B. Levrat, and H. Lipps, Eds. New York: Elsevier, 1974, pp. 467- 472.
[6] C. M. Williams, "An efficient algorithm for the piecewise linear approximation of planar curves,"Comput. Graphics Image Processing, vol. 8, pp. 286-293, 1978.
[7] J. Sklansky and V. Gonzalez, "Fast polygonal approximation of digitized curves,"Pattern Recogn., vol. 12, pp. 327-331, 1980.
[8] T. Pavlidis,Algorithms for Graphics and Image Processing. Rockville, MD: Computer Science Press, 1982.
[9] F. Badi'i and B. Peikari, "Functional approximation of planar curves via adaptive segmentation,"Int. J. Syst. Sci., vol. 13, pp. 667-674, 1982.
[10] K. Wall and P. Danielsson, "A Fast Sequential Method for Polygonal Approximation of Digitized Curves,"Computer Vision, Graphics, and Image Processing, Vol. 28, No. 2, Nov. 1984, pp. 220-227.
[11] J. Roberge, "A data reduction algorithm for planar curves,"Comput. Vision, Graphics, Image Processing, vol. 29, pp. 168-195, 1985.
[12] J.G. Dunham, "Optimum uniform piecewise linear approximation of planar curves,"IEEE Trans., vol. PAMI-8, no. 1, pp. 66-75, Jan. 1986.
[13] C. S. Fahn, "Computer-aided understanding for all sizes of logic circuit diagrams," Ph.D. dissertation, Dep. Elec. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan, Republic of China, Mar. 1989.

Index Terms:
2D digitised curves; computerised picture processing; adaptive reduction; piecewise linear approximation; square grid; time complexity; critical points; computational complexity; computerised picture processing
Citation:
C.S. Fahn, J.F. Wang, J.Y. Lee, "An Adaptive Reduction Procedure for the Piecewise Linear Approximation of Digitized Curves," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 9, pp. 967-973, Sept. 1989, doi:10.1109/34.35499
Usage of this product signifies your acceptance of the Terms of Use.