![](bga.png)
Compression ratio CR or weighted sum error WE,
the algorithm starts, per contour, by removing itera-
tively the corners that introduce the minimal possi-
ble ISEV to the global ISE measure until reaching
the stopping criterion. At the end, the remained cor-
ners form the vertices of the polygon that can best
approximate the current contour.
The experimental results have shown good re-
sults in comparison with other existing methods. In
our opinion, this is due to the efficient straight edge
detector that explores all the contour corners effi-
ciently and then to the iterative polygonal approxi-
mation algorithm that removes, at each iteration, the
corner with the smallest LISEV and at the same time
updates and reexamines the LISEV of already re-
moved corners. This way, we can ensure that the
remained corners form the polygon that best fit their
contour.
Finally, as a future work, we suggest an image
registration application that can benefit from detect-
ed straight edges and corners. These image features
can be combined together in a certain number to
form specific shapes or primitives that can have in-
variant measures versus different image transfor-
mation.
REFERENCES
Loncaric, S., 1998. A survey of shape analysis techniques,
Pattern Recognition, vol.31.
Herman M., Kanade T. and Kuroe S., 1984. Incremental
Acquisition of a Three-Dimensional Scene Model from
Images, IEEE Transactions on Pattern Analysis and
Machine Intelligence, Vol. Pami-6, No. 3.
Bouchafa S. and Zavidovique B., 2006. Efficient cumula-
tive matching for image registration. Image and Vi-
sion computing, Vol. 24.
Ayache N. and Faugeras O., 1986. A new approach for the
recognition and positioning of two dimensional ob-
jects, IEEE Transaction on Pattern Analysis and Ma-
chine Intelligence, vol.8.
Nachar R., Inaty E., Bonnin P. and Alayli Y., 2012. A
Robust Edge Based Corner Detector, Submitted for
possible publication in Autonomous Robots Springer,
September 2013, under review.
Dunham J.,1986. Optimum Uniform Piecewise Linear
Approximation of Planar Curves, IEEE Trans on Pat-
tern Analysis and Machine Intelligence vol PAMI 8
n°1, pp 67-75.
Pavlidis T., 1982. Algorithms for Graphics and Image
Processing, Springer Verlag.
Wall K. and Danielsson P., 1984. A fast sequential method
for polygonal approximation of digitized curves,
Computer Vision Graphics and Image Processing, vol
28, pp 220-227.
Gupta A., Chaudhury S. and Parthasarathy G., 1992. A
Hough Transform Based Approach to Polyline Ap-
proximation of Object Boundaries, Proceedings. 11th
IAPR International Conference on Pattern Recognition.
Vol.III. Conference C: Image, Speech and Signal
Analysis.
Mikheev A., Vincent L. and Faber V., 2001. High-Quality
Polygonal Contour Approximation Based on Relaxa-
tion, Pr ceedings Sixth International Conference on
Document Analysis and Recognition.
Prewitt J., 1979. Object enhacement and extraction, Pic-
ture processing & psychopictorics, BS Lip-
kin&A.Rosenfelded, Academic Press, New York USA.
Sobel, 1978. Neighbourhood coding of binary images for
fast contour following and general binary array pro-
cessing, Computer Graphics & Image Processing USA,
vol 8 pp 127-135.
Kirsch R., 1971. Computer determination of the constitu-
ent structure of biological images, Computers and Bi-
omedical Research 4.
Kolesnikov A., 2008. Fast Algorithm for ISE-Bounded
Polygonal Approximation, 15th IEEE International
Conference on Image Processing.
Kolesnikov A., 2009. Minimum Description Length Ap-
proximation of Digital Curves, 16th IEEE Internation-
al Conference on Image Processing.
Kolesnikov A., 2011. Nonparametric Polygonal and Mul-
timodel Approximation of Digital Curves with Rate-
Distortion Curve Modeling, 18th IEEE International
Conference on Image Processing.
Pinheiro A., 2010. Piecewise Approximation of Contours
Through Scale-Space Selection of Dominant Points
,
IEEE Transaction on Image Processing, Vol. 19, No. 6.
Parvez M. T. and Mahmoud S. A., 2010. Polygonal Ap-
proximation Of Planar Curves Using Triangular Sup-
pression, 10th International Conference on Infor-
mation Science, Signal Processing and their Applica-
tions.
Carmona-Poyato A., Madrid-Cuevas F.I., MedinaCarnicer
R. and Munoz-Salinas R., 2010. Polygonal approxi-
mation of digital planar curves through break point
suppression, Pattern Recognition, 43( 1), pp. 14-25.
Marji M. and Siy P., 2004. Polygonal representation of
digital planar curves through dominant point detec-
tion – a nonparametric algorithm, Pattern Recognition
37, pp. 2113- 2130.
Masood A., 2008. Optimized polygonal approximation by
dominant point deletion, Pattern Recognition 4 1, pp.
227- 239.
The C. H. and Chin R.T., 1989. On the detection of domi-
nant points on digital curves, IEEE Transactions of
Pattern Analysis and Machine Intelligence 11, pp.
859-872.
Canny J., 1986. A computational approach to edge detec-
tion, IEEE Transactions of Pattern Analysis and Ma-
chine Intelligence., vol. PAMI-8, pp. 679–698.
Deriche R., 1987. Optimal Edge detection using recursive
filtering, Int journal on Computer Vision.
Hartley R. and Zisserman A., 2003. Multiple View Geome-
try in Computer Vision, Cambridge university press,
2
nd
Edition.
VISAPP2014-InternationalConferenceonComputerVisionTheoryandApplications
256