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

  • Authors:

  • N. Merhav

  • Affiliations:

  • Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 1999

Quantified Score

Hi-index 0.01

Visualization

Abstract

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