Efficient chain code compression with interpolative coding

DOI10.1016/J.INS.2018.01.045MaRDI QIDQ2195467zbMATH OpenOpenAlexFDO

Authors Borut Žalik, Domen Mongus, Niko Lukač, Krista Rizman Žalik

Publication date 8 September 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2018.01.045

zbMATH Keywords

lossless compressionchain codes\( \psi \)-codingFELICS coding

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Recommendations

• Compressed vertex chain codes
• Efficiency of chain codes to represent binary objects
• Lossless compression of map contours by context tree modeling of chain codes
• A rate and distortion analysis of chain codes for line drawings
• Encoding-interleaved hierarchical interpolation for lossless image compression

Cites work

• A locally adaptive data compression scheme
• A new relative chain code in 3D
• An analysis of the Burrows-Wheeler transform
• An efficient raster font compression for embedded systems
• Compressed vertex chain codes
• Data compression by means of a ``book stack
• Efficiency of chain codes to represent binary objects
• Handbook of data compression. With contributions by David Bryant
• Linear work suffix array construction
• Lossless compression of map contours by context tree modeling of chain codes
• Scalable Parallel Suffix Array Construction
• Two Efficient Algorithms for Linear Time Suffix Array Construction

Cited in

(4)

• Lossless compression of map contours by context tree modeling of chain codes
• Efficiency of chain codes to represent binary objects
• Can Burrows-Wheeler transform be replaced in chain code compression?
• Compressed vertex chain codes

This page was built for publication: Efficient chain code compression with interpolative coding

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