Abstract

This paper presents a comparison between three an efficient algorithms for Arabic contour approximation and compression. The oldest method known as Ramer algorithm will be used for contour approximation in addition with Trapezoid & Adaptive-Triangle methods. These algorithms are introduced & compared. The single step parallel contour extraction (SSPCE) method will be used in this work to achieve Cartesian representation of the object. The main ideas of the analyzed approaches are discussed to obtain contour compression. For comparison, the mean square error and signal-to-noise ratio criterions are used. Experimental results are obtained both in terms of image quality, compression ratios and speed. The main advantage of the analyzed algorithm (Adaptive-Triangle) is the short computational time of operations compared with Ramer, but it has less quality. On the other side it has better quality and quite less speed than that of Trapezoid algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call