I am currently using cv::KNearest to classify some images and it works fine, but I can't seem to find which distance is used to find out "how near" are the train samples. My guess would be Euclidean but I didn't find any clue to confirm that.
Moreover I'd like to try several distance measures to compare their efficiency, as I was told that chi-square performs best in my application. Is it possible to do so with this implementation of the KNN algorithm?
thanks by advance for your answers !