A multiresolution stochastic process for image compression
Shankar Moni, R.L. Kashyap · 2002
We define a data structure called a "web" together with an algorithm to choose scale-space atoms for representing an image. The corresponding wavelet coefficients (of the atoms chosen using this method) have useful properties which lead to (i) the definition of a stochastic process for representing images and (ii) an efficient image compression algorithm. The advantage of our image compression algorithm is that the computational requirement is very low. The stochastic process is useful in a theoretical sense because it gives us a framework in which to understand images and certain image compression algorithms.