How to use KNearest and ANN in OpenCV 3.0

edit

can't help you with ann, but here's KNearest:

Ptr<ml::KNearest>  knn(ml::KNearest::create());
Mat_<float> trainFeatures(6,4);
trainFeatures << 2,2,2,2,
                 3,3,3,3,
                 4,4,4,4,
                 5,5,5,5,
                 6,6,6,6,
                 7,7,7,7;

Mat_<int> trainLabels(1,6);
trainLabels << 2,3,4,5,6,7;

knn->train(trainFeatures, ml::ROW_SAMPLE, trainLabels);

Mat_<float> testFeature(1,4);
testFeature<< 3,3,3,3;


int K=1;
Mat response,dist;
knn->findNearest(testFeature, K, noArray(), response, dist);
cerr << response << endl;
cerr << dist<< endl;

// K=1 
[3]
[0]

// K=4:
[3, 2, 4, 5]
[0, 4, 4, 16]

+++ OK, it appears that I misunderstood the OP's question and answered something that is true but not right on topic... So understand this is an answer about feature detectors, not on machine learning as the OP intended! Thanks for people in comments for pointing out ;) +++

Since OpenCV 3.0 "official release" is not out yet, the doc isn't that much available, so asking questions is a thing to do (well, it is what I have done).

Here is an example of knn match, which I think is another name for KNearest neighbours.

            // Number of neighbours
            int k = 2; 
            // Vector of DMatch containing the filtered results, only the best matches
            vector<DMatch> good_matches;
            // Vector containing a vector of DMatch (which contain the "k" nearest matches)
            vector<vector< DMatch >> matches;
            // Declaration of the matcher "3.0 style"
            Ptr<DescriptorMatcher> matcher = DescriptorMatcher::create("BruteForce-Hamming");

            // Computation of the "k" nearest matches
            matcher -> knnMatch( objectDescriptors, sceneDescriptors, matches, k );


            /// Ratio test from Lowe-SIFT. It helps select the most relevant matches by doing a
            // ratio between each best and second best matches 

            if (matches[0].size() > 1)
            {

                for (int i = 0; i < matches.size(); ++i)
                {
                    const double ratio = 0.8; // As in Lowe's paper; can be tuned
                    if (matches[i][0].distance < ratio * matches[i][1].distance)
                    {
                        good_matches.push_back(matches[i][0]);
                    }
                }
            }

So at the end, you have a vector of DMatch indicating which matches are relevant according to a criterion, here, Lowe's ratio test. You may then use other techniques to continue your detection.

It assumes that prior to its execution, you have computed, for example, BRISK keypoint-descriptors for an object (model) and a scene (the picture on which you try to find the object). If you need more info on keypoint-descriptors, there are wide range of question on this site. If it is still obscure after, ask another question and people will gladly provide help :)

I am trying to create empty KNearest like berak, but I still have an error! What is the parametr of func KNearest::creat?

I've found solution like below, but it still doesn't compile

Ptr<KNearest> knearestKdt = KNearest::create(ml::KNearest::Params(10, true, INT_MAX, ml::KNearest::KDTREE));
knearestKdt->train(trainData, ml::ROW_SAMPLE, trainLabels);
knearestKdt->findNearest(testData, 4, bestLabels);