\
|
+
=
= = .
9
5 , 1
5
5
(1)
where the binary switches
i
are set according to
<
=
else
S g g if
i
i
0
1
5
(2)
and
= =
=
9
5 , 1i i
i
n
(3)
The threshold S is set depending on the current
quantization parameter QP. If g
5
belongs to an intraframe
coded block we set S =QP; if g
5
belongs to an intercoded
block we choose S =QP/2. Parameter controls the amount
of smoothing and typically lies in the range 8 -16.
This filter is adaptive in two ways. First, only those
neighbourhood pixels are included in the filter mask where the
International Journal of Engineering Trends and Technology- Volume4Issue3- 2013
ISSN: 2231-5381 http://www.internationaljournalssrg.org Page 336
corresponding grey level is within a certain confidence
interval around the grey level of the pixel to be filtered.
Secondly, the confidence interval itself adapts to the amount
of ringing noise expected in that the threshold S is adjusted
depending on the quantisation parameter. Finally, the filter
mask is strictly local since only pixels within a 33 window
around the current pixel are considered. Similar to the
deblocking filter, the deringing filter is restricted to those
blocks which have actually been coded. Pixels of non-coded
luminance or chrominance blocks are also not filtered.
Regarding the computational complexity it should be
pointed out that the operator in eqn. 1 does not require a
multiplication but can be implemented with a simple add/not
add operation. In the worst case, therefore sixteen additions,
nine increments/shifts, and one division have to be performed
for each pixel to be filtered. It is also noteworthy that the filter
does not rely on any sequential processing and can operate in
parallel on all image pixels.
C. Iterative Procedures For Reduction Of Blocking Effects In
Transform Image Coding
A new iterative block reduction technique which is based
on the theory of projection onto convex sets as in [2] is
discussed below. Imposing a number of constraints on the
image which is coded in such a way as to restore it to its
original form which is the artifact free form. We can derive
one such constraint by exploiting the fact that corresponding
to horizontal and vertical discontinuities across boundaries of
neighboring blocks, the transform coded image which suffer
from blocking effects contains high frequency horizontal and
vertical artifacts. One step of our iterative procedure consists
of projecting the coded image onto the set of signals that are
bandlimited in the horizontal or vertical directions, since these
components are missing in the original uncoded image or
atleast can be guaranteed to be missing from the original
image prior to coding. Another constraint we have chosen in
the restoration process has to do with the quantization
intervals of the transform coefficients. Associated with
transform coefficient quantizers there are decision levels and
these decision levels can be used as the lower and upper
bounds on transform coefficients which in turn define the
boundaries of the convex set for projection. Thus onto this
convex set when we project the out-of-bound transform
coefficient, we will select the upper (lower) bound of the
quantization interval if its value is larger (smaller) than the
upper (lower) bound.
This paper proposes the iterative procedure. The image that
has high frequency vertical and horizontal components which
corresponds to the discontinuities of the NN blocks is low
pass filtered or bandlimited in the first part of each iteration.
The quantization constraint is applied in the second part of
each iteration as follows. At first the image is divided into
N N blocks and the DCT of each is taken. Then any
coefficient outside its quantization range is projected onto its
appropriate value. Under the above conditions, the Projection
Onto Convex Set theory assures that iterative projection
between S1 and S2 sets results in convergence to an element
in the intersection of the two sets.
D. A Study On Improving Image Quality Of Highly
Compressed Moving Pictures
Reduction of blocky noise using inverse wavelet transform
which is proposed in[22] is discussed below. The block size
that is generally used in JPEG and MPEG is 8 8 pixels.
Discontinuity is generated between the blocks, when data is
compressed, quantizing low band signals. Thus in the
reconstructed images blocky noise is included. In this method,
each block of 8 8 pixels is converted into 4 4 blocks of 2
2 pixels.
1) Masking Process
Consider four bands, LL, which has both a low frequency
horizontal and vertical component, LH, which has a low
frequency horizontal component and a high frequency vertical
component, HL, which has a high frequency horizontal
component and a low frequency vertical component, and HH,
which has both a high frequency horizontal and vertical
component. To reduce the discontinuity, an LL band is filtered
and thus the blocky noise can be reduced. When we do this
process, because of filtering the edge of the images is blurry.
So masking is done which corresponds to the high frequency
components. The masking comprises of the following
processes. A threshold is set at first. If the value of the
threshold is higher when compared to the value of the high
frequency components the pixels are filtered because these
pixels are not the edge component. As a result, a clear image
is obtained since the edges are maintained. Based on the
experimental results only the threshold value is selected.
2) Inverse Wavelet Transform
The DCT coefficients are processed for 1-level inverse
wavelet transform and the reconstructed images are obtained
by adjusting the brightness. A number of filters are used in
this process for inverse wavelet transform. For reversible
transform haar filters are used in this study so that the
reconstructed images are same as those of the inverse DCT.
To remove more blocky noise, 5/3 filters which are used in
JPEG2000 are used. The threshold value is used as same as
the masking process.
3) Setting the Threshold
The blocky noise is very depending to the coding method.
The blocky noise is very visible in scenes were the camera is
moving quickly or where objects are moving fast. So, for each
type of macro blocks the threshold is set. A high threshold is
set in an intra-coding in which blocky noise occurs easily so
that the pixels are more filtered. A low threshold is set in an
inter-coding such that the pixels are filtered less. And a high
threshold is set by detecting quick camera movements. It is
possible to process two kinds of images in these processes,
those in which the camera is moving quickly and the objects
are moving fast.
4) Processing Between Frames
An MPEG sequence comprises of mainly three parts. A
series of intraframes called I-frames, a series of forward
predicted frames called P-frames, and bidirectionally
International Journal of Engineering Trends and Technology- Volume4Issue3- 2013
ISSN: 2231-5381 http://www.internationaljournalssrg.org Page 337
predicted frames called B-frames. I-frames are image frames
coded individually without any temporal prediction, P-frames
are interspersed between the I-frames, and B-frames are
interspersed between the I-frames and the P-frames. The B-
frames can be considered to be motion compensated
interpolation between the P-frames and the I-frames, with the
quantizer coefficients being different in each type of frame.
The number of correlations between the frames diminishes
when we perform the masking process independently in each
frame and thus the flicker appears in the reconstructed moving
pictures. Inorder to solve this problem, the masking area and
value for P- and B-frames following an I-frame are the same
as those for an I-frame.
E. Compression Artifact Reduction Based On Total Variation
Regularization Method For MPEG-2
TV regularization method [23] which is used for the
compression artifact reduction is explained below. In this
method, with the help of TV regularization technique the input
image is mainly divided into structure component and
structure component. Consider the following function
dxdy s i dxdy s s E
} }
+ V =
2
) (
(4)
The above equation is known as the ROF model for the
original TV regularization. It was proposed by Rudin, Osher,
and Fatemi. The TV regularization is a process which is used
to minimize the function given by (4). In (4), |s|dxdy is a
TV term and |i-s|
2
dxdy represents the constraint condition.
The denotes how much the texture component is constrained
to the original input signal. In this method, first, we have the
input image as the image with artifacts. Using the TV
regularization decomposition method [24], this image is
decomposed into structure component and texture component.
The structure component comprises of smooth signals with
only very little amount of noise and edges and the texture
component comprises of noise. The blocky noise, which
occurs due to the quantization of low frequency coefficients,
and the mosquito noise, which occurs due to the quantization
of high frequency coefficients, is separated into the texture
component. The structure component gives the details of the
edge components and this is passed through the sobel filter to
extract only the edge components. The edge information is
passed to the Gaussian filter where only the edge components
are filtered to remove the mosquito noise. Now, the Gaussian
filter output is passed through a Deblocking Edge Filter (DEF)
[25] to remove the blocky noise. Finally, DEF output and
structure components are added to get the final output image
with reduced compression artifact.
III. CONCLUSION
This paper discusses about the different techniques for the
reduction of the compression artifact. The first technique is
about the deblocking method using wavelet transform for
H.264 Mobile TV. When we compare the PSNR of this
method with the deblocking filter, which is adopted in the
reference software JM for H.264 [26], we could find that the
PSNR of the wavelet method is 1dB lower. Also in this
method, delta GBIM is around zero at all bit rates. That is we
can say that, the amount of blocky noise in the proposed
method is almost the same as that in the original image. When
we compare the decoded images it is clear that in terms of
blocky noise and image sharpness the quality of the
reconstructed image in the proposed method is higher than
that in the conventional method. The second technique is
about the reduction of ringing noise in transform image
coding using simple adaptive filter. This filter is an efficient
filter to reduce the mosquito and ringing noise. This filter is
numerically simple. By varying the two parameters filter mask
and filter strength this filter adapts itself to the image content
as well as to the coding mode. Also the loop filter approach
chosen in this method allows the use of the same decoded
picture for prediction and display and so is computationally
simpler. Also it keeps the additional delay small has a slightly
better visual performance. The third technique is about the
iterative procedures for reduction of blocking effects in
transform image coding. As a result of the proposed iterative
algorithm using a 33 low pass filtering, the images which
are free of blockiness but have excess amount of blurriness is
obtained. The fourth technique proposes a new method of
reducing blocky noise using inverse wavelet transform for
moving pictures as a way to reduce blocky noise at high
compression rates. In this technique, a threshold value is
present for both filtering and masking process. In this paper it
was possible to save the edge deletion of filtering and also to
process images in which either the camera is moving or the
object is moving so that fine images were obtained. The fifth
technique proposes a technique for compression artifact
reduction based on total variation regularization method for
MPEG-2. When we go through the experimental results of the
objective evaluation, it is clear that, all the PSNR in the
proposed method is higher and the AGBIM is lower when
compared with all the above mentioned techniques. Also,
there is only less blocky noise and mosquito noise in the
images reconstructed using the proposed method when
compared with all the above mentioned techniques. Also, the
image quality in the proposed method is much higher than all
the above mentioned techniques.
REFERENCES
[1] Yan. L, Adaptive spatial-temporal postprocessing for low bit-rate
coded image sequence, Proc. SPIE Image and Video Processing 2,
1994, SPlE Vol. 2182, pp. 102-110.
[2] Zakhor. A, Iterative procedures for reduction of blocking effects in
transformimage coding, IEEE Trans. Circuits Syst. Video Technol.,
1992, 2, (l), pp. 91-95.
[3] Draft Text of ITU-T Recommendation H.263 Version 2 (H.263+),
Video coding for low bit rate communication, J anuary 1998.
[4] Ozcelik T. , Brailean J . C. , and Katsaggelos A. K. , Image and video
compression algorithms based on recovery techniques using mean field
annealing, Proc. IEEE, 1995, 83, pp. 304-316.
[5] Kaup A. Adaptive constrained least squares restoration for
removal of blocking artifacts in low bit rate video coding, Proc. IEEE
Int. Conf. Acoustics, Speech, and Signal Processing, Munich, 21-24
April 1997, Vol. 4, pp. 2913-2916.
[6] Girod B., Horn U., and Xiancheng Y. Spatial shaping: A fully
compatible improvement of DCT coding, Proc. 1993 Picture Coding
Symp., 1993, p. 3.5.
International Journal of Engineering Trends and Technology- Volume4Issue3- 2013
ISSN: 2231-5381 http://www.internationaljournalssrg.org Page 338
[7] Kutka. R., Kaup, A., and Hager M., Quality improvement of low data-
rate compressed video signals by pre- and postprocessing, Proc. Digital
Compression Technologies and Systems for Video Communication,
1996, Vol. SPIE-2952, pp. 42-49.
[8] T. J arske, P. Haavisto, and I. Defee, Post-filtering methods for reducing
blocking effects fromcoded images, IEEE Trans. Cosum. Electron.,
vol. 40, no. 8, pp. 521526, Aug. 1994.
[9] A. Nosratinia, Embedded post-processing for enhancement of
compressed images, in Proc. IEEE Data Compression Conf., 1999, pp.
6271.
[10] T. Chen, H. Wu, and B. Qiu, Adaptive postfiltering of transform
coefficients for the reduction of blocking artifacts, IEEE Trans.
Circuits Syst. Video Technol., vol. 11, no. 5, pp. 594602, May 2001.
[11] S. Liu and A. Bovik, Efficient DCT-domain blind measurement and
reduction of blocking artifacts, IEEE Trans. Circuits Syst. Video
Technol., vol. 12, no. 12, pp. 11391149, Dec. 2002.
[12] B. Gunturk, Y. Altunbasak, and R. M. Mersereau, Multiframe
blocking-artifact reduction for transform-coded video, IEEE Trans.
Circuits Syst. Video Technol., vol. 12, no. 4, pp. 276282, Apr. 2002.
[13] S. Oguz, Y. Hu, and T. Nguyen, Image coding ringing artifact reduction
using morphological post-filtering, in Proc. IEEE Int. Work.
Multimedia Signal Processing, 1998, pp. 628633.
[14] H. Kong, Y. Nie, A. Vetro, H. Sun, and K. Barner, Adaptive Fuzzy
Post-Filtering for Highly Compressed Video, in Prof. IEEE Int. Conf.
Image Proc., 2004, pp. 18021806.
[15] S. Westen, R. Lagendijk, and J . Biemond, Adaptive spatial noise
shaping for DCT based image compression, in Proc. IEEE Int. Conf.
Acoustics, Speech and Signal Processing, May 1996, vol. 4, pp. 2124
2127.
[16] S. DelCorso, C. Miro, and J . J ung, MNR: A novel approach to correct
MPEG temporal distortions, IEEE Trans. Consum. Electron., vol. 49,
no. 2, pp. 229236, Feb. 2003.
[17] X. Fan, W. Gao, Y. Lu, and D. Zhao, Flicking reduction in all intra
frame coding, J oint Video Team of ISO/IEC MPEG and ITU-T VCEG,
J VT-E070, Oct. 2002.
[18] S. Sakaida, K. Iguchi, S. Gohshi, and Y. Fujita, Adaptive quantization
control for reducing flicker of AVC/H.264 intra frames, presented at
the Picture Coding Symp., Dec. 2004.
[19] T. Kariyazaki, T. Goto, S. Hirano and M. Sakurai, A Deblocking
Method using Wavelet Transformfor H.264 Mobile TV, International
Symposium on Consumer Electronics (ICSE2009), pp.16-17, May 2009.
[20] H.R. Wu, M.Yuen, A genaralized blockedge impariment metric for
video coding, IEEE Signal Processing Letters, Vol.4, No.11, pp.317
320, Nov. 1997.
[21] A. Kaup, Reduction of Ringing Noise in TransformImage Coding
Using a Simple Adaptive Filter, IEEE Electronics Letters, Vol.34,
No.22, pp.2110-2112, October 1998.
[22] T. Goto, T. Yamazaki and M. Sakurai, A Study on Improving Image
Quality of Highly Compressed Moving Pictures, International
Symposiumon Information Theory and its Applications (ISITA2008),
pp.1429-1434, 2008.
[23] T. Goto, Y. Kato, S. Hirano,M. Sakurai,T. Q. Nguyen. Compression
Artifact Reduction based on Total Variation Regularization Method for
MPEG-2.IEEE transactions on consumer electronics, vol. 57, no. 1,
February 2011.
[24] J . Gilles, Image Decomposition: Theory, Numerical Schemes, and
Performance Evaluation, Advances in Imaging and Electron Physics,
Vol.158, pp.89-137, 2009.
[25] ITU-T Recommendation H.263, Video coding for low bit rate
communication, J anuary 2005.
[26] J oint Video Team (J VT), Reference Software,
http://iphome.hhi.de/suehring/tml/.
AUTHORS BIOGRAPHIES
Neethu Kuriakose received BTech
degree in Electronics and
Communication from Caarmel
Engineering College, Pathanamthitta,
Kerala in 2011 and pursuing MTech
in Communication Systems from
Karunya University, Coimbatore,
Tamil Nadu.
e-mail:
neethukuriakose12@gmail.com
Mr. Shanty Chacko received the
B.E from Manipal Institute of
Technology, ME from Government
College of Technology, Coimbatore.
He is currently working as an
Assistant Professor in Karunya
University, Coimbatore. His research
interests include Image processing
and Signal processing.
e-mail: shantychacko@karunya.edu