[cvs] / xvidcore / src / motion / estimation_common.c Repository:
ViewVC logotype

Diff of /xvidcore/src/motion/estimation_common.c

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.1.2.3, Thu Dec 18 02:02:08 2003 UTC revision 1.13, Fri Dec 9 04:39:49 2005 UTC
# Line 55  Line 55 
55  { 0, 1, 0, 0 };  { 0, 1, 0, 0 };
56    
57  const int xvid_me_lambda_vec16[32] =  const int xvid_me_lambda_vec16[32] =
58          {     0    ,(int)(1.00235 * NEIGH_TEND_16X16 + 0.5),          {     0    ,(int)(1.0 * NEIGH_TEND_16X16 + 0.5),
59          (int)(1.15582*NEIGH_TEND_16X16 + 0.5), (int)(1.31976*NEIGH_TEND_16X16 + 0.5),          (int)(2.0*NEIGH_TEND_16X16 + 0.5), (int)(3.0*NEIGH_TEND_16X16 + 0.5),
60          (int)(1.49591*NEIGH_TEND_16X16 + 0.5), (int)(1.68601*NEIGH_TEND_16X16 + 0.5),          (int)(4.0*NEIGH_TEND_16X16 + 0.5), (int)(5.0*NEIGH_TEND_16X16 + 0.5),
61          (int)(1.89187*NEIGH_TEND_16X16 + 0.5), (int)(2.11542*NEIGH_TEND_16X16 + 0.5),          (int)(6.0*NEIGH_TEND_16X16 + 0.5), (int)(7.0*NEIGH_TEND_16X16 + 0.5),
62          (int)(2.35878*NEIGH_TEND_16X16 + 0.5), (int)(2.62429*NEIGH_TEND_16X16 + 0.5),          (int)(8.0*NEIGH_TEND_16X16 + 0.5), (int)(9.0*NEIGH_TEND_16X16 + 0.5),
63          (int)(2.91455*NEIGH_TEND_16X16 + 0.5), (int)(3.23253*NEIGH_TEND_16X16 + 0.5),          (int)(10.0*NEIGH_TEND_16X16 + 0.5), (int)(11.0*NEIGH_TEND_16X16 + 0.5),
64          (int)(3.58158*NEIGH_TEND_16X16 + 0.5), (int)(3.96555*NEIGH_TEND_16X16 + 0.5),          (int)(12.0*NEIGH_TEND_16X16 + 0.5), (int)(13.0*NEIGH_TEND_16X16 + 0.5),
65          (int)(4.38887*NEIGH_TEND_16X16 + 0.5), (int)(4.85673*NEIGH_TEND_16X16 + 0.5),          (int)(14.0*NEIGH_TEND_16X16 + 0.5), (int)(15.0*NEIGH_TEND_16X16 + 0.5),
66          (int)(5.37519*NEIGH_TEND_16X16 + 0.5), (int)(5.95144*NEIGH_TEND_16X16 + 0.5),          (int)(16.0*NEIGH_TEND_16X16 + 0.5), (int)(17.0*NEIGH_TEND_16X16 + 0.5),
67          (int)(6.59408*NEIGH_TEND_16X16 + 0.5), (int)(7.31349*NEIGH_TEND_16X16 + 0.5),          (int)(18.0*NEIGH_TEND_16X16 + 0.5), (int)(19.0*NEIGH_TEND_16X16 + 0.5),
68          (int)(8.12242*NEIGH_TEND_16X16 + 0.5), (int)(9.03669*NEIGH_TEND_16X16 + 0.5),          (int)(20.0*NEIGH_TEND_16X16 + 0.5), (int)(21.0*NEIGH_TEND_16X16 + 0.5),
69          (int)(10.0763*NEIGH_TEND_16X16 + 0.5), (int)(11.2669*NEIGH_TEND_16X16 + 0.5),          (int)(22.0*NEIGH_TEND_16X16 + 0.5), (int)(23.0*NEIGH_TEND_16X16 + 0.5),
70          (int)(12.6426*NEIGH_TEND_16X16 + 0.5), (int)(14.2493*NEIGH_TEND_16X16 + 0.5),          (int)(24.0*NEIGH_TEND_16X16 + 0.5), (int)(25.0*NEIGH_TEND_16X16 + 0.5),
71          (int)(16.1512*NEIGH_TEND_16X16 + 0.5), (int)(18.442*NEIGH_TEND_16X16 + 0.5),          (int)(26.0*NEIGH_TEND_16X16 + 0.5), (int)(27.0*NEIGH_TEND_16X16 + 0.5),
72          (int)(21.2656*NEIGH_TEND_16X16 + 0.5), (int)(24.8580*NEIGH_TEND_16X16 + 0.5),          (int)(28.0*NEIGH_TEND_16X16 + 0.5), (int)(29.0*NEIGH_TEND_16X16 + 0.5),
73          (int)(29.6436*NEIGH_TEND_16X16 + 0.5), (int)(36.4949*NEIGH_TEND_16X16 + 0.5)          (int)(30.0*NEIGH_TEND_16X16 + 0.5), (int)(31.0*NEIGH_TEND_16X16 + 0.5)
74  };  };
75    
76  /*****************************************************************************  /*****************************************************************************
# Line 269  Line 269 
269                                  CHECK_CANDIDATE(x + iDiamondSize, y - iDiamondSize, 2 + 4);                                  CHECK_CANDIDATE(x + iDiamondSize, y - iDiamondSize, 2 + 4);
270                                  break;                                  break;
271                          case 2 + 8:                          case 2 + 8:
272                                  CHECK_CANDIDATE(x - iDiamondSize, y - iDiamondSize, 1 + 4);                                  CHECK_CANDIDATE(x + iDiamondSize, y - iDiamondSize, 2 + 4);
                                 CHECK_CANDIDATE(x - iDiamondSize, y + iDiamondSize, 1 + 8);  
273                                  CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2 + 8);                                  CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2 + 8);
274                                    CHECK_CANDIDATE(x - iDiamondSize, y + iDiamondSize, 1 + 8);
275                                  break;                                  break;
276                          case 1 + 8:                          case 1 + 8:
277                                  CHECK_CANDIDATE(x + iDiamondSize, y - iDiamondSize, 2 + 4);                                  CHECK_CANDIDATE(x - iDiamondSize, y - iDiamondSize, 1 + 4);
                                 CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2 + 8);  
278                                  CHECK_CANDIDATE(x - iDiamondSize, y + iDiamondSize, 1 + 8);                                  CHECK_CANDIDATE(x - iDiamondSize, y + iDiamondSize, 1 + 8);
279                                    CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2 + 8);
280                                  break;                                  break;
281                          default:                /* 1+2+4+8 == we didn't find anything at all */                          default:                /* 1+2+4+8 == we didn't find anything at all */
282                                  CHECK_CANDIDATE(x - iDiamondSize, y - iDiamondSize, 1 + 4);                                  CHECK_CANDIDATE(x - iDiamondSize, y - iDiamondSize, 1 + 4);
# Line 323  Line 323 
323    
324          unsigned int * const iDirection = &data->dir;          unsigned int * const iDirection = &data->dir;
325    
326          do {          for (;;) {
327                  *iDirection = 0;                  *iDirection = 0;
328                  if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1);                  if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1);
329                  if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2);                  if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2);
330                  if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4);                  if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4);
331                  if (bDirection & 8) CHECK_CANDIDATE(x, y + iDiamondSize, 8);                  if (bDirection & 8) CHECK_CANDIDATE(x, y + iDiamondSize, 8);
332    
333                  /* now we're doing diagonal checks near our candidate */                  if (*iDirection == 0)
334                            break;
335    
336                  if (*iDirection) {              /* checking if anything found */                  /* now we're doing diagonal checks near our candidate */
337                          bDirection = *iDirection;                          bDirection = *iDirection;
                         *iDirection = 0;  
338                          x = data->currentMV->x; y = data->currentMV->y;                          x = data->currentMV->x; y = data->currentMV->y;
339                          if (bDirection & 3) {   /* our candidate is left or right */                          if (bDirection & 3) {   /* our candidate is left or right */
340                                  CHECK_CANDIDATE(x, y + iDiamondSize, 8);                                  CHECK_CANDIDATE(x, y + iDiamondSize, 8);
# Line 343  Line 343 
343                                  CHECK_CANDIDATE(x + iDiamondSize, y, 2);                                  CHECK_CANDIDATE(x + iDiamondSize, y, 2);
344                                  CHECK_CANDIDATE(x - iDiamondSize, y, 1);                                  CHECK_CANDIDATE(x - iDiamondSize, y, 1);
345                          }                          }
346                          bDirection += *iDirection;                  bDirection |= *iDirection;
347                          x = data->currentMV->x; y = data->currentMV->y;                          x = data->currentMV->x; y = data->currentMV->y;
348                  }                  }
349          }          }
         while (*iDirection);  
 }  
