├── count.m
├── reverse.m
├── bin_to_dec.m
├── dec_to_bin.m
├── row_col.m
├── quantise.m
├── JPEG.m
├── encode.m
├── insert_to_array.m
├── decode.m
├── zig_zag.m
├── discrete_cosine.m
├── R_Z.m
├── discrete_cosine_transform.m
├── check_coeff.m
└── huffman.m


/count.m:
--------------------------------------------------------------------------------
 1 | function [ s ] = count(x)
 2 | %UNTITLED2 Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | s=0;
 5 | while(x>0)
 6 |     s=s+1;
 7 |     x=floor(x/10);
 8 | end
 9 | end
10 | 
11 | 


--------------------------------------------------------------------------------
/reverse.m:
--------------------------------------------------------------------------------
 1 | function [ s ] = count(x)
 2 | %UNTITLED2 Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | s=0;
 5 | while(x>0)
 6 |     s=s+1;
 7 |     x=floor(x/10);
 8 | end
 9 | end
10 | 
11 | 


--------------------------------------------------------------------------------
/bin_to_dec.m:
--------------------------------------------------------------------------------
 1 | function [ dec ] = bin_to_dec( bin )
 2 | %UNTITLED2 Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | dec=0;i=0;
 5 | while(bin>0)
 6 |     r=mod(bin,10);
 7 |     dec=dec+r*2^i;
 8 |     bin=floor(bin/10);
 9 |     i=i+1;
10 | end
11 | end
12 | 
13 | 


--------------------------------------------------------------------------------
/dec_to_bin.m:
--------------------------------------------------------------------------------
 1 | function [ s ] = dec_to_bin(k)
 2 | %UNTITLED2 Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | i=0;
 5 | s=0;
 6 | if(k>=1)
 7 |     while(k>=1)
 8 |         j=10^i;
 9 |         r=mod(k,2);
10 |         k=floor(k/2);
11 |         s=(r*j)+s;
12 |         i=i+1;
13 |     end
14 |     
15 | elseif (k==0)
16 |     s=0;
17 | end
18 | end
19 | 
20 | 


--------------------------------------------------------------------------------
/row_col.m:
--------------------------------------------------------------------------------
 1 | function [ R,C ] = row_col( value )
 2 | %UNTITLED Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | 
 5 | R=0;
 6 | for i=-11:1:11
 7 |     k=2^i;
 8 |     if (k==abs(value))
 9 |         R=i+1;
10 |         break;
11 |     elseif (k>abs(value) && abs(value)>0)
12 |         R=i;
13 |         break;
14 |     end
15 | end
16 | C=0;
17 | if (value>0)
18 |     C=((2^R)-1)-((2^(R-1))-1)+(value-((2^(R-1))-1));
19 | elseif (value<0)
20 |     C=((2^R)-1)-abs(value)+1;
21 | else
22 |     C=1;
23 | end
24 | C=C-1;
25 | end
26 | 
27 | 


--------------------------------------------------------------------------------
/quantise.m:
--------------------------------------------------------------------------------
 1 | function [ J ] = quantise( J,t,Ia,Ib )
 2 | %UNTITLED4 Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | Q=[16 11 10 16 24 40 51 61;
 5 |    12 12 14 19 26 58 60 55;
 6 |    14 13 16 24 40 57 69 56;
 7 |    14 17 22 29 51 87 80 62;
 8 |    18 22 37 56 68 109 103 77;
 9 |    24 35 55 64 81 104 113 92;
10 |    49 64 78 87 103 121 120 101;
11 |    72 92 95 98 112 100 103 99];
12 | %---quantise--%
13 | if(t==1)
14 |     for i=1:8:Ia
15 |         for j=1:8:Ib
16 |             J(i:i+7,j:j+7)=J(i:i+7,j:j+7)./Q;
17 |         end
18 |     end
19 |     J=round(J);
20 | %--dequantise--%    
21 | else
22 |     for i=1:8:Ia
23 |         for j=1:8:Ib
24 |             J(i:i+7,j:j+7)=J(i:i+7,j:j+7).*Q;
25 |         end
26 |     end
27 | end
28 | end


--------------------------------------------------------------------------------
/JPEG.m:
--------------------------------------------------------------------------------
 1 | I=imread('passport_jaishree.jpg'); %initial image
 2 | T = I;  %backup of image
 3 | I=rgb2gray(I);
 4 | I=double(I);
 5 | [size1,size2]=size(I);
 6 | if(mod(size1,8)==0)
 7 |     Ia=size1-8;
 8 | else
 9 |     Ia=size1-(8+mod(size1,8));
