1 |
/***************************************************************************** |
/****************************************************************************** |
2 |
* |
* * |
3 |
* XVID MPEG-4 VIDEO CODEC |
* This file is part of XviD, a free MPEG-4 video encoder/decoder * |
4 |
* - Prediction functions - |
* * |
5 |
* |
* XviD is an implementation of a part of one or more MPEG-4 Video tools * |
6 |
* Copyright(C) 2001-2002 - Michael Militzer <isibaar@xvid.org> |
* as specified in ISO/IEC 14496-2 standard. Those intending to use this * |
7 |
* Copyright(C) 2001-2002 - Peter Ross <pross@cs.rmit.edu.au> |
* software module in hardware or software products are advised that its * |
8 |
* |
* use may infringe existing patents or copyrights, and any such use * |
9 |
* This program is an implementation of a part of one or more MPEG-4 |
* would be at such party's own risk. The original developer of this * |
10 |
* Video tools as specified in ISO/IEC 14496-2 standard. Those intending |
* software module and his/her company, and subsequent editors and their * |
11 |
* to use this software module in hardware or software products are |
* companies, will have no liability for use of this software or * |
12 |
* advised that its use may infringe existing patents or copyrights, and |
* modifications or derivatives thereof. * |
13 |
* any such use would be at such party's own risk. The original |
* * |
14 |
* developer of this software module and his/her company, and subsequent |
* XviD is free software; you can redistribute it and/or modify it * |
15 |
* editors and their companies, will have no liability for use of this |
* under the terms of the GNU General Public License as published by * |
16 |
* software or modifications or derivatives thereof. |
* the Free Software Foundation; either version 2 of the License, or * |
17 |
* |
* (at your option) any later version. * |
18 |
* This program is free software; you can redistribute it and/or modify |
* * |
19 |
* it under the terms of the GNU General Public License as published by |
* XviD is distributed in the hope that it will be useful, but * |
20 |
* the Free Software Foundation; either version 2 of the License, or |
* WITHOUT ANY WARRANTY; without even the implied warranty of * |
21 |
* (at your option) any later version. |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * |
22 |
* |
* GNU General Public License for more details. * |
23 |
* This program is distributed in the hope that it will be useful, |
* * |
24 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
* You should have received a copy of the GNU General Public License * |
25 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
* along with this program; if not, write to the Free Software * |
26 |
* GNU General Public License for more details. |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * |
27 |
* |
* * |
28 |
* You should have received a copy of the GNU General Public License |
******************************************************************************/ |
29 |
* along with this program; if not, write to the Free Software |
|
30 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
/****************************************************************************** |
31 |
* |
* * |
32 |
* $Id: mbprediction.c,v 1.8 2002-09-07 13:43:00 edgomez Exp $ |
* mbprediction.c * |
33 |
* |
* * |
34 |
****************************************************************************/ |
* Copyright (C) 2001 - Michael Militzer <isibaar@xvid.org> * |
35 |
|
* Copyright (C) 2001 - Peter Ross <pross@cs.rmit.edu.au> * |
36 |
|
* * |
37 |
|
* For more information visit the XviD homepage: http://www.xvid.org * |
38 |
|
* * |
39 |
|
******************************************************************************/ |
40 |
|
|
41 |
|
/****************************************************************************** |
42 |
|
* * |
43 |
|
* Revision history: * |
44 |
|
* * |
45 |
|
* 29.06.2002 predict_acdc() bounding * |
46 |
|
* 12.12.2001 improved calc_acdc_prediction; removed need for memcpy * |
47 |
|
* 15.12.2001 moved pmv displacement to motion estimation * |
48 |
|
* 30.11.2001 mmx cbp support * |
49 |
|
* 17.11.2001 initial version * |
50 |
|
* * |
51 |
|
******************************************************************************/ |
52 |
|
|
53 |
|
#include "../global.h" |
54 |
#include "../encoder.h" |
#include "../encoder.h" |
55 |
#include "mbprediction.h" |
#include "mbprediction.h" |
56 |
#include "../utils/mbfunctions.h" |
#include "../utils/mbfunctions.h" |
57 |
#include "../bitstream/cbp.h" |
#include "../bitstream/cbp.h" |
58 |
|
#include "../bitstream/mbcoding.h" |
59 |
|
#include "../bitstream/zigzag.h" |
60 |
|
|
61 |
|
|
|
#define ABS(X) (((X)>0)?(X):-(X)) |
|
|
#define DIV_DIV(A,B) ( (A) > 0 ? ((A)+((B)>>1))/(B) : ((A)-((B)>>1))/(B) ) |
|
|
|
|
|
|
|
|
/***************************************************************************** |
|
|
* Local inlined function |
|
|
****************************************************************************/ |
|
|
|
|
62 |
static int __inline |
static int __inline |
63 |
rescale(int predict_quant, |
rescale(int predict_quant, |
64 |
int current_quant, |
int current_quant, |
69 |
} |
} |
70 |
|
|
71 |
|
|
|
/***************************************************************************** |
|
|
* Local data |
|
|
****************************************************************************/ |
|
|
|
|
72 |
static const int16_t default_acdc_values[15] = { |
static const int16_t default_acdc_values[15] = { |
73 |
1024, |
1024, |
74 |
0, 0, 0, 0, 0, 0, 0, |
0, 0, 0, 0, 0, 0, 0, |
76 |
}; |
}; |
77 |
|
|
78 |
|
|
|
/***************************************************************************** |
|
|
* Functions |
|
|
****************************************************************************/ |
|
|
|
|
|
|
|
79 |
/* get dc/ac prediction direction for a single block and place |
/* get dc/ac prediction direction for a single block and place |
80 |
predictor values into MB->pred_values[j][..] |
predictor values into MB->pred_values[j][..] |
81 |
*/ |
*/ |
283 |
|
|
284 |
/* encoder: subtract predictors from qcoeff[] and calculate S1/S2 |
/* encoder: subtract predictors from qcoeff[] and calculate S1/S2 |
285 |
|
|
286 |
todo: perform [-127,127] clamping after prediction |
returns sum of coeefficients *saved* if prediction is enabled |
|
clamping must adjust the coeffs, so dequant is done correctly |
|
287 |
|
|
|
S1/S2 are used to determine if its worth predicting for AC |
|
288 |
S1 = sum of all (qcoeff - prediction) |
S1 = sum of all (qcoeff - prediction) |
289 |
S2 = sum of all qcoeff |
S2 = sum of all qcoeff |
290 |
*/ |
*/ |
291 |
|
|
292 |
uint32_t |
int |
293 |
calc_acdc(MACROBLOCK * pMB, |
calc_acdc_coeff(MACROBLOCK * pMB, |
294 |
uint32_t block, |
uint32_t block, |
295 |
int16_t qcoeff[64], |
int16_t qcoeff[64], |
296 |
uint32_t iDcScaler, |
uint32_t iDcScaler, |
298 |
{ |
{ |
299 |
int16_t *pCurrent = pMB->pred_values[block]; |
int16_t *pCurrent = pMB->pred_values[block]; |
300 |
uint32_t i; |
uint32_t i; |
301 |
uint32_t S1 = 0, S2 = 0; |
int S1 = 0, S2 = 0; |
302 |
|
|
303 |
|
|
304 |
/* store current coeffs to pred_values[] for future prediction */ |
/* store current coeffs to pred_values[] for future prediction */ |
342 |
} |
} |
343 |
|
|
344 |
|
|
345 |
|
|
346 |
|
/* returns the bits *saved* if prediction is enabled */ |
347 |
|
|
348 |
|
int |
349 |
|
calc_acdc_bits(MACROBLOCK * pMB, |
350 |
|
uint32_t block, |
351 |
|
int16_t qcoeff[64], |
352 |
|
uint32_t iDcScaler, |
353 |
|
int16_t predictors[8]) |
354 |
|
{ |
355 |
|
const int direction = pMB->acpred_directions[block]; |
356 |
|
int16_t *pCurrent = pMB->pred_values[block]; |
357 |
|
int16_t tmp[8]; |
358 |
|
unsigned int i; |
359 |
|
int Z1, Z2; |
360 |
|
|
361 |
|
/* store current coeffs to pred_values[] for future prediction */ |
362 |
|
pCurrent[0] = qcoeff[0] * iDcScaler; |
363 |
|
for (i = 1; i < 8; i++) { |
364 |
|
pCurrent[i] = qcoeff[i]; |
365 |
|
pCurrent[i + 7] = qcoeff[i * 8]; |
366 |
|
} |
367 |
|
|
368 |
|
|
369 |
|
/* dc prediction */ |
370 |
|
qcoeff[0] = qcoeff[0] - predictors[0]; |
371 |
|
|
372 |
|
/* calc cost before ac prediction */ |
373 |
|
#ifdef BIGLUT |
374 |
|
Z2 = CodeCoeff_CalcBits(qcoeff, intra_table, scan_tables[0], 1); |
375 |
|
#else |
376 |
|
Z2 = CodeCoeffIntra_CalcBits(qcoeff, scan_tables[0]); |
377 |
|
#endif |
378 |
|
|
379 |
|
/* apply ac prediction & calc cost*/ |
380 |
|
if (direction == 1) { |
381 |
|
for (i = 1; i < 8; i++) { |
382 |
|
tmp[i] = qcoeff[i]; |
383 |
|
qcoeff[i] -= predictors[i]; |
384 |
|
predictors[i] = qcoeff[i]; |
385 |
|
} |
386 |
|
}else{ // acpred_direction == 2 |
387 |
|
for (i = 1; i < 8; i++) { |
388 |
|
tmp[i] = qcoeff[i*8]; |
389 |
|
qcoeff[i*8] -= predictors[i]; |
390 |
|
predictors[i] = qcoeff[i*8]; |
391 |
|
} |
392 |
|
} |
393 |
|
|
394 |
|
#ifdef BIGLUT |
395 |
|
Z1 = CodeCoeff_CalcBits(qcoeff, intra_table, scan_tables[direction], 1); |
396 |
|
#else |
397 |
|
Z1 = CodeCoeffIntra_CalcBits(qcoeff, scan_tables[direction]); |
398 |
|
#endif |
399 |
|
|
400 |
|
/* undo prediction */ |
401 |
|
if (direction == 1) { |
402 |
|
for (i = 1; i < 8; i++) |
403 |
|
qcoeff[i] = tmp[i]; |
404 |
|
}else{ // acpred_direction == 2 |
405 |
|
for (i = 1; i < 8; i++) |
406 |
|
qcoeff[i*8] = tmp[i]; |
407 |
|
} |
408 |
|
|
409 |
|
return Z2-Z1; |
410 |
|
} |
411 |
|
|
412 |
/* apply predictors[] to qcoeff */ |
/* apply predictors[] to qcoeff */ |
413 |
|
|
414 |
void |
void |
417 |
int16_t qcoeff[64], |
int16_t qcoeff[64], |
418 |
int16_t predictors[8]) |
int16_t predictors[8]) |
419 |
{ |
{ |
420 |
uint32_t i; |
unsigned int i; |
421 |
|
|
422 |
if (pMB->acpred_directions[block] == 1) { |
if (pMB->acpred_directions[block] == 1) { |
423 |
for (i = 1; i < 8; i++) { |
for (i = 1; i < 8; i++) |
424 |
qcoeff[i] = predictors[i]; |
qcoeff[i] = predictors[i]; |
|
} |
|
425 |
} else { |
} else { |
426 |
for (i = 1; i < 8; i++) { |
for (i = 1; i < 8; i++) |
427 |
qcoeff[i * 8] = predictors[i]; |
qcoeff[i * 8] = predictors[i]; |
428 |
} |
} |
429 |
} |
} |
|
} |
|
430 |
|
|
431 |
|
|
432 |
void |
void |
439 |
|
|
440 |
int32_t j; |
int32_t j; |
441 |
int32_t iDcScaler, iQuant = frame->quant; |
int32_t iDcScaler, iQuant = frame->quant; |
442 |
int32_t S = 0; |
int S = 0; |
443 |
int16_t predictors[6][8]; |
int16_t predictors[6][8]; |
444 |
|
|
445 |
MACROBLOCK *pMB = &frame->mbs[x + y * mb_width]; |
MACROBLOCK *pMB = &frame->mbs[x + y * mb_width]; |
447 |
if ((pMB->mode == MODE_INTRA) || (pMB->mode == MODE_INTRA_Q)) { |
if ((pMB->mode == MODE_INTRA) || (pMB->mode == MODE_INTRA_Q)) { |
448 |
|
|
449 |
for (j = 0; j < 6; j++) { |
for (j = 0; j < 6; j++) { |
450 |
iDcScaler = get_dc_scaler(iQuant, (j < 4) ? 1 : 0); |
iDcScaler = get_dc_scaler(iQuant, j<4); |
451 |
|
|
452 |
predict_acdc(frame->mbs, x, y, mb_width, j, &qcoeff[j * 64], |
predict_acdc(frame->mbs, x, y, mb_width, j, &qcoeff[j * 64], |
453 |
iQuant, iDcScaler, predictors[j], 0); |
iQuant, iDcScaler, predictors[j], 0); |
454 |
|
|
455 |
S += calc_acdc(pMB, j, &qcoeff[j * 64], iDcScaler, predictors[j]); |
if ((frame->global_flags & XVID_HQACPRED)) |
456 |
|
S += calc_acdc_bits(pMB, j, &qcoeff[j * 64], iDcScaler, predictors[j]); |
457 |
|
else |
458 |
|
S += calc_acdc_coeff(pMB, j, &qcoeff[j * 64], iDcScaler, predictors[j]); |
459 |
|
|
460 |
} |
} |
461 |
|
|
462 |
if (S < 0) // dont predict |
if (S<=0) { // dont predict |
463 |
{ |
for (j = 0; j < 6; j++) |
|
for (j = 0; j < 6; j++) { |
|
464 |
pMB->acpred_directions[j] = 0; |
pMB->acpred_directions[j] = 0; |
|
} |
|
465 |
} else { |
} else { |
466 |
for (j = 0; j < 6; j++) { |
for (j = 0; j < 6; j++) |
467 |
apply_acdc(pMB, j, &qcoeff[j * 64], predictors[j]); |
apply_acdc(pMB, j, &qcoeff[j * 64], predictors[j]); |
468 |
} |
} |
469 |
} |
|
470 |
pMB->cbp = calc_cbp(qcoeff); |
pMB->cbp = calc_cbp(qcoeff); |
471 |
} |
} |
472 |
|
|