DocumentCode
3383842
Title
Searchable compressed representation of very sparse bitmaps
Author
Pigeon, Steven ; Wu, Xiaolin
Author_Institution
McMaster Univ., Hamilton, Ont., Canada
fYear
2003
fDate
25-27 March 2003
Firstpage
353
Lastpage
361
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. A method based on pruning of the binary space partition (BSP) tree in the minimal description length (MDL) principle for coding very sparse bitmaps was proposed. This new method for coding of sparse bitmaps meets seemingly competing objectives of good compression, the ability of conducting queries directly in the compression domain, and simple and fast decoding.
Keywords
bit-mapped graphics; data compression; decoding; encoding; search problems; sparse matrices; BSP tree; MDL; adjacency matrices; binary space partition; compression domain; fast decoding; large sparse graphs; minimal description length; searchable compressed representation; sparse bitmaps; sparse bitmaps coding; sparse space occupancy; Arithmetic; Binary trees; Councils; Data compression; Databases; Decoding; Encoding; Predictive coding; Sparse matrices; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2003. Proceedings. DCC 2003
Conference_Location
Snowbird, UT, USA
ISSN
1068-0314
Print_ISBN
0-7695-1896-6
Type
conf
DOI
10.1109/DCC.2003.1194026
Filename
1194026
Link To Document