Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asada, H., Brady, M.: The curvature primal sketch. IEEE Transactions on Pattern Analysis and Machine Intelligence 8(1), 2–14 (1986)
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)
Lowe, D.G.: Organization of smooth image curves at multiple scales. International Journal of Computer Vision 3(2), 119–130 (1989), http://www.cs.ubc.ca/spider/lowe/pubs.html http://www.cs.ubc.ca/~lowe/papers/iccv88.pdf
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), http://www.springerlink.com/content/a36r0kt6570537q0/fulltext.pdf
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)
Harville, D.A.: Matrix Algebra From a Statistician’s Perspective. Springer, Heidelberg (1997)
Pavlidis, T.: Algorithms for Graphics and Image Processing. Computer Science Press (1982)
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), http://agribov.blogspot.com
Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, Reading (September 1998)
Weiss, I.: High-Order Differentiation Filters That Work. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(7), 734–739 (1994)
Burghardt, D.: Controlled Line Smoothing by Snakes. GeoInformatica 9(3), 237–252 (2005), http://www.springerlink.com/openurl.asp?genre=article&eissn=1573-7624&volume=9&issue=3&spage=237
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)
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)
Taubin, G.: Curve and Surface Smoothing without Shrinkage. In: Proceeding, Fifth International Conference on Computer Vision, pp. 852–857 (June 1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gribov, A., Bodansky, E. (2008). Smoothing a Network of Planar Polygonal Lines Obtained with Vectorization. In: Liu, W., Lladós, J., Ogier, JM. (eds) Graphics Recognition. Recent Advances and New Opportunities. GREC 2007. Lecture Notes in Computer Science, vol 5046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88188-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-88188-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88184-1
Online ISBN: 978-3-540-88188-9
eBook Packages: Computer ScienceComputer Science (R0)