Bilinear programming for human activity recognition with unknown MRF graphs

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2013, Pages 1690-1697

  Wang, Zhenhua ^a   Shi, Qinfeng ^a   Shen, Chunhua ^a   Van Den Hengel, Anton ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BILINEAR PROGRAMMING; HUMAN ACTIVITIES; HUMAN ACTIVITY RECOGNITION; MAP INFERENCES; MARKOV RANDOM FIELD; MODEL COMPLEXES; UNDERLYING GRAPHS;

PATTERN RECOGNITION; SPORTS; UNCERTAINTY ANALYSIS;

MARKOV PROCESSES;

EID: 84887361102     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2013.221     Document Type: Conference Paper

References (20)

1. J. K. Aggarwal and M. S. Ryoo. Human activity analysis: A review. ACM Comput. Surv., 43(3), 2011.
2. E. D. Andersen, C. Roos, and T. Terlaky. On implementing a primal-dual interior-point method for conic quadratic optimization. Mathematical Programming, 95, 2003. http: //www. mosek. com.
3. S. Boyd and J. Mattingley. Branch and bound methods, 2003.
4. M. Chandraker and D. Kriegman. Globally optimal bilinear programming for computer vision applications. In Proc. IEEE Conf. Comp. Vis. & Pattern Recogn., 2008.
5. W. Choi, K. Shahid, and S. Savarese. Learning context for collective activity recognition. In Proc. IEEE Conf. Comp. Vis. & Pattern Recogn., 2011.
6. N. Dalal and B. Triggs. Histograms of oriented gradients for human detection. In Proc. IEEE Conf. Comp. Vis. & Pattern Recogn., 2005.
7. A. Globerson and T. Jaakkola. Fixing max-product: Convergent message passing algorithms for map lp-relaxations. In Proc. Adv. Neural Info. Process. Syst., 2007.
8. R. Kinderman and J. L. Snell. Markov Random Fields and their applications. Amer. Math. Soc., Providence, RI, 1980.
9. T. Lan, Y. Wang, and G. Mori. Beyond actions: Discriminative models for contextual group activities. In Proc. Adv. Neural Info. Process. Syst., 2010.
10. I. Laptev. On space-time interest points. Int. J. Comput. Vis., 64(2):107-123, 2005.
11. I. Laptev, M. Marszalek, C. Schmid, and B. Rozenfeld. Learning realistic human actions from movies. In Proc. IEEE Conf. Comp. Vis. & Pattern Recogn., 2008.
12. O. Masoud and N. Papanikolopoulos. A method for human action recognition. Image Vision Comput., 21(8):729-743, 2003.
13. G. P. McCormick. Computability of global solutions to factorable nonconvex programs. Mathematical programming, 10(1):147-175, 1976.
14. A. Patron-Perez, M. Marszalek, A. Zisserman, and I. Reid. High five: Recognising human interactions in tv shows. In Proc. British Comp. Vis. Conf., 2010.
15. C. Schuldt, I. Laptev, and B. Caputo. Recognizing human actions: A local svm approach. In Proc. Int. Conf. Pattern Recogn., 2004.
16. D. Sontag, T. Meltzer, A. Globerson, Y. Weiss, and T. Jaakkola. Tightening LP relaxations for MAP using message-passing. In Proc. Conf. Uncertainty in Artificial Intelli., 2008.
17. D. Tran and A. Sorokin. Human activity recognition with metric learning. In Proc. Eur. Conf. Comput. Vis., 2008.
18. I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun. Large margin methods for structured and interdependent output variables. J. Mach. Learn. Res., 6(2):1453-1484, 2006.
19. C. N. J. Yu and T. Joachims. Learning structural svms with latent variables. In Proc. Int. Conf. Mach. Learn., 2009.
20. A. Yuille, A. Rangarajan, and A. L. Yuille. The concaveconvex procedure (cccp. In Proc. Adv. Neural Info. Process. Syst. MIT Press, 2002.