src/search_engine/relja_retrival/external/KMCode_relja/descriptor/dog.cpp
/* Check whether the image point closest to (row,col) is below the
   given value.  It would be possible to use bilinear interpolation to
   sample the image more accurately, but this is not necessary as we
   are looking for a worst-case peak value.
*/
Check whether the image point closest to (row,col) is below the
given value.  It would be possible to use bilinear interpolation to
sample the image more accurately, but this is not necessary as we
are looking for a worst-case peak value.
Check whether the image point closest to ( row col ) is below the given value . It would be possible to use bilinear interpolation to sample the image more accurately but this is not necessary as we are looking for a worst - case peak value .
int CheckDipPoint(float val, DARY * image, float row, float col)
{
    int r, c;
    r = (int) (row + 0.5);
    c = (int) (col + 0.5);
    if (r < 0  ||  c < 0  ||  r >= (int)image->y()  ||
        	c >= (int)image->x())
	return 1;
    if (val > 0.0) {
	if (image->fel[r][c] > val)
	    return 0;
    } else {
	if (image->fel[r][c] < val)
	    return 0;
    }
    return 1;
}
int CheckDipPoint ( float val , DARY * image , float row , float col ) { int r , c ; r = ( int ) ( row + 0.5 ) ; c = ( int ) ( col + 0.5 ) ; if ( r < 0 || c < 0 || r >= ( int ) image -> y ( ) || c >= ( int ) image -> x ( ) ) return 1 ; if ( val > 0.0 ) { if ( image -> fel [ r ] [ c ] > val ) return 0 ; } else { if ( image -> fel [ r ] [ c ] < val ) return 0 ; } return 1 ; }
Check whether the image point closest to (row,col) is below the
given value.
Check whether the image point closest to ( row col ) is below the given value .