Multiplication-free approximate algorithms for compressed-domain linear operations on images

We propose a method for devising approximate multiplication-free algorithms for compressed-domain linear operations on images, e.g., downsampling, translation, filtering, etc. We demonstrate that the approximate algorithms give output images that are perceptually nearly equivalent to those of the exact processing, while the computational complexity is significantly reduced.