首页> 外文会议>Asian conference on computer vision >Random Forest with Suppressed Leaves for Hough Voting
【24h】

Random Forest with Suppressed Leaves for Hough Voting

机译:随机森林,有被压抑的叶子,可以进行投票

获取原文

摘要

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 LO-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.
机译:基于随机森林的霍夫投票技术已广泛用于各种计算机视觉问题。作为一种集成学习方法,随机森林中叶节点的投票权重起着至关重要的作用,以产生可靠的估计结果。我们建议通过同时优化叶票的权重和修剪森林中不可靠的叶节点来改善随机森林的霍夫投票。构造随机森林后,将每棵树的权重分配问题公式化为LO正规化优化问题,其中抑制具有零投票权重的不可靠叶子节点,并修剪树以忽略仅包含被抑制叶子的子树。我们将我们提出的技术应用于一些回归和分类问题,例如手势识别,头部姿势估计和关节姿势估计。实验结果表明,通过抑制不可靠的叶节点,不仅提高了预测精度,而且降低了随机森林的预测时间成本和模型复杂度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号