(Origin section: C/C
The file format in the compressed package: executable file
Attachment source: Internet
Operation mode: Windows mode
Is it verified by me: yes
Attachment nature: free
Detailed description: #includestdio.h
#includemath.h
#definePI3.1415926
#defineN8
voidyuanshi(inta)//Output initial data
{inti,j;
for(i=0;i
for(j=0;j
{
printf(
a);
if(j==7)
printf(\n);
}
}
voidDCT(intf,floatm)//DCT conversion subroutine
{
intx,y,i,j,l;
floatcoff,doff,D={0};
for(y=0;y//Calculate the coff of the first line
coff=(sqrt(2.0)/sqrt(N))
(sqrt(1.0)/sqrt(2.0));
for(x=1;x//Calculate the coff of the next N-1 lines
{
for(y=0;y
coff=(sqrt(2.0)/sqrt(N))
cos((2
(y 1)-1)
x
PI/(2
N));
}
printf(COFF:\n);//Output matrix coff
for(i=0;i
for(j=0;j
{printf(coff);
if(j==7)
printf(\n);}
for(x=0;x//Find the transposed matrix doff of coff
{
for(y=0;y
doff=coff;
}
for(i=0;i//Matrix doff and f matrix are multiplied, the result is matrix D
for(l=0;l
{D=0;
for(j=0;j
D=D doff
(1.0
f);
}
printf(\n);
for(i=0;i//Matrix D and matrix coff are multiplied, the result is matrix m, that is, the matrix obtained by DCT transformation//
for(l=0;l
{m=0;
for(j=0;j
m=m D
coff;
}
printf(output DCT matrix\n);
for(i=0;i//Output the result matrix m converted by DCT
{for(l=0;l
printf(m);
printf(\n);
}
}
voidsch(intte,floatm,intn)//quantization subroutine
{
intx,y;
inttr;
for(x=0;x
for(y=0;y
{
tr=(int)(m/te);
n=tr;
printf(
tr);
if(y==7)
printf(\n);
}
}
intbianma(intn,intc)//One-dimensional run-length encoding
{
intk,a,i,j,t=0,e=1,d=0,l;
for(i=0;i converts a two-dimensional encoded array into a one-dimensional array
for(j=0;j
k=n;
for(i=0;i calculates the encoded data and stores it in the array a
{l=i 1;
if(k==k)e ;
else{
a=e;
a=k;
e=1;
}
}
printf(encoded output:\n);
for(i=0;i outputs the encoded data
{printf(
a);
c=a;//Copy the value of the encoded array a to the array c
}
printf(\n);
returned;//return the length of the array c
}
voidmain()
{/
8
The 8-picture block data is as follows
/
floatm,b;
intY=128,i=0,j=0,s,number,n,c,data;
inta={{130,130,130,129,134,133,129,130},{130,130,130,129,134,133,130,130},{130,130,130,129,132,132,130,130},{129,130,130,129,130,130,129,129},{127,128,127,129,131,129,131,130},{127,128,127,128,127,128,132,132},{125,126,129,129,127,129,133,132},{127,125,128,128,126,130,131,131}};
intFy={{16,11,10,16,24,40,51,61},{12,12,14,19,26,58,60,55},{14,13,16,24,40, 57,69,56},{14,17,22,29,51,87,80,62},{18,22,37,56,68,109,103,77},{24,35,55,64,81,104,103, 77},{49,64,78,87,103,121,120,101},{72,92,95,98,112,100,103,99}};
printf(8
8 image block data:\n);//Output the data of the image data block of demand management
yuanshi(a);//Call the initial drawing module program
printf(Conversion coefficient matrix:\n);
DCT(a,m);//Call the DCT conversion function
printf(output quantized matrix:\n);
sch(Fy,m,n);//Call the quantization function
number=bianma(n,c);//Call the encoding function
printf(initial amount of data:\n);
printf(
n,s=8
64);//Output the initial amount of data
printf(Total amount of encoded data:\n);
data=number/2
3 number/2
8;
printf(
n,data);//Output the total amount of encoded data
printf(compression ratio:\n);
printf(%\n,data
1.0/s
100);//Output compression ratio
}
113223421412.doc)
发表于 2022-9-22 15:27:37
粤ICP备14042591号-1
粤ICP14042591号