Blocking artifact detection and reduction in compressed data

Triantafyllidis, Georgios; Tzovaras, Dimitrios; Strintzis, Michael G.

doi:10.1109/tcsvt.2002.804880

Cited by 90 publications

(42 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Because the blocking artefacts results in the abrupt changes of pixels across boundaries, a specific type of metric is required to measure such distortions. In addition to PSNR and SSIM, the M SDS t [15] (calculated on 16x16 block) was used to measure changes of intensity gradient of the pixels close to boundary of two blocks. For coarsely quantized blocks, a difference in the intensity gradient across the block boundary is expected to be larger than blocks which are not coarsely quantized.…”

Section: Methodsmentioning

confidence: 99%

Adaptive bilateral filtering using saliency map for deblocking low bit rate videos

Himawan

Zele

Tjondronegoro

2014

2014 IEEE International Conference on Multimedia and Expo (ICME)

View full text Add to dashboard Cite

This paper proposes a novel approach to video deblocking which performs perceptually adaptive bilateral filtering by considering color, intensity, and motion features in a holistic manner. The method is based on bilateral filter which is an effective smoothing filter that preserves edges. The bilateral filter parameters are adaptive and avoid over-blurring of texture regions and at the same time eliminate blocking artefacts in the smooth region and areas of slow motion content. This is achieved by using a saliency map to control the strength of the filter for each individual point in the image based on its perceptual importance. The experimental results demonstrate that the proposed algorithm is effective in deblocking highly compressed video sequences and to avoid over-blurring of edges and textures in salient regions of image.

show abstract

Section: Methodsmentioning

confidence: 99%

Adaptive bilateral filtering using saliency map for deblocking low bit rate videos

Himawan

Zele

Tjondronegoro

2014

2014 IEEE International Conference on Multimedia and Expo (ICME)

View full text Add to dashboard Cite

show abstract

“…They have given a different solution for minimizing the MSDS. Trianta fyllidis et al [11] have proposed another method of minimizing MSDS, which involves diagonal neighboring pixels in addition to horizontal and vertical neighboring pixels. Then, for each block affected by blocking artifacts, DC and AC coefficients are recalculated for artifact reduction.…”

Section: Proposed Algorithm For Detection and Removal Of Corner Outliersmentioning

confidence: 99%

A post-processing algorithm for Detection & Removal of Corner Outlier

Gandam¹,

Sidhu²

2010

IJCA

View full text Add to dashboard Cite

The reconstructed images from JPEG compression produce noticeable image degradation near the block boundaries, in case of highly compressed images, because each block is transformed and quantized independently. The blocking effects are classified into three types of noises: staircase noise, grid noise and corner outlier out of which major thrust is laid on corner outlier in this paper. A post-processing algorithm is proposed to reduce the blocking artifacts of JPEG decompressed images. The proposed postprocessing algorithm, which consists of three stages, reduces the blocking artifacts efficiently. A comparative study between the proposed algorithm and other post-processing algorithms based on various performance indices is made. General TermsJPEG Compression, Corner outlier et.al.

show abstract

“…Our methods can also be viewed as new and improved AC prediction methods over the previously proposed ones, e.g., [1,Sec. 16.1], [13], [14], [18], and [15].…”

Section: ) Dct Theoretically Approximates the Karhunen-loève Transfomentioning

confidence: 99%

“…From the viewpoint of prediction, there are several algorithms, [1,Sec. 16.1], [13], [14], [18], [15], which predict three to nine low frequency AC components of F . Therefore, in this section, we shall measure the performance of U and U Q as a predictor of F and compare the results with those obtained by [1,Sec.…”

Section: A How Close U and U Q Are To F ?mentioning

confidence: 99%

“…16.1] and [13]. We shall not conduct the comparison with the methods proposed by [14], [18], [15] because: 1) the predictors F k for some range of k's proposed by [14] and [18] in the encoding stage require the values of F k themselves and hence the comparison in the encoding stage with our methods does not make sense; 2) the method in [15] needs an optimization by linear programming in order to predict the low frequency AC components of F , in addition to the same problem described in 1).…”

Section: A How Close U and U Q Are To F ?mentioning

confidence: 99%

See 1 more Smart Citation

Improvement of DCT-Based Compression Algorithms Using Poisson's Equation

Yamatani

Saito

2006

IEEE Trans. on Image Process.

View full text Add to dashboard Cite

We propose two new image compression-decompression methods that reproduce images with better visual fidelity, less blocking artifacts, and better PSNR, particularly in low bit rates, than those processed by the JPEG Baseline method at the same bit rates. The additional computational cost is small, i.e., linearly proportional to the number of pixels in an input image. The first method, the "full mode" polyharmonic local cosine transform (PHLCT), modifies the encoder and decoder parts of the JPEG Baseline method. The goal of the full mode PHLCT is to reduce the code size in the encoding part and reduce the blocking artifacts in the decoder part. The second one, the "partial mode" PHLCT (or PPHLCT for short), modifies only the decoder part, and consequently, accepts the JPEG files, yet decompresses them with higher quality with less blocking artifacts. The key idea behind these algorithms is a decomposition of each image block into a polyharmonic component and a residual. The polyharmonic component in this paper is an approximate solution to Poisson's equation with the Neumann boundary condition, which means that it is a smooth predictor of the original image block only using the image gradient information across the block boundary. Thus the residual-obtained by removing the polyharmonic component from the original image block-has approximately zero gradient across the block boundary, which gives rise to the fast-decaying DCT coefficients, which in turn lead to more efficient compression-decompression algorithms for the same bit rates. We show that the polyharmonic component of each block can be estimated solely by the first column and row of the DCT coefficient matrix of that block and those of its adjacent blocks and can predict an original image data better than some of the other AC prediction methods previously proposed. Our numerical experiments objectively and subjectively demonstrate the superiority of PHLCT over the JPEG Baseline method and the improvement of the JPEG-compressed images when decompressed by PPHLCT. K. Yamatani is with the

show abstract

Blocking artifact detection and reduction in compressed data

Cited by 90 publications

References 39 publications

Adaptive bilateral filtering using saliency map for deblocking low bit rate videos

Adaptive bilateral filtering using saliency map for deblocking low bit rate videos

A post-processing algorithm for Detection & Removal of Corner Outlier

Improvement of DCT-Based Compression Algorithms Using Poisson's Equation

Contact Info

Product

Resources

About