New Approach Of Contour Approximation
Loading...
Date
2010
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Sebha University
Abstract
This study introduced new algorithm of a method known as Trapezoid method for the
contour compression. The analysed algorithm is able to approximate efficiently a set of
straight segments in a near optimal way in terms of contour quality. Representations of the
input contour points are in Cartesian co-ordinates which are processed in such way to obtain
vertices and which some of them are chosen as the vertices of the contour polygon. The
analysed algorithm has some main advantage compared to the existing methods, it is faster on
implementation. The proposed algorithm is compared with Ramer method because it has best
quality among well known algorithms; and with Triangle method because it’s high speedity in
implementation; in addition to the Trapezoid method (I algorithm) of contour approximation.
Computational time of analysed method is estimated depending on a number of numerical
operations. This paper shows that the simplicity is additional distinct feature of the proposed
algorithm. This work gives an overview of the system architecture, describe the compression
technique, and discuss implementation aspects. Experimental results for single and multicontours
images are obtained in terms of image quality, compression ratios, and image
retrieval timings. It was concluded that the proposed algorithm have high compression
efficiency with accepted quality for different type of contours from different languages such
as Arabic and English.
Description
Keywords
Polygonal approximation, contour representation, and contour compression