Compressed vertex chain codes

DOI10.1016/J.PATCOG.2007.03.001MaRDI QIDQ2643874zbMATH OpenOpenAlexFDO

Authors Yong Kui Liu, Wei Wei, Peng Jie Wang, Borut Žalik

Publication date 27 August 2007

Published in Pattern Recognition (Search for Journal in Brave)

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

zbMATH Keywords

chain codecompressioncontour representationHuffman code

Mathematics Subject Classification ID

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

Recommendations

• Efficiency of chain codes to represent binary objects
• Efficient chain code compression with interpolative coding
• A new relative chain code in 3D
• A rate and distortion analysis of chain codes for line drawings
• An approach to the computation of the Euler number by means of the vertex chain code

Cited in

(8)

• Symmetry detection in 3D chain coded discrete curves and trees
• Efficient chain code compression with interpolative coding
• An approach to the computation of the Euler number by means of the vertex chain code
• Can Burrows-Wheeler transform be replaced in chain code compression?
• A rate and distortion analysis of chain codes for line drawings
• Delta codes for line drawings
• Lossless compression of map contours by context tree modeling of chain codes
• A new relative chain code in 3D

This page was built for publication: Compressed vertex chain codes

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