Fast Algorithm for Optimal Polygonal Approximation of Shape Boundaries

Prabhudev I. Hosur, Rolando A. Carrasco

Abstract

This paper presents fast optimal algorithm for approximation of a shape boundary with a polygon having minimum number of vertices for a given maximum tolerable approximation error. For this purpose, the directed acyclic graph (DAG) formulation of the polygonal approximation problem is considered. The reduction in computational complexity is achieved by reducing the number of admissible edges in the DAG and speeding up the process of determining whether the edge distortion is within the tolerable limit. The proposed algorithm is compared with other optimal algorithms in terms of the execution time.

References

  1. U. Ramer: An Iterative Procedure for the Polygon Approximation of Planar Curves. Computer Graphics:Image Processing (1972)
  2. MPEG: Description of Core Experiments on Shape Coding in MPEG-4 Video. ISO/IEC JTC1/SC29/WG11 N1326 (1996)
  3. J. G. Dunham: Optimum Uniform Piecewise Linear Approximation of Planar Curves. IEEE Trans. Pattern Anal. Machine Intell. (1986)
  4. J. C. Perez and E. Vidal: Optimum Polygonal Approximation of Digitized Curves. Pattern Recognition Letters (1994)
  5. G. M. Schuster and G. Melnikov and A. K. Katsaggelos: Operationally Optimal Vertex-Based Shape Coding. IEEE Signal Processing Magazine (1998)
  6. Katsaggelos A. K. et. al.: MPEG-4 Rate-Distortion-Based Shape-Coding Techniques. Proceedings of the IEEE (1998)
  7. K. Schroder and P. Laurent: Efficient polygon approximations for shape signatures. Proceedings of the IEEE International Conference on Image Processing (1999)
Download


Paper Citation


in Harvard Style

I. Hosur P. and A. Carrasco R. (2005). Fast Algorithm for Optimal Polygonal Approximation of Shape Boundaries . In Proceedings of the 5th International Workshop on Pattern Recognition in Information Systems - Volume 1: PRIS, (ICEIS 2005) ISBN 972-8865-28-7, pages 104-113. DOI: 10.5220/0002579501040113


in Bibtex Style

@conference{pris05,
author={Prabhudev I. Hosur and Rolando A. Carrasco},
title={Fast Algorithm for Optimal Polygonal Approximation of Shape Boundaries},
booktitle={Proceedings of the 5th International Workshop on Pattern Recognition in Information Systems - Volume 1: PRIS, (ICEIS 2005)},
year={2005},
pages={104-113},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002579501040113},
isbn={972-8865-28-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Workshop on Pattern Recognition in Information Systems - Volume 1: PRIS, (ICEIS 2005)
TI - Fast Algorithm for Optimal Polygonal Approximation of Shape Boundaries
SN - 972-8865-28-7
AU - I. Hosur P.
AU - A. Carrasco R.
PY - 2005
SP - 104
EP - 113
DO - 10.5220/0002579501040113