This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Run-Based Algorithms for Binary Image Analysis and Processing
January 1996 (vol. 18 no. 1)
pp. 83-89

Abstract—In this paper we suggest a variant of a binary image representation based on run length encoding. This variant allows to build a "graph representation" which turns convenient for a number of computing tasks like component labeling, computation of Euler number, diameter, convex hull and the detection of local extrema and multiple points. A running application in the raster-to-vector conversion of digital maps is finally provided.

[1] S. Di Zenzo and A. Morelli, "A useful image representation," Progress in Image Analysis and Processing, V. Cantoni et al., eds., World Scientific, pp. 170-178, 1989.
[2] C. Arcelli and G. Sanniti di Baja, "A width-independent fast thinning algorithm," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, pp. 463-474, 1985.
[3] H. Freeman, “Computer Processing of Line-Drawing Images,” Computing Surveys, vol. 6, no. 1, pp. 57-97, 1974.
[4] H. Freeman and R. Shapira, "Determining the Minimal-Area Encasing Rectangle for an Arbitrary Closed Curve," Comm. ACM, vol. 18, pp. 409-413, 1975.
[5] H. Freeman and L.S. Davis, "A corner-finding algorithm for chain-coded curves," IEEE Transactions on Computers, vol. 26, pp. 297-303, 1977.
[6] T. Pavlidis, "A review of algorithms for shape analysis," Comput. Graphics Image Process., vol. 7, pp. 243-258, 1978.
[7] J. Piper, "Efficient implementation of skeletonization using interval coding," Pattern Recogn. Letters, vol. 3, pp. 389-397, 1985.
[8] J. Piper and D. Rutovitz, "Data structures for image processing in a C language and Unix environment," Pattern Recogn. Letters, vol. 3, pp. 119-129, 1985.
[9] F.P. Preparata and M.I. Shamos, Computational Geometry. Springer-Verlag, 1985.
[10] M.P. Martinez, J. Jimenez, and J.L. Navalon, "A thinning algorithm based on contours," Comp. Vision Graphics Image Proc., vol. 39, pp. 186-201, 1987.
[11] A. Rosenfeld and A.C. Kak,Digital Picture Processing. Academic Press, 2nd ed., 1982
[12] D. Rutovitz, "Efficient processing of 2-D images," Progress in Image Analysis and Processing, V. Cantoni et al., eds. World Scientific, pp. 229-253, 1989.
[13] D. Rutovitz, "Data structures for operations on digital images," Pictorial Pattern Recognition, G.C. Cheng et al., eds. Washington, D.C.: Thompson, pp. 105-133, 1968.
[14] J. Sklansky, "Recognition of convex blobs," Pattern Rec., vol. 2, pp. 3-10, 1970.
[15] 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.
[16] L.A. Fletcher and R. Kasturi, “A Robust Algorithm for Text String Separation from Mixed Text/Graphics Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, pp. 910-918, Nov. 1988.

Index Terms:
Run representation, graph representation, raster-to-vector conversion, multigraph, character recognition.
Citation:
S. Di Zenzo, L. Cinque, S. Levialdi, "Run-Based Algorithms for Binary Image Analysis and Processing," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 1, pp. 83-89, Jan. 1996, doi:10.1109/34.476016
Usage of this product signifies your acceptance of the Terms of Use.