10 | end
11 | if(mod(size2,8)==0)
12 |     Ib=size2-8;
13 | else
14 |     Ib=size2-(8+mod(size2,8));
15 | end
16 | 
17 | D_C=discrete_cosine(I,1,Ia,Ib);
18 | Q=quantise(D_C,1,Ia,Ib);
19 | Z=zig_zag(Q,1,Ia,Ib);
20 |     
21 | A2=[];
22 | P2=[];
23 | 
24 | disp('This loop will run till the iteration value reaches')
25 | disp(Ia*Ib/64);
26 | 
27 | for i=1:1:Ia*Ib/64
28 |     a=length(A2);
29 |     A2=encode(Z(i,:),A2);
30 |     P2=decode(A2,P2,a+1,i);
31 |     disp(i);
32 | end
33 | 
34 | J=zig_zag(P2,2,Ia,Ib);
35 | J=quantise(J,2,Ia,Ib);
36 | I2=discrete_cosine(J,2,Ia,Ib);
37 | I2=uint8(I2);
38 | I=uint8(I); %final image on decoding


--------------------------------------------------------------------------------
/encode.m:
--------------------------------------------------------------------------------
 1 | function [ A2 ] = encode(zig_zag,A2  )
 2 | %UNTITLED Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | [R,C]=row_col(zig_zag(1));
 5 | k=0;
 6 | for i=1:1:R
 7 |     k=k+2^i;
 8 | end
 9 | 
10 | D1=dec_to_bin(k);
11 | D2=dec_to_bin(C);
12 | A2=insert_to_array(A2,D1,-1,1);
13 | A2=insert_to_array(A2,D2,R,1);
14 | zeroes=0;
15 | for i=2:1:length(zig_zag)
16 |     if zig_zag(i)==0
17 |         zeroes=zeroes+1;
18 |     else
19 |         [R,C]=row_col(zig_zag(i));
20 |         if(zeroes<16)
21 |             A2=insert_to_array(A2,R_Z(R,zeroes),-1,2);
22 |             A2=insert_to_array(A2,dec_to_bin(C),R,2);
23 |         else
24 |             for l=1:1:floor(zeroes/15)
25 |                 A2=insert_to_array(A2,11111111001,-1,2);
26 |             end
27 |             zeroes=zeroes-(floor(zeroes/15)*15);
28 |             A2=insert_to_array(A2,R_Z(R,zeroes),-1,2);
29 |             A2=insert_to_array(A2,dec_to_bin(C),R,2);
30 |         end
31 |         zeroes=0;
32 |     end
33 | end
34 | if zeroes~=0
35 |     A2=insert_to_array(A2,1010,-1,2);
36 | end
37 | 
38 | end


--------------------------------------------------------------------------------
/insert_to_array.m:
--------------------------------------------------------------------------------
 1 | function [ A ] = insert_to_array( A,s,r,t)
 2 | %UNTITLED3 Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | len=length(A);
 5 | if(t==1)  %--dc coeff encode
 6 |     if(r==-1)
 7 |         
 8 |         if(s==0)
 9 |             A(len+1)=0;
10 |         else
11 |             len=len+count(s);
12 |         end
13 |     else
14 |         if(r>0)
15 |             if(s==0)
16 |                 A(len+r)=0;
17 |             else
18 |                 len=len+r;
19 |             end
20 |         else
21 |             A(len+1)=0;
22 |         end
23 |     end
24 | end
25 | if(t==2)  %--ac coeff encode
26 |     if(r==-1)
27 |         if(s==0)
28 |             A(len+2)=0;
29 |         elseif(s==1)
30 |             A(len+1)=0;
31 |             len=length(A)+count(s);
32 |         else
33 |             len=len+count(s);
34 |         end
35 |     else
36 |         if(s==0)
37 |             A(len+r)=0;
38 |         else
39 |             len=len+r;
40 |         end
41 |     end
42 | end
43 | while(s>0)
44 |    A(len)=mod(s,10);
45 |    s=floor(s/10);
46 |    len=len-1;
47 | end
48 | end
49 | 
50 | 
51 | 


--------------------------------------------------------------------------------
/decode.m:
--------------------------------------------------------------------------------
 1 | function [ P2,m ] = decode( P,P2,m,p2 )
 2 | %UNTITLED Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | 
 5 | len=length(P);
 6 | cunt=0;
 7 | for j=m:len
 8 |     [row_no,zeroes]=check_coeff(P(m:j),0);
 9 |     if row_no~=-1
