--- trunk/xvidcore/src/motion/motion_est.c 2002/07/31 10:08:58 351 +++ trunk/xvidcore/src/motion/motion_est.c 2002/11/17 00:35:33 652 @@ -1,69 +1,59 @@ -/************************************************************************** +/***************************************************************************** * - * XVID MPEG-4 VIDEO CODEC - * motion estimation + * XVID MPEG-4 VIDEO CODEC + * - Motion Estimation module - * - * This program is an implementation of a part of one or more MPEG-4 - * 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. + * Copyright(C) 2002 Christoph Lampert + * 2002 Michael Militzer * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. + * This file is part of XviD, a free MPEG-4 video encoder/decoder * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. + * XviD is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 2 of the License, or + * (at your option) any later version. * - * You should have received a copy of the GNU General Public License - * along with this program; if not, write to the Free Software - * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. * - *************************************************************************/ - -/************************************************************************** + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + * + * Under section 8 of the GNU General Public License, the copyright + * holders of XVID explicitly forbid distribution in the following + * countries: + * + * - Japan + * - United States of America * - * Modifications: + * Linking XviD statically or dynamically with other modules is making a + * combined work based on XviD. Thus, the terms and conditions of the + * GNU General Public License cover the whole combination. * - * 01.05.2002 updated MotionEstimationBVOP - * 25.04.2002 partial prevMB conversion - * 22.04.2002 remove some compile warning by chenm001 - * 14.04.2002 added MotionEstimationBVOP() - * 02.04.2002 add EPZS(^2) as ME algorithm, use PMV_USESQUARES to choose between - * EPZS and EPZS^2 - * 08.02.2002 split up PMVfast into three routines: PMVFast, PMVFast_MainLoop - * PMVFast_Refine to support multiple searches with different start points - * 07.01.2002 uv-block-based interpolation - * 06.01.2002 INTER/INTRA-decision is now done before any SEARCH8 (speedup) - * changed INTER_BIAS to 150 (as suggested by suxen_drol) - * removed halfpel refinement step in PMVfastSearch8 + quality=5 - * added new quality mode = 6 which performs halfpel refinement - * filesize difference between quality 5 and 6 is smaller than 1% - * (Isibaar) - * 31.12.2001 PMVfastSearch16 and PMVfastSearch8 (gruel) - * 30.12.2001 get_range/MotionSearchX simplified; blue/green bug fix - * 22.12.2001 commented best_point==99 check - * 19.12.2001 modified get_range (purple bug fix) - * 15.12.2001 moved pmv displacement from mbprediction - * 02.12.2001 motion estimation/compensation split (Isibaar) - * 16.11.2001 rewrote/tweaked search algorithms; pross@cs.rmit.edu.au - * 10.11.2001 support for sad16/sad8 functions - * 28.08.2001 reactivated MODE_INTER4V for EXT_MODE - * 24.08.2001 removed MODE_INTER4V_Q, disabled MODE_INTER4V for EXT_MODE - * 22.08.2001 added MODE_INTER4V_Q - * 20.08.2001 added pragma to get rid of internal compiler error with VC6 - * idea by Cyril. Thanks. + * As a special exception, the copyright holders of XviD give you + * permission to link XviD with independent modules that communicate with + * XviD solely through the VFW1.1 and DShow interfaces, regardless of the + * license terms of these independent modules, and to copy and distribute + * the resulting combined work under terms of your choice, provided that + * every copy of the combined work is accompanied by a complete copy of + * the source code of XviD (the version of XviD used to produce the + * combined work), being distributed under the terms of the GNU General + * Public License plus this exception. An independent module is a module + * which is not derived from or based on XviD. * - * Michael Militzer + * Note that people who make modified versions of XviD are not obligated + * to grant this special exception for their modified versions; it is + * their choice whether to do so. The GNU General Public License gives + * permission to release a modified version without this exception; this + * exception also makes it possible to release a modified version which + * carries forward this exception. * - **************************************************************************/ + * $Id: motion_est.c,v 1.53 2002-11-17 00:32:06 edgomez Exp $ + * + *************************************************************************/ #include #include @@ -174,8 +164,8 @@ static const VECTOR zeroMV = { 0, 0 }; VECTOR predMV; - int32_t x, y; - int32_t iIntra = 0; + uint32_t x, y; + uint32_t iIntra = 0; VECTOR pmv; if (sadInit) @@ -389,8 +379,8 @@ { iMinSAD=iSAD; currMV->x=(X); currMV->y=(Y); iDirection=(D); iFound=0; } } \ } +#if 0 /* too slow and not fully functional at the moment */ -/* int32_t ZeroSearch16( const uint8_t * const pRef, const uint8_t * const pRefH, @@ -429,7 +419,7 @@ return iSAD; } -*/ +#endif /* 0 */ int32_t Diamond16_MainSearch(const uint8_t * const pRef, @@ -439,12 +429,12 @@ const uint8_t * const cur, const int x, const int y, - const int start_x, - const int start_y, - int iMinSAD, - VECTOR * const currMV, - const int center_x, - const int center_y, + const int start_x, + const int start_y, + int iMinSAD, + VECTOR * const currMV, + const int center_x, + const int center_y, const int32_t min_dx, const int32_t max_dx, const int32_t min_dy, @@ -506,12 +496,12 @@ const uint8_t * const cur, const int x, const int y, - const int start_x, - const int start_y, - int iMinSAD, - VECTOR * const currMV, - const int center_x, - const int center_y, + const int start_x, + const int start_y, + int iMinSAD, + VECTOR * const currMV, + const int center_x, + const int center_y, const int32_t min_dx, const int32_t max_dx, const int32_t min_dy, @@ -685,12 +675,12 @@ const uint8_t * const cur, const int x, const int y, - const int start_x, - const int start_y, - int iMinSAD, - VECTOR * const currMV, - const int center_x, - const int center_y, + const int start_x, + const int start_y, + int iMinSAD, + VECTOR * const currMV, + const int center_x, + const int center_y, const int32_t min_dx, const int32_t max_dx, const int32_t min_dy, @@ -723,12 +713,12 @@ const uint8_t * const cur, const int x, const int y, - int start_x, - int start_y, - int iMinSAD, - VECTOR * const currMV, - const int center_x, - const int center_y, + const int start_xi, + const int start_yi, + int iMinSAD, + VECTOR * const currMV, + const int center_x, + const int center_y, const int32_t min_dx, const int32_t max_dx, const int32_t min_dy, @@ -741,6 +731,7 @@ { int32_t iSAD; + int start_x = start_xi, start_y = start_yi; /* directions: 1 - left (x-1); 2 - right (x+1), 4 - up (y-1); 8 - down (y+1) */ @@ -871,255 +862,10 @@ } while (1); //forever } - return iMinSAD; -} - -#define CHECK_MV16_F_INTERPOL(X,Y) { \ - if ( ((X) <= f_max_dx) && ((X) >= f_min_dx) \ - && ((Y) <= f_max_dy) && ((Y) >= f_min_dy) ) \ - { \ - iSAD = sad16bi( cur, \ - get_ref(f_pRef, f_pRefH, f_pRefV, f_pRefHV, x, y, 16, X, Y, iEdgedWidth), \ - get_ref(b_pRef, b_pRefH, b_pRefV, b_pRefHV, x, y, 16, b_currMV->x, b_currMV->y, iEdgedWidth), \ - iEdgedWidth); \ - iSAD += calc_delta_16((X) - f_center_x, (Y) - f_center_y, (uint8_t)f_iFcode, iQuant);\ - iSAD += calc_delta_16(b_currMV->x - b_center_x, b_currMV->y - b_center_y, (uint8_t)b_iFcode, iQuant);\ - if (iSAD < iMinSAD) \ - { iMinSAD=iSAD; f_currMV->x=(X); f_currMV->y=(Y); } } \ -} - -#define CHECK_MV16_F_INTERPOL_FOUND(X,Y) { \ - if ( ((X) <= f_max_dx) && ((X) >= f_min_dx) \ - && ((Y) <= f_max_dy) && ((Y) >= f_min_dy) ) \ - { \ - iSAD = sad16bi( cur, \ - get_ref(f_pRef, f_pRefH, f_pRefV, f_pRefHV, x, y, 16, X, Y, iEdgedWidth), \ - get_ref(b_pRef, b_pRefH, b_pRefV, b_pRefHV, x, y, 16, b_currMV->x, b_currMV->y, iEdgedWidth), \ - iEdgedWidth); \ - iSAD += calc_delta_16((X) - f_center_x, (Y) - f_center_y, (uint8_t)f_iFcode, iQuant);\ - iSAD += calc_delta_16(b_currMV->x - b_center_x, b_currMV->y - b_center_y, (uint8_t)b_iFcode, iQuant);\ - if (iSAD < iMinSAD) \ - { iMinSAD=iSAD; f_currMV->x=(X); f_currMV->y=(Y); iFound=0;} } \ -} - -#define CHECK_MV16_B_INTERPOL(X,Y) { \ - if ( ((X) <= b_max_dx) && ((X) >= b_min_dx) \ - && ((Y) <= b_max_dy) && ((Y) >= b_min_dy) ) \ - { \ - iSAD = sad16bi( cur, \ - get_ref(f_pRef, f_pRefH, f_pRefV, f_pRefHV, x, y, 16, f_currMV->x, f_currMV->y, iEdgedWidth), \ - get_ref(b_pRef, b_pRefH, b_pRefV, b_pRefHV, x, y, 16, X, Y, iEdgedWidth), \ - iEdgedWidth); \ - iSAD += calc_delta_16(f_currMV->x - f_center_x, f_currMV->y - f_center_y, (uint8_t)f_iFcode, iQuant);\ - iSAD += calc_delta_16((X) - b_center_x, (Y) - b_center_y, (uint8_t)b_iFcode, iQuant);\ - if (iSAD < iMinSAD) \ - { iMinSAD=iSAD; b_currMV->x=(X); b_currMV->y=(Y); } } \ -} - -#define CHECK_MV16_B_INTERPOL_FOUND(X,Y) { \ - if ( ((X) <= b_max_dx) && ((X) >= b_min_dx) \ - && ((Y) <= b_max_dy) && ((Y) >= b_min_dy) ) \ - { \ - iSAD = sad16bi( cur, \ - get_ref(f_pRef, f_pRefH, f_pRefV, f_pRefHV, x, y, 16, f_currMV->x, f_currMV->y, iEdgedWidth), \ - get_ref(b_pRef, b_pRefH, b_pRefV, b_pRefHV, x, y, 16, X, Y, iEdgedWidth), \ - iEdgedWidth); \ - iSAD += calc_delta_16(f_currMV->x - f_center_x, f_currMV->y - f_center_y, (uint8_t)f_iFcode, iQuant);\ - iSAD += calc_delta_16((X) - b_center_x, (Y) - b_center_y, (uint8_t)b_iFcode, iQuant);\ - if (iSAD < iMinSAD) \ - { iMinSAD=iSAD; b_currMV->x=(X); b_currMV->y=(Y); iFound=0;} } \ -} - -int32_t -Diamond16_InterpolMainSearch( - const uint8_t * const f_pRef, - const uint8_t * const f_pRefH, - const uint8_t * const f_pRefV, - const uint8_t * const f_pRefHV, - - const uint8_t * const cur, - - const uint8_t * const b_pRef, - const uint8_t * const b_pRefH, - const uint8_t * const b_pRefV, - const uint8_t * const b_pRefHV, - - const int x, - const int y, - - const int f_start_x, - const int f_start_y, - const int b_start_x, - const int b_start_y, - - int iMinSAD, - VECTOR * const f_currMV, - VECTOR * const b_currMV, - - const int f_center_x, - const int f_center_y, - const int b_center_x, - const int b_center_y, - - const int32_t f_min_dx, - const int32_t f_max_dx, - const int32_t f_min_dy, - const int32_t f_max_dy, - - const int32_t b_min_dx, - const int32_t b_max_dx, - const int32_t b_min_dy, - const int32_t b_max_dy, - - const int32_t iEdgedWidth, - const int32_t iDiamondSize, - - const int32_t f_iFcode, - const int32_t b_iFcode, - - const int32_t iQuant, - int iFound) -{ -/* Do a diamond search around given starting point, return SAD of best */ - - int32_t iSAD; - - VECTOR f_backupMV; - VECTOR b_backupMV; - - f_currMV->x = f_start_x; - f_currMV->y = f_start_y; - b_currMV->x = b_start_x; - b_currMV->y = b_start_y; - - do - { - iFound = 1; - - f_backupMV = *f_currMV; - - CHECK_MV16_F_INTERPOL_FOUND(f_backupMV.x - iDiamondSize, f_backupMV.y); - CHECK_MV16_F_INTERPOL_FOUND(f_backupMV.x + iDiamondSize, f_backupMV.y); - CHECK_MV16_F_INTERPOL_FOUND(f_backupMV.x, f_backupMV.y - iDiamondSize); - CHECK_MV16_F_INTERPOL_FOUND(f_backupMV.x, f_backupMV.y + iDiamondSize); - - b_backupMV = *b_currMV; - - CHECK_MV16_B_INTERPOL_FOUND(b_backupMV.x - iDiamondSize, b_backupMV.y); - CHECK_MV16_B_INTERPOL_FOUND(b_backupMV.x + iDiamondSize, b_backupMV.y); - CHECK_MV16_B_INTERPOL_FOUND(b_backupMV.x, b_backupMV.y - iDiamondSize); - CHECK_MV16_B_INTERPOL_FOUND(b_backupMV.x, b_backupMV.y + iDiamondSize); - - } while (!iFound); return iMinSAD; } -/* Sorry, these MACROS really got too large... I'll turn them into function soon! */ - -#define CHECK_MV16_DIRECT_FOUND(X,Y) \ - if ( (X)>=(-32) && (X)<=(31) && ((Y)>=-32) && ((Y)<=31) ) \ - { int k;\ - VECTOR mvs,b_mvs; \ - iSAD = 0;\ - for (k = 0; k < 4; k++) { \ - mvs.x = (int32_t) ((TRB * directmv[k].x) / TRD + (X)); \ - b_mvs.x = (int32_t) (((X) == 0) \ - ? ((TRB - TRD) * directmv[k].x) / TRD \ - : mvs.x - directmv[k].x); \ - \ - mvs.y = (int32_t) ((TRB * directmv[k].y) / TRD + (Y)); \ - b_mvs.y = (int32_t) (((Y) == 0) \ - ? ((TRB - TRD) * directmv[k].y) / TRD \ - : mvs.y - directmv[k].y); \ - \ - if ( (mvs.x <= max_dx) && (mvs.x >= min_dx) \ - && (mvs.y <= max_dy) && (mvs.y >= min_dy) \ - && (b_mvs.x <= max_dx) && (b_mvs.x >= min_dx) \ - && (b_mvs.y <= max_dy) && (b_mvs.y >= min_dy) ) { \ - iSAD += sad8bi( cur + 8*(k&1) + 8*(k>>1)*iEdgedWidth, \ - get_ref(f_pRef, f_pRefH, f_pRefV, f_pRefHV, 2*x+(k&1), 2*y+(k>>1), 8, \ - mvs.x, mvs.y, iEdgedWidth), \ - get_ref(b_pRef, b_pRefH, b_pRefV, b_pRefHV, 2*x+(k&1), 2*y+(k>>1), 8, \ - b_mvs.x, b_mvs.y, iEdgedWidth), \ - iEdgedWidth); \ - } \ - else \ - iSAD = 65535; \ - } \ - iSAD += calc_delta_16((X),(Y), 1, iQuant);\ - if (iSAD < iMinSAD) \ - { iMinSAD=iSAD; currMV->x=(X); currMV->y=(Y); iFound=0; } \ -} - - - -int32_t -Diamond16_DirectMainSearch( - const uint8_t * const f_pRef, - const uint8_t * const f_pRefH, - const uint8_t * const f_pRefV, - const uint8_t * const f_pRefHV, - - const uint8_t * const cur, - - const uint8_t * const b_pRef, - const uint8_t * const b_pRefH, - const uint8_t * const b_pRefV, - const uint8_t * const b_pRefHV, - - const int x, - const int y, - - const int TRB, - const int TRD, - - const int start_x, - const int start_y, - - int iMinSAD, - VECTOR * const currMV, - const VECTOR * const directmv, - - const int32_t min_dx, - const int32_t max_dx, - const int32_t min_dy, - const int32_t max_dy, - - const int32_t iEdgedWidth, - const int32_t iDiamondSize, - - const int32_t iQuant, - int iFound) -{ -/* Do a diamond search around given starting point, return SAD of best */ - - int32_t iSAD; - - VECTOR backupMV; - - currMV->x = start_x; - currMV->y = start_y; - -/* It's one search with full Diamond pattern, and only 3 of 4 for all following diamonds */ - - do - { - iFound = 1; - - backupMV = *currMV; - - CHECK_MV16_DIRECT_FOUND(backupMV.x - iDiamondSize, backupMV.y); - CHECK_MV16_DIRECT_FOUND(backupMV.x + iDiamondSize, backupMV.y); - CHECK_MV16_DIRECT_FOUND(backupMV.x, backupMV.y - iDiamondSize); - CHECK_MV16_DIRECT_FOUND(backupMV.x, backupMV.y + iDiamondSize); - - } while (!iFound); - - return iMinSAD; -} - - int32_t AdvDiamond8_MainSearch(const uint8_t * const pRef, const uint8_t * const pRefH, @@ -1128,8 +874,8 @@ const uint8_t * const cur, const int x, const int y, - int start_x, - int start_y, + const int start_xi, + const int start_yi, int iMinSAD, VECTOR * const currMV, const int center_x, @@ -1146,6 +892,7 @@ { int32_t iSAD; + int start_x = start_xi, start_y = start_yi; /* directions: 1 - left (x-1); 2 - right (x+1), 4 - up (y-1); 8 - down (y+1) */ @@ -1425,7 +1172,6 @@ } /* because we might use something like IF (dx>max_dx) THEN dx=max_dx; */ - //bPredEq = get_pmvdata(pMBs, x, y, iWcount, 0, pmv, psad); bPredEq = get_pmvdata2(pMBs, iWcount, 0, x, y, 0, pmv, psad); if ((x == 0) && (y == 0)) { @@ -1483,7 +1229,7 @@ if ((iMinSAD < 256) || ((MVequal(*currMV, prevMB->mvs[0])) && ((int32_t) iMinSAD < prevMB->sad16))) { - if (iMinSAD < 2 * iQuant) // high chances for SKIP-mode + if (iMinSAD < (int)(2 * iQuant)) // high chances for SKIP-mode { if (!MVzero(*currMV)) { iMinSAD += MV16_00_BIAS; @@ -1688,12 +1434,12 @@ const uint8_t * const cur, const int x, const int y, - int32_t start_x, - int32_t start_y, + const int32_t start_x, + const int32_t start_y, int32_t iMinSAD, VECTOR * const currMV, - const int center_x, - const int center_y, + const int center_x, + const int center_y, const int32_t min_dx, const int32_t max_dx, const int32_t min_dy, @@ -1752,27 +1498,27 @@ int32_t Square8_MainSearch(const uint8_t * const pRef, - const uint8_t * const pRefH, - const uint8_t * const pRefV, - const uint8_t * const pRefHV, - const uint8_t * const cur, - const int x, - const int y, - int32_t start_x, - int32_t start_y, - int32_t iMinSAD, - VECTOR * const currMV, + const uint8_t * const pRefH, + const uint8_t * const pRefV, + const uint8_t * const pRefHV, + const uint8_t * const cur, + const int x, + const int y, + const int32_t start_x, + const int32_t start_y, + int32_t iMinSAD, + VECTOR * const currMV, const int center_x, const int center_y, - const int32_t min_dx, - const int32_t max_dx, - const int32_t min_dy, - const int32_t max_dy, - const int32_t iEdgedWidth, - const int32_t iDiamondSize, - const int32_t iFcode, - const int32_t iQuant, - int iFound) + const int32_t min_dx, + const int32_t max_dx, + const int32_t min_dy, + const int32_t max_dy, + const int32_t iEdgedWidth, + const int32_t iDiamondSize, + const int32_t iFcode, + const int32_t iQuant, + int iFound) { /* Do a square search around given starting point, return SAD of best */ @@ -1934,23 +1680,23 @@ int32_t Halfpel8_Refine_c(const uint8_t * const pRef, - const uint8_t * const pRefH, - const uint8_t * const pRefV, - const uint8_t * const pRefHV, - const uint8_t * const cur, - const int x, - const int y, - VECTOR * const currMV, - int32_t iMinSAD, - const int center_x, - const int center_y, - const int32_t min_dx, - const int32_t max_dx, - const int32_t min_dy, - const int32_t max_dy, - const int32_t iFcode, - const int32_t iQuant, - const int32_t iEdgedWidth) + const uint8_t * const pRefH, + const uint8_t * const pRefV, + const uint8_t * const pRefHV, + const uint8_t * const cur, + const int x, + const int y, + VECTOR * const currMV, + int32_t iMinSAD, + const int center_x, + const int center_y, + const int32_t min_dx, + const int32_t max_dx, + const int32_t min_dy, + const int32_t max_dy, + const int32_t iFcode, + const int32_t iQuant, + const int32_t iEdgedWidth) { /* Do a half-pel refinement (or rather a "smallest possible amount" refinement) */ @@ -2040,7 +1786,6 @@ } /* because we might use IF (dx>max_dx) THEN dx=max_dx; */ - //bPredEq = get_pmvdata(pMBs, (x >> 1), (y >> 1), iWcount, iSubBlock, pmv, psad); bPredEq = get_pmvdata2(pMBs, iWcount, 0, (x >> 1), (y >> 1), iSubBlock, pmv, psad); if ((x == 0) && (y == 0)) { @@ -2355,7 +2100,6 @@ max_dy = EVEN(max_dy); } /* because we might use something like IF (dx>max_dx) THEN dx=max_dx; */ - //bPredEq = get_pmvdata(pMBs, x, y, iWcount, 0, pmv, psad); bPredEq = get_pmvdata2(pMBs, iWcount, 0, x, y, 0, pmv, psad); /* Step 4: Calculate SAD around the Median prediction. @@ -2638,7 +2382,6 @@ max_dy = EVEN(max_dy); } /* because we might use something like IF (dx>max_dx) THEN dx=max_dx; */ - //bPredEq = get_pmvdata(pMBs, x >> 1, y >> 1, iWcount, iSubBlock, pmv[0].x, pmv[0].y, psad); bPredEq = get_pmvdata2(pMBs, iWcount, 0, x >> 1, y >> 1, iSubBlock, pmv, psad); @@ -2816,634 +2559,3 @@ currPMV->y = currMV->y - center_y; return iMinSAD; } - - - -int32_t -PMVfastIntSearch16(const uint8_t * const pRef, - const uint8_t * const pRefH, - const uint8_t * const pRefV, - const uint8_t * const pRefHV, - const IMAGE * const pCur, - const int x, - const int y, - const int start_x, /* start should be most likely vector */ - const int start_y, - const int center_x, /* center is from where length of MVs is measured */ - const int center_y, - const uint32_t MotionFlags, - const uint32_t iQuant, - const uint32_t iFcode, - const MBParam * const pParam, - const MACROBLOCK * const pMBs, - const MACROBLOCK * const prevMBs, - VECTOR * const currMV, - VECTOR * const currPMV) -{ - const uint32_t iWcount = pParam->mb_width; - const int32_t iWidth = pParam->width; - const int32_t iHeight = pParam->height; - const int32_t iEdgedWidth = pParam->edged_width; - - const uint8_t *cur = pCur->y + x * 16 + y * 16 * iEdgedWidth; - const VECTOR zeroMV = { 0, 0 }; - - int32_t iDiamondSize; - - int32_t min_dx; - int32_t max_dx; - int32_t min_dy; - int32_t max_dy; - - int32_t iFound; - - VECTOR newMV; - VECTOR backupMV; - - VECTOR pmv[4]; - int32_t psad[4]; - - MainSearch16FuncPtr MainSearchPtr; - - const MACROBLOCK *const prevMB = prevMBs + x + y * iWcount; - MACROBLOCK *const pMB = pMBs + x + y * iWcount; - - int32_t threshA, threshB; - int32_t bPredEq; - int32_t iMinSAD, iSAD; - - -/* Get maximum range */ - get_range(&min_dx, &max_dx, &min_dy, &max_dy, x, y, 16, iWidth, iHeight, - iFcode); - -/* we work with abs. MVs, not relative to prediction, so get_range is called relative to 0,0 */ - - if ((x == 0) && (y == 0)) { - threshA = 512; - threshB = 1024; - - bPredEq = 0; - psad[0] = psad[1] = psad[2] = psad[3] = 0; - *currMV = pmv[0] = pmv[1] = pmv[2] = pmv[3] = zeroMV; - - } else { - threshA = psad[0]; - threshB = threshA + 256; - if (threshA < 512) - threshA = 512; - if (threshA > 1024) - threshA = 1024; - if (threshB > 1792) - threshB = 1792; - - bPredEq = get_ipmvdata(pMBs, iWcount, 0, x, y, 0, pmv, psad); - *currMV = pmv[0]; /* current best := prediction */ - } - - iFound = 0; - -/* Step 4: Calculate SAD around the Median prediction. - MinSAD=SAD - If Motion Vector equal to Previous frame motion vector - and MinSADx > max_dx) { - currMV->x = EVEN(max_dx); - } - if (currMV->x < min_dx) { - currMV->x = EVEN(min_dx); - } - if (currMV->y > max_dy) { - currMV->y = EVEN(max_dy); - } - if (currMV->y < min_dy) { - currMV->y = EVEN(min_dy); - } - - iMinSAD = - sad16(cur, - get_iref_mv(pRef, x, y, 16, currMV, - iEdgedWidth), iEdgedWidth, MV_MAX_ERROR); - iMinSAD += - calc_delta_16(currMV->x - center_x, currMV->y - center_y, - (uint8_t) iFcode, iQuant); - - if ((iMinSAD < 256) || - ((MVequal(*currMV, prevMB->i_mvs[0])) && - ((int32_t) iMinSAD < prevMB->i_sad16))) { - if (iMinSAD < 2 * iQuant) // high chances for SKIP-mode - { - if (!MVzero(*currMV)) { - iMinSAD += MV16_00_BIAS; - CHECK_MV16_ZERO; // (0,0) saves space for letterboxed pictures - iMinSAD -= MV16_00_BIAS; - } - } - - if (MotionFlags & PMV_EARLYSTOP16) - goto PMVfastInt16_Terminate_with_Refine; - } - - -/* Step 2 (lazy eval): Calculate Distance= |MedianMVX| + |MedianMVY| where MedianMV is the motion - vector of the median. - If PredEq=1 and MVpredicted = Previous Frame MV, set Found=2 -*/ - - if ((bPredEq) && (MVequal(pmv[0], prevMB->i_mvs[0]))) - iFound = 2; - -/* Step 3 (lazy eval): If Distance>0 or thresb<1536 or PredEq=1 Select small Diamond Search. - Otherwise select large Diamond Search. -*/ - - if ((!MVzero(pmv[0])) || (threshB < 1536) || (bPredEq)) - iDiamondSize = 2; // halfpel units! - else - iDiamondSize = 4; // halfpel units! - -/* - Step 5: Calculate SAD for motion vectors taken from left block, top, top-right, and Previous frame block. - Also calculate (0,0) but do not subtract offset. - Let MinSAD be the smallest SAD up to this point. - If MV is (0,0) subtract offset. -*/ - -// (0,0) is often a good choice - - if (!MVzero(pmv[0])) - CHECK_MV16_ZERO; - -// previous frame MV is always possible - - if (!MVzero(prevMB->i_mvs[0])) - if (!MVequal(prevMB->i_mvs[0], pmv[0])) - CHECK_MV16_CANDIDATE(prevMB->i_mvs[0].x, prevMB->i_mvs[0].y); - -// left neighbour, if allowed - - if (!MVzero(pmv[1])) - if (!MVequal(pmv[1], prevMB->i_mvs[0])) - if (!MVequal(pmv[1], pmv[0])) - CHECK_MV16_CANDIDATE(pmv[1].x, pmv[1].y); - -// top neighbour, if allowed - if (!MVzero(pmv[2])) - if (!MVequal(pmv[2], prevMB->i_mvs[0])) - if (!MVequal(pmv[2], pmv[0])) - if (!MVequal(pmv[2], pmv[1])) - CHECK_MV16_CANDIDATE(pmv[2].x, pmv[2].y); - -// top right neighbour, if allowed - if (!MVzero(pmv[3])) - if (!MVequal(pmv[3], prevMB->i_mvs[0])) - if (!MVequal(pmv[3], pmv[0])) - if (!MVequal(pmv[3], pmv[1])) - if (!MVequal(pmv[3], pmv[2])) - CHECK_MV16_CANDIDATE(pmv[3].x, - pmv[3].y); - - if ((MVzero(*currMV)) && - (!MVzero(pmv[0])) /* && (iMinSAD <= iQuant * 96) */ ) - iMinSAD -= MV16_00_BIAS; - - -/* Step 6: If MinSAD <= thresa goto Step 10. - If Motion Vector equal to Previous frame motion vector and MinSADi_mvs[0]) && - ((int32_t) iMinSAD < prevMB->i_sad16))) { - - if (MotionFlags & PMV_EARLYSTOP16) - goto PMVfastInt16_Terminate_with_Refine; - } - - -/************ (Diamond Search) **************/ -/* - Step 7: Perform Diamond search, with either the small or large diamond. - If Found=2 only examine one Diamond pattern, and afterwards goto step 10 - Step 8: If small diamond, iterate small diamond search pattern until motion vector lies in the center of the diamond. - If center then goto step 10. - Step 9: If large diamond, iterate large diamond search pattern until motion vector lies in the center. - Refine by using small diamond and goto step 10. -*/ - - if (MotionFlags & PMV_USESQUARES16) - MainSearchPtr = Square16_MainSearch; - else if (MotionFlags & PMV_ADVANCEDDIAMOND16) - MainSearchPtr = AdvDiamond16_MainSearch; - else - MainSearchPtr = Diamond16_MainSearch; - - backupMV = *currMV; /* save best prediction, actually only for EXTSEARCH */ - - -/* default: use best prediction as starting point for one call of PMVfast_MainSearch */ - iSAD = - (*MainSearchPtr) (pRef, pRefH, pRefV, pRefHV, cur, x, y, currMV->x, - currMV->y, iMinSAD, &newMV, center_x, center_y, min_dx, max_dx, - min_dy, max_dy, iEdgedWidth, iDiamondSize, iFcode, - iQuant, iFound); - - if (iSAD < iMinSAD) { - *currMV = newMV; - iMinSAD = iSAD; - } - - if (MotionFlags & PMV_EXTSEARCH16) { -/* extended: search (up to) two more times: orignal prediction and (0,0) */ - - if (!(MVequal(pmv[0], backupMV))) { - iSAD = - (*MainSearchPtr) (pRef, pRefH, pRefV, pRefHV, cur, x, y, - pmv[0].x, pmv[0].y, iMinSAD, &newMV, center_x, center_y, - min_dx, max_dx, min_dy, max_dy, iEdgedWidth, - iDiamondSize, iFcode, iQuant, iFound); - - if (iSAD < iMinSAD) { - *currMV = newMV; - iMinSAD = iSAD; - } - } - - if ((!(MVzero(pmv[0]))) && (!(MVzero(backupMV)))) { - iSAD = - (*MainSearchPtr) (pRef, pRefH, pRefV, pRefHV, cur, x, y, 0, 0, - iMinSAD, &newMV, center_x, center_y, min_dx, max_dx, min_dy, - max_dy, iEdgedWidth, iDiamondSize, iFcode, - iQuant, iFound); - - if (iSAD < iMinSAD) { - *currMV = newMV; - iMinSAD = iSAD; - } - } - } - -/* - Step 10: The motion vector is chosen according to the block corresponding to MinSAD. -*/ - -PMVfastInt16_Terminate_with_Refine: - - pMB->i_mvs[0] = pMB->i_mvs[1] = pMB->i_mvs[2] = pMB->i_mvs[3] = pMB->i_mv16 = *currMV; - pMB->i_sad8[0] = pMB->i_sad8[1] = pMB->i_sad8[2] = pMB->i_sad8[3] = pMB->i_sad16 = iMinSAD; - - if (MotionFlags & PMV_HALFPELREFINE16) // perform final half-pel step - iMinSAD = - Halfpel16_Refine(pRef, pRefH, pRefV, pRefHV, cur, x, y, currMV, - iMinSAD, center_x, center_y, min_dx, max_dx, min_dy, max_dy, - iFcode, iQuant, iEdgedWidth); - - pmv[0] = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); // get _REAL_ prediction (halfpel possible) - -PMVfastInt16_Terminate_without_Refine: - currPMV->x = currMV->x - center_x; - currPMV->y = currMV->y - center_y; - return iMinSAD; -} - - - -/* *********************************************************** - bvop motion estimation -***************************************************************/ - -void -MotionEstimationBVOP(MBParam * const pParam, - FRAMEINFO * const frame, - const int32_t time_bp, - const int32_t time_pp, - // forward (past) reference - const MACROBLOCK * const f_mbs, - const IMAGE * const f_ref, - const IMAGE * const f_refH, - const IMAGE * const f_refV, - const IMAGE * const f_refHV, - // backward (future) reference - const MACROBLOCK * const b_mbs, - const IMAGE * const b_ref, - const IMAGE * const b_refH, - const IMAGE * const b_refV, - const IMAGE * const b_refHV) -{ - const int mb_width = pParam->mb_width; - const int mb_height = pParam->mb_height; - const int edged_width = pParam->edged_width; - - const int32_t iWidth = pParam->width; - const int32_t iHeight = pParam->height; - - int i, j, k; - - static const VECTOR zeroMV={0,0}; - - int f_sad16; /* forward (as usual) search */ - int b_sad16; /* backward (only in b-frames) search */ - int i_sad16; /* interpolated (both direction, b-frames only) */ - int d_sad16; /* direct mode (assume almost linear motion) */ - - int best_sad; - - VECTOR f_predMV, b_predMV; /* there is no prediction for direct mode*/ - VECTOR f_interpolMV, b_interpolMV; - VECTOR pmv_dontcare; - - int min_dx, max_dx, min_dy, max_dy; - int f_min_dx, f_max_dx, f_min_dy, f_max_dy; - int b_min_dx, b_max_dx, b_min_dy, b_max_dy; - - int f_count=0; - int b_count=0; - int i_count=0; - int d_count=0; - - const int64_t TRB = (int32_t)time_pp - (int32_t)time_bp; - const int64_t TRD = (int32_t)time_pp; - - // fprintf(stderr,"TRB = %lld TRD = %lld time_bp =%d time_pp =%d\n\n",TRB,TRD,time_bp,time_pp); - // note: i==horizontal, j==vertical - for (j = 0; j < mb_height; j++) { - - f_predMV = zeroMV; /* prediction is reset at left boundary */ - b_predMV = zeroMV; - - for (i = 0; i < mb_width; i++) { - MACROBLOCK *mb = &frame->mbs[i + j * mb_width]; - const MACROBLOCK *f_mb = &f_mbs[i + j * mb_width]; - const MACROBLOCK *b_mb = &b_mbs[i + j * mb_width]; - - mb->deltamv=zeroMV; - -/* special case, if collocated block is SKIPed: encoding is forward (0,0), cpb=0 without further ado */ - - if (b_mb->mode == MODE_INTER && b_mb->cbp == 0 && - b_mb->mvs[0].x == 0 && b_mb->mvs[0].y == 0) { - mb->mode = MODE_NOT_CODED; - mb->b_mvs[0] = mb->mvs[0] = zeroMV; - continue; - } - - if (b_mb->mode == MODE_INTER4V) - { - d_sad16 = 0; - /* same method of scaling as in decoder.c, so we copy from there */ - for (k = 0; k < 4; k++) { - - mb->directmv[k] = b_mb->mvs[k]; - - mb->mvs[k].x = (int32_t) ((TRB * mb->directmv[k].x) / TRD + mb->deltamv.x); - mb->b_mvs[k].x = (int32_t) ((mb->deltamv.x == 0) - ? ((TRB - TRD) * mb->directmv[k].x) / TRD - : mb->mvs[k].x - mb->directmv[k].x); - - mb->mvs[k].y = (int32_t) ((TRB * mb->directmv[k].y) / TRD + mb->deltamv.y); - mb->b_mvs[k].y = (int32_t) ((mb->deltamv.y == 0) - ? ((TRB - TRD) * mb->directmv[k].y) / TRD - : mb->mvs[k].y - mb->directmv[k].y); - - d_sad16 += - sad8bi(frame->image.y + (2*i+(k&1))*8 + (2*j+(k>>1))*8*edged_width, - get_ref_mv(f_ref->y, f_refH->y, f_refV->y, f_refHV->y, - (2*i+(k&1)), (2*j+(k>>1)), 8, &mb->mvs[k], edged_width), - get_ref_mv(b_ref->y, b_refH->y, b_refV->y, b_refHV->y, - (2*i+(k&1)), (2*j+(k>>1)), 8, &mb->b_mvs[k], edged_width), - edged_width); - } - } - else - { - mb->directmv[3] = mb->directmv[2] = mb->directmv[1] = - mb->directmv[0] = b_mb->mvs[0]; - - mb->mvs[0].x = (int32_t) ((TRB * mb->directmv[0].x) / TRD + mb->deltamv.x); - mb->b_mvs[0].x = (int32_t) ((mb->deltamv.x == 0) - ? ((TRB - TRD) * mb->directmv[0].x) / TRD - : mb->mvs[0].x - mb->directmv[0].x); - - mb->mvs[0].y = (int32_t) ((TRB * mb->directmv[0].y) / TRD + mb->deltamv.y); - mb->b_mvs[0].y = (int32_t) ((mb->directmv[0].y == 0) - ? ((TRB - TRD) * mb->directmv[0].y) / TRD - : mb->mvs[0].y - mb->directmv[0].y); - - d_sad16 = sad16bi(frame->image.y + i * 16 + j * 16 * edged_width, - get_ref_mv(f_ref->y, f_refH->y, f_refV->y, f_refHV->y, - i, j, 16, &mb->mvs[0], edged_width), - get_ref_mv(b_ref->y, b_refH->y, b_refV->y, b_refHV->y, - i, j, 16, &mb->b_mvs[0], edged_width), - edged_width); - - } - d_sad16 += calc_delta_16(mb->deltamv.x, mb->deltamv.y, 1, frame->quant); - - // forward search - f_sad16 = SEARCH16(f_ref->y, f_refH->y, f_refV->y, f_refHV->y, - &frame->image, i, j, - mb->mvs[0].x, mb->mvs[0].y, /* start point f_directMV */ - f_predMV.x, f_predMV.y, /* center is f-prediction */ - frame->motion_flags, - frame->quant, frame->fcode, pParam, - f_mbs, f_mbs, - &mb->mvs[0], &pmv_dontcare); - - - // backward search - b_sad16 = SEARCH16(b_ref->y, b_refH->y, b_refV->y, b_refHV->y, - &frame->image, i, j, - mb->b_mvs[0].x, mb->b_mvs[0].y, /* start point b_directMV */ - b_predMV.x, b_predMV.y, /* center is b-prediction */ - frame->motion_flags, - frame->quant, frame->bcode, pParam, - b_mbs, b_mbs, - &mb->b_mvs[0], &pmv_dontcare); - - i_sad16 = - sad16bi(frame->image.y + i * 16 + j * 16 * edged_width, - get_ref_mv(f_ref->y, f_refH->y, f_refV->y, f_refHV->y, - i, j, 16, &mb->mvs[0], edged_width), - get_ref_mv(b_ref->y, b_refH->y, b_refV->y, b_refHV->y, - i, j, 16, &mb->b_mvs[0], edged_width), - edged_width); - i_sad16 += calc_delta_16(mb->mvs[0].x-f_predMV.x, mb->mvs[0].y-f_predMV.y, - frame->fcode, frame->quant); - i_sad16 += calc_delta_16(mb->b_mvs[0].x-b_predMV.x, mb->b_mvs[0].y-b_predMV.y, - frame->bcode, frame->quant); - - get_range(&f_min_dx, &f_max_dx, &f_min_dy, &f_max_dy, i, j, 16, iWidth, iHeight, - frame->fcode); - get_range(&b_min_dx, &b_max_dx, &b_min_dy, &b_max_dy, i, j, 16, iWidth, iHeight, - frame->bcode); - -/* Interpolated MC motion vector search, this is tedious and more complicated because there are - two values for everything, always one for backward and one for forward ME. Still, we don't gain - much from this search, maybe it should simply be skipped and simply current i_sad16 value used - as "optimal". */ - - i_sad16 = Diamond16_InterpolMainSearch( - f_ref->y, f_refH->y, f_refV->y, f_refHV->y, - frame->image.y + i * 16 + j * 16 * edged_width, - b_ref->y, b_refH->y, b_refV->y, b_refHV->y, - i, j, - mb->mvs[0].x, mb->mvs[0].y, - mb->b_mvs[0].x, mb->b_mvs[0].y, - i_sad16, - &f_interpolMV, &b_interpolMV, - f_predMV.x, f_predMV.y, b_predMV.x, b_predMV.y, - f_min_dx, f_max_dx, f_min_dy, f_max_dy, - b_min_dx, b_max_dx, b_min_dy, b_max_dy, - edged_width, 2, - frame->fcode, frame->bcode,frame->quant,0); - - i_sad16 = Diamond16_InterpolMainSearch( - f_ref->y, f_refH->y, f_refV->y, f_refHV->y, - frame->image.y + i * 16 + j * 16 * edged_width, - b_ref->y, b_refH->y, b_refV->y, b_refHV->y, - i, j, - f_interpolMV.x, f_interpolMV.y, - b_interpolMV.x, b_interpolMV.y, - i_sad16, - &f_interpolMV, &b_interpolMV, - f_predMV.x, f_predMV.y, b_predMV.x, b_predMV.y, - f_min_dx, f_max_dx, f_min_dy, f_max_dy, - b_min_dx, b_max_dx, b_min_dy, b_max_dy, - edged_width, 1, - frame->fcode, frame->bcode,frame->quant,0); // equiv to halfpel refine - - -/* DIRECT MODE DELTA VECTOR SEARCH. - This has to be made more effective, but at the moment I'm happy it's running at all */ - -/* There are two range restrictions for direct mode: deltaMV is limited to [-32,31] in halfpel units, and - absolute vector must not lie outside of image dimensions. Constraint one is dealt with by CHECK_MV16_DIRECT - and for constraint two we need distance to boundary. This is done by get_range very large fcode (hack!) */ - - get_range(&min_dx, &max_dx, &min_dy, &max_dy, i, j, 16, iWidth, iHeight, 19); - - d_sad16 = Diamond16_DirectMainSearch( - f_ref->y, f_refH->y, f_refV->y, f_refHV->y, - frame->image.y + i*16 + j*16*edged_width, - b_ref->y, b_refH->y, b_refV->y, b_refHV->y, - i, j, - TRB,TRD, - 0,0, - d_sad16, - &mb->deltamv, - mb->directmv, // this has to be pre-initialized with b_mb->mvs[] - min_dx, max_dx, min_dy, max_dy, - edged_width, 2, frame->quant, 0); - - d_sad16 = Diamond16_DirectMainSearch( - f_ref->y, f_refH->y, f_refV->y, f_refHV->y, - frame->image.y + i*16 + j*16*edged_width, - b_ref->y, b_refH->y, b_refV->y, b_refHV->y, - i, j, - TRB,TRD, - mb->deltamv.x, mb->deltamv.y, - d_sad16, - &mb->deltamv, - mb->directmv, // this has to be pre-initialized with b_mb->mvs[] - min_dx, max_dx, min_dy, max_dy, - edged_width, 1, frame->quant, 0); // equiv to halfpel refine - - -// i_sad16 = 65535; /* remove the comment to disable any of the MODEs */ -// f_sad16 = 65535; -// b_sad16 = 65535; -// d_sad16 = 65535; - - if (f_sad16 < b_sad16) { - best_sad = f_sad16; - mb->mode = MODE_FORWARD; - } else { - best_sad = b_sad16; - mb->mode = MODE_BACKWARD; - } - - if (i_sad16 < best_sad) { - best_sad = i_sad16; - mb->mode = MODE_INTERPOLATE; - } - - if (d_sad16 < best_sad) { - - if (b_mb->mode == MODE_INTER4V) - { - - /* how to calc vectors is defined in standard. mvs[] and b_mvs[] are only for motion compensation */ - /* for the bitstream, the value mb->deltamv is read directly */ - - for (k = 0; k < 4; k++) { - - mb->mvs[k].x = (int32_t) ((TRB * mb->directmv[k].x) / TRD + mb->deltamv.x); - mb->b_mvs[k].x = (int32_t) ((mb->deltamv.x == 0) - ? ((TRB - TRD) * mb->directmv[k].x) / TRD - : mb->mvs[k].x - mb->directmv[k].x); - - mb->mvs[k].y = (int32_t) ((TRB * mb->directmv[k].y) / TRD + mb->deltamv.y); - mb->b_mvs[k].y = (int32_t) ((mb->deltamv.y == 0) - ? ((TRB - TRD) * mb->directmv[k].y) / TRD - : mb->mvs[k].y - mb->directmv[k].y); - } - } - else - { - mb->mvs[0].x = (int32_t) ((TRB * mb->directmv[0].x) / TRD + mb->deltamv.x); - - mb->b_mvs[0].x = (int32_t) ((mb->deltamv.x == 0) - ? ((TRB - TRD) * mb->directmv[0].x) / TRD - : mb->mvs[0].x - mb->directmv[0].x); - - mb->mvs[0].y = (int32_t) ((TRB * mb->directmv[0].y) / TRD + mb->deltamv.y); - - mb->b_mvs[0].y = (int32_t) ((mb->deltamv.y == 0) - ? ((TRB - TRD) * mb->directmv[0].y) / TRD - : mb->mvs[0].y - mb->directmv[0].y); - - mb->mvs[3] = mb->mvs[2] = mb->mvs[1] = mb->mvs[0]; - mb->b_mvs[3] = mb->b_mvs[2] = mb->b_mvs[1] = mb->b_mvs[0]; - } - - best_sad = d_sad16; - mb->mode = MODE_DIRECT; - } - - switch (mb->mode) - { - case MODE_FORWARD: - f_count++; - f_predMV = mb->mvs[0]; - break; - case MODE_BACKWARD: - b_count++; - b_predMV = mb->b_mvs[0]; - - break; - case MODE_INTERPOLATE: - i_count++; - mb->mvs[0] = f_interpolMV; - mb->b_mvs[0] = b_interpolMV; - f_predMV = mb->mvs[0]; - b_predMV = mb->b_mvs[0]; - break; - case MODE_DIRECT: - d_count++; - break; - default: - break; - } - - } - } - -#ifdef _DEBUG_BFRAME_STAT - fprintf(stderr,"B-Stat: F: %04d B: %04d I: %04d D: %04d\n", - f_count,b_count,i_count,d_count); -#endif - -}