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

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free