10 |         col_no=0;k=0;
11 |         temp=P(j+1:j+row_no);
12 |         for i=length(temp):-1:1
13 |             col_no=col_no+temp(i)*2^k;
14 |             k=k+1;
15 |         end
16 |         if(col_no<abs((2^row_no)-1)-abs((2^(row_no-1))-1))
17 |             P2(p2,cunt+1)=-((2^row_no)-1)+col_no;
18 |             cunt=cunt+1;
19 |         elseif(row_no==0 && col_no==0)
20 |             j=j+1;
21 |             P2(p2,cunt+1)=0;
22 |             cunt=cunt+1;
23 |         else
24 |             P2(p2,cunt+1)=((2^(row_no-1))-1)+col_no-(abs((2^row_no)-1)-abs((2^(row_no-1))-1))+1;
25 |             cunt=cunt+1;
26 |         end
27 |         break;
28 |     end
29 | end
30 | 
31 | i=j+1+row_no;
32 | 
33 | for j=i:1:len
34 |     [row_no,zeroes]=check_coeff(P(i:j),1);
35 |     if row_no~=-1
36 |         if((j-i)==10 & P(i:j)==[1,1,1,1,1,1,1,1,0,0,1])
37 |             P2(p2,cunt+15)=0;
38 |             cunt=cunt+15;
39 |             i=j+1;
40 |         else
41 |             col_no=0;k=0;
42 |             temp=P(j+1:j+row_no);
43 |             for i=length(temp):-1:1
44 |                 col_no=col_no+temp(i)*2^k;
45 |                 k=k+1;
46 |             end
47 |             if(zeroes>0)
48 |                 P2(p2,cunt+zeroes)=0;
49 |             end
50 |             cunt=cunt+zeroes;
51 |             if(col_no<abs((2^row_no)-1)-abs((2^(row_no-1))-1))
52 |                 P2(p2,cunt+1)=-((2^row_no)-1)+col_no;
53 |                 cunt=cunt+1;
54 |             else
55 |                 P2(p2,cunt+1)=((2^(row_no-1))-1)+col_no-(abs((2^row_no)-1)-abs((2^(row_no-1))));
56 |                 cunt=cunt+1;
57 |             end
58 |             i=j+1+row_no;
59 |         end
60 |     elseif ((j-i)==10 & P(i:j)==[1,1,1,1,1,1,1,1,0,0,1])
61 |         P2(p2,cunt+15)=0;
62 |         cunt=cunt+15;
63 |         i=j+1;
64 |     elseif ((j-i)==3 & P(i:j)==[1,0,1,0])
65 |         P2(p2,64)=0;
66 |         m=j+1;
67 |     end 
68 | end
69 | 
70 | end


--------------------------------------------------------------------------------
/zig_zag.m:
--------------------------------------------------------------------------------
 1 | function [ Z ] = zig_zag( z,t,Ia,Ib )
 2 | %UNTITLED2 Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | 
 5 | if(t==1)
 6 |     %--subtract subsequent DC coeff with the first DC coeff of image--%
 7 |     %--tranform blocks into zig_zag fashion--%  
 8 |     for i=1:8:Ia
 9 |         for j=1:8:Ib
10 |             if(i==1 && j==1)
11 |                 continue;
12 |             end
13 |             z(i,j)=z(i,j)-z(1,1);
14 |         end
15 |     end
16 |     Z=zeros(Ia*Ib/64,64);
17 |     x=0;
18 |     for i=1:8:Ia
19 |         for j=1:8:Ib
20 |             x=x+1;
21 |             A=z(i:i+7,j:j+7);
22 |             Z(x,:)=[A(1,1),A(1,2),A(2,1),A(3,1),A(2,2),A(1,3),A(1,4),A(2,3),A(3,2),A(4,1),A(5,1),A(4,2),A(3,3),A(2,4),A(1,5),A(1,6),A(2,5),A(3,4),A(4,3),A(5,2),A(6,1),A(7,1),A(6,2),A(5,3),A(4,4),A(3,5),A(2,6),A(1,7),A(1,8),A(2,7),A(3,6),A(4,5),A(5,4),A(6,3),A(7,2),A(8,1),A(8,2),A(7,3),A(6,4),A(5,5),A(4,6),A(3,7),A(2,8),A(3,8),A(4,7),A(5,6),A(6,5),A(7,4),A(8,3),A(8,4),A(7,5),A(6,6),A(5,7),A(4,8),A(5,8),A(6,7),A(7,6),A(8,5),A(8,6),A(7,7),A(6,8),A(7,8),A(8,7),A(8,8)];
23 |         end
24 |     end
25 | %--do reverse of the above--%
26 | else
27 |     k=1;
28 |     Z=zeros(Ia,Ib);
29 |     for i=1:8:Ia
30 |         for j=1:8:Ib
31 |             P2=z(k,:);
32 |             P=[P2(1),P2(2),P2(6),P2(7),P2(15),P2(16),P2(28),P2(29);
33 |                P2(3),P2(5),P2(8),P2(14),P2(17),P2(27),P2(30),P2(43);
34 |                P2(4),P2(9),P2(13),P2(18),P2(26),P2(31),P2(42),P2(44);
35 |                P2(10),P2(12),P2(19),P2(25),P2(32),P2(41),P2(45),P2(54);
36 |                P2(11),P2(20),P2(24),P2(33),P2(40),P2(46),P2(53),P2(55);
37 |                P2(21),P2(23),P2(34),P2(39),P2(47),P2(52),P2(56),P2(61);
38 |                P2(22),P2(35),P2(38),P2(48),P2(51),P2(57),P2(60),P2(62);
39 |                P2(36),P2(37),P2(49),P2(50),P2(58),P2(59),P2(63),P2(64)];
40 |             Z(i:i+7,j:j+7)=P;
41 |             k=k+1;
42 |         end
43 |     end
44 |     for i=1:8:Ia
45 |         for j=1:8:Ib
46 |             if(i==1 && j==1)
47 |                 continue;
48 |             end
49 |             Z(i,j)=Z(i,j)+Z(1,1);
50 |         end
51 |     end
52 | end
53 | 
54 | end


