20 |
* along with this program ; if not, write to the Free Software |
* along with this program ; if not, write to the Free Software |
21 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
22 |
* |
* |
23 |
* $Id: estimation_rd_based.c,v 1.1.2.6 2003-10-03 16:57:55 edgomez Exp $ |
* $Id: estimation_rd_based.c,v 1.1.2.9 2003-11-13 23:11:24 edgomez Exp $ |
24 |
* |
* |
25 |
****************************************************************************/ |
****************************************************************************/ |
26 |
|
|
40 |
#include "motion.h" |
#include "motion.h" |
41 |
#include "sad.h" |
#include "sad.h" |
42 |
#include "../bitstream/zigzag.h" |
#include "../bitstream/zigzag.h" |
43 |
#include "../quant/quant_mpeg4.h" |
#include "../quant/quant.h" |
|
#include "../quant/quant_h263.h" |
|
44 |
#include "../bitstream/vlc_codes.h" |
#include "../bitstream/vlc_codes.h" |
45 |
#include "../dct/fdct.h" |
#include "../dct/fdct.h" |
46 |
#include "motion_inlines.h" |
#include "motion_inlines.h" |
60 |
int sum; |
int sum; |
61 |
int bits; |
int bits; |
62 |
int distortion = 0; |
int distortion = 0; |
|
int i; |
|
63 |
|
|
64 |
fdct(data); |
fdct(data); |
65 |
|
|
66 |
if (quant_type) sum = quant_inter(coeff, data, quant); |
if (quant_type) sum = quant_h263_inter(coeff, data, quant); |
67 |
else sum = quant4_inter(coeff, data, quant); |
else sum = quant_mpeg_inter(coeff, data, quant); |
68 |
|
|
69 |
if (sum > 0) { |
if (sum > 0) { |
70 |
*cbp |= 1 << (5 - block); |
*cbp |= 1 << (5 - block); |
71 |
bits = BITS_MULT * CodeCoeffInter_CalcBits(coeff, scan_table); |
bits = BITS_MULT * CodeCoeffInter_CalcBits(coeff, scan_table); |
72 |
|
|
73 |
if (quant_type) dequant_inter(dqcoeff, coeff, quant); |
if (quant_type) dequant_h263_inter(dqcoeff, coeff, quant); |
74 |
else dequant4_inter(dqcoeff, coeff, quant); |
else dequant_mpeg_inter(dqcoeff, coeff, quant); |
|
|
|
|
for (i = 0; i < 64; i++) |
|
|
distortion += (data[i] - dqcoeff[i])*(data[i] - dqcoeff[i]); |
|
75 |
|
|
76 |
|
distortion = sse8_16bit(data, dqcoeff, 8*sizeof(int16_t)); |
77 |
} else { |
} else { |
78 |
|
const static int16_t zero_block[64] = |
79 |
|
{ |
80 |
|
0, 0, 0, 0, 0, 0, 0, 0, |
81 |
|
0, 0, 0, 0, 0, 0, 0, 0, |
82 |
|
0, 0, 0, 0, 0, 0, 0, 0, |
83 |
|
0, 0, 0, 0, 0, 0, 0, 0, |
84 |
|
0, 0, 0, 0, 0, 0, 0, 0, |
85 |
|
0, 0, 0, 0, 0, 0, 0, 0, |
86 |
|
0, 0, 0, 0, 0, 0, 0, 0, |
87 |
|
0, 0, 0, 0, 0, 0, 0, 0, |
88 |
|
}; |
89 |
bits = 0; |
bits = 0; |
90 |
for (i = 0; i < 64; i++) |
distortion = sse8_16bit(data, zero_block, 8*sizeof(int16_t)); |
|
distortion += data[i]*data[i]; |
|
91 |
} |
} |
92 |
|
|
93 |
|
|
94 |
return bits + (LAMBDA*distortion)/(quant*quant); |
return bits + (LAMBDA*distortion)/(quant*quant); |
95 |
} |
} |
96 |
|
|
97 |
static __inline unsigned int |
static __inline unsigned int |
98 |
Block_CalcBitsIntra(int16_t * const coeff, |
Block_CalcBitsIntra(MACROBLOCK * pMB, |
99 |
int16_t * const data, |
const unsigned int x, |
100 |
int16_t * const dqcoeff, |
const unsigned int y, |
101 |
const uint32_t quant, const int quant_type, |
const unsigned int mb_width, |
102 |
uint32_t * cbp, |
const uint32_t block, |
103 |
const int block, |
int16_t coeff[64], |
104 |
int * dcpred, |
int16_t qcoeff[64], |
105 |
const uint16_t * scan_table) |
int16_t dqcoeff[64], |
106 |
{ |
int16_t predictors[8], |
107 |
int bits, i; |
const uint32_t quant, |
108 |
int distortion = 0; |
const int quant_type, |
109 |
uint32_t iDcScaler = get_dc_scaler(quant, block < 4); |
unsigned int bits[2], |
110 |
int b_dc; |
unsigned int cbp[2]) |
111 |
|
{ |
112 |
|
int direction; |
113 |
|
int16_t *pCurrent; |
114 |
|
unsigned int i, coded; |
115 |
|
unsigned int distortion = 0; |
116 |
|
const uint32_t iDcScaler = get_dc_scaler(quant, block < 4); |
117 |
|
|
118 |
|
fdct(coeff); |
119 |
|
|
120 |
|
if (quant_type) { |
121 |
|
quant_h263_intra(qcoeff, coeff, quant, iDcScaler); |
122 |
|
dequant_h263_intra(dqcoeff, qcoeff, quant, iDcScaler); |
123 |
|
} else { |
124 |
|
quant_mpeg_intra(qcoeff, coeff, quant, iDcScaler); |
125 |
|
dequant_mpeg_intra(dqcoeff, qcoeff, quant, iDcScaler); |
126 |
|
} |
127 |
|
|
128 |
fdct(data); |
predict_acdc(pMB-(x+mb_width*y), x, y, mb_width, block, qcoeff, |
129 |
data[0] -= 1024; |
quant, iDcScaler, predictors, 0); |
130 |
|
|
131 |
if (quant_type) quant_intra(coeff, data, quant, iDcScaler); |
direction = pMB->acpred_directions[block]; |
132 |
else quant4_intra(coeff, data, quant, iDcScaler); |
pCurrent = pMB->pred_values[block]; |
133 |
|
|
134 |
b_dc = coeff[0]; |
/* store current coeffs to pred_values[] for future prediction */ |
135 |
if (block < 4) { |
pCurrent[0] = qcoeff[0] * iDcScaler; |
136 |
coeff[0] -= *dcpred; |
for (i = 1; i < 8; i++) { |
137 |
*dcpred = b_dc; |
pCurrent[i] = qcoeff[i]; |
138 |
|
pCurrent[i + 7] = qcoeff[i * 8]; |
139 |
} |
} |
140 |
|
|
141 |
bits = BITS_MULT*CodeCoeffIntra_CalcBits(coeff, scan_table); |
/* dc prediction */ |
142 |
if (bits != 0) *cbp |= 1 << (5 - block); |
qcoeff[0] = qcoeff[0] - predictors[0]; |
143 |
|
|
144 |
if (block < 4) bits += BITS_MULT*dcy_tab[coeff[0] + 255].len; |
if (block < 4) bits[1] = bits[0] = dcy_tab[qcoeff[0] + 255].len; |
145 |
else bits += BITS_MULT*dcc_tab[coeff[0] + 255].len; |
else bits[1] = bits[0] = dcc_tab[qcoeff[0] + 255].len; |
146 |
|
|
147 |
coeff[0] = b_dc; |
/* calc cost before ac prediction */ |
148 |
if (quant_type) dequant_intra(dqcoeff, coeff, quant, iDcScaler); |
bits[0] += coded = CodeCoeffIntra_CalcBits(qcoeff, scan_tables[0]); |
149 |
else dequant4_intra(dqcoeff, coeff, quant, iDcScaler); |
if (coded > 0) cbp[0] |= 1 << (5 - block); |
150 |
|
|
151 |
for (i = 0; i < 64; i++) |
/* apply ac prediction & calc cost*/ |
152 |
distortion += (data[i] - dqcoeff[i])*(data[i] - dqcoeff[i]); |
if (direction == 1) { |
153 |
|
for (i = 1; i < 8; i++) { |
154 |
|
qcoeff[i] -= predictors[i]; |
155 |
|
predictors[i] = qcoeff[i]; |
156 |
|
} |
157 |
|
} else { /* acpred_direction == 2 */ |
158 |
|
for (i = 1; i < 8; i++) { |
159 |
|
qcoeff[i*8] -= predictors[i]; |
160 |
|
predictors[i] = qcoeff[i*8]; |
161 |
|
} |
162 |
|
} |
163 |
|
|
164 |
return bits + (LAMBDA*distortion)/(quant*quant); |
bits[1] += coded = CodeCoeffIntra_CalcBits(qcoeff, scan_tables[direction]); |
165 |
|
if (coded > 0) cbp[1] |= 1 << (5 - block); |
166 |
|
|
167 |
|
distortion = sse8_16bit(coeff, dqcoeff, 8*sizeof(int16_t)); |
168 |
|
|
169 |
|
return (LAMBDA*distortion)/(quant*quant); |
170 |
} |
} |
171 |
|
|
172 |
|
|
173 |
|
|
174 |
static void |
static void |
175 |
CheckCandidateRD16(const int x, const int y, const SearchData * const data, const unsigned int Direction) |
CheckCandidateRD16(const int x, const int y, const SearchData * const data, const unsigned int Direction) |
176 |
{ |
{ |
480 |
} |
} |
481 |
|
|
482 |
static int |
static int |
483 |
findRD_intra(const SearchData * const Data) |
findRD_intra(const SearchData * const Data, MACROBLOCK * pMB, |
484 |
|
const int x, const int y, const int mb_width) |
485 |
{ |
{ |
486 |
int bits = BITS_MULT*1; /* this one is ac/dc prediction flag bit */ |
int cbp[2] = {0, 0}, bits[2], i; |
487 |
int cbp = 0, i, dc = 0; |
int bits1 = BITS_MULT*1, bits2 = BITS_MULT*1; /* this one is ac/dc prediction flag bit */ |
488 |
int16_t *in = Data->dctSpace, * coeff = Data->dctSpace + 64; |
int distortion = 0; |
489 |
|
|
490 |
|
int16_t *in = Data->dctSpace, * coeff = Data->dctSpace + 64, * dqcoeff = Data->dctSpace + 128; |
491 |
|
const uint32_t iQuant = Data->iQuant; |
492 |
|
int16_t predictors[6][8]; |
493 |
|
|
494 |
for(i = 0; i < 4; i++) { |
for(i = 0; i < 4; i++) { |
495 |
int s = 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
int s = 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
496 |
transfer_8to16copy(in, Data->Cur + s, Data->iEdgedWidth); |
transfer_8to16copy(in, Data->Cur + s, Data->iEdgedWidth); |
|
bits += Block_CalcBitsIntra(coeff, in, Data->dctSpace + 128, Data->iQuant, Data->quant_type, &cbp, i, &dc, Data->scan_table); |
|
497 |
|
|
498 |
if (bits >= Data->iMinSAD[0]) return bits; |
|
499 |
|
distortion = Block_CalcBitsIntra(pMB, x, y, mb_width, i, in, coeff, dqcoeff, |
500 |
|
predictors[i], iQuant, Data->quant_type, bits, cbp); |
501 |
|
bits1 += distortion + BITS_MULT * bits[0]; |
502 |
|
bits2 += distortion + BITS_MULT * bits[1]; |
503 |
|
|
504 |
|
if (bits1 >= Data->iMinSAD[0] && bits2 >= Data->iMinSAD[0]) |
505 |
|
return bits1; |
506 |
} |
} |
507 |
|
|
508 |
bits += BITS_MULT*xvid_cbpy_tab[cbp>>2].len; |
bits1 += BITS_MULT*xvid_cbpy_tab[cbp[0]>>2].len; |
509 |
|
bits2 += BITS_MULT*xvid_cbpy_tab[cbp[1]>>2].len; |
510 |
|
|
511 |
/*chroma U */ |
/*chroma U */ |
512 |
transfer_8to16copy(in, Data->CurU, Data->iEdgedWidth/2); |
transfer_8to16copy(in, Data->CurU, Data->iEdgedWidth/2); |
513 |
bits += Block_CalcBitsIntra(coeff, in, Data->dctSpace + 128, Data->iQuant, Data->quant_type, &cbp, 4, &dc, Data->scan_table); |
distortion = Block_CalcBitsIntra(pMB, x, y, mb_width, 4, in, coeff, dqcoeff, |
514 |
|
predictors[4], iQuant, Data->quant_type, bits, cbp); |
515 |
|
bits1 += distortion + BITS_MULT * bits[0]; |
516 |
|
bits2 += distortion + BITS_MULT * bits[1]; |
517 |
|
|
518 |
if (bits >= Data->iMinSAD[0]) return bits; |
if (bits1 >= Data->iMinSAD[0] && bits2 >= Data->iMinSAD[0]) |
519 |
|
return bits1; |
520 |
|
|
521 |
/* chroma V */ |
/* chroma V */ |
522 |
transfer_8to16copy(in, Data->CurV, Data->iEdgedWidth/2); |
transfer_8to16copy(in, Data->CurV, Data->iEdgedWidth/2); |
523 |
bits += Block_CalcBitsIntra(coeff, in, Data->dctSpace + 128, Data->iQuant, Data->quant_type, &cbp, 5, &dc, Data->scan_table); |
distortion = Block_CalcBitsIntra(pMB, x, y, mb_width, 5, in, coeff, dqcoeff, |
524 |
|
predictors[5], iQuant, Data->quant_type, bits, cbp); |
525 |
|
|
526 |
bits += BITS_MULT*mcbpc_inter_tab[(MODE_INTRA & 7) | ((cbp & 3) << 3)].len; |
bits1 += distortion + BITS_MULT * bits[0]; |
527 |
|
bits2 += distortion + BITS_MULT * bits[1]; |
528 |
|
|
529 |
return bits; |
bits1 += BITS_MULT*mcbpc_inter_tab[(MODE_INTRA & 7) | ((cbp[0] & 3) << 3)].len; |
530 |
|
bits2 += BITS_MULT*mcbpc_inter_tab[(MODE_INTRA & 7) | ((cbp[1] & 3) << 3)].len; |
531 |
|
|
532 |
|
*Data->cbp = bits1 <= bits2 ? cbp[0] : cbp[1]; |
533 |
|
|
534 |
|
return MIN(bits1, bits2); |
535 |
} |
} |
536 |
|
|
537 |
|
|
538 |
static int |
static int |
539 |
findRD_gmc(const SearchData * const Data, const IMAGE * const vGMC, const int x, const int y) |
findRD_gmc(const SearchData * const Data, const IMAGE * const vGMC, const int x, const int y) |
540 |
{ |
{ |
627 |
} |
} |
628 |
} |
} |
629 |
|
|
630 |
intra_rd = findRD_intra(Data); |
intra_rd = findRD_intra(Data, pMB, x, y, pParam->mb_width); |
631 |
if (intra_rd < min_rd) { |
if (intra_rd < min_rd) { |
632 |
*Data->iMinSAD = min_rd = intra_rd; |
*Data->iMinSAD = min_rd = intra_rd; |
633 |
mode = MODE_INTRA; |
mode = MODE_INTRA; |
634 |
|
cbp = *Data->cbp; |
635 |
} |
} |
636 |
|
|
637 |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = pMB->sad8[3] = 0; |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = pMB->sad8[3] = 0; |
886 |
} |
} |
887 |
} |
} |
888 |
|
|
889 |
intra_rd = findRD_intra(Data); |
intra_rd = findRD_intra(Data, pMB, x, y, pParam->mb_width); |
890 |
if (intra_rd < min_rd) { |
if (intra_rd < min_rd) { |
891 |
*Data->iMinSAD = min_rd = intra_rd; |
*Data->iMinSAD = min_rd = intra_rd; |
892 |
mode = MODE_INTRA; |
mode = MODE_INTRA; |