We present a context-based scanning algorithm which reorders the input image using a hierarchical representation of the image. Our algorithm optimally orders (permutes) the leaves corresponding to the pixels, by minimizing the sum of distances between neighboring pixels. The reordering results in an improved autocorrelation between nearby pixels which leads to a smoother image. This allows us, for the first time, to improve image compression rates using context-based scans. The results presented in this paper greatly improve upon previous work in both compression rate and running time.
|Number of pages
|Computer Graphics Forum
|Published - 2003
|European Association for Computer Graphics 24th Annual Conference EUROGRAPHICS 2003 - Granada, Spain
Duration: 1 Sep 2003 → 6 Sep 2003
- Leaf ordering
- Lossless compression