Line Net Global Vectorization: An Algorithm and Its Performance Evaluation
Abstract
In this paper, an efficient global algorithm for vectorizing line drawings is presented. It first extracts a seed segment of a graphic entity from a raster image to obtain its direction and width, then tracks the pixels under the guidance of the direction so that the tracking can track through junctions and is not affected by noise and degradation of image quality. Thus, an entity will be vectorized in one step without postprocessing. The relations among lines are also used to realize the continuous vectorization of a line net. The speed and quality of vectorization are greatly improved with this algorithm. The performance evaluation is carried out both by theoretical analysis and by experiments. Comparisons with other vectorization algorithms are also made.
Cite
Text
Song et al. "Line Net Global Vectorization: An Algorithm and Its Performance Evaluation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2000. doi:10.1109/CVPR.2000.855844Markdown
[Song et al. "Line Net Global Vectorization: An Algorithm and Its Performance Evaluation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2000.](https://mlanthology.org/cvpr/2000/song2000cvpr-line/) doi:10.1109/CVPR.2000.855844BibTeX
@inproceedings{song2000cvpr-line,
title = {{Line Net Global Vectorization: An Algorithm and Its Performance Evaluation}},
author = {Song, Jiqiang and Su, Feng and Chen, Jibing and Tai, Chiew-Lan and Cai, Shijie},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2000},
pages = {1383-1388},
doi = {10.1109/CVPR.2000.855844},
url = {https://mlanthology.org/cvpr/2000/song2000cvpr-line/}
}