1 |
/************************************************************************** |
/***************************************************************************** |
2 |
* |
* |
3 |
* XVID MPEG-4 VIDEO CODEC |
* XVID MPEG-4 VIDEO CODEC |
4 |
* motion estimation |
* - Motion Estimation module - |
5 |
|
* |
6 |
|
* Copyright(C) 2002 Christoph Lampert <gruel@web.de> |
7 |
|
* Copyright(C) 2002 Michael Militzer <michael@xvid.org> |
8 |
|
* Copyright(C) 2002 Edouard Gomez <ed.gomez@wanadoo.fr> |
9 |
* |
* |
10 |
* This program is an implementation of a part of one or more MPEG-4 |
* This program is an implementation of a part of one or more MPEG-4 |
11 |
* Video tools as specified in ISO/IEC 14496-2 standard. Those intending |
* Video tools as specified in ISO/IEC 14496-2 standard. Those intending |
28 |
* |
* |
29 |
* You should have received a copy of the GNU General Public License |
* You should have received a copy of the GNU General Public License |
30 |
* along with this program; if not, write to the Free Software |
* along with this program; if not, write to the Free Software |
31 |
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
32 |
* |
* |
33 |
*************************************************************************/ |
*************************************************************************/ |
34 |
|
|
|
/************************************************************************** |
|
|
* |
|
|
* Modifications: |
|
|
* |
|
|
* 01.05.2002 updated MotionEstimationBVOP |
|
|
* 25.04.2002 partial prevMB conversion |
|
|
* 22.04.2002 remove some compile warning by chenm001 <chenm001@163.com> |
|
|
* 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. |
|
|
* |
|
|
* Michael Militzer <isibaar@videocoding.de> |
|
|
* |
|
|
**************************************************************************/ |
|
|
|
|
35 |
#include <assert.h> |
#include <assert.h> |
36 |
#include <stdio.h> |
#include <stdio.h> |
37 |
#include <stdlib.h> |
#include <stdlib.h> |
141 |
static const VECTOR zeroMV = { 0, 0 }; |
static const VECTOR zeroMV = { 0, 0 }; |
142 |
VECTOR predMV; |
VECTOR predMV; |
143 |
|
|
144 |
int32_t x, y; |
uint32_t x, y; |
145 |
int32_t iIntra = 0; |
uint32_t iIntra = 0; |
146 |
VECTOR pmv; |
VECTOR pmv; |
147 |
|
|
148 |
if (sadInit) |
if (sadInit) |
153 |
|
|
154 |
MACROBLOCK *const pMB = &pMBs[x + y * iWcount]; |
MACROBLOCK *const pMB = &pMBs[x + y * iWcount]; |
155 |
|
|
156 |
|
if (pMB->mode == MODE_NOT_CODED) |
157 |
|
continue; |
158 |
|
|
159 |
predMV = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); |
predMV = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); |
160 |
|
|
161 |
pMB->sad16 = |
pMB->sad16 = |
428 |
/* Do a diamond search around given starting point, return SAD of best */ |
/* Do a diamond search around given starting point, return SAD of best */ |
429 |
|
|
430 |
int32_t iDirection = 0; |
int32_t iDirection = 0; |
431 |
|
int32_t iDirectionBackup; |
432 |
int32_t iSAD; |
int32_t iSAD; |
433 |
VECTOR backupMV; |
VECTOR backupMV; |
434 |
|
|
442 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y - iDiamondSize, 3); |
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y - iDiamondSize, 3); |
443 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y + iDiamondSize, 4); |
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y + iDiamondSize, 4); |
444 |
|
|
445 |
if (iDirection) |
if (iDirection) { |
446 |
while (!iFound) { |
while (!iFound) { |
447 |
iFound = 1; |
iFound = 1; |
448 |
backupMV = *currMV; |
backupMV = *currMV; |
449 |
|
iDirectionBackup = iDirection; |
450 |
|
|
451 |
if (iDirection != 2) |
if (iDirectionBackup != 2) |
452 |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
453 |
backupMV.y, 1); |
backupMV.y, 1); |
454 |
if (iDirection != 1) |
if (iDirectionBackup != 1) |
455 |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
456 |
backupMV.y, 2); |
backupMV.y, 2); |
457 |
if (iDirection != 4) |
if (iDirectionBackup != 4) |
458 |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, |
459 |
backupMV.y - iDiamondSize, 3); |
backupMV.y - iDiamondSize, 3); |
460 |
if (iDirection != 3) |
if (iDirectionBackup != 3) |
461 |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, |
462 |
backupMV.y + iDiamondSize, 4); |
backupMV.y + iDiamondSize, 4); |
463 |
|
} |
464 |
} else { |
} else { |
465 |
currMV->x = start_x; |
currMV->x = start_x; |
466 |
currMV->y = start_y; |
currMV->y = start_y; |
524 |
backupMV.y + iDiamondSize, 8); |
backupMV.y + iDiamondSize, 8); |
525 |
|
|
526 |
|
|
527 |
if (iDirection) |
if (iDirection) { |
528 |
while (!iFound) { |
while (!iFound) { |
529 |
iFound = 1; |
iFound = 1; |
530 |
backupMV = *currMV; |
backupMV = *currMV; |
533 |
case 1: |
case 1: |
534 |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
535 |
backupMV.y, 1); |
backupMV.y, 1); |
536 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
537 |
backupMV.y - iDiamondSize, 5); |
backupMV.y - iDiamondSize, 5); |
538 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
539 |
backupMV.y - iDiamondSize, 7); |
backupMV.y - iDiamondSize, 7); |
540 |
break; |
break; |
541 |
case 2: |
case 2: |
542 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, backupMV.y, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, backupMV.y, |
543 |
2); |
2); |
544 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
545 |
backupMV.y + iDiamondSize, 6); |
backupMV.y + iDiamondSize, 6); |
546 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
547 |
backupMV.y + iDiamondSize, 8); |
backupMV.y + iDiamondSize, 8); |
548 |
break; |
break; |
549 |
|
|
550 |
case 3: |
case 3: |
551 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, backupMV.y + iDiamondSize, |
552 |
4); |
4); |
553 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
554 |
backupMV.y - iDiamondSize, 7); |
backupMV.y - iDiamondSize, 7); |
555 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
556 |
backupMV.y + iDiamondSize, 8); |
backupMV.y + iDiamondSize, 8); |
557 |
break; |
break; |
558 |
|
|
559 |
case 4: |
case 4: |
560 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, backupMV.y - iDiamondSize, |
561 |
3); |
3); |
562 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
563 |
backupMV.y - iDiamondSize, 5); |
backupMV.y - iDiamondSize, 5); |
564 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
565 |
backupMV.y + iDiamondSize, 6); |
backupMV.y + iDiamondSize, 6); |
566 |
break; |
break; |
567 |
|
|
568 |
case 5: |
case 5: |
569 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, backupMV.y, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, backupMV.y, |
570 |
1); |
1); |
571 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, backupMV.y - iDiamondSize, |
572 |
3); |
3); |
573 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
574 |
backupMV.y - iDiamondSize, 5); |
backupMV.y - iDiamondSize, 5); |
575 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
576 |
backupMV.y + iDiamondSize, 6); |
backupMV.y + iDiamondSize, 6); |
577 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
578 |
backupMV.y - iDiamondSize, 7); |
backupMV.y - iDiamondSize, 7); |
579 |
break; |
break; |
580 |
|
|
581 |
case 6: |
case 6: |
582 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, backupMV.y, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, backupMV.y, |
583 |
2); |
2); |
584 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, backupMV.y - iDiamondSize, |
585 |
3); |
3); |
586 |
|
|
587 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
588 |
backupMV.y - iDiamondSize, 5); |
backupMV.y - iDiamondSize, 5); |
589 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
590 |
backupMV.y + iDiamondSize, 6); |
backupMV.y + iDiamondSize, 6); |
591 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
592 |
backupMV.y + iDiamondSize, 8); |
backupMV.y + iDiamondSize, 8); |
593 |
|
|
594 |
break; |
break; |
596 |
case 7: |
case 7: |
597 |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
598 |
backupMV.y, 1); |
backupMV.y, 1); |
599 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, backupMV.y + iDiamondSize, |
600 |
4); |
4); |
601 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
602 |
backupMV.y - iDiamondSize, 5); |
backupMV.y - iDiamondSize, 5); |
603 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
604 |
backupMV.y - iDiamondSize, 7); |
backupMV.y - iDiamondSize, 7); |
605 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
606 |
backupMV.y + iDiamondSize, 8); |
backupMV.y + iDiamondSize, 8); |
607 |
break; |
break; |
608 |
|
|
609 |
case 8: |
case 8: |
610 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, backupMV.y, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, backupMV.y, |
611 |
2); |
2); |
612 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, backupMV.y + iDiamondSize, |
613 |
4); |
4); |
614 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
615 |
backupMV.y + iDiamondSize, 6); |
backupMV.y + iDiamondSize, 6); |
616 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
617 |
backupMV.y - iDiamondSize, 7); |
backupMV.y - iDiamondSize, 7); |
618 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
619 |
backupMV.y + iDiamondSize, 8); |
backupMV.y + iDiamondSize, 8); |
620 |
break; |
break; |
621 |
default: |
default: |
622 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, backupMV.y, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, backupMV.y, |
623 |
1); |
1); |
624 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, backupMV.y, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, backupMV.y, |
625 |
2); |
2); |
626 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, backupMV.y - iDiamondSize, |
627 |
3); |
3); |
628 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, backupMV.y + iDiamondSize, |
629 |
4); |
4); |
630 |
|
|
631 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
632 |
backupMV.y - iDiamondSize, 5); |
backupMV.y - iDiamondSize, 5); |
633 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
634 |
backupMV.y + iDiamondSize, 6); |
backupMV.y + iDiamondSize, 6); |
635 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
636 |
backupMV.y - iDiamondSize, 7); |
backupMV.y - iDiamondSize, 7); |
637 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
638 |
backupMV.y + iDiamondSize, 8); |
backupMV.y + iDiamondSize, 8); |
639 |
break; |
break; |
640 |
} |
} |
641 |
|
} |
642 |
} else { |
} else { |
643 |
currMV->x = start_x; |
currMV->x = start_x; |
644 |
currMV->y = start_y; |
currMV->y = start_y; |
693 |
const uint8_t * const cur, |
const uint8_t * const cur, |
694 |
const int x, |
const int x, |
695 |
const int y, |
const int y, |
696 |
int start_x, |
const int start_xi, |
697 |
int start_y, |
const int start_yi, |
698 |
int iMinSAD, |
int iMinSAD, |
699 |
VECTOR * const currMV, |
VECTOR * const currMV, |
700 |
const int center_x, |
const int center_x, |
711 |
{ |
{ |
712 |
|
|
713 |
int32_t iSAD; |
int32_t iSAD; |
714 |
|
int start_x = start_xi, start_y = start_yi; |
715 |
|
|
716 |
/* directions: 1 - left (x-1); 2 - right (x+1), 4 - up (y-1); 8 - down (y+1) */ |
/* directions: 1 - left (x-1); 2 - right (x+1), 4 - up (y-1); 8 - down (y+1) */ |
717 |
|
|
845 |
return iMinSAD; |
return iMinSAD; |
846 |
} |
} |
847 |
|
|
848 |
|
#define CHECK_MV16_F_INTERPOL(X,Y) { \ |
849 |
#define CHECK_MV16_F_INTERPOL(X,Y,BX,BY) { \ |
if ( ((X) <= f_max_dx) && ((X) >= f_min_dx) \ |
850 |
if ( ((X) <= max_dx) && ((X) >= min_dx) \ |
&& ((Y) <= f_max_dy) && ((Y) >= f_min_dy) ) \ |
|
&& ((Y) <= max_dy) && ((Y) >= min_dy) ) \ |
|
851 |
{ \ |
{ \ |
852 |
iSAD = sad16( cur, get_ref(pRef, pRefH, pRefV, pRefHV, x, y, 16, X, Y, iEdgedWidth),iEdgedWidth, iMinSAD); \ |
iSAD = sad16bi( cur, \ |
853 |
iSAD += calc_delta_16((X) - center_x, (Y) - center_y, (uint8_t)iFcode, iQuant);\ |
get_ref(f_pRef, f_pRefH, f_pRefV, f_pRefHV, x, y, 16, X, Y, iEdgedWidth), \ |
854 |
|
get_ref(b_pRef, b_pRefH, b_pRefV, b_pRefHV, x, y, 16, b_currMV->x, b_currMV->y, iEdgedWidth), \ |
855 |
|
iEdgedWidth); \ |
856 |
|
iSAD += calc_delta_16((X) - f_center_x, (Y) - f_center_y, (uint8_t)f_iFcode, iQuant);\ |
857 |
|
iSAD += calc_delta_16(b_currMV->x - b_center_x, b_currMV->y - b_center_y, (uint8_t)b_iFcode, iQuant);\ |
858 |
if (iSAD < iMinSAD) \ |
if (iSAD < iMinSAD) \ |
859 |
{ iMinSAD=iSAD; currMV->x=(X); currMV->y=(Y); } } \ |
{ iMinSAD=iSAD; f_currMV->x=(X); f_currMV->y=(Y); } } \ |
860 |
} |
} |
861 |
|
|
862 |
#define CHECK_MV16_F_INTERPOL_DIR(X,Y,BX,BY,D) { \ |
#define CHECK_MV16_F_INTERPOL_FOUND(X,Y) { \ |
863 |
if ( ((X) <= max_dx) && ((X) >= min_dx) \ |
if ( ((X) <= f_max_dx) && ((X) >= f_min_dx) \ |
864 |
&& ((Y) <= max_dy) && ((Y) >= min_dy) ) \ |
&& ((Y) <= f_max_dy) && ((Y) >= f_min_dy) ) \ |
865 |
{ \ |
{ \ |
866 |
iSAD = sad16( cur, get_ref(pRef, pRefH, pRefV, pRefHV, x, y, 16, X, Y, iEdgedWidth),iEdgedWidth, iMinSAD); \ |
iSAD = sad16bi( cur, \ |
867 |
iSAD += calc_delta_16((X) - center_x, (Y) - center_y, (uint8_t)iFcode, iQuant);\ |
get_ref(f_pRef, f_pRefH, f_pRefV, f_pRefHV, x, y, 16, X, Y, iEdgedWidth), \ |
868 |
|
get_ref(b_pRef, b_pRefH, b_pRefV, b_pRefHV, x, y, 16, b_currMV->x, b_currMV->y, iEdgedWidth), \ |
869 |
|
iEdgedWidth); \ |
870 |
|
iSAD += calc_delta_16((X) - f_center_x, (Y) - f_center_y, (uint8_t)f_iFcode, iQuant);\ |
871 |
|
iSAD += calc_delta_16(b_currMV->x - b_center_x, b_currMV->y - b_center_y, (uint8_t)b_iFcode, iQuant);\ |
872 |
if (iSAD < iMinSAD) \ |
if (iSAD < iMinSAD) \ |
873 |
{ iMinSAD=iSAD; currMV->x=(X); currMV->y=(Y); iDirection=(D); } } \ |
{ iMinSAD=iSAD; f_currMV->x=(X); f_currMV->y=(Y); iFound=0;} } \ |
874 |
} |
} |
875 |
|
|
876 |
#define CHECK_MV16_F_INTERPOL_FOUND(X,Y,BX,BY,D) { \ |
#define CHECK_MV16_B_INTERPOL(X,Y) { \ |
877 |
if ( ((X) <= max_dx) && ((X) >= min_dx) \ |
if ( ((X) <= b_max_dx) && ((X) >= b_min_dx) \ |
878 |
&& ((Y) <= max_dy) && ((Y) >= min_dy) ) \ |
&& ((Y) <= b_max_dy) && ((Y) >= b_min_dy) ) \ |
879 |
{ \ |
{ \ |
880 |
iSAD = sad16( cur, get_ref(pRef, pRefH, pRefV, pRefHV, x, y, 16, X, Y, iEdgedWidth),iEdgedWidth, iMinSAD); \ |
iSAD = sad16bi( cur, \ |
881 |
iSAD += calc_delta_16((X) - center_x, (Y) - center_y, (uint8_t)iFcode, iQuant);\ |
get_ref(f_pRef, f_pRefH, f_pRefV, f_pRefHV, x, y, 16, f_currMV->x, f_currMV->y, iEdgedWidth), \ |
882 |
|
get_ref(b_pRef, b_pRefH, b_pRefV, b_pRefHV, x, y, 16, X, Y, iEdgedWidth), \ |
883 |
|
iEdgedWidth); \ |
884 |
|
iSAD += calc_delta_16(f_currMV->x - f_center_x, f_currMV->y - f_center_y, (uint8_t)f_iFcode, iQuant);\ |
885 |
|
iSAD += calc_delta_16((X) - b_center_x, (Y) - b_center_y, (uint8_t)b_iFcode, iQuant);\ |
886 |
if (iSAD < iMinSAD) \ |
if (iSAD < iMinSAD) \ |
887 |
{ iMinSAD=iSAD; currMV->x=(X); currMV->y=(Y); iDirection=(D); iFound=0; } } \ |
{ iMinSAD=iSAD; b_currMV->x=(X); b_currMV->y=(Y); } } \ |
888 |
} |
} |
889 |
|
|
890 |
|
#define CHECK_MV16_B_INTERPOL_FOUND(X,Y) { \ |
891 |
#define CHECK_MV16_B_INTERPOL(FX,FY,X,Y) { \ |
if ( ((X) <= b_max_dx) && ((X) >= b_min_dx) \ |
892 |
if ( ((X) <= max_dx) && ((X) >= min_dx) \ |
&& ((Y) <= b_max_dy) && ((Y) >= b_min_dy) ) \ |
|
&& ((Y) <= max_dy) && ((Y) >= min_dy) ) \ |
|
893 |
{ \ |
{ \ |
894 |
iSAD = sad16( cur, get_ref(pRef, pRefH, pRefV, pRefHV, x, y, 16, X, Y, iEdgedWidth),iEdgedWidth, iMinSAD); \ |
iSAD = sad16bi( cur, \ |
895 |
iSAD += calc_delta_16((X) - center_x, (Y) - center_y, (uint8_t)iFcode, iQuant);\ |
get_ref(f_pRef, f_pRefH, f_pRefV, f_pRefHV, x, y, 16, f_currMV->x, f_currMV->y, iEdgedWidth), \ |
896 |
if (iSAD < iMinSAD) \ |
get_ref(b_pRef, b_pRefH, b_pRefV, b_pRefHV, x, y, 16, X, Y, iEdgedWidth), \ |
897 |
{ iMinSAD=iSAD; currMV->x=(X); currMV->y=(Y); } } \ |
iEdgedWidth); \ |
898 |
} |
iSAD += calc_delta_16(f_currMV->x - f_center_x, f_currMV->y - f_center_y, (uint8_t)f_iFcode, iQuant);\ |
899 |
|
iSAD += calc_delta_16((X) - b_center_x, (Y) - b_center_y, (uint8_t)b_iFcode, iQuant);\ |
|
|
|
|
#define CHECK_MV16_B_INTERPOL_DIR(FX,FY,X,Y,D) { \ |
|
|
if ( ((X) <= max_dx) && ((X) >= min_dx) \ |
|
|
&& ((Y) <= max_dy) && ((Y) >= min_dy) ) \ |
|
|
{ \ |
|
|
iSAD = sad16( cur, get_ref(pRef, pRefH, pRefV, pRefHV, x, y, 16, X, Y, iEdgedWidth),iEdgedWidth, iMinSAD); \ |
|
|
iSAD += calc_delta_16((X) - center_x, (Y) - center_y, (uint8_t)iFcode, iQuant);\ |
|
|
if (iSAD < iMinSAD) \ |
|
|
{ iMinSAD=iSAD; currMV->x=(X); currMV->y=(Y); iDirection=(D); } } \ |
|
|
} |
|
|
|
|
|
|
|
|
#define CHECK_MV16_B_INTERPOL_FOUND(FX,FY,X,Y,D) { \ |
|
|
if ( ((X) <= max_dx) && ((X) >= min_dx) \ |
|
|
&& ((Y) <= max_dy) && ((Y) >= min_dy) ) \ |
|
|
{ \ |
|
|
iSAD = sad16( cur, get_ref(pRef, pRefH, pRefV, pRefHV, x, y, 16, X, Y, iEdgedWidth),iEdgedWidth, iMinSAD); \ |
|
|
iSAD += calc_delta_16((X) - center_x, (Y) - center_y, (uint8_t)iFcode, iQuant);\ |
|
900 |
if (iSAD < iMinSAD) \ |
if (iSAD < iMinSAD) \ |
901 |
{ iMinSAD=iSAD; currMV->x=(X); currMV->y=(Y); iDirection=(D); iFound=0; } } \ |
{ iMinSAD=iSAD; b_currMV->x=(X); b_currMV->y=(Y); iFound=0;} } \ |
902 |
} |
} |
903 |
|
|
|
|
|
|
#if (0==1) |
|
904 |
int32_t |
int32_t |
905 |
Diamond16_InterpolMainSearch( |
Diamond16_InterpolMainSearch(const uint8_t * const f_pRef, |
|
const uint8_t * const f_pRef, |
|
906 |
const uint8_t * const f_pRefH, |
const uint8_t * const f_pRefH, |
907 |
const uint8_t * const f_pRefV, |
const uint8_t * const f_pRefV, |
908 |
const uint8_t * const f_pRefHV, |
const uint8_t * const f_pRefHV, |
909 |
|
|
910 |
const uint8_t * const cur, |
const uint8_t * const cur, |
911 |
|
|
912 |
const uint8_t * const b_pRef, |
const uint8_t * const b_pRef, |
931 |
const int b_center_x, |
const int b_center_x, |
932 |
const int b_center_y, |
const int b_center_y, |
933 |
|
|
934 |
const int32_t min_dx, |
const int32_t f_min_dx, |
935 |
const int32_t max_dx, |
const int32_t f_max_dx, |
936 |
const int32_t min_dy, |
const int32_t f_min_dy, |
937 |
const int32_t max_dy, |
const int32_t f_max_dy, |
938 |
|
|
939 |
|
const int32_t b_min_dx, |
940 |
|
const int32_t b_max_dx, |
941 |
|
const int32_t b_min_dy, |
942 |
|
const int32_t b_max_dy, |
943 |
|
|
944 |
const int32_t iEdgedWidth, |
const int32_t iEdgedWidth, |
945 |
const int32_t iDiamondSize, |
const int32_t iDiamondSize, |
946 |
|
|
952 |
{ |
{ |
953 |
/* Do a diamond search around given starting point, return SAD of best */ |
/* Do a diamond search around given starting point, return SAD of best */ |
954 |
|
|
|
int32_t f_iDirection = 0; |
|
|
int32_t b_iDirection = 0; |
|
955 |
int32_t iSAD; |
int32_t iSAD; |
956 |
|
|
957 |
VECTOR f_backupMV; |
VECTOR f_backupMV; |
958 |
VECTOR b_backupMV; |
VECTOR b_backupMV; |
959 |
|
|
960 |
f_backupMV.x = start_x; |
f_currMV->x = f_start_x; |
961 |
f_backupMV.y = start_y; |
f_currMV->y = f_start_y; |
962 |
b_backupMV.x = start_x; |
b_currMV->x = b_start_x; |
963 |
b_backupMV.y = start_y; |
b_currMV->y = b_start_y; |
964 |
|
|
965 |
/* It's one search with full Diamond pattern, and only 3 of 4 for all following diamonds */ |
do |
966 |
|
{ |
967 |
|
iFound = 1; |
968 |
|
|
969 |
CHECK_MV16_CANDIDATE_DIR(backupMV.x - iDiamondSize, backupMV.y, 1); |
f_backupMV = *f_currMV; |
|
CHECK_MV16_CANDIDATE_DIR(backupMV.x + iDiamondSize, backupMV.y, 2); |
|
|
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y - iDiamondSize, 3); |
|
|
CHECK_MV16_CANDIDATE_DIR(backupMV.x, backupMV.y + iDiamondSize, 4); |
|
970 |
|
|
971 |
if (iDirection) |
CHECK_MV16_F_INTERPOL_FOUND(f_backupMV.x - iDiamondSize, f_backupMV.y); |
972 |
while (!iFound) { |
CHECK_MV16_F_INTERPOL_FOUND(f_backupMV.x + iDiamondSize, f_backupMV.y); |
973 |
iFound = 1; |
CHECK_MV16_F_INTERPOL_FOUND(f_backupMV.x, f_backupMV.y - iDiamondSize); |
974 |
backupMV = *currMV; |
CHECK_MV16_F_INTERPOL_FOUND(f_backupMV.x, f_backupMV.y + iDiamondSize); |
975 |
|
|
976 |
|
b_backupMV = *b_currMV; |
977 |
|
|
978 |
|
CHECK_MV16_B_INTERPOL_FOUND(b_backupMV.x - iDiamondSize, b_backupMV.y); |
979 |
|
CHECK_MV16_B_INTERPOL_FOUND(b_backupMV.x + iDiamondSize, b_backupMV.y); |
980 |
|
CHECK_MV16_B_INTERPOL_FOUND(b_backupMV.x, b_backupMV.y - iDiamondSize); |
981 |
|
CHECK_MV16_B_INTERPOL_FOUND(b_backupMV.x, b_backupMV.y + iDiamondSize); |
982 |
|
|
983 |
|
} while (!iFound); |
984 |
|
|
985 |
|
return iMinSAD; |
986 |
|
} |
987 |
|
|
988 |
|
/* Sorry, these MACROS really got too large... I'll turn them into function soon! */ |
989 |
|
|
990 |
|
#define CHECK_MV16_DIRECT_FOUND(X,Y) \ |
991 |
|
if ( (X)>=(-32) && (X)<=(31) && ((Y)>=-32) && ((Y)<=31) ) \ |
992 |
|
{ int k;\ |
993 |
|
VECTOR mvs,b_mvs; \ |
994 |
|
iSAD = 0;\ |
995 |
|
for (k = 0; k < 4; k++) { \ |
996 |
|
mvs.x = (int32_t) ((TRB * directmv[k].x) / TRD + (X)); \ |
997 |
|
b_mvs.x = (int32_t) (((X) == 0) \ |
998 |
|
? ((TRB - TRD) * directmv[k].x) / TRD \ |
999 |
|
: mvs.x - directmv[k].x); \ |
1000 |
|
\ |
1001 |
|
mvs.y = (int32_t) ((TRB * directmv[k].y) / TRD + (Y)); \ |
1002 |
|
b_mvs.y = (int32_t) (((Y) == 0) \ |
1003 |
|
? ((TRB - TRD) * directmv[k].y) / TRD \ |
1004 |
|
: mvs.y - directmv[k].y); \ |
1005 |
|
\ |
1006 |
|
if ( (mvs.x <= max_dx) && (mvs.x >= min_dx) \ |
1007 |
|
&& (mvs.y <= max_dy) && (mvs.y >= min_dy) \ |
1008 |
|
&& (b_mvs.x <= max_dx) && (b_mvs.x >= min_dx) \ |
1009 |
|
&& (b_mvs.y <= max_dy) && (b_mvs.y >= min_dy) ) { \ |
1010 |
|
iSAD += sad8bi( cur + 8*(k&1) + 8*(k>>1)*iEdgedWidth, \ |
1011 |
|
get_ref(f_pRef, f_pRefH, f_pRefV, f_pRefHV, 2*x+(k&1), 2*y+(k>>1), 8, \ |
1012 |
|
mvs.x, mvs.y, iEdgedWidth), \ |
1013 |
|
get_ref(b_pRef, b_pRefH, b_pRefV, b_pRefHV, 2*x+(k&1), 2*y+(k>>1), 8, \ |
1014 |
|
b_mvs.x, b_mvs.y, iEdgedWidth), \ |
1015 |
|
iEdgedWidth); \ |
1016 |
|
} \ |
1017 |
|
else \ |
1018 |
|
iSAD = 65535; \ |
1019 |
|
} \ |
1020 |
|
iSAD += calc_delta_16((X),(Y), 1, iQuant);\ |
1021 |
|
if (iSAD < iMinSAD) \ |
1022 |
|
{ iMinSAD=iSAD; currMV->x=(X); currMV->y=(Y); iFound=0; } \ |
1023 |
|
} |
1024 |
|
|
1025 |
|
|
1026 |
|
|
1027 |
|
int32_t |
1028 |
|
Diamond16_DirectMainSearch( |
1029 |
|
const uint8_t * const f_pRef, |
1030 |
|
const uint8_t * const f_pRefH, |
1031 |
|
const uint8_t * const f_pRefV, |
1032 |
|
const uint8_t * const f_pRefHV, |
1033 |
|
|
1034 |
|
const uint8_t * const cur, |
1035 |
|
|
1036 |
|
const uint8_t * const b_pRef, |
1037 |
|
const uint8_t * const b_pRefH, |
1038 |
|
const uint8_t * const b_pRefV, |
1039 |
|
const uint8_t * const b_pRefHV, |
1040 |
|
|
1041 |
|
const int x, |
1042 |
|
const int y, |
1043 |
|
|
1044 |
|
const int TRB, |
1045 |
|
const int TRD, |
1046 |
|
|
1047 |
|
const int start_x, |
1048 |
|
const int start_y, |
1049 |
|
|
1050 |
|
int iMinSAD, |
1051 |
|
VECTOR * const currMV, |
1052 |
|
const VECTOR * const directmv, |
1053 |
|
|
1054 |
|
const int32_t min_dx, |
1055 |
|
const int32_t max_dx, |
1056 |
|
const int32_t min_dy, |
1057 |
|
const int32_t max_dy, |
1058 |
|
|
1059 |
|
const int32_t iEdgedWidth, |
1060 |
|
const int32_t iDiamondSize, |
1061 |
|
|
1062 |
|
const int32_t iQuant, |
1063 |
|
int iFound) |
1064 |
|
{ |
1065 |
|
/* Do a diamond search around given starting point, return SAD of best */ |
1066 |
|
|
1067 |
|
int32_t iSAD; |
1068 |
|
|
1069 |
|
VECTOR backupMV; |
1070 |
|
|
|
if (iDirection != 2) |
|
|
CHECK_MV16_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
|
|
backupMV.y, 1); |
|
|
if (iDirection != 1) |
|
|
CHECK_MV16_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
|
|
backupMV.y, 2); |
|
|
if (iDirection != 4) |
|
|
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, |
|
|
backupMV.y - iDiamondSize, 3); |
|
|
if (iDirection != 3) |
|
|
CHECK_MV16_CANDIDATE_FOUND(backupMV.x, |
|
|
backupMV.y + iDiamondSize, 4); |
|
|
} else { |
|
1071 |
currMV->x = start_x; |
currMV->x = start_x; |
1072 |
currMV->y = start_y; |
currMV->y = start_y; |
1073 |
} |
|
1074 |
|
/* It's one search with full Diamond pattern, and only 3 of 4 for all following diamonds */ |
1075 |
|
|
1076 |
|
do |
1077 |
|
{ |
1078 |
|
iFound = 1; |
1079 |
|
|
1080 |
|
backupMV = *currMV; |
1081 |
|
|
1082 |
|
CHECK_MV16_DIRECT_FOUND(backupMV.x - iDiamondSize, backupMV.y); |
1083 |
|
CHECK_MV16_DIRECT_FOUND(backupMV.x + iDiamondSize, backupMV.y); |
1084 |
|
CHECK_MV16_DIRECT_FOUND(backupMV.x, backupMV.y - iDiamondSize); |
1085 |
|
CHECK_MV16_DIRECT_FOUND(backupMV.x, backupMV.y + iDiamondSize); |
1086 |
|
|
1087 |
|
} while (!iFound); |
1088 |
|
|
1089 |
return iMinSAD; |
return iMinSAD; |
1090 |
} |
} |
|
#endif |
|
1091 |
|
|
1092 |
|
|
1093 |
int32_t |
int32_t |
1098 |
const uint8_t * const cur, |
const uint8_t * const cur, |
1099 |
const int x, |
const int x, |
1100 |
const int y, |
const int y, |
1101 |
int start_x, |
const int start_xi, |
1102 |
int start_y, |
const int start_yi, |
1103 |
int iMinSAD, |
int iMinSAD, |
1104 |
VECTOR * const currMV, |
VECTOR * const currMV, |
1105 |
const int center_x, |
const int center_x, |
1116 |
{ |
{ |
1117 |
|
|
1118 |
int32_t iSAD; |
int32_t iSAD; |
1119 |
|
int start_x = start_xi, start_y = start_yi; |
1120 |
|
|
1121 |
/* directions: 1 - left (x-1); 2 - right (x+1), 4 - up (y-1); 8 - down (y+1) */ |
/* directions: 1 - left (x-1); 2 - right (x+1), 4 - up (y-1); 8 - down (y+1) */ |
1122 |
|
|
1339 |
const IMAGE * const pCur, |
const IMAGE * const pCur, |
1340 |
const int x, |
const int x, |
1341 |
const int y, |
const int y, |
1342 |
const int start_x, |
const int start_x, /* start is searched first, so it should contain the most */ |
1343 |
const int start_y, |
const int start_y, /* likely motion vector for this block */ |
1344 |
const int center_x, |
const int center_x, /* center is from where length of MVs is measured */ |
1345 |
const int center_y, |
const int center_y, |
1346 |
const uint32_t MotionFlags, |
const uint32_t MotionFlags, |
1347 |
const uint32_t iQuant, |
const uint32_t iQuant, |
1396 |
} |
} |
1397 |
|
|
1398 |
/* because we might use something like IF (dx>max_dx) THEN dx=max_dx; */ |
/* because we might use something like IF (dx>max_dx) THEN dx=max_dx; */ |
|
//bPredEq = get_pmvdata(pMBs, x, y, iWcount, 0, pmv, psad); |
|
1399 |
bPredEq = get_pmvdata2(pMBs, iWcount, 0, x, y, 0, pmv, psad); |
bPredEq = get_pmvdata2(pMBs, iWcount, 0, x, y, 0, pmv, psad); |
1400 |
|
|
1401 |
if ((x == 0) && (y == 0)) { |
if ((x == 0) && (y == 0)) { |
1453 |
if ((iMinSAD < 256) || |
if ((iMinSAD < 256) || |
1454 |
((MVequal(*currMV, prevMB->mvs[0])) && |
((MVequal(*currMV, prevMB->mvs[0])) && |
1455 |
((int32_t) iMinSAD < prevMB->sad16))) { |
((int32_t) iMinSAD < prevMB->sad16))) { |
1456 |
if (iMinSAD < 2 * iQuant) // high chances for SKIP-mode |
if (iMinSAD < (int)(2 * iQuant)) // high chances for SKIP-mode |
1457 |
{ |
{ |
1458 |
if (!MVzero(*currMV)) { |
if (!MVzero(*currMV)) { |
1459 |
iMinSAD += MV16_00_BIAS; |
iMinSAD += MV16_00_BIAS; |
1658 |
const uint8_t * const cur, |
const uint8_t * const cur, |
1659 |
const int x, |
const int x, |
1660 |
const int y, |
const int y, |
1661 |
int32_t start_x, |
const int32_t start_x, |
1662 |
int32_t start_y, |
const int32_t start_y, |
1663 |
int32_t iMinSAD, |
int32_t iMinSAD, |
1664 |
VECTOR * const currMV, |
VECTOR * const currMV, |
1665 |
const int center_x, |
const int center_x, |
1677 |
/* Do a diamond search around given starting point, return SAD of best */ |
/* Do a diamond search around given starting point, return SAD of best */ |
1678 |
|
|
1679 |
int32_t iDirection = 0; |
int32_t iDirection = 0; |
1680 |
|
int32_t iDirectionBackup; |
1681 |
int32_t iSAD; |
int32_t iSAD; |
1682 |
VECTOR backupMV; |
VECTOR backupMV; |
1683 |
|
|
1691 |
CHECK_MV8_CANDIDATE_DIR(backupMV.x, backupMV.y - iDiamondSize, 3); |
CHECK_MV8_CANDIDATE_DIR(backupMV.x, backupMV.y - iDiamondSize, 3); |
1692 |
CHECK_MV8_CANDIDATE_DIR(backupMV.x, backupMV.y + iDiamondSize, 4); |
CHECK_MV8_CANDIDATE_DIR(backupMV.x, backupMV.y + iDiamondSize, 4); |
1693 |
|
|
1694 |
if (iDirection) |
if (iDirection) { |
1695 |
while (!iFound) { |
while (!iFound) { |
1696 |
iFound = 1; |
iFound = 1; |
1697 |
backupMV = *currMV; // since iDirection!=0, this is well defined! |
backupMV = *currMV; // since iDirection!=0, this is well defined! |
1698 |
|
iDirectionBackup = iDirection; |
1699 |
|
|
1700 |
if (iDirection != 2) |
if (iDirectionBackup != 2) |
1701 |
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1702 |
backupMV.y, 1); |
backupMV.y, 1); |
1703 |
if (iDirection != 1) |
if (iDirectionBackup != 1) |
1704 |
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1705 |
backupMV.y, 2); |
backupMV.y, 2); |
1706 |
if (iDirection != 4) |
if (iDirectionBackup != 4) |
1707 |
CHECK_MV8_CANDIDATE_FOUND(backupMV.x, |
CHECK_MV8_CANDIDATE_FOUND(backupMV.x, |
1708 |
backupMV.y - iDiamondSize, 3); |
backupMV.y - iDiamondSize, 3); |
1709 |
if (iDirection != 3) |
if (iDirectionBackup != 3) |
1710 |
CHECK_MV8_CANDIDATE_FOUND(backupMV.x, |
CHECK_MV8_CANDIDATE_FOUND(backupMV.x, |
1711 |
backupMV.y + iDiamondSize, 4); |
backupMV.y + iDiamondSize, 4); |
1712 |
|
} |
1713 |
|
} else { |
1714 |
|
currMV->x = start_x; |
1715 |
|
currMV->y = start_y; |
1716 |
|
} |
1717 |
|
return iMinSAD; |
1718 |
|
} |
1719 |
|
|
1720 |
|
|
1721 |
|
|
1722 |
|
|
1723 |
|
int32_t |
1724 |
|
Square8_MainSearch(const uint8_t * const pRef, |
1725 |
|
const uint8_t * const pRefH, |
1726 |
|
const uint8_t * const pRefV, |
1727 |
|
const uint8_t * const pRefHV, |
1728 |
|
const uint8_t * const cur, |
1729 |
|
const int x, |
1730 |
|
const int y, |
1731 |
|
const int32_t start_x, |
1732 |
|
const int32_t start_y, |
1733 |
|
int32_t iMinSAD, |
1734 |
|
VECTOR * const currMV, |
1735 |
|
const int center_x, |
1736 |
|
const int center_y, |
1737 |
|
const int32_t min_dx, |
1738 |
|
const int32_t max_dx, |
1739 |
|
const int32_t min_dy, |
1740 |
|
const int32_t max_dy, |
1741 |
|
const int32_t iEdgedWidth, |
1742 |
|
const int32_t iDiamondSize, |
1743 |
|
const int32_t iFcode, |
1744 |
|
const int32_t iQuant, |
1745 |
|
int iFound) |
1746 |
|
{ |
1747 |
|
/* Do a square search around given starting point, return SAD of best */ |
1748 |
|
|
1749 |
|
int32_t iDirection = 0; |
1750 |
|
int32_t iSAD; |
1751 |
|
VECTOR backupMV; |
1752 |
|
|
1753 |
|
backupMV.x = start_x; |
1754 |
|
backupMV.y = start_y; |
1755 |
|
|
1756 |
|
/* It's one search with full square pattern, and new parts for all following diamonds */ |
1757 |
|
|
1758 |
|
/* new direction are extra, so 1-4 is normal diamond |
1759 |
|
537 |
1760 |
|
1*2 |
1761 |
|
648 |
1762 |
|
*/ |
1763 |
|
|
1764 |
|
CHECK_MV8_CANDIDATE_DIR(backupMV.x - iDiamondSize, backupMV.y, 1); |
1765 |
|
CHECK_MV8_CANDIDATE_DIR(backupMV.x + iDiamondSize, backupMV.y, 2); |
1766 |
|
CHECK_MV8_CANDIDATE_DIR(backupMV.x, backupMV.y - iDiamondSize, 3); |
1767 |
|
CHECK_MV8_CANDIDATE_DIR(backupMV.x, backupMV.y + iDiamondSize, 4); |
1768 |
|
|
1769 |
|
CHECK_MV8_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
1770 |
|
backupMV.y - iDiamondSize, 5); |
1771 |
|
CHECK_MV8_CANDIDATE_DIR(backupMV.x - iDiamondSize, |
1772 |
|
backupMV.y + iDiamondSize, 6); |
1773 |
|
CHECK_MV8_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
1774 |
|
backupMV.y - iDiamondSize, 7); |
1775 |
|
CHECK_MV8_CANDIDATE_DIR(backupMV.x + iDiamondSize, |
1776 |
|
backupMV.y + iDiamondSize, 8); |
1777 |
|
|
1778 |
|
|
1779 |
|
if (iDirection) { |
1780 |
|
while (!iFound) { |
1781 |
|
iFound = 1; |
1782 |
|
backupMV = *currMV; |
1783 |
|
|
1784 |
|
switch (iDirection) { |
1785 |
|
case 1: |
1786 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1787 |
|
backupMV.y, 1); |
1788 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1789 |
|
backupMV.y - iDiamondSize, 5); |
1790 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1791 |
|
backupMV.y - iDiamondSize, 7); |
1792 |
|
break; |
1793 |
|
case 2: |
1794 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, backupMV.y, |
1795 |
|
2); |
1796 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1797 |
|
backupMV.y + iDiamondSize, 6); |
1798 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1799 |
|
backupMV.y + iDiamondSize, 8); |
1800 |
|
break; |
1801 |
|
|
1802 |
|
case 3: |
1803 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x, backupMV.y + iDiamondSize, |
1804 |
|
4); |
1805 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1806 |
|
backupMV.y - iDiamondSize, 7); |
1807 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1808 |
|
backupMV.y + iDiamondSize, 8); |
1809 |
|
break; |
1810 |
|
|
1811 |
|
case 4: |
1812 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x, backupMV.y - iDiamondSize, |
1813 |
|
3); |
1814 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1815 |
|
backupMV.y - iDiamondSize, 5); |
1816 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1817 |
|
backupMV.y + iDiamondSize, 6); |
1818 |
|
break; |
1819 |
|
|
1820 |
|
case 5: |
1821 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, backupMV.y, |
1822 |
|
1); |
1823 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x, backupMV.y - iDiamondSize, |
1824 |
|
3); |
1825 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1826 |
|
backupMV.y - iDiamondSize, 5); |
1827 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1828 |
|
backupMV.y + iDiamondSize, 6); |
1829 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1830 |
|
backupMV.y - iDiamondSize, 7); |
1831 |
|
break; |
1832 |
|
|
1833 |
|
case 6: |
1834 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, backupMV.y, |
1835 |
|
2); |
1836 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x, backupMV.y - iDiamondSize, |
1837 |
|
3); |
1838 |
|
|
1839 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1840 |
|
backupMV.y - iDiamondSize, 5); |
1841 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1842 |
|
backupMV.y + iDiamondSize, 6); |
1843 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1844 |
|
backupMV.y + iDiamondSize, 8); |
1845 |
|
|
1846 |
|
break; |
1847 |
|
|
1848 |
|
case 7: |
1849 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1850 |
|
backupMV.y, 1); |
1851 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x, backupMV.y + iDiamondSize, |
1852 |
|
4); |
1853 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1854 |
|
backupMV.y - iDiamondSize, 5); |
1855 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1856 |
|
backupMV.y - iDiamondSize, 7); |
1857 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1858 |
|
backupMV.y + iDiamondSize, 8); |
1859 |
|
break; |
1860 |
|
|
1861 |
|
case 8: |
1862 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, backupMV.y, |
1863 |
|
2); |
1864 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x, backupMV.y + iDiamondSize, |
1865 |
|
4); |
1866 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1867 |
|
backupMV.y + iDiamondSize, 6); |
1868 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1869 |
|
backupMV.y - iDiamondSize, 7); |
1870 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1871 |
|
backupMV.y + iDiamondSize, 8); |
1872 |
|
break; |
1873 |
|
default: |
1874 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, backupMV.y, |
1875 |
|
1); |
1876 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, backupMV.y, |
1877 |
|
2); |
1878 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x, backupMV.y - iDiamondSize, |
1879 |
|
3); |
1880 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x, backupMV.y + iDiamondSize, |
1881 |
|
4); |
1882 |
|
|
1883 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1884 |
|
backupMV.y - iDiamondSize, 5); |
1885 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x - iDiamondSize, |
1886 |
|
backupMV.y + iDiamondSize, 6); |
1887 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1888 |
|
backupMV.y - iDiamondSize, 7); |
1889 |
|
CHECK_MV8_CANDIDATE_FOUND(backupMV.x + iDiamondSize, |
1890 |
|
backupMV.y + iDiamondSize, 8); |
1891 |
|
break; |
1892 |
|
} |
1893 |
|
} |
1894 |
} else { |
} else { |
1895 |
currMV->x = start_x; |
currMV->x = start_x; |
1896 |
currMV->y = start_y; |
currMV->y = start_y; |
1898 |
return iMinSAD; |
return iMinSAD; |
1899 |
} |
} |
1900 |
|
|
1901 |
|
|
1902 |
|
|
1903 |
|
|
1904 |
|
|
1905 |
int32_t |
int32_t |
1906 |
Halfpel8_Refine_c(const uint8_t * const pRef, |
Halfpel8_Refine_c(const uint8_t * const pRef, |
1907 |
const uint8_t * const pRefH, |
const uint8_t * const pRefH, |
2010 |
} |
} |
2011 |
|
|
2012 |
/* because we might use IF (dx>max_dx) THEN dx=max_dx; */ |
/* because we might use IF (dx>max_dx) THEN dx=max_dx; */ |
|
//bPredEq = get_pmvdata(pMBs, (x >> 1), (y >> 1), iWcount, iSubBlock, pmv, psad); |
|
2013 |
bPredEq = get_pmvdata2(pMBs, iWcount, 0, (x >> 1), (y >> 1), iSubBlock, pmv, psad); |
bPredEq = get_pmvdata2(pMBs, iWcount, 0, (x >> 1), (y >> 1), iSubBlock, pmv, psad); |
2014 |
|
|
2015 |
if ((x == 0) && (y == 0)) { |
if ((x == 0) && (y == 0)) { |
2039 |
|
|
2040 |
// Prepare for main loop |
// Prepare for main loop |
2041 |
|
|
2042 |
// if (MotionFlags & PMV_USESQUARES8) |
if (MotionFlags & PMV_USESQUARES8) |
2043 |
// MainSearchPtr = Square8_MainSearch; |
MainSearchPtr = Square8_MainSearch; |
2044 |
// else |
else |
2045 |
|
|
2046 |
if (MotionFlags & PMV_ADVANCEDDIAMOND8) |
if (MotionFlags & PMV_ADVANCEDDIAMOND8) |
2047 |
MainSearchPtr = AdvDiamond8_MainSearch; |
MainSearchPtr = AdvDiamond8_MainSearch; |
2324 |
max_dy = EVEN(max_dy); |
max_dy = EVEN(max_dy); |
2325 |
} |
} |
2326 |
/* because we might use something like IF (dx>max_dx) THEN dx=max_dx; */ |
/* because we might use something like IF (dx>max_dx) THEN dx=max_dx; */ |
|
//bPredEq = get_pmvdata(pMBs, x, y, iWcount, 0, pmv, psad); |
|
2327 |
bPredEq = get_pmvdata2(pMBs, iWcount, 0, x, y, 0, pmv, psad); |
bPredEq = get_pmvdata2(pMBs, iWcount, 0, x, y, 0, pmv, psad); |
2328 |
|
|
2329 |
/* Step 4: Calculate SAD around the Median prediction. |
/* Step 4: Calculate SAD around the Median prediction. |
2606 |
max_dy = EVEN(max_dy); |
max_dy = EVEN(max_dy); |
2607 |
} |
} |
2608 |
/* because we might use something like IF (dx>max_dx) THEN dx=max_dx; */ |
/* 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); |
|
2609 |
bPredEq = get_pmvdata2(pMBs, iWcount, 0, x >> 1, y >> 1, iSubBlock, pmv, psad); |
bPredEq = get_pmvdata2(pMBs, iWcount, 0, x >> 1, y >> 1, iSubBlock, pmv, psad); |
2610 |
|
|
2611 |
|
|
2717 |
|
|
2718 |
// there is no EPZS^2 for inter4v at the moment |
// there is no EPZS^2 for inter4v at the moment |
2719 |
|
|
2720 |
// if (MotionFlags & PMV_USESQUARES8) |
if (MotionFlags & PMV_USESQUARES8) |
2721 |
// MainSearchPtr = Square8_MainSearch; |
MainSearchPtr = Square8_MainSearch; |
2722 |
// else |
else |
2723 |
|
|
2724 |
if (MotionFlags & PMV_ADVANCEDDIAMOND8) |
if (MotionFlags & PMV_ADVANCEDDIAMOND8) |
2725 |
MainSearchPtr = AdvDiamond8_MainSearch; |
MainSearchPtr = AdvDiamond8_MainSearch; |
2794 |
const IMAGE * const pCur, |
const IMAGE * const pCur, |
2795 |
const int x, |
const int x, |
2796 |
const int y, |
const int y, |
2797 |
const int start_x, |
const int start_x, /* start should be most likely vector */ |
2798 |
const int start_y, |
const int start_y, |
2799 |
const int center_x, |
const int center_x, /* center is from where length of MVs is measured */ |
2800 |
const int center_y, |
const int center_y, |
2801 |
const uint32_t MotionFlags, |
const uint32_t MotionFlags, |
2802 |
const uint32_t iQuant, |
const uint32_t iQuant, |
2825 |
int32_t iFound; |
int32_t iFound; |
2826 |
|
|
2827 |
VECTOR newMV; |
VECTOR newMV; |
2828 |
VECTOR backupMV; /* just for PMVFAST */ |
VECTOR backupMV; |
2829 |
|
|
2830 |
VECTOR pmv[4]; |
VECTOR pmv[4]; |
2831 |
int32_t psad[4]; |
int32_t psad[4]; |
2832 |
|
|
2833 |
MainSearch16FuncPtr MainSearchPtr; |
MainSearch16FuncPtr MainSearchPtr; |
2834 |
|
|
2835 |
const MACROBLOCK *const prevMB = prevMBs + x + y * iWcount; |
MACROBLOCK *const prevMB = (MACROBLOCK *const)prevMBs + x + y * iWcount; |
2836 |
MACROBLOCK *const pMB = pMBs + x + y * iWcount; |
MACROBLOCK *const pMB = (MACROBLOCK *const)(pMBs + x + y * iWcount); |
2837 |
|
|
2838 |
int32_t threshA, threshB; |
int32_t threshA, threshB; |
2839 |
int32_t bPredEq; |
int32_t bPredEq; |
2855 |
*currMV = pmv[0] = pmv[1] = pmv[2] = pmv[3] = zeroMV; |
*currMV = pmv[0] = pmv[1] = pmv[2] = pmv[3] = zeroMV; |
2856 |
|
|
2857 |
} else { |
} else { |
2858 |
|
|
2859 |
|
bPredEq = get_ipmvdata(pMBs, iWcount, 0, x, y, 0, pmv, psad); |
2860 |
|
|
2861 |
threshA = psad[0]; |
threshA = psad[0]; |
2862 |
threshB = threshA + 256; |
threshB = threshA + 256; |
2863 |
if (threshA < 512) |
if (threshA < 512) |
2867 |
if (threshB > 1792) |
if (threshB > 1792) |
2868 |
threshB = 1792; |
threshB = 1792; |
2869 |
|
|
|
bPredEq = get_ipmvdata(pMBs, iWcount, 0, x, y, 0, pmv, psad); |
|
2870 |
*currMV = pmv[0]; /* current best := prediction */ |
*currMV = pmv[0]; /* current best := prediction */ |
2871 |
} |
} |
2872 |
|
|
2903 |
if ((iMinSAD < 256) || |
if ((iMinSAD < 256) || |
2904 |
((MVequal(*currMV, prevMB->i_mvs[0])) && |
((MVequal(*currMV, prevMB->i_mvs[0])) && |
2905 |
((int32_t) iMinSAD < prevMB->i_sad16))) { |
((int32_t) iMinSAD < prevMB->i_sad16))) { |
2906 |
if (iMinSAD < 2 * iQuant) // high chances for SKIP-mode |
if (iMinSAD < (int)(2 * iQuant)) // high chances for SKIP-mode |
2907 |
{ |
{ |
2908 |
if (!MVzero(*currMV)) { |
if (!MVzero(*currMV)) { |
2909 |
iMinSAD += MV16_00_BIAS; |
iMinSAD += MV16_00_BIAS; |
3072 |
|
|
3073 |
pmv[0] = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); // get _REAL_ prediction (halfpel possible) |
pmv[0] = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); // get _REAL_ prediction (halfpel possible) |
3074 |
|
|
|
PMVfastInt16_Terminate_without_Refine: |
|
3075 |
currPMV->x = currMV->x - center_x; |
currPMV->x = currMV->x - center_x; |
3076 |
currPMV->y = currMV->y - center_y; |
currPMV->y = currMV->y - center_y; |
3077 |
return iMinSAD; |
return iMinSAD; |
3078 |
} |
} |
3079 |
|
|
|
|
|
|
|
|
|
/* *********************************************************** |
|
|
bvop motion estimation |
|
|
// TODO: need to incorporate prediction here (eg. sad += calc_delta_16) |
|
|
***************************************************************/ |
|
|
|
|
|
|
|
|
#define DIRECT_PENALTY 0 |
|
|
#define DIRECT_UPPERLIMIT 256 // never use direct mode if SAD is larger than this |
|
|
|
|
|
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; |
|
|
|
|
|
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 linear motion) */ |
|
|
int dnv_sad16; /* direct mode (assume linear motion) without correction vector */ |
|
|
|
|
|
int best_sad; |
|
|
|
|
|
VECTOR f_predMV, b_predMV; /* there is no direct prediction */ |
|
|
VECTOR pmv_dontcare; |
|
|
|
|
|
int f_count=0; |
|
|
int b_count=0; |
|
|
int i_count=0; |
|
|
int d_count=0; |
|
|
int dnv_count=0; |
|
|
int s_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]; |
|
|
|
|
|
VECTOR directMV; |
|
|
VECTOR deltaMV=zeroMV; |
|
|
|
|
|
/* special case, if collocated block is SKIPed: encoding is forward(0,0) */ |
|
|
|
|
|
#ifndef _DISABLE_SKIP |
|
|
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->mvs[0].x = 0; |
|
|
mb->mvs[0].y = 0; |
|
|
mb->b_mvs[0].x = 0; |
|
|
mb->b_mvs[0].y = 0; |
|
|
continue; |
|
|
} |
|
|
#endif |
|
|
|
|
|
dnv_sad16 = DIRECT_PENALTY; |
|
|
|
|
|
if (b_mb->mode == MODE_INTER4V) |
|
|
{ |
|
|
|
|
|
/* same method of scaling as in decoder.c, so we copy from there */ |
|
|
for (k = 0; k < 4; k++) { |
|
|
|
|
|
directMV = b_mb->mvs[k]; |
|
|
|
|
|
mb->mvs[k].x = (int32_t) ((TRB * directMV.x) / TRD + deltaMV.x); |
|
|
mb->b_mvs[k].x = (int32_t) ((deltaMV.x == 0) |
|
|
? ((TRB - TRD) * directMV.x) / TRD |
|
|
: mb->mvs[k].x - directMV.x); |
|
|
mb->mvs[k].y = (int32_t) ((TRB * directMV.y) / TRD + deltaMV.y); |
|
|
mb->b_mvs[k].y = (int32_t) ((deltaMV.y == 0) |
|
|
? ((TRB - TRD) * directMV.y) / TRD |
|
|
: mb->mvs[k].y - directMV.y); |
|
|
|
|
|
dnv_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 |
|
|
{ |
|
|
directMV = b_mb->mvs[0]; |
|
|
|
|
|
mb->mvs[0].x = (int32_t) ((TRB * directMV.x) / TRD + deltaMV.x); |
|
|
mb->b_mvs[0].x = (int32_t) ((deltaMV.x == 0) |
|
|
? ((TRB - TRD) * directMV.x) / TRD |
|
|
: mb->mvs[0].x - directMV.x); |
|
|
mb->mvs[0].y = (int32_t) ((TRB * directMV.y) / TRD + deltaMV.y); |
|
|
mb->b_mvs[0].y = (int32_t) ((deltaMV.y == 0) |
|
|
? ((TRB - TRD) * directMV.y) / TRD |
|
|
: mb->mvs[0].y - directMV.y); |
|
|
|
|
|
dnv_sad16 = DIRECT_PENALTY + |
|
|
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); |
|
|
|
|
|
|
|
|
} |
|
|
|
|
|
// 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 & (~(PMV_EARLYSTOP16|PMV_QUICKSTOP16)), |
|
|
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 & (~(PMV_EARLYSTOP16|PMV_QUICKSTOP16)), |
|
|
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].y-b_predMV.y, mb->b_mvs[0].y-b_predMV.y, |
|
|
frame->bcode, frame->quant); |
|
|
|
|
|
// TODO: direct search |
|
|
// predictor + delta vector in range [-32,32] (fcode=1) |
|
|
|
|
|
// i_sad16 = 65535; |
|
|
// f_sad16 = 65535; |
|
|
// b_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 (dnv_sad16 < best_sad) { |
|
|
|
|
|
if (dnv_sad16 > DIRECT_UPPERLIMIT) |
|
|
{ |
|
|
/* if SAD value is too large, try same vector with MODE_INTERPOLATE |
|
|
instead (interpolate has residue encoding, direct mode without MV |
|
|
doesn't) |
|
|
|
|
|
This has to be replaced later by "real" direct mode, including delta |
|
|
vector and (if needed) residue encoding |
|
|
|
|
|
*/ |
|
|
|
|
|
directMV = b_mb->mvs[0]; |
|
|
|
|
|
mb->mvs[0].x = (int32_t) ((TRB * directMV.x) / TRD + deltaMV.x); |
|
|
mb->b_mvs[0].x = (int32_t) ((deltaMV.x == 0) |
|
|
? ((TRB - TRD) * directMV.x) / TRD |
|
|
: mb->mvs[0].x - directMV.x); |
|
|
mb->mvs[0].y = (int32_t) ((TRB * directMV.y) / TRD + deltaMV.y); |
|
|
mb->b_mvs[0].y = (int32_t) ((deltaMV.y == 0) |
|
|
? ((TRB - TRD) * directMV.y) / TRD |
|
|
: mb->mvs[0].y - directMV.y); |
|
|
|
|
|
dnv_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); |
|
|
dnv_sad16 += calc_delta_16(mb->mvs[0].x-f_predMV.x, mb->mvs[0].y-f_predMV.y, |
|
|
frame->fcode, frame->quant); |
|
|
dnv_sad16 += calc_delta_16(mb->b_mvs[0].y-b_predMV.y, mb->b_mvs[0].y-b_predMV.y, |
|
|
frame->bcode, frame->quant); |
|
|
|
|
|
if (dnv_sad16 < best_sad) |
|
|
{ |
|
|
best_sad = dnv_sad16; |
|
|
mb->mode = MODE_INTERPOLATE; |
|
|
|
|
|
/* fprintf(stderr,"f_sad16 = %d, b_sad16 = %d, i_sad16 = %d, dnv_sad16 = %d\n", |
|
|
f_sad16,b_sad16,i_sad16,dnv_sad16); |
|
|
*/ } |
|
|
} |
|
|
else |
|
|
{ |
|
|
best_sad = dnv_sad16; |
|
|
mb->mode = MODE_DIRECT_NONE_MV; |
|
|
} |
|
|
} |
|
|
|
|
|
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++; |
|
|
f_predMV = mb->mvs[0]; |
|
|
b_predMV = mb->b_mvs[0]; |
|
|
break; |
|
|
case MODE_DIRECT: |
|
|
d_count++; break; |
|
|
case MODE_DIRECT_NONE_MV: |
|
|
dnv_count++; break; |
|
|
default: |
|
|
s_count++; break; |
|
|
} |
|
|
|
|
|
} |
|
|
} |
|
|
|
|
|
#ifdef _DEBUG_BFRAME_STAT |
|
|
fprintf(stderr,"B-Stat: F: %04d B: %04d I: %04d D0: %04d D: %04d S: %04d\n", |
|
|
f_count,b_count,i_count,dnv_count,d_count,s_count); |
|
|
#endif |
|
|
|
|
|
} |
|