By Topic

Deblocking of block-DCT compressed images using deblocking frames of variable size

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. Schclar ; School of Computer Science, Tel-Aviv University, 69978, Israel ; A. Averbuch ; D. L. Donoho

A new algorithm for the removal of blocking artifacts in block-DCT compressed images and video sequences is proposed in this paper. The algorithm uses deblocking frames of variable size (DFOVS). A deblocking frame is a square of pixels which overlaps image blocks. Deblocking is achieved by applying weighted summation on pixels quartets which reside in deblocking frames. The pixels in a quartet are symmetrically aligned with respect to block boundaries. The weights are determined according to a special 2-D function and a predefined factor, we refer to as a grade. A pixel's grade is determined according to the amount of details in its neighborhood. Deblocking of monotone areas is achieved by iteratively applying deblocking frames of decreasing sizes on such areas. This new algorithm produces very good subjective results and PSNR results which are competitive relative to available state-of-the-art methods.

Published in:

Acoustics, Speech, and Signal Processing (ICASSP), 2002 IEEE International Conference on  (Volume:4 )

Date of Conference:

13-17 May 2002