IEEE Transactions on Pattern Analysis and Machine Intelligence
Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Algorithms for Graphics and Imag
Algorithms for Graphics and Imag
High-Order Differentiation Filters that Work
IEEE Transactions on Pattern Analysis and Machine Intelligence
Smoothing and Compression of Lines Obtained by Raster-to-Vector Conversion
GREC '01 Selected Papers from the Fourth International Workshop on Graphics Recognition Algorithms and Applications
Diffusion Kernels on Graphs and Other Discrete Input Spaces
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Curve and surface smoothing without shrinkage
ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
Controlled Line Smoothing by Snakes
Geoinformatica
| Hi-index | 0.00 |
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.