Abstract: A new approach for contour data approximation and compression algorithm is presented in the paper. Cartesian co-ordinates of an input contour are processed in such a manner that finally contours is presented by selected vertices of the edge of the contour. In the paper the main idea of the proposed procedure and compression of analysed method with the Ramer and the Tangent methods of contour approximation are performed. To compare the results, the mean square error and signal-to-noise ratio criterions were used. Number of operations that is necessary to perform approximation and compression procedures is also presented. The simplicity and the small number of operations are the main advantages of the proposed algorithm.
B I B L I O G R A F I A1. H. Freeman, “Techniques for The Digital Computer Analysis of Chain Encoded Arbitrary Plane Curves”, Proc. of the National Electrician Conference, 1961, pp. 421-432.
2. U. Montanari, “A Note on Minimum Length Polygonal Approximation to a Digitized Contour”, Comm. ACM, Vol.13, NO. 1, PP. 41- 47, 1970.
3. U. Ramer, "An Iterative Procedure for the Polygonal Approximation of Plane Curves'', Computer Graphics and Image Proc., Academic Press, 1972, pp.244-256.
4. A. K. Jain, "Fundamentals of Digital Image Processing", New Jersey: Prentice Hall International, 1989.
5. A. Dziech, W. S. Besbas, “Fast Algorithm for Closed Contour Extraction”, Proc. of the Int. Workshop on Systems, Signals and Image Processing, Poznań, Poland, 1997,
pp. 203-206.
6. A. Sirjani, G. R. Cross Dixon, “An Algorithm for Polygonal Approximation of Digital Objects”, Pattern Recognition Letters, Elsevier
7. B. Tibken, A. Dziech, R. Baran, "Spatial Methods of Contour Approximation", International Conference on Computational Intelligence for Modeling, Control and Automation, Vienna, Austria, 2003, pp. 354-362.
8. R. Baran, W. Dziech, "Tangent Method of Contour Approximation", International Workshop on Multimedia Communication and Services, Kielce, Poland, 2003, pp. 11-16.
9. A. Dziech, R. Baran, "The Tangent Method Algorithms for Contour Approximation", International Workshop on Multimedia Communication and Services, Cracov, Poland,
2004, pp. 11-16. 
Pełny tekst