A New Method of Polyline Approximation
Many methods of a raw vectorization produce lines with redundant vertices. Therefore the results of vectorization usually need to be compressed. Approximating methods based on throwing out inessential vertices are widely disseminated. The result of using any of these methods is a polyline, the vertices of which are a subset of source polyline vertices. When the vertices of the source polyline contain noise, vertices of the result polyline will have the same noise. Reduction of vertices without noise filtering can disfigure the shape of the source polyline. We suggested a new optimal method of the piecewise linear approximation that produces noise filtering. Our method divides the source polyline into clusters and approximates each cluster with a straight line. Our optimal method of dividing polylines into clusters guarantees that the functional, which is the integral square error of approximation plus the penalty for each cluster, will be the minimum one.
Keywordsvectorization polylinecompression polyline approximation shape analysis
- 1.Douglas, D., Peucker, T.: Algorithm for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer 10, #2, 112–122 (1973)Google Scholar
- 2.Lang, T.: Rules for robot draftsmen. Geographical Magazine 22(1), 50–51 (1969)Google Scholar
- 5.Lowe, D.G.: Perceptual organization and visual recognition, ch. 4. Kluwer Academic Publishers, Boston (1985)Google Scholar