350    
351  void  void
352  xvid_me_SubpelRefine(SearchData * const data, CheckFunc * const CheckCandidate)  xvid_me_SubpelRefine(VECTOR centerMV, SearchData * const data, CheckFunc * const CheckCandidate, int dir)
353  {  {
354  /* Do a half-pel or q-pel refinement */  /* Do a half-pel or q-pel refinement */
         const VECTOR centerMV = data->qpel_precision ? *data->currentQMV : *data->currentMV;  
355    
356          CHECK_CANDIDATE(centerMV.x, centerMV.y - 1, 0);          CHECK_CANDIDATE(centerMV.x, centerMV.y - 1, dir);
357          CHECK_CANDIDATE(centerMV.x + 1, centerMV.y - 1, 0);          CHECK_CANDIDATE(centerMV.x + 1, centerMV.y - 1, dir);
358          CHECK_CANDIDATE(centerMV.x + 1, centerMV.y, 0);          CHECK_CANDIDATE(centerMV.x + 1, centerMV.y, dir);
359          CHECK_CANDIDATE(centerMV.x + 1, centerMV.y + 1, 0);          CHECK_CANDIDATE(centerMV.x + 1, centerMV.y + 1, dir);
360          CHECK_CANDIDATE(centerMV.x, centerMV.y + 1, 0);          CHECK_CANDIDATE(centerMV.x, centerMV.y + 1, dir);
361          CHECK_CANDIDATE(centerMV.x - 1, centerMV.y + 1, 0);          CHECK_CANDIDATE(centerMV.x - 1, centerMV.y + 1, dir);
362          CHECK_CANDIDATE(centerMV.x - 1, centerMV.y, 0);          CHECK_CANDIDATE(centerMV.x - 1, centerMV.y, dir);
363          CHECK_CANDIDATE(centerMV.x - 1, centerMV.y - 1, 0);          CHECK_CANDIDATE(centerMV.x - 1, centerMV.y - 1, dir);
364    }
365    
366    #define CHECK_CANDIDATE_2ndBEST(X, Y, DIR) { \
367            *data->iMinSAD = s_best2; \
368            CheckCandidate((X),(Y), data, direction); \
369            if (data->iMinSAD[0] < s_best) { \
370                    s_best2 = s_best; \
371                    s_best = data->iMinSAD[0]; \
372                    v_best2 = v_best; \
373                    v_best.x = X; v_best.y = Y; \
374                    dir = DIR; \
375            } else if (data->iMinSAD[0] < s_best2) { \
376                    s_best2 = data->iMinSAD[0]; \
377                    v_best2.x = X; v_best2.y = Y; \
378            } \
379  }  }
380    
381  void  void
382  SubpelRefine_Fast(SearchData * data, CheckFunc * CheckCandidate)  FullRefine_Fast(SearchData * data, CheckFunc * CheckCandidate, int direction)
383  {  {
384  /* Do a fast q-pel refinement */  /* Do a fast h-pel and then q-pel refinement */
         VECTOR centerMV;  
         VECTOR second_best;  
         int best_sad = *data->iMinSAD;  
         int xo, yo, xo2, yo2;  
         int size = 2;  
         data->iMinSAD2 = 0;  
   
         /* check all halfpixel positions near our best halfpel position */  
         centerMV = *data->currentQMV;  
         *data->iMinSAD = 256 * 4096;  
   
         CHECK_CANDIDATE(centerMV.x, centerMV.y - size, 0);  
         CHECK_CANDIDATE(centerMV.x + size, centerMV.y - size, 0);  
         CHECK_CANDIDATE(centerMV.x + size, centerMV.y, 0);  
         CHECK_CANDIDATE(centerMV.x + size, centerMV.y + size, 0);  
   
         CHECK_CANDIDATE(centerMV.x, centerMV.y + size, 0);  
         CHECK_CANDIDATE(centerMV.x - size, centerMV.y + size, 0);  
         CHECK_CANDIDATE(centerMV.x - size, centerMV.y, 0);  
         CHECK_CANDIDATE(centerMV.x - size, centerMV.y - size, 0);  
   
         second_best = *data->currentQMV;  
   
         /* after second_best has been found, go back to the vector we began with */  
   
         data->currentQMV[0] = centerMV;  
         *data->iMinSAD = best_sad;  
   
         xo = centerMV.x;  
         yo = centerMV.y;  
         xo2 = second_best.x;  
         yo2 = second_best.y;  
385    
386          data->iMinSAD2 = 256 * 4096;          int32_t s_best = data->iMinSAD[0], s_best2 = 256*4096;
387            VECTOR v_best, v_best2;
388            int dir = 0, xo2, yo2, best_halfpel, b_cbp;
389    
390            int xo = 2*data->currentMV[0].x, yo = 2*data->currentMV[0].y;
391    
392            data->currentQMV[0].x = v_best.x = v_best2.x = xo;
393            data->currentQMV[0].y = v_best.y = v_best2.y = yo;
394    
395            data->qpel_precision = 1;
396    
397            /* halfpel refinement: check 8 neighbours, but keep the second best SAD as well */
398            CHECK_CANDIDATE_2ndBEST(xo - 2, yo,             1+16+64);
399            CHECK_CANDIDATE_2ndBEST(xo + 2, yo,             2+32+128);
400            CHECK_CANDIDATE_2ndBEST(xo,             yo - 2, 4+16+32);
401            CHECK_CANDIDATE_2ndBEST(xo,             yo + 2, 8+64+128);
402            CHECK_CANDIDATE_2ndBEST(xo - 2, yo - 2, 1+4+16+32+64);
403            CHECK_CANDIDATE_2ndBEST(xo + 2, yo - 2, 2+4+16+32+128);
404            CHECK_CANDIDATE_2ndBEST(xo - 2, yo + 2, 1+8+16+64+128);
405            CHECK_CANDIDATE_2ndBEST(xo + 2, yo + 2, 2+8+32+64+128);
406    
407            xo = v_best.x; yo = v_best.y, b_cbp = data->cbp[0];
408    
409            /* we need all 8 neighbours *of best hpel position found above* checked for 2nd best
410                    let's check the missing ones */
411    
412            /* on rare occasions, 1st best and 2nd best are far away, and 2nd best is not 1st best's neighbour.
413                    to simplify stuff, we'll forget that evil 2nd best and make a full search for a new 2nd best */
414            /* todo. we should check the missing neighbours first, maybe they'll give us 2nd best which is even better
415                    than the infamous one. in that case, we will not have to re-check the other neighbours */
416    
417            if (abs(v_best.x - v_best2.x) > 2 || abs(v_best.y - v_best2.y) > 2) { /* v_best2 is useless */
418                    data->iMinSAD[0] = 256*4096;
419                    dir = ~0; /* all */
420            } else {
421                    data->iMinSAD[0] = s_best2;
422                    data->currentQMV[0] = v_best2;
423            }
424    
425            if (dir & 1) CHECK_CANDIDATE(   xo - 2, yo,             direction);
426            if (dir & 2) CHECK_CANDIDATE(   xo + 2, yo,             direction);
427            if (dir & 4) CHECK_CANDIDATE(   xo,             yo - 2, direction);
428            if (dir & 8) CHECK_CANDIDATE(   xo,             yo + 2, direction);
429            if (dir & 16) CHECK_CANDIDATE(  xo - 2, yo - 2, direction);
430            if (dir & 32) CHECK_CANDIDATE(  xo + 2, yo - 2, direction);
431            if (dir & 64) CHECK_CANDIDATE(  xo - 2, yo + 2, direction);
432            if (dir & 128) CHECK_CANDIDATE( xo + 2, yo + 2, direction);
433    
434            /* read the position of 2nd best */
435            v_best2 = data->currentQMV[0];
436    
437            /* after second_best has been found, go back to best vector */
438    
439            data->currentQMV[0].x = xo;
440            data->currentQMV[0].y = yo;
441            data->cbp[0] = b_cbp;
442    
443            data->currentMV[0].x = xo/2;
444            data->currentMV[0].y = yo/2;
445            data->iMinSAD[0] = best_halfpel = s_best;
446    
447            xo2 = v_best2.x;
448            yo2 = v_best2.y;
449            s_best2 = 256*4096;
450    
451          if (yo == yo2) {          if (yo == yo2) {
452                  CHECK_CANDIDATE((xo+xo2)>>1, yo, 0);                  CHECK_CANDIDATE_2ndBEST((xo+xo2)>>1, yo, 0);
453                  CHECK_CANDIDATE(xo, yo-1, 0);                  CHECK_CANDIDATE_2ndBEST(xo, yo-1, 0);
454                  CHECK_CANDIDATE(xo, yo+1, 0);                  CHECK_CANDIDATE_2ndBEST(xo, yo+1, 0);
455                    data->currentQMV[0] = v_best;
456                  if(best_sad <= data->iMinSAD2) return;                  data->iMinSAD[0] = s_best;
457    
458                  if(data->currentQMV[0].x == data->currentQMV2.x) {                  if(best_halfpel <= s_best2) return;
459                          CHECK_CANDIDATE((xo+xo2)>>1, yo-1, 0);  
460                          CHECK_CANDIDATE((xo+xo2)>>1, yo+1, 0);                  if(data->currentQMV[0].x == v_best2.x) {
461                            CHECK_CANDIDATE((xo+xo2)>>1, yo-1, direction);
462                            CHECK_CANDIDATE((xo+xo2)>>1, yo+1, direction);
463                  } else {                  } else {
464                          CHECK_CANDIDATE((xo+xo2)>>1,                          CHECK_CANDIDATE((xo+xo2)>>1,
465                                  (data->currentQMV[0].x == xo) ? data->currentQMV[0].y : data->currentQMV2.y, 0);                                  (data->currentQMV[0].x == xo) ? data->currentQMV[0].y : v_best2.y, direction);
466                  }                  }
467                  return;                  return;
468          }          }
469    
470          if (xo == xo2) {          if (xo == xo2) {
471                  CHECK_CANDIDATE(xo, (yo+yo2)>>1, 0);                  CHECK_CANDIDATE_2ndBEST(xo, (yo+yo2)>>1, 0);
472                  CHECK_CANDIDATE(xo-1, yo, 0);                  CHECK_CANDIDATE_2ndBEST(xo-1, yo, 0);
473                  CHECK_CANDIDATE(xo+1, yo, 0);                  CHECK_CANDIDATE_2ndBEST(xo+1, yo, 0);
474                    data->currentQMV[0] = v_best;
475                  if(best_sad < data->iMinSAD2) return;                  data->iMinSAD[0] = s_best;
476    
477                  if(data->currentQMV[0].y == data->currentQMV2.y) {                  if(best_halfpel <= s_best2) return;
478                          CHECK_CANDIDATE(xo-1, (yo+yo2)>>1, 0);  
479                          CHECK_CANDIDATE(xo+1, (yo+yo2)>>1, 0);                  if(data->currentQMV[0].y == v_best2.y) {
480                            CHECK_CANDIDATE(xo-1, (yo+yo2)>>1, direction);
481                            CHECK_CANDIDATE(xo+1, (yo+yo2)>>1, direction);
482                  } else {                  } else {
483                          CHECK_CANDIDATE((data->currentQMV[0].y == yo) ? data->currentQMV[0].x : data->currentQMV2.x, (yo+yo2)>>1, 0);                          CHECK_CANDIDATE((data->currentQMV[0].y == yo) ? data->currentQMV[0].x : v_best2.x, (yo+yo2)>>1, direction);
484                  }                  }
485                  return;                  return;
486          }          }
487    
488          CHECK_CANDIDATE(xo, (yo+yo2)>>1, 0);          CHECK_CANDIDATE_2ndBEST(xo, (yo+yo2)>>1, 0);
489          CHECK_CANDIDATE((xo+xo2)>>1, yo, 0);          CHECK_CANDIDATE_2ndBEST((xo+xo2)>>1, yo, 0);
490            data->currentQMV[0] = v_best;
491            data->iMinSAD[0] = s_best;
492    
493            if(best_halfpel <= s_best2) return;
494    
495          if(best_sad <= data->iMinSAD2) return;          CHECK_CANDIDATE((xo+xo2)>>1, (yo+yo2)>>1, direction);
496    
497          CHECK_CANDIDATE((xo+xo2)>>1, (yo+yo2)>>1, 0);  }
498    
499    /* it's the positive max, so "32" needs fcode of 2, not 1 */
500    unsigned int
501    getMinFcode(const int MVmax)
502    {
503            unsigned int fcode;
504            for (fcode = 1; (16 << fcode) <= MVmax; fcode++);
505            return fcode;
506  }  }
Legend:
Removed from v.1.1.2.3  
changed lines
  Added in v.1.13
No admin address has been configured
 ViewVC Help
Powered by ViewVC 1.0.4