Efficient descriptor tree growing for fast action recognition
Our method significantly reduces the time complexity of a popular classifier. Our method achieves state-of-the-art classification accuracy. We present an efficient algorithm to organize the training data used by our method. An important parameter of the data organization algorithm is analyzed.
action recognition nearest neighbor instance-to-class distance