| | |
| | |
| | |
| | |
| |
|
| | #include "float.th" |
| |
|
| | #undef COMPARISONFUNCTION_TYPE |
| |
|
| | #if (FLT == VL_TYPE_FLOAT) |
| | #define COMPARISONFUNCTION_TYPE VlFloatVectorComparisonFunction |
| | #else |
| | #define COMPARISONFUNCTION_TYPE VlDoubleVectorComparisonFunction |
| | #endif |
| |
|
| | |
| |
|
| | VL_EXPORT T |
| | VL_XCAT(_vl_distance_l2_, SFX) |
| | (vl_size dimension, T const * X, T const * Y) |
| | { |
| | T const * X_end = X + dimension ; |
| | T acc = 0.0 ; |
| | while (X < X_end) { |
| | T d = *X++ - *Y++ ; |
| | acc += d * d ; |
| | } |
| | return acc ; |
| | } |
| |
|
| | VL_EXPORT T |
| | VL_XCAT(_vl_distance_l1_, SFX) |
| | (vl_size dimension, T const * X, T const * Y) |
| | { |
| | T const * X_end = X + dimension ; |
| | T acc = 0.0 ; |
| | while (X < X_end) { |
| | T d = *X++ - *Y++ ; |
| | acc += VL_MAX(d, -d) ; |
| | } |
| | return acc ; |
| | } |
| |
|
| | VL_EXPORT T |
| | VL_XCAT(_vl_distance_chi2_, SFX) |
| | (vl_size dimension, T const * X, T const * Y) |
| | { |
| | T const * X_end = X + dimension ; |
| | T acc = 0.0 ; |
| | while (X < X_end) { |
| | T a = *X++ ; |
| | T b = *Y++ ; |
| | T delta = a - b ; |
| | T denom = (a + b) ; |
| | T numer = delta * delta ; |
| | if (denom) { |
| | T ratio = numer / denom ; |
| | acc += ratio ; |
| | } |
| | } |
| | return acc ; |
| | } |
| |
|
| | VL_EXPORT T |
| | VL_XCAT(_vl_kernel_l2_, SFX) |
| | (vl_size dimension, T const * X, T const * Y) |
| | { |
| | T const * X_end = X + dimension ; |
| | T acc = 0.0 ; |
| | while (X < X_end) { |
| | T a = *X++ ; |
| | T b = *Y++ ; |
| | acc += a * b ; |
| | } |
| | return acc ; |
| | } |
| |
|
| | VL_EXPORT T |
| | VL_XCAT(_vl_kernel_l1_, SFX) |
| | (vl_size dimension, T const * X, T const * Y) |
| | { |
| | T const * X_end = X + dimension ; |
| | T acc = 0.0 ; |
| | while (X < X_end) { |
| | T a = *X++ ; |
| | T b = *Y++ ; |
| | T a_ = VL_XCAT(vl_abs_, SFX) (a) ; |
| | T b_ = VL_XCAT(vl_abs_, SFX) (b) ; |
| | acc += a_ + b_ - VL_XCAT(vl_abs_, SFX) (a - b) ; |
| | } |
| | return acc / ((T)2) ; |
| | } |
| |
|
| | VL_EXPORT T |
| | VL_XCAT(_vl_kernel_chi2_, SFX) |
| | (vl_size dimension, T const * X, T const * Y) |
| | { |
| | T const * X_end = X + dimension ; |
| | T acc = 0.0 ; |
| | while (X < X_end) { |
| | T a = *X++ ; |
| | T b = *Y++ ; |
| | T denom = (a + b) ; |
| | if (denom) { |
| | T numer = 2 * a * b ; |
| | T ratio = numer / denom ; |
| | acc += ratio ; |
| | } |
| | } |
| | return acc ; |
| | } |
| |
|
| | |
| |
|
| | VL_EXPORT COMPARISONFUNCTION_TYPE |
| | VL_XCAT(vl_get_vector_comparison_function_, SFX)(VlVectorComparisonType type) |
| | { |
| | COMPARISONFUNCTION_TYPE function = 0 ; |
| | switch (type) { |
| | case VlDistanceL2 : function = VL_XCAT(_vl_distance_l2_, SFX) ; break ; |
| | case VlDistanceL1 : function = VL_XCAT(_vl_distance_l1_, SFX) ; break ; |
| | case VlDistanceChi2 : function = VL_XCAT(_vl_distance_chi2_, SFX) ; break ; |
| | case VlKernelL2 : function = VL_XCAT(_vl_kernel_l2_, SFX) ; break ; |
| | case VlKernelL1 : function = VL_XCAT(_vl_kernel_l1_, SFX) ; break ; |
| | case VlKernelChi2 : function = VL_XCAT(_vl_kernel_chi2_, SFX) ; break ; |
| | default: assert(0) ; break ; |
| | } |
| |
|
| | #ifdef VL_SUPPORT_SSE2 |
| | if (vl_cpu_has_sse2() && vl_get_simd_enabled()) { |
| | switch (type) { |
| | case VlDistanceL2 : function = VL_XCAT(_vl_distance_l2_sse2_, SFX) ; break ; |
| | case VlDistanceL1 : function = VL_XCAT(_vl_distance_l1_sse2_, SFX) ; break ; |
| | case VlDistanceChi2 : function = VL_XCAT(_vl_distance_chi2_sse2_, SFX) ; break ; |
| | case VlKernelL2 : function = VL_XCAT(_vl_kernel_l2_sse2_, SFX) ; break ; |
| | case VlKernelL1 : function = VL_XCAT(_vl_kernel_l1_sse2_, SFX) ; break ; |
| | case VlKernelChi2 : function = VL_XCAT(_vl_kernel_chi2_sse2_, SFX) ; break ; |
| | default: break ; |
| | } |
| | } |
| | #endif |
| |
|
| | return function ; |
| | } |
| |
|
| | |
| |
|
| | VL_EXPORT void |
| | VL_XCAT(vl_eval_vector_comparison_on_all_pairs_, SFX) |
| | (T * result, vl_size dimension, |
| | T const * X, vl_size numDataX, |
| | T const * Y, vl_size numDataY, |
| | COMPARISONFUNCTION_TYPE function) |
| | { |
| | int xi ; |
| | int yi ; |
| |
|
| | assert (X) ; |
| | if (numDataX == 0) return ; |
| |
|
| | if (Y) { |
| | if (numDataY == 0) return ; |
| | for (yi = 0 ; yi < numDataY ; ++ yi) { |
| | for (xi = 0 ; xi < numDataX ; ++ xi) { |
| | *result++ = (*function)(dimension, X, Y) ; |
| | X += dimension ; |
| | } |
| | X -= dimension * numDataX ; |
| | Y += dimension ; |
| | } |
| | } else { |
| | T * resultTransp = result ; |
| | Y = X ; |
| | for (yi = 0 ; yi < numDataX ; ++ yi) { |
| | for (xi = 0 ; xi <= yi ; ++ xi) { |
| | T z = (*function)(dimension, X, Y) ; |
| | X += dimension ; |
| | *result = z ; |
| | *resultTransp = z ; |
| | result += 1 ; |
| | resultTransp += numDataX ; |
| | } |
| | X -= dimension * (yi + 1) ; |
| | Y += dimension ; |
| | result += numDataX - (yi + 1) ; |
| | resultTransp += 1 - (yi + 1) * numDataX ; |
| | } |
| | } |
| | } |
| |
|
| |
|
| |
|