Effective technology to improve the quality of the compressed binary contour image of single-curved Arabic words
Article Sidebar
-
Contour description, Contour compression, Polygon approximation, Ramer, Triangle, and Trapezoid Methods.
Abstract
Contour compression (closed curves) is a major challenge in image processing. In this paper, a trapezoidal method will be introduced to compress the boundary of closed single-curved Arabic words. The improved Trapezoid algorithm has been compared with existing methods such as the Ramer algorithm (good quality) and the triangle algorithm (faster) in this work. The Cartesian coordinates of the input contour are processed so that the contour is represented by a set of vertices that selected for the edge of the contour. The measurements in this method are calculated using three criteria based on the mean square error, signal-to-noise ratio and speed. The calculation time of the proposed method is estimated based on the number of performed calculations. The experimental results are obtained in terms of image quality, compression ratio and speed which are encouraging to put forward other points of view. The main advantages of the analyzed algorithm are simplicity and have small numbers of calculations compared to existing algorithms, and they show higher quality than the previous trapezoid algorithm. This method is suitable for the applications where high speed is needed in the real time.
Full text article
Authors
This work is licensed under a Creative Commons Attribution 4.0 International License.
In a brief statement, the rights relate to the publication and distribution of research published in the journal of the University of Sebha where authors who have published their articles in the journal of the university of Sebha should how they can use or distribute their articles. They reserve all their rights to the published works, such as (but not limited to) the following rights:
- Copyright and other property rights related to the article, such as patent rights.
- Research published in the journal of the University of Sebha and used in its future works, including lectures and books, the right to reproduce articles for their own purposes, and the right to self-archive their articles.
- The right to enter a separate article, or for a non-exclusive distribution of their article with an acknowledgment of its initial publication in the journal of Sebha University.
Privacy Statement The names and e-mail addresses entered on the Sabha University Journal site will be used for the aforementioned purposes only and for which they were used.
