Efficiency of chain codes to represent binary objects

  • Authors:
  • Hermilo Sánchez-Cruz;Ernesto Bribiesca;Ramón M. Rodríguez-Dagnino

  • Affiliations:
  • Electronics Systems Department, Centro de Ciencias Básicas, Universidad Autónoma de Aguascalientes, Av. Universidad 940, Aguascalientes, Ags. 20100, México;Department of Computer Science, Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas, Universidad Nacional Autónoma de México, Apdo. 20-726, México D.F. 01000, M ...;Electronics and Telecommunications Center, Instituto Tecnológico y de Estudios Superiores de Monterrey, Av. E. Garza Sada 2501 Sur, Monterrey, NL, C.P. 64849, México

  • Venue:
  • Pattern Recognition
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

We present a study of compression efficiency for binary objects or bi-level images for different chain-code schemes. Chain-code techniques are used for compression of bi-level images because they preserve information and allow a considerable data reduction. Furthermore, chain codes are the standard input format for numerous shape-analysis algorithms. In this work we apply chain codes to represent object with holes and we compare their compression efficiency for seven chain codes. We have also compared all these chain codes with the JBIG standard for bi-level images.