|
public FindFeatures ( float descriptors, Matrix |
||
| descriptors | float | The m feature descriptors to be searched from the feature tree |
| results | Matrix |
/// The results of the best |
| dist | Matrix |
/// A m x |
| k | int | The number of neighbors to find |
| emax | int | For k-d tree only: the maximum number of leaves to visit. Use 20 if not sure |
| Результат | void | |
public void FindFeatures(float[][] descriptors, out Matrix<Int32> results, out Matrix<double> dist, int k, int emax)
{
int numberOfDescriptors = descriptors.Length;
results = new Matrix<Int32>(numberOfDescriptors, k);
dist = new Matrix<double>(numberOfDescriptors, k);
FindFeatures(descriptors, results, dist, k, emax);
}
public void TestKDTree()
{
float[][] features = new float[10][];
for (int i = 0; i < features.Length; i++)
features[i] = new float[] { (float)i };
FeatureTree tree = new FeatureTree(features);
Matrix<Int32> result;
Matrix<double> distance;
float[][] features2 = new float[1][];
features2[0] = new float[] { 5.0f };
tree.FindFeatures(features2, out result, out distance, 1, 20);
Assert.AreEqual(result[0, 0], 5);
Assert.AreEqual(distance[0, 0], 0.0);
}