| 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.1.2.2 2003-11-19 12:24:25 syskin Exp $ |
* $Id: estimation_common.c,v 1.1.2.3 2003-12-18 02:02:08 Isibaar Exp $ |
| 25 |
* |
* |
| 26 |
****************************************************************************/ |
****************************************************************************/ |
| 27 |
|
|
| 366 |
CHECK_CANDIDATE(centerMV.x - 1, centerMV.y - 1, 0); |
CHECK_CANDIDATE(centerMV.x - 1, centerMV.y - 1, 0); |
| 367 |
} |
} |
| 368 |
|
|
| 369 |
|
void |
| 370 |
|
SubpelRefine_Fast(SearchData * data, CheckFunc * CheckCandidate) |
| 371 |
|
{ |
| 372 |
|
/* Do a fast q-pel refinement */ |
| 373 |
|
VECTOR centerMV; |
| 374 |
|
VECTOR second_best; |
| 375 |
|
int best_sad = *data->iMinSAD; |
| 376 |
|
int xo, yo, xo2, yo2; |
| 377 |
|
int size = 2; |
| 378 |
|
data->iMinSAD2 = 0; |
| 379 |
|
|
| 380 |
|
/* check all halfpixel positions near our best halfpel position */ |
| 381 |
|
centerMV = *data->currentQMV; |
| 382 |
|
*data->iMinSAD = 256 * 4096; |
| 383 |
|
|
| 384 |
|
CHECK_CANDIDATE(centerMV.x, centerMV.y - size, 0); |
| 385 |
|
CHECK_CANDIDATE(centerMV.x + size, centerMV.y - size, 0); |
| 386 |
|
CHECK_CANDIDATE(centerMV.x + size, centerMV.y, 0); |
| 387 |
|
CHECK_CANDIDATE(centerMV.x + size, centerMV.y + size, 0); |
| 388 |
|
|
| 389 |
|
CHECK_CANDIDATE(centerMV.x, centerMV.y + size, 0); |
| 390 |
|
CHECK_CANDIDATE(centerMV.x - size, centerMV.y + size, 0); |
| 391 |
|
CHECK_CANDIDATE(centerMV.x - size, centerMV.y, 0); |
| 392 |
|
CHECK_CANDIDATE(centerMV.x - size, centerMV.y - size, 0); |
| 393 |
|
|
| 394 |
|
second_best = *data->currentQMV; |
| 395 |
|
|
| 396 |
|
/* after second_best has been found, go back to the vector we began with */ |
| 397 |
|
|
| 398 |
|
data->currentQMV[0] = centerMV; |
| 399 |
|
*data->iMinSAD = best_sad; |
| 400 |
|
|
| 401 |
|
xo = centerMV.x; |
| 402 |
|
yo = centerMV.y; |
| 403 |
|
xo2 = second_best.x; |
| 404 |
|
yo2 = second_best.y; |
| 405 |
|
|
| 406 |
|
data->iMinSAD2 = 256 * 4096; |
| 407 |
|
|
| 408 |
|
if (yo == yo2) { |
| 409 |
|
CHECK_CANDIDATE((xo+xo2)>>1, yo, 0); |
| 410 |
|
CHECK_CANDIDATE(xo, yo-1, 0); |
| 411 |
|
CHECK_CANDIDATE(xo, yo+1, 0); |
| 412 |
|
|
| 413 |
|
if(best_sad <= data->iMinSAD2) return; |
| 414 |
|
|
| 415 |
|
if(data->currentQMV[0].x == data->currentQMV2.x) { |
| 416 |
|
CHECK_CANDIDATE((xo+xo2)>>1, yo-1, 0); |
| 417 |
|
CHECK_CANDIDATE((xo+xo2)>>1, yo+1, 0); |
| 418 |
|
} else { |
| 419 |
|
CHECK_CANDIDATE((xo+xo2)>>1, |
| 420 |
|
(data->currentQMV[0].x == xo) ? data->currentQMV[0].y : data->currentQMV2.y, 0); |
| 421 |
|
} |
| 422 |
|
return; |
| 423 |
|
} |
| 424 |
|
|
| 425 |
|
if (xo == xo2) { |
| 426 |
|
CHECK_CANDIDATE(xo, (yo+yo2)>>1, 0); |
| 427 |
|
CHECK_CANDIDATE(xo-1, yo, 0); |
| 428 |
|
CHECK_CANDIDATE(xo+1, yo, 0); |
| 429 |
|
|
| 430 |
|
if(best_sad < data->iMinSAD2) return; |
| 431 |
|
|
| 432 |
|
if(data->currentQMV[0].y == data->currentQMV2.y) { |
| 433 |
|
CHECK_CANDIDATE(xo-1, (yo+yo2)>>1, 0); |
| 434 |
|
CHECK_CANDIDATE(xo+1, (yo+yo2)>>1, 0); |
| 435 |
|
} else { |
| 436 |
|
CHECK_CANDIDATE((data->currentQMV[0].y == yo) ? data->currentQMV[0].x : data->currentQMV2.x, (yo+yo2)>>1, 0); |
| 437 |
|
} |
| 438 |
|
return; |
| 439 |
|
} |
| 440 |
|
|
| 441 |
|
CHECK_CANDIDATE(xo, (yo+yo2)>>1, 0); |
| 442 |
|
CHECK_CANDIDATE((xo+xo2)>>1, yo, 0); |
| 443 |
|
|
| 444 |
|
if(best_sad <= data->iMinSAD2) return; |
| 445 |
|
|
| 446 |
|
CHECK_CANDIDATE((xo+xo2)>>1, (yo+yo2)>>1, 0); |
| 447 |
|
} |
Parent Directory
| 
Revision Log
| 
Patch