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

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

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

revision 1440, Mon Apr 19 13:40:54 2004 UTC revision 1441, Tue Apr 20 06:10:40 2004 UTC
# Line 21  Line 21 
21   *  along with this program ; if not, write to the Free Software   *  along with this program ; if not, write to the Free Software
22   *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA   *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
23   *   *
24   * $Id: estimation_common.c,v 1.3 2004-04-05 20:36:36 edgomez Exp $   * $Id: estimation_common.c,v 1.4 2004-04-20 06:10:40 syskin Exp $
25   *   *
26   ****************************************************************************/   ****************************************************************************/
27    
# Line 351  Line 351 
351  }  }
352    
353  void  void
354  xvid_me_SubpelRefine(SearchData * const data, CheckFunc * const CheckCandidate)  xvid_me_SubpelRefine(SearchData * const data, CheckFunc * const CheckCandidate, int dir)
355  {  {
356  /* Do a half-pel or q-pel refinement */  /* Do a half-pel or q-pel refinement */
357          const VECTOR centerMV = data->qpel_precision ? *data->currentQMV : *data->currentMV;          const VECTOR centerMV = data->qpel_precision ? *data->currentQMV : *data->currentMV;
358    
359          CHECK_CANDIDATE(centerMV.x, centerMV.y - 1, 0);          CHECK_CANDIDATE(centerMV.x, centerMV.y - 1, dir);
360          CHECK_CANDIDATE(centerMV.x + 1, centerMV.y - 1, 0);          CHECK_CANDIDATE(centerMV.x + 1, centerMV.y - 1, dir);
361          CHECK_CANDIDATE(centerMV.x + 1, centerMV.y, 0);          CHECK_CANDIDATE(centerMV.x + 1, centerMV.y, dir);
362          CHECK_CANDIDATE(centerMV.x + 1, centerMV.y + 1, 0);          CHECK_CANDIDATE(centerMV.x + 1, centerMV.y + 1, dir);
363          CHECK_CANDIDATE(centerMV.x, centerMV.y + 1, 0);          CHECK_CANDIDATE(centerMV.x, centerMV.y + 1, dir);
364          CHECK_CANDIDATE(centerMV.x - 1, centerMV.y + 1, 0);          CHECK_CANDIDATE(centerMV.x - 1, centerMV.y + 1, dir);
365          CHECK_CANDIDATE(centerMV.x - 1, centerMV.y, 0);          CHECK_CANDIDATE(centerMV.x - 1, centerMV.y, dir);
366          CHECK_CANDIDATE(centerMV.x - 1, centerMV.y - 1, 0);          CHECK_CANDIDATE(centerMV.x - 1, centerMV.y - 1, dir);
367    }
368    
369    #define CHECK_CANDIDATE_2ndBEST(X, Y, DIR) { \
370            *data->iMinSAD = s_best2; \
371            CheckCandidate((X),(Y), data, direction); \
372            if (data->iMinSAD[0] < s_best) { \
373                    s_best2 = s_best; \
374                    s_best = data->iMinSAD[0]; \
375                    v_best2 = v_best; \
376                    v_best.x = X; v_best.y = Y; \
377                    dir = DIR; \
378            } else if (data->iMinSAD[0] < s_best2) { \
379                    s_best2 = data->iMinSAD[0]; \
380                    v_best2.x = X; v_best2.y = Y; \
381            } \
382  }  }
383    
384  void  void
385  SubpelRefine_Fast(SearchData * data, CheckFunc * CheckCandidate)  FullRefine_Fast(SearchData * data, CheckFunc * CheckCandidate, int direction)
386  {  {
387  /* 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;  
388    
389          data->iMinSAD2 = 256 * 4096;          int32_t s_best = data->iMinSAD[0], s_best2 = 256*4096;
390            VECTOR v_best, v_best2;
391            int dir = 0, xo2, yo2, best_halfpel, b_cbp;
392    
393            int xo = 2*data->currentMV[0].x, yo = 2*data->currentMV[0].y;
394    
395            data->currentQMV[0].x = v_best.x = xo;
396            data->currentQMV[0].y = v_best.y = yo;
397    
398            data->qpel_precision = 1;
399    
400            /* halfpel refinement: check 8 neighbours, but keep the second best SAD as well */
401            CHECK_CANDIDATE_2ndBEST(xo - 2, yo,             1+16+64);
402            CHECK_CANDIDATE_2ndBEST(xo + 2, yo,             2+32+128);
403            CHECK_CANDIDATE_2ndBEST(xo,             yo - 2, 4+16+32);
404            CHECK_CANDIDATE_2ndBEST(xo,             yo + 2, 8+64+128);
405            CHECK_CANDIDATE_2ndBEST(xo - 2, yo - 2, 1+4+16+32+64);
406            CHECK_CANDIDATE_2ndBEST(xo + 2, yo - 2, 2+4+16+32+128);
407            CHECK_CANDIDATE_2ndBEST(xo - 2, yo + 2, 1+8+16+64+128);
408            CHECK_CANDIDATE_2ndBEST(xo + 2, yo + 2, 2+8+32+64+128);
409    
410            xo = v_best.x; yo = v_best.y, b_cbp = data->cbp[0];
411    
412            /* we need all 8 neighbours *of best hpel position found above* checked for 2nd best
413                    let's check the missing ones */
414    
415            /* on rare occasions, 1st best and 2nd best are far away, and 2nd best is not 1st best's neighbour.
416                    to simplify stuff, we'll forget that evil 2nd best and make a full search for a new 2nd best */
417            /* todo. we should check the missing neighbours first, maybe they'll give us 2nd best which is even better
418                    than the infamous one. in that case, we will not have to re-check the other neighbours */
419    
420            if (abs(v_best.x - v_best2.x) > 2 || abs(v_best.y - v_best2.y) > 2) { /* v_best2 is useless */
421                    data->iMinSAD[0] = 256*4096;
422                    dir = ~0; /* all */
423            } else {
424                    data->iMinSAD[0] = s_best2;
425                    data->currentQMV[0] = v_best2;
426            }
427    
428            if (dir & 1) CHECK_CANDIDATE(   xo - 2, yo,             direction);
429            if (dir & 2) CHECK_CANDIDATE(   xo + 2, yo,             direction);
430            if (dir & 4) CHECK_CANDIDATE(   xo,             yo - 2, direction);
431            if (dir & 8) CHECK_CANDIDATE(   xo,             yo + 2, direction);
432            if (dir & 16) CHECK_CANDIDATE(  xo - 2, yo - 2, direction);
433            if (dir & 32) CHECK_CANDIDATE(  xo + 2, yo - 2, direction);
434            if (dir & 64) CHECK_CANDIDATE(  xo - 2, yo + 2, direction);
435            if (dir & 128) CHECK_CANDIDATE( xo + 2, yo + 2, direction);
436    
437            /* read the position of 2nd best */
438            v_best2 = data->currentQMV[0];
439    
440            /* after second_best has been found, go back to best vector */
441    
442            data->currentQMV[0].x = xo;
443            data->currentQMV[0].y = yo;
444            data->cbp[0] = b_cbp;
445    
446            data->currentMV[0].x = xo/2;
447            data->currentMV[0].y = yo/2;
448            data->iMinSAD[0] = best_halfpel = s_best;
449    
450            xo2 = v_best2.x;
451            yo2 = v_best2.y;
452            s_best2 = 256*4096;
453    
454          if (yo == yo2) {          if (yo == yo2) {
455                  CHECK_CANDIDATE((xo+xo2)>>1, yo, 0);                  CHECK_CANDIDATE_2ndBEST((xo+xo2)>>1, yo, 0);
456                  CHECK_CANDIDATE(xo, yo-1, 0);                  CHECK_CANDIDATE_2ndBEST(xo, yo-1, 0);
457                  CHECK_CANDIDATE(xo, yo+1, 0);                  CHECK_CANDIDATE_2ndBEST(xo, yo+1, 0);
458                    data->currentQMV[0] = v_best;
459                  if(best_sad <= data->iMinSAD2) return;                  data->iMinSAD[0] = s_best;
460    
461                  if(data->currentQMV[0].x == data->currentQMV2.x) {                  if(best_halfpel <= s_best2) return;
462                          CHECK_CANDIDATE((xo+xo2)>>1, yo-1, 0);  
463                          CHECK_CANDIDATE((xo+xo2)>>1, yo+1, 0);                  if(data->currentQMV[0].x == v_best2.x) {
464                            CHECK_CANDIDATE((xo+xo2)>>1, yo-1, direction);
465                            CHECK_CANDIDATE((xo+xo2)>>1, yo+1, direction);
466                  } else {                  } else {
467                          CHECK_CANDIDATE((xo+xo2)>>1,                          CHECK_CANDIDATE((xo+xo2)>>1,
468                                  (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);
469                  }                  }
470                  return;                  return;
471          }          }
472    
473          if (xo == xo2) {          if (xo == xo2) {
474                  CHECK_CANDIDATE(xo, (yo+yo2)>>1, 0);                  CHECK_CANDIDATE_2ndBEST(xo, (yo+yo2)>>1, 0);
475                  CHECK_CANDIDATE(xo-1, yo, 0);                  CHECK_CANDIDATE_2ndBEST(xo-1, yo, 0);
476                  CHECK_CANDIDATE(xo+1, yo, 0);                  CHECK_CANDIDATE_2ndBEST(xo+1, yo, 0);
477                    data->currentQMV[0] = v_best;
478                  if(best_sad <= data->iMinSAD2) return;                  data->iMinSAD[0] = s_best;
479    
480                  if(data->currentQMV[0].y == data->currentQMV2.y) {                  if(best_halfpel <= s_best2) return;
481                          CHECK_CANDIDATE(xo-1, (yo+yo2)>>1, 0);  
482                          CHECK_CANDIDATE(xo+1, (yo+yo2)>>1, 0);                  if(data->currentQMV[0].y == v_best2.y) {
483                            CHECK_CANDIDATE(xo-1, (yo+yo2)>>1, direction);
484                            CHECK_CANDIDATE(xo+1, (yo+yo2)>>1, direction);
485                  } else {                  } else {
486                          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);
487                  }                  }
488                  return;                  return;
489          }          }
490    
491          CHECK_CANDIDATE(xo, (yo+yo2)>>1, 0);          CHECK_CANDIDATE_2ndBEST(xo, (yo+yo2)>>1, 0);
492          CHECK_CANDIDATE((xo+xo2)>>1, yo, 0);          CHECK_CANDIDATE_2ndBEST((xo+xo2)>>1, yo, 0);
493            data->currentQMV[0] = v_best;
494            data->iMinSAD[0] = s_best;
495    
496            if(best_halfpel <= s_best2) return;
497    
498          if(best_sad <= data->iMinSAD2) return;          CHECK_CANDIDATE((xo+xo2)>>1, (yo+yo2)>>1, direction);
499    
         CHECK_CANDIDATE((xo+xo2)>>1, (yo+yo2)>>1, 0);  
500  }  }

Legend:
Removed from v.1440  
changed lines
  Added in v.1441

No admin address has been configured
ViewVC Help
Powered by ViewVC 1.0.4