--------------------------------------------------------------------------------
/discrete_cosine.m:
--------------------------------------------------------------------------------
 1 | function [ J ] = discrete_cosine( I,t,Ia,Ib )
 2 | %UNTITLED3 Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | 
 5 | if(t==1)
 6 |     %--compute discrete cosine transform of the image--%
 7 |     J=zeros(Ia,Ib);
 8 |     for k=1:8:Ia    
 9 |         for l=1:8:Ib
10 |             z=1;
11 |             for i=k:1:k+7
12 |                 c=1;
13 |                 for j=l:1:l+7
14 |                     v=1;
15 |                     for x=k:1:k+7
16 |                         b=1; 
17 |                         for y=l:1:l+7                       
18 |                             J(i,j)=J(i,j)+I(x,y)*cos((2*(b-1)+1)*(c-1)*pi/16)*cos((2*(v-1)+1)*(z-1)*pi/16);
19 |                             b=b+1;
20 |                         end
21 |                         v=v+1;
22 |                     end               
23 |                     if ((z-1)==0)
24 |                         Ci=1/sqrt(2);
25 |                     else
26 |                         Ci=1;
27 |                     end
28 |                     if ((c-1)==0) 
29 |                         Cj=1/sqrt(2);
30 |                     else
31 |                         Cj=1;
32 |                     end
33 |                     J(i,j)=J(i,j)*Ci*Cj/4;
34 |                     c=c+1;
35 |                 end
36 |                 z=z+1;               
37 |             end        
38 |         end    
39 |     end
40 | %--reverse the discrete cosine transform made--%
41 | else
42 |     J=zeros(Ia,Ib);
43 |     for k=1:8:Ia
44 |         for l=1:8:Ib
45 |             z=1;
46 |             for i=k:1:k+7
47 |                 c=1;
48 |                 for j=l:1:l+7
49 |                     v=1;
50 |                     for x=k:1:k+7
51 |                         b=1;
52 |                         for y=l:1:l+7 
53 |                             if ((v-1)==0)
54 |                                 Ci=1/sqrt(2);
55 |                             else
56 |                                 Ci=1;
57 |                             end
58 |                             if ((b-1)==0)
59 |                                 Cj=1/sqrt(2);
60 |                             else
61 |                                 Cj=1;
62 |                             end
63 |                             J(i,j)=J(i,j)+I(x,y)*Ci*Cj*cos((2*(c-1)+1)*(b-1)*pi/16)*cos((2*(z-1)+1)*(v-1)*pi/16);
64 |                             b=b+1;
65 |                         end
66 |                         v=v+1;
67 |                     end        
68 |                     J(i,j)=J(i,j)/4;
69 |                     c=c+1;
70 |                 end
71 |                 z=z+1;
72 |             end
73 |         end
74 |     end
75 | end
76 |     
77 | end


