Random forest with suppressed leaves for hough voting

Abstract

Random forest based Hough-voting techniques have been widely used in a variety of computer vision problems. As an ensemble learning method, the voting weights of leaf nodes in random forest play critical role to generate reliable estimation result. We propose to improve Hough-voting with random forest via simultaneously optimizing the weights of leaf votes and pruning unreliable leaf nodes in the forest. After constructing the random forest, the weight assignment problem at each tree is formulated as a L0-regularized optimization problem, where unreliable leaf nodes with zero voting weights are suppressed and trees are pruned to ignore sub-trees that contain only suppressed leaves. We apply our proposed techniques to several regression and classification problems such as hand gesture recognition, head pose estimation and articulated pose estimation. The experimental results demonstrate that by suppressing unreliable leaf nodes, it not only improves prediction accuracy, but also reduces both prediction time cost and model complexity of the random forest.