Deeply optimized Hough transform: Application to action segmentation

7Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Hough-like methods like Implicit Shape Model (ISM) and Hough forest have been successfully applied in multiple computer vision fields like object detection, tracking, skeleton extraction or human action detection. However, these methods are known to generate false positives. To handle this issue, several works like Max-Margin Hough Transform (MMHT) or Implicit Shape Kernel (ISK) have reported significant performance improvements by adding discriminative parameters to the generative ones introduced by ISM. In this paper, we offer to use only discriminative parameters that are globally optimized according to all the variables of the Hough transform. To this end, we abstract the common vote process of all Hough methods into linear equations, leading to a training formulation that can be solved using linear programming solvers. Our new Hough Transform significantly outperforms the previous ones on HoneyBee and TUM datasets, two public databases of action and behaviour segmentation. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Chan-Hon-Tong, A., Achard, C., & Lucat, L. (2013). Deeply optimized Hough transform: Application to action segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8156 LNCS, pp. 51–60). https://doi.org/10.1007/978-3-642-41181-6_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free