This Article 
 Bibliographic References 
 Add to: 
Automatic Representation of Binary Images
December 1990 (vol. 12 no. 12)
pp. 1190-1196

A method of representing black and white images through the description of the boundaries of the objects that define such images is proposed. In order to obtain such a representation, this method uses several algorithms which perform boundary extraction, contour following, segmentation, pattern classification, and curve fitting. One of the advantages of this method is that the image can be reconstructed at any size. It can also be rotated or translated without losing any quality. In addition to achieving a good data-compression rate, the coding-decoding process is computationally very efficient. Also shown is the application of these algorithms to characters in order to obtain fonts that may be downloaded for modern laser printers.

[1] R. O. Duda and P. E. Hart,Pattern Classification and Scene Analysis. New York: Wiley, 1973.
[2] F. B. Hildebrand,Introduction to Numerical Analysis. New York: McGraw-Hill, 1956, ch. 2.
[3] A. Jain,Fundamentals of Digital Image Processing. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[4] T. Pavlidis,Algorithms for Graphics and Image Processing. Rockville, MD: Computer Science Press, 1982.
[5] J. Serra,Image Analysis and Mathematical Morphology. New York: Academic, 1982.

Index Terms:
binary image representation; computerised picture processing; boundary extraction; contour following; segmentation; pattern classification; curve fitting; data-compression; coding-decoding process; computerised pattern recognition; computerised picture processing; data compression; decoding; encoding
C.A. Cabrelli, U.M. Molter, "Automatic Representation of Binary Images," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 12, pp. 1190-1196, Dec. 1990, doi:10.1109/34.62608
Usage of this product signifies your acceptance of the Terms of Use.