An algorithm for line matching in an image by mapping into an n-dimensional vector space

This paper proposes a minimal length difference algorithm for construction of a line in an image by solving the problem of optimal contour approximation. In this algorithm, a method for finding interest points is proposed, and the object matching (classification) is done by mapping interest points onto a vector space. In cases where the lines in the representation of the images are not smooth, the algorithm converges rapidly. The results of the experiments showed that for convergence of the contour simplification, there were 5-6 iterations for n = 13 . To check how close the curve approximation calculated by the algorithm above, the researchers have calculated the length of the curve simplification manually. This length was then compared to the length of the original curve. The results showed that the length of the simplified curve grew rapidly to 92%–95% of the original curve length. The further increase in the number of points does not affect this indicator. According to the obtained results, the relative difference and the relative difference distance are good metrics to match objects.

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

[2]  José L. G. Pallero,et al.  Robust line simplification on the plane , 2013, Comput. Geosci..

[3]  Cordelia Schmid,et al.  Evaluation of Interest Point Detectors , 2000, International Journal of Computer Vision.

[4]  Francisco Javier Ariza-López,et al.  Sinuosity pattern recognition of road features for segmentation purposes in cartographic generalization , 2009, Pattern Recognit..

[5]  Kiyun Yu,et al.  Hybrid line simplification for cartographic generalization , 2011, Pattern Recognit. Lett..

[6]  Hiroshi Imai,et al.  Computational-geometric methods for polygonal approximations of a curve , 1986, Comput. Vis. Graph. Image Process..

[7]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[8]  Gary R. Bradski,et al.  Learning OpenCV - computer vision with the OpenCV library: software that sees , 2008 .

[9]  Shihong Du.  Analyzing topological changes for structural shape simplification , 2014, J. Vis. Lang. Comput..

[10]  Shin-Ting Wu,et al.  A non-self-intersection Douglas-Peucker algorithm , 2003, 16th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2003).

[11]  Juan Carlos Pérez-Cortes,et al.  Optimum polygonal approximation of digitized curves , 1994, Pattern Recognit. Lett..

[12]  Érick O. Rodrigues,et al.  Combining Minkowski and Cheyshev: New distance proposal and survey of distance metrics using k-nearest neighbours classifier , 2018, Pattern Recognit. Lett..

[13]  Paul S. Heckbert,et al.  Survey of Polygonal Surface Simplification Algorithms , 1997 .

[14]  Leonidas J. Guibas,et al.  Discrete Geometric Shapes: Matching, Interpolation, and Approximation , 2000, Handbook of Computational Geometry.

[15]  Pengda Wu,et al.  A Study on Curve Simplification Method Combining Douglas-Peucker with Li-Openshaw , 2016, GRMSE.

[16]  Remco C. Veltkamp,et al.  State of the Art in Shape Matching , 2001, Principles of Visual Information Retrieval.

[17]  J. Hershberger,et al.  Speeding Up the Douglas-Peucker Line-Simplification Algorithm , 1992 .

[18]  Chenghu Zhou,et al.  Gestalt-Based Douglas-Peucker Algorithm to Keep Shape Similarity and Area Consistency of Polygons , 2013 .

[19]  A. Saalfeld.  Topologically Consistent Line Simplification with the Douglas-Peucker Algorithm , 1999 .