Abstract: A new method for contour approximation and compression is presented in the paper. The proposed algorithm performs a typical scheme of polygonal approximation. Effectiveness of proposed method is compared with the other well known methods for contour compression. The Ramer and Tangent methods of contour approximation are briefly described. For comparison of the proposed method the mean square error, signal-to-noise ratio and the number of operations are considered as the main criteria of quality and complexity. Some experiments for the selected contours are also performed. The small number of operations and simplicity are the main features of the proposed method.
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, 1970 pp. 41- 47.
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. R. Baran, W. Dziech, "Tangent Method of Contour Approximation", International Workshop on Multimedia Communication and Services, Kielce, Poland, 2003, pp. 11-16.
8. R. Baran, A. Dziech, "Tangent Method and The Other Efficient Methods of Contour Compression", WSEAS Transactions on Computers, Issue 7, Vol. 4, July 2005, pp. 805-813. 
Pełny tekst