--------------------------------------------------------------------------------
/R_Z.m:
--------------------------------------------------------------------------------
 1 | function [ k ] = R_Z( X,Y )
 2 | %UNTITLED Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | AC_coeff=[00,01,100,1011,11010,1111000,11111000,1111110110,1111111110000010,1111111110000011;
 5 |     1100,11011,1111001,111110110,11111110110,1111111110000100,1111111110000101,1111111110000110,1111111110000111,1111111110001000;
 6 |     11100,11111001,1111110111,111111110100,1111111110001001,1111111110001010,1111111110001011,1111111110001100,1111111110001101,1111111110001110;
 7 |     111010,111110111,111111110101,1111111110001111,1111111110010000,1111111110010001,1111111110010010,1111111110010011,1111111110010100,1111111110010101;
 8 |     111011,1111111000,1111111110010110,1111111110010111,1111111110011000,1111111110011001,1111111110011010,1111111110011011,1111111110011100,1111111110011101;
 9 |     1111010,11111110111,1111111110011110,1111111110011111,1111111110100000,1111111110100001,1111111110100010,1111111110100011,1111111110100100,1111111110100101;
10 |     1111011,111111110110,1111111110100110,1111111110100111,1111111110101000,1111111110101001,1111111110101010,1111111110101011,1111111110101100,1111111110101101;
11 |     11111010,111111110111,1111111110101110,1111111110101111,1111111110110000,1111111110110001,1111111110110010,1111111110110011,1111111110110100,1111111110110101;
12 |     111111000,111111111000000,1111111110110110,1111111110110111,1111111110111000,1111111110111001,1111111110111010,1111111110111011,1111111110111100,1111111110111101;
13 |     111111001,1111111110111110,1111111110111111,1111111111000000,1111111111000001,1111111111000010,1111111111000011,1111111111000100,1111111111000101,1111111111000110;
14 |     111111010,1111111111000111,1111111111001000,1111111111001001,1111111111001010,1111111111001011,1111111111001100,1111111111001101,1111111111001110,1111111111001111;
15 |     1111111001,1111111111010000,1111111111010001,1111111111010010,1111111111010011,1111111111010100,1111111111010101,1111111111010110,1111111111010111,1111111111011000;
16 |     1111111010,1111111111011001,1111111111011010,1111111111011011,1111111111011100,1111111111011101,1111111111011110,1111111111011111,1111111111100000,1111111111100001;
17 |     11111111000,1111111111100010,1111111111100011,1111111111100100,1111111111100101,1111111111100110,1111111111100111,1111111111101000,1111111111101001,1111111111101010;
18 |     1111111111101011,1111111111101100,1111111111101101,1111111111101110,1111111111101111,1111111111110000,1111111111110001,1111111111110010,1111111111110011,1111111111110100;
19 |     1111111111110101,1111111111110110,1111111111110111,1111111111111000,1111111111111001,1111111111111010,1111111111111011,1111111111111100,1111111111111101,1111111111111110];
20 | 
21 | k=AC_coeff(Y+1,X);
22 | 
23 | end
24 | 
25 | 


--------------------------------------------------------------------------------
/discrete_cosine_transform.m:
--------------------------------------------------------------------------------
  1 | I=imread('C:\Users\Jaishree\Pictures\Robomanipal.jpg');
  2 | I=rgb2gray(I);
  3 | I=double(I);
  4 | J=zeros(375,384);
  5 | C=I;
  6 | for k=1:8:368    
  7 |     for l=1:8:384
  8 |         z=1;
  9 |         for i=k:1:k+7
 10 |             c=1;
 11 |             for j=l:1:l+7
 12 |                v=1;
 13 |                for x=k:1:k+7
 14 |                    b=1; 
 15 |                    for y=l:1:l+7                       
 16 |                        J(i,j)=J(i,j)+I(x,y)*cos((2*(b-1)+1)*(c-1)*pi/16)*cos((2*(v-1)+1)*(z-1)*pi/16);
 17 |                        b=b+1;
 18 |                    end
 19 |                    v=v+1;
 20 |                end               
 21 |                if ((z-1)==0)
 22 |                    Ci=1/sqrt(2);
 23 |                else
 24 |                    Ci=1;
 25 |                end
 26 |                if ((c-1)==0) 
 27 |                    Cj=1/sqrt(2);
 28 |                else
 29 |                    Cj=1;
 30 |                end
 31 |                J(i,j)=J(i,j)*Ci*Cj/4;
 32 |                c=c+1;
 33 |             end
 34 |                z=z+1;               
 35 |         end        
 36 |     end    
 37 | end
 38 | CC=J;
 39 | Q=[16 11 10 16 24 40 51 61;
 40 |    12 12 14 19 26 58 60 55;
 41 |    14 13 16 24 40 57 69 56;
 42 |    14 17 22 29 51 87 80 62;
 43 |    18 22 37 56 68 109 103 77;
 44 |    24 35 55 64 81 104 113 92;
 45 |    49 64 78 87 103 121 120 101;
 46 |    72 92 95 98 112 100 103 99];
 47 | 
 48 | for i=1:8:368
 49 |     for j=1:8:384
 50 |         J(i:i+7,j:j+7)=J(i:i+7,j:j+7)./Q;
 51 |     end
 52 | end
 53 | J=round(J);
 54 | 
 55 | AB=J;
 56 | count=0;
 57 | for i=1:368
 58 |     for j=1:384
 59 |         if J(i,j)==0
 60 |             count=count+1;
 61 |         end
 62 |     end
 63 | end
 64 | for i=1:8:368
 65 |     for j=1:8:384
 66 |         J(i:i+7,j:j+7)=J(i:i+7,j:j+7).*Q;
 67 |     end
 68 | end
 69 | I2=zeros(375,384);
 70 | for k=1:8:368
 71 |     for l=1:8:384
 72 |         z=1;
 73 |         for i=k:1:k+7
 74 |             c=1;
 75 |             for j=l:1:l+7
 76 |                 v=1;
 77 |                 for x=k:1:k+7
 78 |                     b=1;
 79 |                     for y=l:1:l+7 
 80 |                         if ((v-1)==0)
 81 |                             Ci=1/sqrt(2);
 82 |                         else
 83 |                             Ci=1;
 84 |                         end
 85 |                         if ((b-1)==0)
 86 |                            Cj=1/sqrt(2);
 87 |                         else
 88 |                            Cj=1;
 89 |                         end
 90 |                         I2(i,j)=I2(i,j)+J(x,y)*Ci*Cj*cos((2*(c-1)+1)*(b-1)*pi/16)*cos((2*(z-1)+1)*(v-1)*pi/16);
 91 |                         b=b+1;
 92 |                     end
 93 |                     v=v+1;
 94 |                 end        
 95 |                 I2(i,j)=I2(i,j)/4;
 96 |                 c=c+1;
 97 |             end
 98 |             z=z+1;
 99 |         end
