This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sparse Pixel Vectorization: An Algorithm and Its Performance Evaluation
March 1999 (vol. 21 no. 3)
pp. 202-215

Abstract—Accurate and efficient vectorization of line drawings is essential for their higher level processing. We present a thinningless Sparse Pixel Vectorization (SPV) algorithm. Rather than visiting all the points along the wire's black area, SPV sparsely visits selected medial axis points. The result is a crude polyline, which is refined through polygonal approximation by removing redundant points. Due to the sparseness of pixel examination and the use of a specialized data structure, SPV is both time efficient and accurate, as evaluated by our proposed performance evaluation criteria.

[1] J. Jimenez and J.L. Navalon, "Some Experiments in Image Vectorization," IBM J. Res. Develop., vol. 26, pp. 724-734, 1982.
[2] R.W. Smith, Computer Processing of Line Images: A Survey Pattern Recognition, vol. 20, pp. 7-15, 1987.
[3] H. Tamura, "A Comparison of Line Thinning Algorithms From Digital Geometry Viewpoint." Proc. Fourth Int'l Joint Conf. Pattern Recognition, pp. 715-719,Kyoto, Japan, 1978.
[4] C.S. Fahn, J.F. Wang, and J.Y. Lee, "A Topology-Based Component Extractor for Understanding Electronic Circuit Diagrams," Computer Vision, Graphics and Image Processing, vol. 44, p. 119-138, 1988.
[5] R. Kasturi, S.T. Bow, W. El-Masri, J. Shah, J.R. Gattikermes, and U.B. Mokate, "A System for Interpretation of Line Drawings," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 10, pp. 978-992, Oct. 1990.
[6] V. Nagasamy and N.A. Langrana, "Engineering Drawing Processing and Vectorization System," Computer Vision, Graphics and Image Processing, vol. 49, no. 3, pp. 379-397, 1990.
[7] O. Hori and S. Tanigawa, “Rastor-to-Vector Conversion by Line Fitting Based on Contours and Skeletons,” Proc. Int'l Conf. Document Analysis and Recognition, pp. 272-281, 1993.
[8] L. Boatto, V. Consorti, M.C. Buono, S. Di Zenzo, V. Eramo, A.E.F. Melcarne, M. Meucci, A. Morelli, M. Mosciatti, S. Scarci, and M. Tucci, "An Interpretation System for Land Register Maps," IEEE Computer, vol. 25, no. 7, pp. 25-33, July 1992.
[9] G. Monagan and M. Roosli, "Appropriate Base Representation Using a Run Graph," Proc. ICDAR93, pp. 623-626,Tsukuba, Japan, 1993.
[10] X. Lin, S. Shimotsuji, M. Minoh, and T. Sakai, "Efficient Diagram Understanding With Characteristic Pattern Detection," Computer Vision, Graphics and Image Processing, vol. 30, pp. 84-106, 1985.
[11] P. Vaxiviere and K. Tombre, "Celesstin: CAD Conversion of Mechanical Drawings," IEEE Computer, vol. 25, no. 7, pp. 46-54, July 1992.
[12] I. Chai and D. Dori,“Orthogonal zig-zag: An efficient method for extracting bars in engineering drawings,” Visual Form, C. Arcelli, L.P. Cordella, and G. Sanniti di Baja, eds. New York and London: Plenum Press, pp. 127-136, 1992.
[13] D. Dori, Y. Liang, and I. Chai, "Spare Pixel Recognition of Primitives in Engineering Drawings," Machine Vision and Applications, vol. 6, pp. 69-82, 1993.
[14] D. Dori, “Orthogonal Zig-Zag: An Algorithm for Vectorizing Engineering Drawings Compared with Hough Transform,” Advances in Eng. Software, vol. 28, no. 1, pp. 11-24, 1997.
[15] A.J. Filipski and R. Flandrena, "Automated Conversion of Engineering Drawings to CAD Form," Proc. IEEE, vol. 80, no. 7, pp. 1,195-1,209, 1992.
[16] M. Roosli and G. Monagan, "Towards a High Quality Vectorization," Proc. GREC95, pp. 44-52,University Park, Pennsylvania, 1995.
[17] W. Liu and D. Dori, "Sparse Pixel Tracking: A Fast Vectorization Algorithm Applied to Engineering Drawings," Proc. ICPR96, Volume III: Robotics and Applications, pp. 808-811,Vienna, 1996.
[18] J. Sklansky and V. Gonzalez, "Fast Polygonal Approximation of Digitized Curves," Pattern Recognition, vol. 12, pp. 327-331, 1980.
[19] W. Liu, D. Dori, L. Tang, and Z. Tang, "Object Recognition in Engineering Drawings Using Planar Indexing," Proc. GREC95, pp. 53-61,University Park, Pennsylvania, 1995.
[20] B. Kong, I. Phillips, R. Haralick, A. Prasad, and R. Kasturi, “A Benchmark: Performance Evaluation of Dashed Line Detection Algorithms,” Graphics Recognition: Methods and Applications, First Int'l Workshop, Selected Papers, R. Kasturi and K. Tombre, eds., pp. 270-285, Lecture Notes in Computer Science, vol. 1072.Berlin: Springer-Verlag, 1996.
[21] O. Hori and S. Doermann, “Quantitative Measurement of the Performance of Raster-to-Vector Conversion Algorithms,” Graphics Recognition: Methods and Applications, First Int'l Workshop, Selected Papers, R. Kasturi and K. Tombre, eds., pp. 57-68, Lecture Notes in Computer Science, vol. 1072.Berlin: Springer-Verlag, 1996.
[22] W. Liu and D. Dori, “A Protocol for Performance Evaluation of Line Detection Algorithms,” Machine Vision and Application, vol. 9, no. 5, pp. 240-250, 1997.
[23] I. Phillips, J. Liang, A. Chhabra, and R. Haralick, “A Performance Evaluation Protocol for Graphics Recognition Systems,” Graphics Recognition: Algorithms and Systems, Second Int'l Workshop, GREC '97, Selected Papers, pp. 372-389, Lecture Notes in Computer Science, vol. 1389.Berlin: Springer-Verlag, 1998.
[24] W. Liu and D. Dori, Incremental Arc Segmentation Algorithm and Its Evaluation IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 4, pp. 424-431, Apr. 1998.
[25] ftp.technion.ac.il/pub/supported/ie/dori/ MDUSsunmdus.gz.
[26] A. Chhabra and I. Phillips Web pages for the Second International Graphics Recognition Contest—Raster to Vector Conversion:http://graphics.basit.com/iapr-tc10contest.html .
[27] A.K. Chhabra, and I.T. Phillips, “The Second International Graphics Recognition Contest—Raster to Vector Conversion: A Report,” Graphics Recognition—Algorithms and Systems, K. Tombre and A.K. Chhabra, eds., pp. 390-410, 1998.
[28] J.-Y. Yoo, M.-K. Kim, and Y.-B. Kwon, "Information Extraction From a Skewed Form Document in the Presence of Crossing Characters," K. Tombre and A. Chhabra, eds., Graphics Recognition—Algorithms and Systems. Lecture Notes in Computer Science, vol. 1,389. New York: Springer, 1998, pp. 139-148.

Index Terms:
Vectorization, line tracking, sparse pixel vectorization, polygonal approximation, performance evaluation.
Citation:
Dov Dori, Wenyin Liu, "Sparse Pixel Vectorization: An Algorithm and Its Performance Evaluation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 3, pp. 202-215, March 1999, doi:10.1109/34.754586
Usage of this product signifies your acceptance of the Terms of Use.