Contour compression using centroid method

  • Authors:

  • Andrzej Dziech;Remigiusz Baran;Ali Ukasha

  • Affiliations:

  • Department of Telecommunications, AGH University of Science and Technology, Poland;Department of Electronics and Intelligent Systems, Kielce University of Technology, Poland;University of Computer Technology and Telecommunications in Kielce, Poland

  • Venue:
  • AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.