100 |     end
101 | end
102 | I=uint8(I);
103 | I2=uint8(I2);


--------------------------------------------------------------------------------
/check_coeff.m:
--------------------------------------------------------------------------------
 1 | function [ row_no,zeroes ] = check_coeff( a,t)
 2 | %UNTITLED2 Summary of this function goes here
 3 | %   Detailed explanation goes here
 4 | AC_coeff=[00,01,100,1011,11010,1111000,11111000,1111110110,1111111110000010,1111111110000011;
 5 |     1100,11011,1111001,111110110,11111110110,1111111110000100,1111111110000101,1111111110000110,1111111110000111,1111111110001000;
 6 |     11100,11111001,1111110111,111111110100,1111111110001001,1111111110001010,1111111110001011,1111111110001100,1111111110001101,1111111110001110;
 7 |     111010,111110111,111111110101,1111111110001111,1111111110010000,1111111110010001,1111111110010010,1111111110010011,1111111110010100,1111111110010101;
 8 |     111011,1111111000,1111111110010110,1111111110010111,1111111110011000,1111111110011001,1111111110011010,1111111110011011,1111111110011100,1111111110011101;
 9 |     1111010,11111110111,1111111110011110,1111111110011111,1111111110100000,1111111110100001,1111111110100010,1111111110100011,1111111110100100,1111111110100101;
10 |     1111011,111111110110,1111111110100110,1111111110100111,1111111110101000,1111111110101001,1111111110101010,1111111110101011,1111111110101100,1111111110101101;
11 |     11111010,111111110111,1111111110101110,1111111110101111,1111111110110000,1111111110110001,1111111110110010,1111111110110011,1111111110110100,1111111110110101;
12 |     111111000,111111111000000,1111111110110110,1111111110110111,1111111110111000,1111111110111001,1111111110111010,1111111110111011,1111111110111100,1111111110111101;
13 |     111111001,1111111110111110,1111111110111111,1111111111000000,1111111111000001,1111111111000010,1111111111000011,1111111111000100,1111111111000101,1111111111000110;
14 |     111111010,1111111111000111,1111111111001000,1111111111001001,1111111111001010,1111111111001011,1111111111001100,1111111111001101,1111111111001110,1111111111001111;
15 |     1111111001,1111111111010000,1111111111010001,1111111111010010,1111111111010011,1111111111010100,1111111111010101,1111111111010110,1111111111010111,1111111111011000;
16 |     1111111010,1111111111011001,1111111111011010,1111111111011011,1111111111011100,1111111111011101,1111111111011110,1111111111011111,1111111111100000,1111111111100001;
17 |     11111111000,1111111111100010,1111111111100011,1111111111100100,1111111111100101,1111111111100110,1111111111100111,1111111111101000,1111111111101001,1111111111101010;
18 |     1111111111101011,1111111111101100,1111111111101101,1111111111101110,1111111111101111,1111111111110000,1111111111110001,1111111111110010,1111111111110011,1111111111110100;
19 |     1111111111110101,1111111111110110,1111111111110111,1111111111111000,1111111111111001,1111111111111010,1111111111111011,1111111111111100,1111111111111101,1111111111111110];
20 | 
21 | DC_coeff=[0,2,6,14,30,62,126,254,510,1022,2046,4094,8190,16382,32766,65534,131070];
22 | s=0;j=0;
23 | for i=length(a):-1:1
24 |     s=s+a(i)*2^j;
25 |     j=j+1;
26 | end
27 | 
28 | zeroes=-1;
29 | if (t==0)
30 |     for i=1:1:length(DC_coeff)
31 |         if (DC_coeff(i)==s)
32 |             row_no=i-1;
33 |             break;
34 |         else
35 |             row_no=-1;
36 |         end
37 |     end
38 | end
39 | if (t==1)
40 |     for i=1:16
41 |         for j=1:10
42 |             A=[];
43 |             A=insert_to_array(A,AC_coeff(i,j),-1,2);
44 |             if((length(A)==length(a)) & (A==a))
45 |                 row_no=j;
46 |                 zeroes=i-1;
47 |                 break;
48 |             else
49 |                 row_no=-1;
50 |             end
51 |         end
52 |         if row_no~=-1
53 |             break;
54 |         end
55 |     end
56 | end
57 | end
58 | 
59 | 


