Tight Bounds for Top Tree Compression.
Philip BilleFinn FernstrømInge Li GørtzPublished in: SPIRE (2017)
Keyphrases
- tight bounds
- upper bound
- tree structure
- data compression
- compression algorithm
- image compression
- compression ratio
- wavelet tree
- lower bound
- compression scheme
- tree structures
- random access
- tree construction
- tree models
- image quality
- hierarchical structure
- b tree
- image processing
- data structure
- spanning tree
- binary tree
- compressed data
- bayesian networks
- case study