Unsupervised Polygonal Reconstruction of Noisy Contours by a Discrete Irregular Approach

In this paper, we present an original algorithm to build a polygonal reconstruction of noisy digital contours. For this purpose, we first improve an algorithm devoted to the vectorization of discrete irregular isothetic objects. Afterwards we propose to use it to define a reconstruction process of noisy digital contours. More precisely, we use a local noise detector, introduced by Kerautret and Lachaud in IWCIA 2009, that builds a multi-scale representation of the digital contour, which is composed of pixels of various size depending of the local amount of noise. Finally, we compare our approach with previous works, by considering the Hausdorff distance and the error on tangent orientations of the computed line segments to the original perfect contour. Thanks to both synthetic and real noisy objects, we show that our approach has interesting performance, and could be integrated into document analysis systems.

[1]  Laure Tougne,et al.  Digital straight line recognition on heterogeneous grids , 2004, IS&T/SPIE Electronic Imaging.

[2]  Joseph O'Rourke,et al.  An on-line algorithm for fitting straight lines between data ranges , 1981, CACM.

[3]  Jacques-Olivier Lachaud,et al.  Multi-scale Analysis of Discrete Contours for Unsupervised Noise Detection , 2009, IWCIA.

[4]  Karl Tombre,et al.  Robust and accurate vectorization of line drawings , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Laure Tougne,et al.  Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids , 2006, DGCI.

[6]  Eric Andres,et al.  Discrete analytical curve reconstruction without patches , 2005, Image Vis. Comput..

[7]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Thanh Phuong Nguyen,et al.  Parameter-free Method for Polygonal Representation of the Noisy Curves , 2009, IWCIA Special Track on Applications.

[9]  Antoine Vacavant,et al.  Fast distance transformation on irregular two-dimensional grids , 2010, Pattern Recognit..

[10]  François de Vieilleville,et al.  Fast, accurate and convergent tangent estimation on digital contours , 2007, Image Vis. Comput..

[11]  Gaëlle Largeteau-Skapin,et al.  Adaptive Pixel Resizing for Multiscale Recognition and Reconstruction , 2009, IWCIA.

[12]  Isabelle Debled-Rennesson,et al.  Optimal blurred segments decomposition of noisy shapes in linear time , 2006, Comput. Graph..

[13]  Mario Vento,et al.  Symbol recognition in documents: a collection of techniques? , 2000, International Journal on Document Analysis and Recognition.

[14]  David Coeurjolly,et al.  Supercover model, digital straight line recognition and curve reconstruction on the irregular isothetic grids , 2006, Comput. Graph..

[15]  Alexandre Faure,et al.  Linear Decomposition of Planar Shapes , 2010, 2010 20th International Conference on Pattern Recognition.

[16]  Laure Tougne,et al.  A framework for dynamic implicit curve approximation by an irregular discrete approach , 2009, Graph. Model..