--------------------------------------------------------------------------------
/huffman.m:
--------------------------------------------------------------------------------
  1 | A=[3 0 0 0 0 0 0 -5;
  2 |    0 10 0 0 0 0 0 0;
  3 |    0 0 0 0 0 0 0 0;
  4 |    0 0 0 -1 0 0 0 0;
  5 |    0 0 0 0 0 0 0 0;
  6 |    0 0 0 0 0 0 0 0;
  7 |    0 0 0 0 8 0 0 0;
  8 |    0 0 0 0 0 0 0 0];
  9 | zig_zag=[A(1,1),A(1,2),A(2,1),A(3,1),A(2,2),A(1,3),A(1,4),A(2,3),A(3,2),A(4,1),A(5,1),A(4,2),A(3,3),A(2,4),A(1,5),A(1,6),A(2,5),A(3,4),A(4,3),A(5,2),A(6,1),A(7,1),A(6,2),A(5,3),A(4,4),A(3,5),A(2,6),A(1,7),A(1,8),A(2,7),A(3,6),A(4,5),A(5,4),A(6,3),A(7,2),A(8,1),A(8,2),A(7,3),A(6,4),A(5,5),A(4,6),A(3,7),A(2,8),A(3,8),A(4,7),A(5,6),A(6,5),A(7,4),A(8,3),A(8,4),A(7,5),A(6,6),A(5,7),A(4,8),A(5,8),A(6,7),A(7,6),A(8,5),A(8,6),A(7,7),A(6,8),A(7,8),A(8,7),A(8,8)];
 10 | %zig_zag=Z(363,:);
 11 | %zig_zag2=[P2(1),P2(2),P2(6),P2(7),P2(15),P2(16),P2(28),P2(29);
 12 |  %         P2(3),P2(5),P2(8),P2(14),P2(17),P2(27),P2(30),P2(43);
 13 |   %        P2(4),P2(9),P2(13),P2(18),P2(26),P2(31),P2(42),P2(44);
 14 |    %       P2(10),P2(12),P2(19),P2(25),P2(32),P2(41),P2(45),P2(54);
 15 |     %      P2(11),P2(20),P2(24),P2(33),P2(40),P2(46),P2(53),P2(55);
 16 |      %     P2(21),P2(23),P2(34),P2(39),P2(47),P2(52),P2(56),P2(61);
 17 |       %    P2(22),P2(35),P2(38),P2(48),P2(51),P2(57),P2(60),P2(62);
 18 |        %   P2(36),P2(37),P2(49),P2(50),P2(58),P2(59),P2(63),P2(64)];
 19 | [R,C]=row_col(zig_zag(1));
 20 | k=0;
 21 | for i=1:1:R
 22 |     k=k+2^i;
 23 | end
 24 | A2=[];
 25 | D1=dec_to_bin(k);
 26 | D2=dec_to_bin(C);
 27 | A2=insert_to_array(A2,D1,-1,1);
 28 | %disp(A2);
 29 | A2=insert_to_array(A2,D2,R,1);
 30 | %disp(A2);
 31 | zeroes=0;
 32 | for i=2:1:length(zig_zag)
 33 |     if zig_zag(i)==0
 34 |         zeroes=zeroes+1;
 35 |     else
 36 |         [R,C]=row_col(zig_zag(i));
 37 |         if(zeroes<16)
 38 |             A2=insert_to_array(A2,R_Z(R,zeroes),-1,2);
 39 |             A2=insert_to_array(A2,dec_to_bin(C),R,2);
 40 |         else
 41 |             for l=1:1:floor(zeroes/15)
 42 |                 A2=insert_to_array(A2,11111111001,-1,2);
 43 |             end
 44 |             zeroes=zeroes-(floor(zeroes/15)*15);
 45 |            % disp(zeroes);
 46 |             A2=insert_to_array(A2,R_Z(R,zeroes),-1,2);
 47 |            % disp(A2);
 48 |             A2=insert_to_array(A2,dec_to_bin(C),R,2);
 49 |         end
 50 |         zeroes=0;
 51 |     end
 52 | end
 53 | %disp(A2);
 54 | if zeroes~=0
 55 |     
 56 |     A2=insert_to_array(A2,1010,-1,2);
 57 | end
 58 | 
 59 | 
 60 | %---decoding--%
 61 | 
 62 | 
 63 | P=[1     1     1     1     1     1     0     1     0     1     0     0     0     1     0     1     0];
 64 | P=A2;
 65 | P2=[];
 66 | for j=1:length(P)
 67 |     [row_no,zeroes]=check_coeff(P(1:j),0);
 68 |     if row_no~=-1
 69 |        % disp(row_no);
 70 |         col_no=0;k=0;
 71 |         temp=P(j+1:j+row_no);
 72 |        % disp(temp);
 73 |         for i=length(temp):-1:1
 74 |             col_no=col_no+temp(i)*2^k;
 75 |             k=k+1;
 76 |         end
 77 |         %disp(col_no);
 78 |         if(col_no<abs((2^row_no)-1)-abs((2^(row_no-1))-1))
 79 |             P2(length(P2)+1)=-((2^row_no)-1)+col_no;
 80 |             
 81 |         elseif(row_no==0 && col_no==0)
 82 |             j=j+1;
 83 |             P2(length(P2)+1)=0;
 84 |         else
 85 |             P2(length(P2)+1)=((2^(row_no-1))-1)+col_no-(abs((2^row_no)-1)-abs((2^(row_no-1))-1))+1;
 86 |         end
 87 |         break;
 88 |     end
 89 | end   
 90 | %disp(P2);
 91 | i=j+1+row_no;
 92 | 
 93 | %K=P(j+1+row:length(P));
 94 | n=1;
 95 | for j=i:1:length(P)
 96 |     [row_no,zeroes]=check_coeff(P(i:j),1);
 97 |     disp([P(i:j),i,j]);
 98 |     if row_no~=-1
 99 |         if((j-i)==10 & P(i:j)==[1,1,1,1,1,1,1,1,0,0,1])
