Tracking and data association
Markov random field modeling in computer vision
Markov random field modeling in computer vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Recognition of Human Movement Using Temporal Templates
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiresolution Gray-Scale and Rotation Invariant Texture Classification with Local Binary Patterns
IEEE Transactions on Pattern Analysis and Machine Intelligence
Probabilistic People Tracking for Occlusion Handling
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Real-Time Multiple Objects Tracking with Occlusion Handling in Dynamic Scenes
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
IEEE Transactions on Pattern Analysis and Machine Intelligence
Segmentation and Tracking of Multiple Humans in Crowded Environments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Vision-Based Multiple Interacting Targets Tracking via On-Line Supervised Learning
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
Real-time foreground-background segmentation using codebook model
Real-Time Imaging
Hi-index | 0.08 |
In multiple object tracking, it is challenging to maintain the correct tracks of objects in the presence of occlusions. The paper proposes a new method to this problem, building on the patch representation of object appearance. We formulate multiple object tracking as classification tasks which competitively use the appearance models of the interacting objects. To obtain the optimal configuration of classification, a patches-based MAP-MRF decision framework is presented to make a global inference based on local spatial information existing between adjacent patches and the maximum a posteriori solution is evaluated exactly with graph cuts. As a result, accurate object identification is achieved. Extensive experiments on several difficult sequences validate that the proposed method is effective in dealing with multiple object occlusion, and comparative results show that our method outperforms the previous methods.