Efficiency of chain codes to represent binary objects
From MaRDI portal
Publication:877106
DOI10.1016/J.PATCOG.2006.10.013zbMath1111.68142OpenAlexW2034941089MaRDI QIDQ877106
Ernesto Bribiesca, Hermilo Sánchez-Cruz, Ramón Martin 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
Computing methodologies for image processing (68U10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (4)
Can Burrows-Wheeler transform be replaced in chain code compression? ⋮ Entropy-Based Selection of Cluster Representatives for Document Image Compression ⋮ A new relative chain code in 3D ⋮ Efficient chain code compression with interpolative coding
Cites Work
This page was built for publication: Efficiency of chain codes to represent binary objects