1 |
/************************************************************************** |
/***************************************************************************** |
2 |
* |
* |
3 |
* XVID MPEG-4 VIDEO CODEC |
* XVID MPEG-4 VIDEO CODEC |
4 |
* sum of absolute difference |
* - Sum Of Absolute Difference related code - |
5 |
* |
* |
6 |
* This program is an implementation of a part of one or more MPEG-4 |
* Copyright(C) 2001-2003 Peter Ross <pross@xvid.org> |
|
* Video tools as specified in ISO/IEC 14496-2 standard. Those intending |
|
|
* to use this software module in hardware or software products are |
|
|
* advised that its use may infringe existing patents or copyrights, and |
|
|
* any such use would be at such party's own risk. The original |
|
|
* developer of this software module and his/her company, and subsequent |
|
|
* editors and their companies, will have no liability for use of this |
|
|
* software or modifications or derivatives thereof. |
|
7 |
* |
* |
8 |
* This program is free software; you can redistribute it and/or modify |
* This program is free software; you can redistribute it and/or modify |
9 |
* it under the terms of the GNU General Public License as published by |
* it under the terms of the GNU General Public License as published by |
17 |
* |
* |
18 |
* You should have received a copy of the GNU General Public License |
* You should have received a copy of the GNU General Public License |
19 |
* along with this program; if not, write to the Free Software |
* along with this program; if not, write to the Free Software |
20 |
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
21 |
* |
* |
22 |
*************************************************************************/ |
* $Id$ |
|
|
|
|
/************************************************************************** |
|
|
* |
|
|
* History: |
|
23 |
* |
* |
24 |
* 14.02.2002 added sad16bi_c() |
****************************************************************************/ |
|
* 10.11.2001 initial version; (c)2001 peter ross <pross@cs.rmit.edu.au> |
|
|
* |
|
|
*************************************************************************/ |
|
|
|
|
25 |
|
|
26 |
#include "../portab.h" |
#include "../portab.h" |
27 |
#include "../global.h" |
#include "../global.h" |
28 |
#include "sad.h" |
#include "sad.h" |
29 |
|
|
30 |
|
#include <stdlib.h> |
31 |
|
|
32 |
sad16FuncPtr sad16; |
sad16FuncPtr sad16; |
33 |
sad8FuncPtr sad8; |
sad8FuncPtr sad8; |
34 |
sad16biFuncPtr sad16bi; |
sad16biFuncPtr sad16bi; |
35 |
sad8biFuncPtr sad8bi; // not really sad16, but no difference in prototype |
sad8biFuncPtr sad8bi; /* not really sad16, but no difference in prototype */ |
36 |
dev16FuncPtr dev16; |
dev16FuncPtr dev16; |
37 |
sad16vFuncPtr sad16v; |
sad16vFuncPtr sad16v; |
38 |
|
sse8Func_16bitPtr sse8_16bit; |
39 |
|
sse8Func_8bitPtr sse8_8bit; |
40 |
|
|
41 |
sadInitFuncPtr sadInit; |
sadInitFuncPtr sadInit; |
42 |
|
|
54 |
uint8_t const *ptr_ref = ref; |
uint8_t const *ptr_ref = ref; |
55 |
|
|
56 |
for (j = 0; j < 16; j++) { |
for (j = 0; j < 16; j++) { |
57 |
sad += ABS(ptr_cur[0] - ptr_ref[0]); |
sad += abs(ptr_cur[0] - ptr_ref[0]); |
58 |
sad += ABS(ptr_cur[1] - ptr_ref[1]); |
sad += abs(ptr_cur[1] - ptr_ref[1]); |
59 |
sad += ABS(ptr_cur[2] - ptr_ref[2]); |
sad += abs(ptr_cur[2] - ptr_ref[2]); |
60 |
sad += ABS(ptr_cur[3] - ptr_ref[3]); |
sad += abs(ptr_cur[3] - ptr_ref[3]); |
61 |
sad += ABS(ptr_cur[4] - ptr_ref[4]); |
sad += abs(ptr_cur[4] - ptr_ref[4]); |
62 |
sad += ABS(ptr_cur[5] - ptr_ref[5]); |
sad += abs(ptr_cur[5] - ptr_ref[5]); |
63 |
sad += ABS(ptr_cur[6] - ptr_ref[6]); |
sad += abs(ptr_cur[6] - ptr_ref[6]); |
64 |
sad += ABS(ptr_cur[7] - ptr_ref[7]); |
sad += abs(ptr_cur[7] - ptr_ref[7]); |
65 |
sad += ABS(ptr_cur[8] - ptr_ref[8]); |
sad += abs(ptr_cur[8] - ptr_ref[8]); |
66 |
sad += ABS(ptr_cur[9] - ptr_ref[9]); |
sad += abs(ptr_cur[9] - ptr_ref[9]); |
67 |
sad += ABS(ptr_cur[10] - ptr_ref[10]); |
sad += abs(ptr_cur[10] - ptr_ref[10]); |
68 |
sad += ABS(ptr_cur[11] - ptr_ref[11]); |
sad += abs(ptr_cur[11] - ptr_ref[11]); |
69 |
sad += ABS(ptr_cur[12] - ptr_ref[12]); |
sad += abs(ptr_cur[12] - ptr_ref[12]); |
70 |
sad += ABS(ptr_cur[13] - ptr_ref[13]); |
sad += abs(ptr_cur[13] - ptr_ref[13]); |
71 |
sad += ABS(ptr_cur[14] - ptr_ref[14]); |
sad += abs(ptr_cur[14] - ptr_ref[14]); |
72 |
sad += ABS(ptr_cur[15] - ptr_ref[15]); |
sad += abs(ptr_cur[15] - ptr_ref[15]); |
73 |
|
|
74 |
if (sad >= best_sad) |
if (sad >= best_sad) |
75 |
return sad; |
return sad; |
100 |
|
|
101 |
for (i = 0; i < 16; i++) { |
for (i = 0; i < 16; i++) { |
102 |
int pixel = (ptr_ref1[i] + ptr_ref2[i] + 1) / 2; |
int pixel = (ptr_ref1[i] + ptr_ref2[i] + 1) / 2; |
103 |
|
sad += abs(ptr_cur[i] - pixel); |
|
if (pixel < 0) { |
|
|
pixel = 0; |
|
|
} else if (pixel > 255) { |
|
|
pixel = 255; |
|
|
} |
|
|
|
|
|
sad += ABS(ptr_cur[i] - pixel); |
|
104 |
} |
} |
105 |
|
|
106 |
ptr_cur += stride; |
ptr_cur += stride; |
130 |
|
|
131 |
for (i = 0; i < 8; i++) { |
for (i = 0; i < 8; i++) { |
132 |
int pixel = (ptr_ref1[i] + ptr_ref2[i] + 1) / 2; |
int pixel = (ptr_ref1[i] + ptr_ref2[i] + 1) / 2; |
133 |
|
sad += abs(ptr_cur[i] - pixel); |
|
if (pixel < 0) { |
|
|
pixel = 0; |
|
|
} else if (pixel > 255) { |
|
|
pixel = 255; |
|
|
} |
|
|
|
|
|
sad += ABS(ptr_cur[i] - pixel); |
|
134 |
} |
} |
135 |
|
|
136 |
ptr_cur += stride; |
ptr_cur += stride; |
157 |
|
|
158 |
for (j = 0; j < 8; j++) { |
for (j = 0; j < 8; j++) { |
159 |
|
|
160 |
sad += ABS(ptr_cur[0] - ptr_ref[0]); |
sad += abs(ptr_cur[0] - ptr_ref[0]); |
161 |
sad += ABS(ptr_cur[1] - ptr_ref[1]); |
sad += abs(ptr_cur[1] - ptr_ref[1]); |
162 |
sad += ABS(ptr_cur[2] - ptr_ref[2]); |
sad += abs(ptr_cur[2] - ptr_ref[2]); |
163 |
sad += ABS(ptr_cur[3] - ptr_ref[3]); |
sad += abs(ptr_cur[3] - ptr_ref[3]); |
164 |
sad += ABS(ptr_cur[4] - ptr_ref[4]); |
sad += abs(ptr_cur[4] - ptr_ref[4]); |
165 |
sad += ABS(ptr_cur[5] - ptr_ref[5]); |
sad += abs(ptr_cur[5] - ptr_ref[5]); |
166 |
sad += ABS(ptr_cur[6] - ptr_ref[6]); |
sad += abs(ptr_cur[6] - ptr_ref[6]); |
167 |
sad += ABS(ptr_cur[7] - ptr_ref[7]); |
sad += abs(ptr_cur[7] - ptr_ref[7]); |
168 |
|
|
169 |
ptr_cur += stride; |
ptr_cur += stride; |
170 |
ptr_ref += stride; |
ptr_ref += stride; |
202 |
for (j = 0; j < 16; j++) { |
for (j = 0; j < 16; j++) { |
203 |
|
|
204 |
for (i = 0; i < 16; i++) |
for (i = 0; i < 16; i++) |
205 |
dev += ABS(*(ptr_cur + i) - (int32_t) mean); |
dev += abs(*(ptr_cur + i) - (int32_t) mean); |
206 |
|
|
207 |
ptr_cur += stride; |
ptr_cur += stride; |
208 |
|
|
230 |
int32_t *sad) |
int32_t *sad) |
231 |
{ |
{ |
232 |
sad[0] = sad16(cur, ref, stride, 256*4096); |
sad[0] = sad16(cur, ref, stride, 256*4096); |
233 |
sad[1] = sad16(cur + 8, ref + 8, stride, 256*4096); |
sad[1] = sad16(cur + 16, ref + 16, stride, 256*4096); |
234 |
sad[2] = sad16(cur + 8*stride, ref + 8*stride, stride, 256*4096); |
sad[2] = sad16(cur + 16*stride, ref + 16*stride, stride, 256*4096); |
235 |
sad[3] = sad16(cur + 8*stride + 8, ref + 8*stride + 8, stride, 256*4096); |
sad[3] = sad16(cur + 16*stride + 16, ref + 16*stride + 16, stride, 256*4096); |
236 |
|
|
237 |
return sad[0]+sad[1]+sad[2]+sad[3]; |
return sad[0]+sad[1]+sad[2]+sad[3]; |
238 |
} |
} |
270 |
|
|
271 |
for (i = 0; i < 16; i++) { |
for (i = 0; i < 16; i++) { |
272 |
|
|
273 |
sad += ABS(*(ptr_cur + i) - *(ptr_ref + i) - mean); |
sad += abs(*(ptr_cur + i) - *(ptr_ref + i) - mean); |
274 |
if (sad >= best_sad) { |
if (sad >= best_sad) { |
275 |
return MRSAD16_CORRFACTOR * sad; |
return MRSAD16_CORRFACTOR * sad; |
276 |
} |
} |
278 |
} |
} |
279 |
|
|
280 |
return MRSAD16_CORRFACTOR * sad; |
return MRSAD16_CORRFACTOR * sad; |
281 |
|
} |
282 |
|
|
283 |
|
uint32_t |
284 |
|
sse8_16bit_c(const int16_t * b1, |
285 |
|
const int16_t * b2, |
286 |
|
const uint32_t stride) |
287 |
|
{ |
288 |
|
int i; |
289 |
|
int sse = 0; |
290 |
|
|
291 |
|
for (i=0; i<8; i++) { |
292 |
|
sse += (b1[0] - b2[0])*(b1[0] - b2[0]); |
293 |
|
sse += (b1[1] - b2[1])*(b1[1] - b2[1]); |
294 |
|
sse += (b1[2] - b2[2])*(b1[2] - b2[2]); |
295 |
|
sse += (b1[3] - b2[3])*(b1[3] - b2[3]); |
296 |
|
sse += (b1[4] - b2[4])*(b1[4] - b2[4]); |
297 |
|
sse += (b1[5] - b2[5])*(b1[5] - b2[5]); |
298 |
|
sse += (b1[6] - b2[6])*(b1[6] - b2[6]); |
299 |
|
sse += (b1[7] - b2[7])*(b1[7] - b2[7]); |
300 |
|
|
301 |
|
b1 = (const int16_t*)((int8_t*)b1+stride); |
302 |
|
b2 = (const int16_t*)((int8_t*)b2+stride); |
303 |
} |
} |
304 |
|
|
305 |
|
return(sse); |
306 |
|
} |
307 |
|
|
308 |
|
uint32_t |
309 |
|
sse8_8bit_c(const uint8_t * b1, |
310 |
|
const uint8_t * b2, |
311 |
|
const uint32_t stride) |
312 |
|
{ |
313 |
|
int i; |
314 |
|
int sse = 0; |
315 |
|
|
316 |
|
for (i=0; i<8; i++) { |
317 |
|
sse += (b1[0] - b2[0])*(b1[0] - b2[0]); |
318 |
|
sse += (b1[1] - b2[1])*(b1[1] - b2[1]); |
319 |
|
sse += (b1[2] - b2[2])*(b1[2] - b2[2]); |
320 |
|
sse += (b1[3] - b2[3])*(b1[3] - b2[3]); |
321 |
|
sse += (b1[4] - b2[4])*(b1[4] - b2[4]); |
322 |
|
sse += (b1[5] - b2[5])*(b1[5] - b2[5]); |
323 |
|
sse += (b1[6] - b2[6])*(b1[6] - b2[6]); |
324 |
|
sse += (b1[7] - b2[7])*(b1[7] - b2[7]); |
325 |
|
|
326 |
|
b1 = b1+stride; |
327 |
|
b2 = b2+stride; |
328 |
|
} |
329 |
|
|
330 |
|
return(sse); |
331 |
|
} |