Lossless compression of map contours by context tree modeling of chain codes
From MaRDI portal
Publication:856458
DOI10.1016/j.patcog.2006.08.005zbMath1119.68167OpenAlexW2037423667MaRDI QIDQ856458
Pasi Fränti, Alexander V. Kolesnikov, Alexander Akimov
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
Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)
Related Items
Can Burrows-Wheeler transform be replaced in chain code compression? ⋮ Symmetry detection in 3D chain coded discrete curves and trees ⋮ A new relative chain code in 3D ⋮ Efficient chain code compression with interpolative coding
Cites Work