Conference
Searchable Compressed Representations of Very Sparse Bitmaps
Abstract
Very sparse bitmaps are used in a wide variety of applications, ranging from adjacency matrices in representation of large sparse graphs, representation of sparse space occupancy to book-keeping in databases. In this paper, we propose a method based on pruning of binary space partition (BSP) tree in minimal description length (MDL) principle for coding very sparse bitmaps. This new method for coding of sparse bitmaps meets seemingly competing …
Authors
Pigeon S; Wu X
Pagination
pp. 353-361
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
January 1, 2003
DOI
10.1109/dcc.2003.1194026
Name of conference
Data Compression Conference, 2003. Proceedings. DCC 2003