We consider lossless compression of digital contours in map images. The problem is attacked by the use of context-based statistical modeling and entropy coding of chain codes. We propose to generate an optimal context tree by first constructing a complete tree up to a predefined depth, and then create the optimal tree by pruning out nodes that do not provide improvement in compression. Experiments show that the proposed method gives lower bit rates than the existing methods for the set of test images. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Akimov, A., Kolesnikov, A., & Fränti, P. (2005). Lossless compression of map contours by context tree modeling of chain codes. In Lecture Notes in Computer Science (Vol. 3540, pp. 312–321). Springer Verlag. https://doi.org/10.1007/11499145_33
Mendeley helps you to discover research relevant for your work.