Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29530

Select areas to restrict search in scientific publication database:
A New Method for Contour Approximation Using Basic Ramer Idea
This paper presented two new efficient algorithms for contour approximation. The proposed algorithm is compared with Ramer (good quality), Triangle (faster) and Trapezoid (fastest) in this work; which are briefly described. Cartesian co-ordinates of an input contour are processed in such a manner that finally contours is presented by a set of selected vertices of the edge of the contour. In the paper the main idea of the analyzed procedures for contour compression is performed. For comparison, the mean square error and signal-to-noise ratio criterions are used. Computational time of analyzed methods is estimated depending on a number of numerical operations. Experimental results are obtained both in terms of image quality, compression ratios, and speed. The main advantages of the analyzed algorithm is small numbers of the arithmetic operations compared to the existing algorithms.
Digital Object Identifier (DOI):


[1] Dziech A., Besbas W. S., Nabout A. and Nour Eldin H. A., "Fast algorithm for closed contour extraction", Proc. of the 4th International Workshop on Systems, Signals and Image Processing, Poznań, Poland, pp. 203-206, 1997.
[2] Sklansky J. and Gonzalez V., "Fast polygonalapproximation of digitized curves", Pattern Recognition, Volume 12, Issue 5, pp. 327- 331, 1980.
[3] Ramer U., "An iterative procedure for the Polygonal approximation of plane curves", Computer Graphics and Image Processing, Academic Press, Volume 1, Issue 3, pp. 244-256, 1972.
[4] Dziech A., Ukasha A. and Baran R., "Fast method for contour approximation and compression", WSEAS Transaction on communications, Volume 5, Issue 1, pp. 49-56, 2006.
[5] Baran R., and Dziech A., "Tangent method and the other efficient methods of contour compression", WSEAS Transactions on Computers, Volume 4, Issue 7, pp. 805-813, 2005.
[6] Zhu P. and Chirlian P. M., "On critical point detection of digital shapes", IEEE Transaction on Pattern Analysis and Machine Intelligence, Volume 17, Issue 8, pp. 737-748, 1995.
[7] Batchelor B. G. and Laing S. G., "Polar-vector representations of edges in Pictures", Electronics Letters, Volume 13, Issue 24, pp. 727- 729, 1977.
[8] Jain A. K., "Fundamentals of Digital Image Processing", Englewood Cliffs, NJ: Prentice-Hall, 1989.
[9] Ukasha A., Dziech A., Elsherif E. and Baran R.,"An efficient method of contour compression",International Conference on Visualization, Imaging and Image Processing (IASTED/VIIP),Cambridge, United Kingdom, pp. 213-218, 2009.
[10] Ukasha A., Dziech A. & Baran R., "A New Method For Contour Compression", WSEAS Int. Conf. on Signal, Speech and Signal Processin (SSIP 2005), Corfu Island, Greece, pp. 282- 286, 2005.
[11] Dziech A., Baran R. & Ukasha A., "Contour compression using centroid method", WSEAS Int. Conf. on Electronics, Signal Processing and Control (ESPOCO 2005), Copacabana, Rio de Janeiro, Brazil, pp. 225-229, 2005.
[12] Ukasha A., "Arabic Letters Compression using New Algorithm of Trapezoid method", International Conference on Signal Processing, Robotics and Automation (ISPRA'10), Cambridge, United Kingdom, 336-341, 2010.
[13] Gonzalez R. C., "Digital Image Processing",Second Edition, Addison Wesley, 1987.
[14] Besbas W., "Contour Extraction, Processing and Recognition", Poznan University of Technology, Ph. D. Thesis, 1998.
Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007