Hierarchical Context-based Pixel Ordering

Ziv Bar-Joseph*, Daniel Cohen-Or

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish
Pages (from-to)349-358
Number of pages10
JournalComputer Graphics Forum
Issue number3
StatePublished - 2003
EventEuropean Association for Computer Graphics 24th Annual Conference EUROGRAPHICS 2003 - Granada, Spain
Duration: 1 Sep 20036 Sep 2003


  • Context-based
  • Image-space
  • Leaf ordering
  • Lossless compression
  • Quadtrees


Dive into the research topics of 'Hierarchical Context-based Pixel Ordering'. Together they form a unique fingerprint.

Cite this