Fast Edge-Preserved Postprocessing for Compressed Images
Images are often coded using block-based discrete cosine transform (DCT), where blocking and ringing artifacts are the most common visual distortion. In this letter, a fast algorithm is proposed to alleviate the said artifacts in the DCT domain. The new concept is to decompose a row or column image...
Saved in:
Published in | IEEE transactions on circuits and systems for video technology Vol. 16; no. 9; pp. 1142 - 1147 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.09.2006
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Images are often coded using block-based discrete cosine transform (DCT), where blocking and ringing artifacts are the most common visual distortion. In this letter, a fast algorithm is proposed to alleviate the said artifacts in the DCT domain. The new concept is to decompose a row or column image vector to a gradually changed signal and a fast variational signal, which correspond to low-frequency (LF) and high-frequency (HF) DCT subbands, respectively. Blocking artifacts between adjacent LF blocks are suppressed by smoothing LF components and discarding invalid HF ones, and ringing artifacts inside HF vectors are reduced by a simplified bilateral filter. With such a process, edges are preserved while blockiness and ringing are alleviated. Analytic and experimental results confirm the robustness and computational efficiency of the proposed method |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1051-8215 1558-2205 |
DOI: | 10.1109/TCSVT.2006.880187 |