100 |             for l=1:15
101 |                 P2(length(P2)+1)=0;
102 |             end
103 |             i=j+1;
104 |         else
105 |             col_no=0;k=0;
106 |             %disp([i,j]);
107 |             temp=P(j+1:j+row_no);
108 |             for i=length(temp):-1:1
109 |                 col_no=col_no+temp(i)*2^k;
110 |                 k=k+1;
111 |             end
112 |             for z=1:zeroes
113 |                 P2(length(P2)+1)=0;
114 |             end
115 |             if(col_no<abs((2^row_no)-1)-abs((2^(row_no-1))-1))
116 |                 P2(length(P2)+1)=-((2^row_no)-1)+col_no;
117 |             else
118 |                 P2(length(P2)+1)=((2^(row_no-1))-1)+col_no-(abs((2^row_no)-1)-abs((2^(row_no-1))));
119 |             end
120 |         
121 |             i=j+1+row_no;
122 |             %j=j+1+row_no;
123 |             disp('ya');
124 |         end
125 |     elseif ((j-i)==10 & P(i:j)==[1,1,1,1,1,1,1,1,0,0,1])
126 |         P2(length(P2)+15)=0;
127 |         
128 |         i=j+1;
129 |         
130 |         
131 |     elseif ((j-i)==3 & P(i:j)==[1,0,1,0])
132 |         for l=1:64-length(P2)
133 |             P2(length(P2)+1)=0;
134 |         end
135 |         i=j;    
136 |           
137 |     end 
138 | end
139 | 
140 |     


--------------------------------------------------------------------------------