Zhuolin Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zhuolin Jiang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
Larry S. Davis
University of Maryland, College Park, MD 20742, United States
2 shared publications- Zhe Lin
Adobe Research, San Jose, USA
2 shared publications - Fatih Porikli
Qualcomm AI Research
1 shared publication Haibin Ling
1 shared publicationLarry Davis
1 shared publication- Ling Shao
University of Chinese Academy of Sciences
1 shared publication
Latest Publications
- 1 October 2015
- Published by Elsevier in Pattern Recognition
- Vol. 48 (10) , 2961-2963
Discriminative feature learning from big data for visual recognition
- 1 October 2015
- Published by Elsevier in Pattern Recognition
- Vol. 48 (10) , 2961-2963
Discriminative feature learning from big data for visual recognition
- 1 October 2013
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 117 (10) , 1345-1355
A unified tree-based framework for joint action localization, recognition and segmentation
- 1 October 2013
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 117 (10) , 1345-1355
A unified tree-based framework for joint action localization, recognition and segmentation
- 23 January 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 34 (3) , 533-547
Recognizing Human Actions by Learning and Matching Shape-Motion Prototype Trees
A shape-motion prototype-based approach is introduced for action recognition. The approach represents an action as a sequence of prototypes for efficient and flexible action matching in long video sequences. During training, an action prototype tree is learned in a joint shape and motion space via hierarchical K-means clustering and each training sequence is represented as a labeled prototype sequence; then a look-up table of prototype-to-prototype distances is generated. During testing, based on a joint probability model of the actor location and action prototype, the actor is tracked while a frame-to-prototype correspondence is established by maximizing the joint probability, which is efficiently performed by searching the learned prototype tree; then actions are recognized using dynamic prototype sequence matching. Distance measures used for sequence matching are rapidly obtained by look-up table indexing, which is an order of magnitude faster than brute-force computation of frame-to-frame distances. Our approach enables robust action matching in challenging situations (such as moving cameras, dynamic backgrounds) and allows automatic alignment of action sequences. Experimental results demonstrate that our approach achieves recognition rates of 92.86 percent on a large gesture data set (with dynamic backgrounds), 100 percent on the Weizmann action data set, 95.77 percent on the KTH action data set, 88 percent on the UCF sports data set, and 87.27 percent on the CMU action data set.
- 23 January 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 34 (3) , 533-547
Recognizing Human Actions by Learning and Matching Shape-Motion Prototype Trees
A shape-motion prototype-based approach is introduced for action recognition. The approach represents an action as a sequence of prototypes for efficient and flexible action matching in long video sequences. During training, an action prototype tree is learned in a joint shape and motion space via hierarchical K-means clustering and each training sequence is represented as a labeled prototype sequence; then a look-up table of prototype-to-prototype distances is generated. During testing, based on a joint probability model of the actor location and action prototype, the actor is tracked while a frame-to-prototype correspondence is established by maximizing the joint probability, which is efficiently performed by searching the learned prototype tree; then actions are recognized using dynamic prototype sequence matching. Distance measures used for sequence matching are rapidly obtained by look-up table indexing, which is an order of magnitude faster than brute-force computation of frame-to-frame distances. Our approach enables robust action matching in challenging situations (such as moving cameras, dynamic backgrounds) and allows automatic alignment of action sequences. Experimental results demonstrate that our approach achieves recognition rates of 92.86 percent on a large gesture data set (with dynamic backgrounds), 100 percent on the Weizmann action data set, 95.77 percent on the KTH action data set, 88 percent on the UCF sports data set, and 87.27 percent on the CMU action data set.