An algorithm for polygonal approximation based on local integral deviation is presented. The algorithm is tested on various shapes with varying number of dominant points. A comparative study of the proposed procedure with other iterative methods shows that the proposed procedure produces polygon from a digital curve approximating high as well as low curvature regions with almost equal precision.

Mangayarkarasi R

Department of Information Technology

School of Information Technology and Engineering

Vellore Campus

Bimal Kumar Ray

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Polygonal approximation of digital planar curve using local integral deviation

International Journal of Computational Vision and Robotics

Closed Curve approximation is a technique to approximate a digital planar curve with piece straight line segments. The terminating point of a candidate line segment is known as pseudo point. By detecting good choice of the pseudo point on the digital planar one may be able to visibly recognize the shape of the curve. The techniques analyzed in this paper makes closed curve approximation by deleting the redundant pseudo high high curvature points and retains the real pseudo high curvature point. This paper makes an attempt to summarize the deficiency of the closed curve approximation techniques under geometric invariance and the response for the noisy curve.

2017 International conference on Microelectronic Devices, Circuits and Systems (ICMDCS)

A brief review of closed curve approximation technique using iterative point elimination

A technique to preserve the self-tracing portion of a digital planar curve is presented in this paper. The proposed alternative method produces initial segmentation points using chain code assignment. To compute the deviation of an initial segmentation points/pseudo high curvature points the proposed methods use the value of arc length between its adjacent pseudo high curvature points as a departure measure. And the technique removes pseudo high curvature point with minimal deviation until the polygon preserves the self-tracing portion. The experimental result reveals that the proposed method produce output curve with self-tracing portion with less approximation error.

An alternative metric to preserve self-tracing portion on the digital planar curves

Image and Vision Computing

A novel framework for making dominant point detection methods non-parametric

Dominant point detection by reverse polygonization of digital curves

Pattern Recognition

Optimized polygonal approximation by dominant point deletion

Polygonal representation of digital planar curves through dominant point detection—a nonparametric algorithm

Ant colony search algorithms for optimal polygonal approximation of plane curves

Journal	International Journal of Computational Vision and Robotics
Publisher	Inderscience Publishers
ISSN	1752-9131
Open Access	0