yading@11
|
1 /*
|
yading@11
|
2 * Copyright (c) 2003-2013 Loren Merritt
|
yading@11
|
3 *
|
yading@11
|
4 * This program is free software; you can redistribute it and/or modify
|
yading@11
|
5 * it under the terms of the GNU General Public License as published by
|
yading@11
|
6 * the Free Software Foundation; either version 2 of the License, or
|
yading@11
|
7 * (at your option) any later version.
|
yading@11
|
8 *
|
yading@11
|
9 * This program is distributed in the hope that it will be useful,
|
yading@11
|
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
yading@11
|
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
yading@11
|
12 * GNU General Public License for more details.
|
yading@11
|
13 *
|
yading@11
|
14 * You should have received a copy of the GNU General Public License
|
yading@11
|
15 * along with this program; if not, write to the Free Software
|
yading@11
|
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110 USA
|
yading@11
|
17 */
|
yading@11
|
18 /*
|
yading@11
|
19 * tiny_ssim.c
|
yading@11
|
20 * Computes the Structural Similarity Metric between two rawYV12 video files.
|
yading@11
|
21 * original algorithm:
|
yading@11
|
22 * Z. Wang, A. C. Bovik, H. R. Sheikh and E. P. Simoncelli,
|
yading@11
|
23 * "Image quality assessment: From error visibility to structural similarity,"
|
yading@11
|
24 * IEEE Transactions on Image Processing, vol. 13, no. 4, pp. 600-612, Apr. 2004.
|
yading@11
|
25 *
|
yading@11
|
26 * To improve speed, this implementation uses the standard approximation of
|
yading@11
|
27 * overlapped 8x8 block sums, rather than the original gaussian weights.
|
yading@11
|
28 */
|
yading@11
|
29
|
yading@11
|
30 #include <inttypes.h>
|
yading@11
|
31 #include <math.h>
|
yading@11
|
32 #include <stdio.h>
|
yading@11
|
33 #include <stdlib.h>
|
yading@11
|
34
|
yading@11
|
35 #define FFSWAP(type,a,b) do{type SWAP_tmp= b; b= a; a= SWAP_tmp;}while(0)
|
yading@11
|
36 #define FFMIN(a,b) ((a) > (b) ? (b) : (a))
|
yading@11
|
37
|
yading@11
|
38 #define BIT_DEPTH 8
|
yading@11
|
39 #define PIXEL_MAX ((1 << BIT_DEPTH)-1)
|
yading@11
|
40 typedef uint8_t pixel;
|
yading@11
|
41
|
yading@11
|
42 /****************************************************************************
|
yading@11
|
43 * structural similarity metric
|
yading@11
|
44 ****************************************************************************/
|
yading@11
|
45 static void ssim_4x4x2_core( const pixel *pix1, intptr_t stride1,
|
yading@11
|
46 const pixel *pix2, intptr_t stride2,
|
yading@11
|
47 int sums[2][4] )
|
yading@11
|
48 {
|
yading@11
|
49 int x,y,z;
|
yading@11
|
50
|
yading@11
|
51 for( z = 0; z < 2; z++ )
|
yading@11
|
52 {
|
yading@11
|
53 uint32_t s1 = 0, s2 = 0, ss = 0, s12 = 0;
|
yading@11
|
54 for( y = 0; y < 4; y++ )
|
yading@11
|
55 for( x = 0; x < 4; x++ )
|
yading@11
|
56 {
|
yading@11
|
57 int a = pix1[x+y*stride1];
|
yading@11
|
58 int b = pix2[x+y*stride2];
|
yading@11
|
59 s1 += a;
|
yading@11
|
60 s2 += b;
|
yading@11
|
61 ss += a*a;
|
yading@11
|
62 ss += b*b;
|
yading@11
|
63 s12 += a*b;
|
yading@11
|
64 }
|
yading@11
|
65 sums[z][0] = s1;
|
yading@11
|
66 sums[z][1] = s2;
|
yading@11
|
67 sums[z][2] = ss;
|
yading@11
|
68 sums[z][3] = s12;
|
yading@11
|
69 pix1 += 4;
|
yading@11
|
70 pix2 += 4;
|
yading@11
|
71 }
|
yading@11
|
72 }
|
yading@11
|
73
|
yading@11
|
74 static float ssim_end1( int s1, int s2, int ss, int s12 )
|
yading@11
|
75 {
|
yading@11
|
76 /* Maximum value for 10-bit is: ss*64 = (2^10-1)^2*16*4*64 = 4286582784, which will overflow in some cases.
|
yading@11
|
77 * s1*s1, s2*s2, and s1*s2 also obtain this value for edge cases: ((2^10-1)*16*4)^2 = 4286582784.
|
yading@11
|
78 * Maximum value for 9-bit is: ss*64 = (2^9-1)^2*16*4*64 = 1069551616, which will not overflow. */
|
yading@11
|
79 #if BIT_DEPTH > 9
|
yading@11
|
80 #define type float
|
yading@11
|
81 static const float ssim_c1 = .01*.01*PIXEL_MAX*PIXEL_MAX*64;
|
yading@11
|
82 static const float ssim_c2 = .03*.03*PIXEL_MAX*PIXEL_MAX*64*63;
|
yading@11
|
83 #else
|
yading@11
|
84 #define type int
|
yading@11
|
85 static const int ssim_c1 = (int)(.01*.01*PIXEL_MAX*PIXEL_MAX*64 + .5);
|
yading@11
|
86 static const int ssim_c2 = (int)(.03*.03*PIXEL_MAX*PIXEL_MAX*64*63 + .5);
|
yading@11
|
87 #endif
|
yading@11
|
88 type fs1 = s1;
|
yading@11
|
89 type fs2 = s2;
|
yading@11
|
90 type fss = ss;
|
yading@11
|
91 type fs12 = s12;
|
yading@11
|
92 type vars = fss*64 - fs1*fs1 - fs2*fs2;
|
yading@11
|
93 type covar = fs12*64 - fs1*fs2;
|
yading@11
|
94 return (float)(2*fs1*fs2 + ssim_c1) * (float)(2*covar + ssim_c2)
|
yading@11
|
95 / ((float)(fs1*fs1 + fs2*fs2 + ssim_c1) * (float)(vars + ssim_c2));
|
yading@11
|
96 #undef type
|
yading@11
|
97 }
|
yading@11
|
98
|
yading@11
|
99 static float ssim_end4( int sum0[5][4], int sum1[5][4], int width )
|
yading@11
|
100 {
|
yading@11
|
101 float ssim = 0.0;
|
yading@11
|
102 int i;
|
yading@11
|
103
|
yading@11
|
104 for( i = 0; i < width; i++ )
|
yading@11
|
105 ssim += ssim_end1( sum0[i][0] + sum0[i+1][0] + sum1[i][0] + sum1[i+1][0],
|
yading@11
|
106 sum0[i][1] + sum0[i+1][1] + sum1[i][1] + sum1[i+1][1],
|
yading@11
|
107 sum0[i][2] + sum0[i+1][2] + sum1[i][2] + sum1[i+1][2],
|
yading@11
|
108 sum0[i][3] + sum0[i+1][3] + sum1[i][3] + sum1[i+1][3] );
|
yading@11
|
109 return ssim;
|
yading@11
|
110 }
|
yading@11
|
111
|
yading@11
|
112 float ssim_plane(
|
yading@11
|
113 pixel *pix1, intptr_t stride1,
|
yading@11
|
114 pixel *pix2, intptr_t stride2,
|
yading@11
|
115 int width, int height, void *buf, int *cnt )
|
yading@11
|
116 {
|
yading@11
|
117 int z = 0;
|
yading@11
|
118 int x, y;
|
yading@11
|
119 float ssim = 0.0;
|
yading@11
|
120 int (*sum0)[4] = buf;
|
yading@11
|
121 int (*sum1)[4] = sum0 + (width >> 2) + 3;
|
yading@11
|
122 width >>= 2;
|
yading@11
|
123 height >>= 2;
|
yading@11
|
124 for( y = 1; y < height; y++ )
|
yading@11
|
125 {
|
yading@11
|
126 for( ; z <= y; z++ )
|
yading@11
|
127 {
|
yading@11
|
128 FFSWAP( void*, sum0, sum1 );
|
yading@11
|
129 for( x = 0; x < width; x+=2 )
|
yading@11
|
130 ssim_4x4x2_core( &pix1[4*(x+z*stride1)], stride1, &pix2[4*(x+z*stride2)], stride2, &sum0[x] );
|
yading@11
|
131 }
|
yading@11
|
132 for( x = 0; x < width-1; x += 4 )
|
yading@11
|
133 ssim += ssim_end4( sum0+x, sum1+x, FFMIN(4,width-x-1) );
|
yading@11
|
134 }
|
yading@11
|
135 // *cnt = (height-1) * (width-1);
|
yading@11
|
136 return ssim / ((height-1) * (width-1));
|
yading@11
|
137 }
|
yading@11
|
138
|
yading@11
|
139
|
yading@11
|
140 uint64_t ssd_plane( const uint8_t *pix1, const uint8_t *pix2, int size )
|
yading@11
|
141 {
|
yading@11
|
142 uint64_t ssd = 0;
|
yading@11
|
143 int i;
|
yading@11
|
144 for( i=0; i<size; i++ )
|
yading@11
|
145 {
|
yading@11
|
146 int d = pix1[i] - pix2[i];
|
yading@11
|
147 ssd += d*d;
|
yading@11
|
148 }
|
yading@11
|
149 return ssd;
|
yading@11
|
150 }
|
yading@11
|
151
|
yading@11
|
152 double ssd_to_psnr( uint64_t ssd, uint64_t denom )
|
yading@11
|
153 {
|
yading@11
|
154 return -10*log((double)ssd/(denom*255*255))/log(10);
|
yading@11
|
155 }
|
yading@11
|
156
|
yading@11
|
157 int main(int argc, char* argv[])
|
yading@11
|
158 {
|
yading@11
|
159 FILE *f[2];
|
yading@11
|
160 uint8_t *buf[2], *plane[2][3];
|
yading@11
|
161 int *temp;
|
yading@11
|
162 uint64_t ssd[3] = {0,0,0};
|
yading@11
|
163 double ssim[3] = {0,0,0};
|
yading@11
|
164 int frame_size, w, h;
|
yading@11
|
165 int frames, seek;
|
yading@11
|
166 int i;
|
yading@11
|
167
|
yading@11
|
168 if( argc<4 || 2 != sscanf(argv[3], "%dx%d", &w, &h) )
|
yading@11
|
169 {
|
yading@11
|
170 printf("tiny_ssim <file1.yuv> <file2.yuv> <width>x<height> [<seek>]\n");
|
yading@11
|
171 return -1;
|
yading@11
|
172 }
|
yading@11
|
173
|
yading@11
|
174 f[0] = fopen(argv[1], "rb");
|
yading@11
|
175 f[1] = fopen(argv[2], "rb");
|
yading@11
|
176 sscanf(argv[3], "%dx%d", &w, &h);
|
yading@11
|
177 frame_size = w*h*3/2;
|
yading@11
|
178 for( i=0; i<2; i++ )
|
yading@11
|
179 {
|
yading@11
|
180 buf[i] = malloc(frame_size);
|
yading@11
|
181 plane[i][0] = buf[i];
|
yading@11
|
182 plane[i][1] = plane[i][0] + w*h;
|
yading@11
|
183 plane[i][2] = plane[i][1] + w*h/4;
|
yading@11
|
184 }
|
yading@11
|
185 temp = malloc((2*w+12)*sizeof(*temp));
|
yading@11
|
186 seek = argc<5 ? 0 : atoi(argv[4]);
|
yading@11
|
187 fseek(f[seek<0], seek < 0 ? -seek : seek, SEEK_SET);
|
yading@11
|
188
|
yading@11
|
189 for( frames=0;; frames++ )
|
yading@11
|
190 {
|
yading@11
|
191 if( fread(buf[0], frame_size, 1, f[0]) != 1) break;
|
yading@11
|
192 if( fread(buf[1], frame_size, 1, f[1]) != 1) break;
|
yading@11
|
193 for( i=0; i<3; i++ )
|
yading@11
|
194 {
|
yading@11
|
195 ssd[i] += ssd_plane ( plane[0][i], plane[1][i], w*h>>2*!!i );
|
yading@11
|
196 ssim[i] += ssim_plane( plane[0][i], w>>!!i,
|
yading@11
|
197 plane[1][i], w>>!!i,
|
yading@11
|
198 w>>!!i, h>>!!i, temp, NULL );
|
yading@11
|
199 }
|
yading@11
|
200 }
|
yading@11
|
201
|
yading@11
|
202 if( !frames ) return 0;
|
yading@11
|
203
|
yading@11
|
204 printf( "PSNR Y:%.3f U:%.3f V:%.3f All:%.3f\n",
|
yading@11
|
205 ssd_to_psnr( ssd[0], (uint64_t)frames*w*h ),
|
yading@11
|
206 ssd_to_psnr( ssd[1], (uint64_t)frames*w*h/4 ),
|
yading@11
|
207 ssd_to_psnr( ssd[2], (uint64_t)frames*w*h/4 ),
|
yading@11
|
208 ssd_to_psnr( ssd[0] + ssd[1] + ssd[2], (uint64_t)frames*w*h*3/2 ) );
|
yading@11
|
209 printf( "SSIM Y:%.5f U:%.5f V:%.5f All:%.5f\n",
|
yading@11
|
210 ssim[0] / frames,
|
yading@11
|
211 ssim[1] / frames,
|
yading@11
|
212 ssim[2] / frames,
|
yading@11
|
213 (ssim[0]*4 + ssim[1] + ssim[2]) / (frames*6) );
|
yading@11
|
214
|
yading@11
|
215 return 0;
|
yading@11
|
216 }
|