Compressed vertex chain codes
From MaRDI portal
Publication:2643874
DOI10.1016/J.PATCOG.2007.03.001zbMATH Open1118.68734OpenAlexW2070831106MaRDI QIDQ2643874FDOQ2643874
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
Recommendations
Computing methodologies for image processing (68U10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (8)
- An approach to the computation of the Euler number by means of the vertex chain code
- Delta codes for line drawings
- Lossless compression of map contours by context tree modeling of chain codes
- A rate and distortion analysis of chain codes for line drawings
- Can Burrows-Wheeler transform be replaced in chain code compression?
- A new relative chain code in 3D
- Efficient chain code compression with interpolative coding
- Symmetry detection in 3D chain coded discrete curves and trees
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)