Applications of digital straight segments to economical image encoding

  • Vladimir Kovalevsky
2D Recognition
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1347)


A new classification of digital curves into boundary curves and visual curves of different thickness is suggested. A fast algorithm for recognising digital straight line segments in boundary curves is presented. The algorithm is applied to encode the boundaries of homogeneous regions in digitized images. The code is economical and enables an exact reconstruction of the original image.


Boundary Curve Cell Complex Middle Point Boundary Crack Exact Reconstruction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [AndKi1685]
    T. A. Andersen and C.E. Kim: Representation of digital line segments and their preimages. CVGIP 30, 279–288 (1985).Google Scholar
  2. [Deb95]
    I. Debled-Renesson: Etude et reconnaissance de droites et plans discrets. Thése de doctorat soutenue A l'Université Lis Pasteur de Strasbourg, 1995.Google Scholar
  3. [Franc96]
    J. François, J.-M. Schramm and M. Tajine: Recognizing arithmetic straight lines and planes. In: Miguet, S., Montanvert A., Ubéda S. (eds.): Discrete Geometry for Computer Imagery. Berlin Heidelberg New York Tokyo: Springer 1996 (Lecture Ws in Computer Science vol. 1176, pp. 146–150).Google Scholar
  4. [Fre6l]
    H. Freeman: On the encoding of arbitrary geometric configurations. IRE Trans. Electron. Comput EC-10, 260–068 (1961).Google Scholar
  5. [Fre74]
    H. Freeman: Computer processing of line-drawing images. Comput. Sure. 6, 57–97 (1974).Google Scholar
  6. [Kov84]
    V.A. Kovalevsky: Discrete topology and contour definition. Pattern Recognition, Letters 2 281–288 (1984)Google Scholar
  7. [Kov89]
    V.A. Kovalevsky: Finite topology as applied to image processing, CVGIP 46,141–161 (1989).Google Scholar
  8. [Kov90]
    V.A. Kovalevsky: New definition and fast recognition of digital straight segments and arcs. In: Proceeding of the International Conference on Pattern Recognition (ICPR-10), Los Alamitos, IEEE Computer Society Press 1990 (vol. II, pp. 31–34).Google Scholar
  9. [Kov94a]
    V.A. Kovalevsky: Topological foundations of shape analysis. In: Ying-Lie O. Alexander Toet, David Foster, Henk J.A.M. Heijmans, Peter Meer (eds.): Shape in Picture. Berlin Heidelberg York Tokyo: Springer 1994 (Series F: Computer and Systems Sciences Vol, 126, pp. 21–36).Google Scholar
  10. [Kov94b]
    V.A. Kovalevsky: A new concept for digital geometry. In: Ying-Lie O., Alexander Toet, David Foster, Henk J.A.M Heijmans, Peter Meer (eds.): Shape in Picture. Berlin Heidelberg New York Tokyo: Springer 1994 (Series F: Computer and Systems Sciences Vol. 126, pp. 37–51).Google Scholar
  11. [RevDeb94]
    J.P. Reveilles, 1. Debled-Renesson: A linear algorithm for segmentation of discrete curves. Third International Works, on Parallel Image Analysis: Theory and Applications, Washington, 1994.Google Scholar
  12. [RosKaak82]
    A. Rosenfeld and A. C. Kaak: Digital Picture Processing. 2nd edition, Academic Press 1982.Google Scholar
  13. [Whit83]
    T. Whiffed: Antialiased line drawing using brush extrusion. SIGGRAPH 83, 151–156 (1983).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Vladimir Kovalevsky
    • 1
  1. 1.Technische Fachhochschule BerlinBerlinGermany

Personalised recommendations