1995
DOI: 10.1109/76.475891
|View full text |Cite
|
Sign up to set email alerts
|

Improved image decompression for reduced transform coding artifacts

Abstract: Abstract--The

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
77
0

Year Published

1998
1998
2007
2007

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 156 publications
(77 citation statements)
references
References 19 publications
0
77
0
Order By: Relevance
“…Before examining the experimental results, we shall comment about the computational burden involved in each iteration of Brent's algorithm. Each such iteration requires coding the image after applying the filter , followed by a decoding stage and computation of the residual in (9). In our experiments on typical 512 512 images, the execution time per iteration was 3.92 s, when executed on a P4 2-GHz machine, using Matlab.…”
Section: Optimal Decimation and Interpolation By Variable Projecmentioning
confidence: 99%
See 2 more Smart Citations
“…Before examining the experimental results, we shall comment about the computational burden involved in each iteration of Brent's algorithm. Each such iteration requires coding the image after applying the filter , followed by a decoding stage and computation of the residual in (9). In our experiments on typical 512 512 images, the execution time per iteration was 3.92 s, when executed on a P4 2-GHz machine, using Matlab.…”
Section: Optimal Decimation and Interpolation By Variable Projecmentioning
confidence: 99%
“…For the design of the lowpass filter , we use the window method with a Hamming window to design a separable filter with cutoff frequency . Consequently, a suboptimal solution of (5) is given by the lowpass filter , where is given by (9) This is a univariate minimization problem, which we solve using Brent's classic algorithm for minimization without derivatives [20]. We note that the optimization problem (9) is solved once at the encoding stage, and the resulting decimation filter need not be sent to the decoder as it is not used in the decoding process.…”
Section: Optimal Decimation and Interpolation By Variable Projecmentioning
confidence: 99%
See 1 more Smart Citation
“…For block-based discrete cosine transform (DCT) coding, the coded images usually suffer from the blocking effect across block boundaries and the ringing effect around edges. Due to the widespread use of DCT-based coding, many post-processing techniques have been proposed, among which most of them aim at suppressing the blocking effect as methods (4) (5) , and some can also reduce the ringing effect as methods (6) (7) . Recently, the discrete wavelet transform (DWT) has attracted considerable attention for image coding due to its unique joint space-frequency characteristics.…”
Section: Introductionmentioning
confidence: 99%
“…In order to remove this blocking artifacts while maintaining the compatibility with current industrial standards, various post-processing techniques such as block-boundary filtering [2][3][4][5], maximum a posteriori (MAP) methods [6], projections onto convex sets (POCS) [7][8][9][10], transform domain filtering [11,12] and others [13][14][15] have been proposed. Most of these post-processing techniques were proved to be very effective to eliminate the blocking effect.…”
Section: Introductionmentioning
confidence: 99%