Smoothing a Network of Planar Polygonal Lines Obtained with Vectorization

  • Alexander Gribov
  • Eugene Bodansky
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5046)


A new method of smoothing polygonal lines obtained as the result of vectorization and creating the network is suggested. This method performs not only smoothing but also filtering of vectorization errors taking into account that these errors appear not only as the errors of vertices but as errors of node coordinates as well. An important part of this algorithm is a technique of building piecewise polynomial base functions for local approximation of the polylines of the network. The suggested algorithm has a linear computational complexity for exponential weight functions. The necessity of using finite weight functions is shown. Algorithms of calculating tangents and curvatures are derived. Shrinking errors and errors of parameters are analyzed. A method of compensation of the shrinking errors is suggested and how to do smoothing with variable intensity is shown.


smoothing error filtering local approximation polygonal lines network of polylines weight functions vectorization line drawings 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Asada, H., Brady, M.: The curvature primal sketch. IEEE Transactions on Pattern Analysis and Machine Intelligence 8(1), 2–14 (1986)Google Scholar
  2. 2.
    Mokhtarian, F., Mackworth, A.: Scale-Based Description and Recognition of Planar Curves and Two-dimensional Shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence 8(1), 34–43 (1986)CrossRefGoogle Scholar
  3. 3.
    Lowe, D.G.: Organization of smooth image curves at multiple scales. International Journal of Computer Vision 3(2), 119–130 (1989), CrossRefMathSciNetGoogle Scholar
  4. 4.
    Ver Hoef, J.M., Peterson, E., Theobald, D.: Spatial statistical models that use flow and stream distance. Environmental and Ecological Statistics 13(4), 449–464 (2006), CrossRefMathSciNetGoogle Scholar
  5. 5.
    Cressie, N., Frey, J., Harch, B., Smith, M.: Spatial Prediction on a River Network. Journal of Agricultural, Biological & Environmental Statistics, American Statistical Association 11(2), 127–150 (2006)CrossRefGoogle Scholar
  6. 6.
    Harville, D.A.: Matrix Algebra From a Statistician’s Perspective. Springer, Heidelberg (1997)zbMATHGoogle Scholar
  7. 7.
    Pavlidis, T.: Algorithms for Graphics and Image Processing. Computer Science Press (1982)Google Scholar
  8. 8.
    Bodansky, E., Gribov, A., Pilouk, M.: Smoothing and Compression of Lines Obtained by Raster-to-Vector Conversion. In: Blostein, D., Kwon, Y.-B. (eds.) GREC 2001. LNCS, vol. 2390, pp. 256–265. Springer, Heidelberg (2002), CrossRefGoogle Scholar
  9. 9.
    Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, Reading (September 1998)Google Scholar
  10. 10.
    Weiss, I.: High-Order Differentiation Filters That Work. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(7), 734–739 (1994)CrossRefGoogle Scholar
  11. 11.
    Burghardt, D.: Controlled Line Smoothing by Snakes. GeoInformatica 9(3), 237–252 (2005), CrossRefGoogle Scholar
  12. 12.
    Korn, G.A., Korn, T.M.: Mathematical Handbook for Scientists and Engineers: Definitions, Theorems, and Formulas for Reference and Review. McGraw-Hill Book Company, New York (1968)zbMATHGoogle Scholar
  13. 13.
    Kondor, R.I., Lafferty, J.: Diffusion Kernels on Graphs and Other Discrete Structures. Machine Learning. In: Proceedings of the Nineteenth International Conference, pp. 315–322 (July 2002)Google Scholar
  14. 14.
    Taubin, G.: Curve and Surface Smoothing without Shrinkage. In: Proceeding, Fifth International Conference on Computer Vision, pp. 852–857 (June 1995) Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Alexander Gribov
    • 1
  • Eugene Bodansky
    • 1
  1. 1.Environmental Systems Research Institute (ESRI)RedlandsUSA

Personalised recommendations