Please use this identifier to cite or link to this item: http://rportal.lib.ntnu.edu.tw:80/handle/20.500.12235/95816
Title: 一種以鄰近資料機率作為適應性算術編碼之彩色影像壓縮演算法
A Lossless Color Image Compression Algorithm with Adaptive Arithmetic Coding Based on Adjacent Data Probability
Authors: 莊謙本
Chien-Pen Chuang
林佳婕
Chia-Chieh Lin
Keywords: 無損數據壓縮
算術編碼
鄰近資料機率
適應性算術編碼
lossless data compression
arithmetic coding
adjacent data probability
adaptive arithmetic coding
Issue Date: 2011
Abstract: 近年來影像壓縮技術不斷進步,尤其在有損數據壓縮,如JPEG、JPEG 2000都已經發展得相當成熟,且已廣泛的被使用。但壓縮技術在無損數據壓縮方面,礙於無損數據壓縮對於原檔案的資料,不能有任何遺失,頇完整保留,因此壓縮效果較無法明顯的提升。雖有許多無損數據的編碼被發展出來,例如使用熵編碼(Entropy Coding)的算術編碼(Arithmetic Coding)對雜亂資料進行編碼時,能保有良好的壓縮效果,但其無法對不同類型影像有相同的壓縮效果。因此本論文提出一種簡易且能達到泛用的演算法,希望對各類型的影像都有相近的壓縮效果。本演算法分為兩部分,首先以簡單的蛇行掃描(Snake Scan)將資料做相減,以去除像素間的相關性,再開始對資料編碼。接著以適應性算術編碼(Adaptive Arithmetic Coding)中機率模型的建置,不使用整張影像的資料,而是採用待編碼符號鄰近的資料來建立機率模型。以24張Kodak所提供的彩色影像作壓縮的實驗結果,發現本演算法的效率比原適應性算術編碼有效,因此本法具有進步性。
In the last decade, many advances have been made in the area of image compression. Especially on lost data compression, such as JPEG and JPEG 2000 have been developed quite mature and widely used. However, most lossless data compressions have low Compression Rate because it has to reserve all information. Many data codes had been proposed for lossless data compression. Such as Arithmetic Coding is using Entropy Coding to compress the clutter data with good efficiency. But it cannot compress all kinds of images with the same high Compression Rate. In this paper, we propose a simple lossless algorithm which can compress all types of images with the same high Compression Rate. The algorithm consists of two phases. First, it removes the correlation between pixels with Snake Scan to get residual of data. And then encode the residual of data with an Adaptive Arithmetic Coding. This Adaptive Arithmetic Coding only uses adjacent data to build the probability model. 24 color images provided by Kodak Company were used to test compression rate of this proposed algorithm. The results show the efficiency of this proposed algorithm is better than original Adaptive Arithmetic Coding method.
URI: http://etds.lib.ntnu.edu.tw/cgi-bin/gs32/gsweb.cgi?o=dstdcdr&s=%22http://etds.lib.ntnu.edu.tw/cgi-bin/gs32/gsweb.cgi?o=dstdcdr&s=id=%22GN0698750035%22.&%22.id.&
http://rportal.lib.ntnu.edu.tw:80/handle/20.500.12235/95816
Other Identifiers: GN0698750035
Appears in Collections:學位論文

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.