Efficiency of chain codes to represent binary objects

DOI10.1016/J.PATCOG.2006.10.013MaRDI QIDQ877106zbMATH OpenOpenAlexFDO

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

Publication date 19 April 2007

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2006.10.013

zbMATH Keywords

shapesentropyHuffman algorithmchain codingbi-level images

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Efficient and Compact Representations of Prefix Codes
• Efficient chain code compression with interpolative coding
• Efficient representation of binary nonlinear codes: constructions and minimum distance computation
• Bit probabilities of optimal binary source codes
• scientific article; zbMATH DE number 515901
• Some efficient binary codes constructed using Srivastava codes (Corresp.)
• Theoretical Aspects of Computing – ICTAC 2005
• Optimal Binary Coding of Ordered Numbers
• Efficient encoding of low-density parity-check codes

Cites work

• scientific article; zbMATH DE number 54067 (Why is no real title available?)
• scientific article; zbMATH DE number 3451488 (Why is no real title available?)
• An algorithm for compression of bilevel images
• Property Encoding: Application in Binary Picture Encoding and Boundary Following

Cited in

(6)

• Entropy-based selection of cluster representatives for document image compression
• Can Burrows-Wheeler transform be replaced in chain code compression?
• Efficient chain code compression with interpolative coding
• A new relative chain code in 3D
• Compressed vertex chain codes
• A rate and distortion analysis of chain codes for line drawings

This page was built for publication: Efficiency of chain codes to represent binary objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877106)