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

Authors:
Alexander Akimov;Alexander Kolesnikov;Pasi Fränti
Affiliations:
Department of Computer Science, University of Joensuu, P.O. Box 111, 80110 Joensuu, Finland;Department of Computer Science, University of Joensuu, P.O. Box 111, 80110 Joensuu, Finland;Department of Computer Science, University of Joensuu, P.O. Box 111, 80110 Joensuu, Finland
Venue:
Pattern Recognition
Year:
2007

Citing 11
Cited 5

Fast Chain Coding of Region Boundaries

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer Processing of Line-Drawing Images

ACM Computing Surveys (CSUR)
Algorithms for Graphics and Imag

Algorithms for Graphics and Imag
Highly efficient coding schemes for contour line drawings

ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 3)-Volume 3 - Volume 3
Efficient error free chain coding of binary documents

DCC '95 Proceedings of the Conference on Data Compression
Algorithm for computer control of a digital plotter

IBM Systems Journal
An efficient chain code with Huffman coding

Pattern Recognition
A universal data compression system

IEEE Transactions on Information Theory
A universal finite memory source

IEEE Transactions on Information Theory
Applications of universal context modeling to lossless compression of gray-scale images

IEEE Transactions on Image Processing
Tree coding of bilevel images

IEEE Transactions on Image Processing

JPEG2000 coding techniques addressed to images containing no-data regions

ACIVS'07 Proceedings of the 9th international conference on Advanced concepts for intelligent vision systems
Proposing a new code by considering pieces of discrete straight lines in contour shapes

Journal of Visual Communication and Image Representation
Directional difference chain codes with quasi-lossless compression and run-length encoding

Image Communication
A new relative chain code in 3D

Pattern Recognition
Chain code lossless compression using move-to-front transform and adaptive run-length encoding

Image Communication

Quantified Score

Hi-index	0.02

Visualization

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 the chain codes. We propose to generate an optimal n-ary incomplete context tree by first constructing a complete tree up to a predefined depth and creating the optimal tree by pruning out nodes that do not provide improvement in compression. We apply this method for both vector and raster maps. Experiments show that the proposed method gives lower bit rates than the existing methods of chain codes compression for the set of test data.