《Huffman编码(哈夫曼编码)的Matlab实现.doc》由会员分享，可在线阅读，更多相关《Huffman编码(哈夫曼编码)的Matlab实现.doc（4页珍藏版）》请在taowenge.com淘文阁网|工程机械CAD图纸|机械工程制图|CAD装配图下载|SolidWorks_CaTia_CAD_UG_PROE_设计图分享下载上搜索。
1、clear allfprintf(Reading data.)data=imread(cameraman.tif);data=uint8(data);%读入数据，并将数据限制为uint8fprintf(Done!n)%编码压缩fprintf(compressing data.);zipped,info=norm2huff(data);fprintf(Done!n)%解压缩fprintf(compressing data.);unzipped=huff2norm(zipped,info);fprintf(Done!n)%测试是否无失真isOK=isequal(data(:),unzipped(:
2、)%显示压缩效果whos data zipped unzipped function zipped,info=norm2huff(vector)ifisa(vector,uint8), error(input argument must be a uint8 vector)endvector=vector(:);%将输入向量转换为行向量f=frequency(vector);%计算个元素出现的概率simbols=find(f=0);f=f(simbols);%将元素按出现的概率排列f,sortindex=sot(f);simbols=simbols(sortindex);%产生码字 gener
3、ate the codeword as the 52 bits of a doublelen=length(simbols);simbols_index=num2cell(1:len);codeword_tmp=cell(len,1);while length(f)1, index1=simbols_index1; index2=simbols_index2; codeword_tmp(index1)=addnode(codeword_tmp(index1),uint8(0); codeword_tmp(index2)=addnode(codeword_tmp(index2),uint8(1)
4、; f=sum(f(1:2) f(3:end); simbols_index=index1 index2 simbols_index(3:end); %将数据重新排列，是两个节点的频率尽量与前一个节点的频率想当 resort data in order to have two nodes with lower frequency as first to f,sortindex=sort(f); simbols_index=simbols_index(sortindex);end%对应相应的元素与码字codeword=cell(256:1);codeword(simbols)=codeword_
5、tmp;%计算总的字符串长度len=0;for index=1:length(vector), len=len+length(codeworddouble(vector(index)+1);end%产生01序列string=repmat(uint8(0),1,len);pointer=1;for index=1:length(vector), code=codeworddouble(vector(index)+1; len=length(code); string(pointer+(0:len-1)=code; pointer=pointer+len;end%如果需要，加零len=length
6、(string);pad=8-mod(len,8);if pad0, string=string uint8(zeros(1,pad);end%保存实际有用的码字codeword=codeword(simbols);codelen=zeros(size(codeword);weights=2.(0:23);maxcodelen=0;for index 1:length(codeword), len=length(codewordindex); if lenmaxcodelen, maxcodelen=len; end if len0, code=sum(weights(codewordinde
7、x=1); code=bitset(code,len+1); codewordindex=code; codelen(index)=len; endendcodeword=codeword:%计算压缩后的向量cols=length(string)/8;string=reshape(string,8,cols);weights=2.(0:7);zipped=uint8(weights*double(string);%存储一个稀疏矩阵huffcodes=sparse(1,1);% init sparse matrixfor index=1:numel(codeword), huffcodes(co
8、deword(index),1)=simbols(index);end%产生信息结构体info.pad=pad;info.ratio=cols./length(vector);info.length=length(vector);info.maxcodelen=maxcodelen; function codeword_new=addnode(codeword_old,item)codeword_new=cell(size(codeword_old);for index=1:length(codeword_old), codeword_newindex=item codeword_oldind
9、ex;end function vector=huff2norm(zipped,info)%HUFF2NORM Huffman 解码器%HUFF2NORM(X,INFO)根据信息体结构 info 返回向量 zipped 的解码结果%矩阵参数以X(:)形式输入ifisa(zipped,uint8), error(input argument must be a uint8 vector)end%产生01序列len=length(zipped);string=repmat(uint8(0),1,len.*8);bitindex=1:8;for index+1:len, string(bitinde
10、x+8.*(index-1)=uint8(bitget(zipped(index),bitindex);end%调整字符串string=logical(string(:);% remove 0 paddinglen=length(string);%解码weights=2.(0:51);vector=repmat(uint8(0),1,info,length);vectorindex=1;codeindex=1;code=0;for index=1:len, code=bitset(code,codeindex,string(index); codeindex=codeindex+1; byte
11、=decode(bitset(code,codeindex),info); if byte0,% vector(vectorindex)=byte-1; codeindex=1; code=0; vectorindex=vectorindex+1; endend function byte=decode(code,info)byte=info.huffcodes(code); function f=frequency(vector)%FREQUENCY 计算元素出现概率ifisa(vector,uint8), error(input argument must be a uint8 vecto
12、r)endf=repmat(0,1,256);%扫描向量len=length(vector);for index=0:256,% f(index+1)=sum(vector=uint8(index);end%归一化f=f./len;4 一 ) = ( + (,:= ) 向),( ) , 概出素 = ) ( + 00 = - ( ,0 ) , + ;) ( = 00 = ) ,( ( ):.= 解) ( %)( 符字 ) , ( ) ( + )* ,0 = ) 序 ( ) , 输形( 果码的 向 体据 ,( 码 ) ) _ _ ( ) ) / . .构息 ) , ( ) ( = ) = 矩个) ( ) ) , 向的: ) = )+ )= = 0 ) ) : 0 ) ( ) ( ( ) 码的实 ) ( = 0 ), -) ( 加要 = = : ( ) ( ) ( ) ( : ) ,0 ( 序0 ) ) = ) 0=长串的 ): 码与应 ) )( , 想频的前与率个，新据% : ): ( ) ( =) ( ) ( _ = ) = ):( ) ( 码) )( 排概现素; ()0 概的元) 向为转向) = ) , ( = 效效)( ( 失无 ) ( = ). 压! )( ). 压 为数，入; ( =) . ( .