DocumentCode
1469324
Title
Multiplication-free approximate algorithms for compressed-domain linear operations on images
Author
Merhav, Neri
Volume
8
Issue
2
fYear
1999
fDate
2/1/1999 12:00:00 AM
Firstpage
247
Lastpage
254
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
Keywords
computational complexity; convolution; data compression; discrete cosine transforms; filtering theory; image coding; image sampling; quantisation (signal); transform coding; JPEG; MPEG; compressed-domain linear operations; computational complexity; convolution; discrete cosine transform; downsampling; exact processing; filtering; image compression; multiplication-free approximate algorithms; output images; quantization; scaling; translation; Computational complexity; Convolution; Discrete cosine transforms; Filtering algorithms; Image coding; Maximum likelihood detection; Nonlinear filters; Quantization; Transform coding; Vectors;
fLanguage
English
Journal_Title
Image Processing, IEEE Transactions on
Publisher
ieee
ISSN
1057-7149
Type
jour
DOI
10.1109/83.743858
Filename
743858
Link To Document