Lossless compression of map contours by context tree modeling of chain codes

DOI10.1016/J.PATCOG.2006.08.005zbMATH Open1119.68167OpenAlexW2037423667MaRDI QIDQ856458FDOQ856458

Authors: Alexander Akimov, Alexander V. Kolesnikov, Pasi Fränti 

Publication date: 7 December 2006

Published in: Pattern Recognition (Search for Journal in Brave)

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

Recommendations

• Efficient chain code compression with interpolative coding
• Lossless compression algorithm based on context tree
• scientific article; zbMATH DE number 2044047
• scientific article; zbMATH DE number 637360
• Compressed vertex chain codes

zbMATH Keywords

chain code encodingcontext treecontour compression

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)

Cites Work

• Title not available (Why is that?)
• A universal data compression system
• Title not available (Why is that?)
• A universal finite memory source
• Tree coding of bilevel images

Cited In (6)

• Lossless compression algorithm based on context tree
• Title not available (Why is that?)
• 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: Lossless compression of map contours by context tree modeling of chain codes

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