Skip to main content
SpringerLink
Log in

A new method to obtain chain codes from y-axis representation of a region in a binary image

  • Communication Briefs
  • Published:
Multidimensional Systems and Signal Processing Aims and scope Submit manuscript

Abstract

Chain codes [Freeman 1974; Charavarty 1982; Kim, Lee and Kim 1988; Morrin 1976; Pavlidis 1978] and y-axis representation [Merrill 1973] are both commonly used representation of a region in a binary image. The y-axis representation is very efficient for some geometric applications [Chang and Leu 1990] and morphological operations [Ji, Piper and Tang 1989]. However, it is not efficient to compute the properties on the contour. In this paper, a new and simple algorithm other than Kim's [Kim, Lee and Kim 1988] to convert the y-axis representation to a sequence of chain codes is developed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • L.W. Chang and K.L. Leu, “A fast algorithm for the restoration of images based on chain codes description and its application,”Computer Vision, Graphics, and Image Processing, vol. 50, pp. 296–307, 1990.

    Google Scholar 

  • I. Charavarty, “A single pass, chain generating algorithm for region boundaries,”Computer Graphics Image Processing, vol. 15, pp. 224–235, 1982.

    Google Scholar 

  • C.R. Dyer, A. Rosenfeld, and H. Samet, “Region representation: boundary codes from quadtrees,”Comm. ACM vol. 23, pp. 171–179, March 1980.

    Google Scholar 

  • H. Freeman, “Computer processing of line drawing images”Computer Surveys, vol. 6, pp. 57–98, March 1974.

    Google Scholar 

  • L. Ji, J. Piper and J.Y. Tang, “Erosion and dilation of binary images by arbitrary structuring elements using interval coding,”Pattern Recognization Letters, No. 9, pp. 201–209, 1989.

  • S.D. Kim, J.H. Lee and J.K. Kim, “A new Chain-coding algorithm for binary images using run-length codes,”Computer Vision, Graphics, and Image Processing vol. 41, pp. 114–128, 1988.

    Google Scholar 

  • R.D. Merrill, “Representation of contours and regions for efficient computer search,”Comm. ACM vol. 16, pp. 69–82, February 1973.

    Google Scholar 

  • H. Morrin, “Chain-link compression of arbitrary black-white image,”Cmputer Graphics Image Processing vol. 5, pp. 172–189, 1976.

    Google Scholar 

  • T. Pavlidis, “A minimum storage boundary tracing algorithm and its application to automatic inspection,”IEEE Trans. Systems Man Cybernet. vol. SMC-8, pp. 66–69, 1978.

    Google Scholar 

  • H. Samet, “Region representation: quadtrees from boundary codes,”Comm. ACM vol. 23, pp. 163–170, March 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, 30043, ROC

    Long-Wen Chang & Kuen-Long Leu

Authors
  1. Long-Wen Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kuen-Long Leu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, LW., Leu, KL. A new method to obtain chain codes from y-axis representation of a region in a binary image. Multidim Syst Sign Process 3, 79–87 (1992). https://doi.org/10.1007/BF01941019

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01941019

Keywords

Search

Navigation