A Comparative Study on DeBlocking Algorithms for Highly Compressed Image

碩士 === 國立成功大學 === 電腦與通信工程研究所 === 96 === In recent years, the demand of images has been increasing because the Internet and multimedia prevails all over around. In order to transmit and store data, there are many compression standards. JPEG image compression standard is very popular nowadays which ha...

Full description

Bibliographic Details
Main Authors: Hsueh-Jung Hung, 洪雪榕
Other Authors: Chin-Hsing Chen
Format: Others
Language:en_US
Published: 2008
Online Access:http://ndltd.ncl.edu.tw/handle/95586097847859438681
id ndltd-TW-096NCKU5652115
record_format oai_dc
spelling ndltd-TW-096NCKU56521152015-11-23T04:03:11Z http://ndltd.ncl.edu.tw/handle/95586097847859438681 A Comparative Study on DeBlocking Algorithms for Highly Compressed Image 高度壓縮影像去方塊效應演算法之比較研究 Hsueh-Jung Hung 洪雪榕 碩士 國立成功大學 電腦與通信工程研究所 96 In recent years, the demand of images has been increasing because the Internet and multimedia prevails all over around. In order to transmit and store data, there are many compression standards. JPEG image compression standard is very popular nowadays which has two kinds of compression modes. One is lossless, the other is lossy. In order to get high compression rate, we often use the lossy mode to compress images and multimedia. However, the higher the compression rate, the more serious the blocks appear blocky. Degradation caused by this mosaic like artifact is called the blocking effect. We will focus on improving images with blocking effect after JPEG compression in this thesis. There are two classes of deblocking methods: one is removing blocking effect as noises by filtering the compressed image, the other is removing blocking effect in the wavelet transform domain. The Kuo’s method only deals with visible blocks by filtering and the Ramamurthi’s method filters pixels of different classes by one-dimensional and two-dimensional filters. The Shi’s method weakens edge features in the wavelet domain. We design a deblocking algorithm by combining the merits of the above three algorithms. At first we remove the block boundary by the one level Shi’s wavelet-based deblocking algorithm. Then we blur lightly the image by a lowpass filter in order to blur the block boundary. Then we filter the pixel at visible block boundaries but not inside blocks. Finally we filter pixels in the remaining blocks by the Ramamurthi’s method. By combining the merits of the three well known algorithms, we design an algorithm which eliminates the blocking edge and meanwhile maintains the edge information of images. In the future, we will focus on further improving the sharpness of the image. Chin-Hsing Chen 陳進興 2008 學位論文 ; thesis 49 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 國立成功大學 === 電腦與通信工程研究所 === 96 === In recent years, the demand of images has been increasing because the Internet and multimedia prevails all over around. In order to transmit and store data, there are many compression standards. JPEG image compression standard is very popular nowadays which has two kinds of compression modes. One is lossless, the other is lossy. In order to get high compression rate, we often use the lossy mode to compress images and multimedia. However, the higher the compression rate, the more serious the blocks appear blocky. Degradation caused by this mosaic like artifact is called the blocking effect. We will focus on improving images with blocking effect after JPEG compression in this thesis. There are two classes of deblocking methods: one is removing blocking effect as noises by filtering the compressed image, the other is removing blocking effect in the wavelet transform domain. The Kuo’s method only deals with visible blocks by filtering and the Ramamurthi’s method filters pixels of different classes by one-dimensional and two-dimensional filters. The Shi’s method weakens edge features in the wavelet domain. We design a deblocking algorithm by combining the merits of the above three algorithms. At first we remove the block boundary by the one level Shi’s wavelet-based deblocking algorithm. Then we blur lightly the image by a lowpass filter in order to blur the block boundary. Then we filter the pixel at visible block boundaries but not inside blocks. Finally we filter pixels in the remaining blocks by the Ramamurthi’s method. By combining the merits of the three well known algorithms, we design an algorithm which eliminates the blocking edge and meanwhile maintains the edge information of images. In the future, we will focus on further improving the sharpness of the image.
author2 Chin-Hsing Chen
author_facet Chin-Hsing Chen
Hsueh-Jung Hung
洪雪榕
author Hsueh-Jung Hung
洪雪榕
spellingShingle Hsueh-Jung Hung
洪雪榕
A Comparative Study on DeBlocking Algorithms for Highly Compressed Image
author_sort Hsueh-Jung Hung
title A Comparative Study on DeBlocking Algorithms for Highly Compressed Image
title_short A Comparative Study on DeBlocking Algorithms for Highly Compressed Image
title_full A Comparative Study on DeBlocking Algorithms for Highly Compressed Image
title_fullStr A Comparative Study on DeBlocking Algorithms for Highly Compressed Image
title_full_unstemmed A Comparative Study on DeBlocking Algorithms for Highly Compressed Image
title_sort comparative study on deblocking algorithms for highly compressed image
publishDate 2008
url http://ndltd.ncl.edu.tw/handle/95586097847859438681
work_keys_str_mv AT hsuehjunghung acomparativestudyondeblockingalgorithmsforhighlycompressedimage
AT hóngxuěróng acomparativestudyondeblockingalgorithmsforhighlycompressedimage
AT hsuehjunghung gāodùyāsuōyǐngxiàngqùfāngkuàixiàoyīngyǎnsuànfǎzhībǐjiàoyánjiū
AT hóngxuěróng gāodùyāsuōyǐngxiàngqùfāngkuàixiàoyīngyǎnsuànfǎzhībǐjiàoyánjiū
AT hsuehjunghung comparativestudyondeblockingalgorithmsforhighlycompressedimage
AT hóngxuěróng comparativestudyondeblockingalgorithmsforhighlycompressedimage
_version_ 1718134365038313472