Abstract: A new approach for contour data compression is presented in the paper – Cartesian co-ordinates of an input contour are processed in such a way that final contour is represented by one-dimensional set of distances with constant, regular angle between them. The selection of vertices and the final algorithm for contour compression are described. Comparison of proposed method with the Ramer algorithm was also performed. For comparison the mean square error and SNR criteria were used. Finally, results of the experiments and advantages and drawbacks of proposed method are discussed.
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. Ramer, An Iterative Procedure for the Polygonal Approximation of Plane Curves, Computer Graphics and Image Proc., Academic Press, 1972, pp.244-256.
3. A. K. Jain, Fundamentals of Digital Image Processing, Prentice Hall International, 1989.
4. 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.
5. B. Tibken, A. Dziech, R. Baran, Spatial Methods of Contour Approximation, Int. Conf. on Computational Intelligence for Modeling, Control and Automation, Vienna, Austria, 2003, pp. 354-362.
6. R. Baran, W. Dziech, Tangent Method of Contour Approximation, Int. Workshop on Multimedia Communication and Services, Kielce, Poland, 2003, pp. 11-16.
7. A. Dziech, R. Baran, The Tangent Method Algorithms for Contour Approximation, Int. Workshop on Multimedia Communication and Services, Kraków, Poland, 2004, pp. 11-16. 
Pełny tekst