A new method for contour compression

Authors:
Andrzej Dziech;Ali Ukasha;Remigiusz Baran
Affiliations:
Department of Telecommunications, AGH University of Science and Technology, Poland;University of Computer Technology and Telecommunications in Kielce, Poland;Department of Electronics and Intelligent Systems, Kielce University of Technology, Poland
Venue:
MIV'05 Proceedings of the 5th WSEAS international conference on Multimedia, internet & video technologies
Year:
2005

Citing 3
Cited 0

An algorithm for polygonal approximation of a digital object

Pattern Recognition Letters
Fundamentals of digital image processing

Fundamentals of digital image processing
A note on minimal length polygonal approximation to a digitized contour

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

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.