An Adaptive Learning Method for Target Tracking across Multiple Cameras Kuan-Wen Chen, Chih-Chuan Lai, Yi-Ping Hung, Chu-Song Chen National Taiwan University.

Slides:



Advertisements
Similar presentations
QR Code Recognition Based On Image Processing
Advertisements

Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Fast Algorithms For Hierarchical Range Histogram Constructions
Bayesian Estimation in MARK
1 Approximated tracking of multiple non-rigid objects using adaptive quantization and resampling techniques. J. M. Sotoca 1, F.J. Ferri 1, J. Gutierrez.
Ch 11. Sampling Models Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by I.-H. Lee Biointelligence Laboratory, Seoul National.
Patch to the Future: Unsupervised Visual Prediction
M.S. Student, Hee-Jong Hong
Learning to estimate human pose with data driven belief propagation Gang Hua, Ming-Hsuan Yang, Ying Wu CVPR 05.
Semantic Structure from Motion Paper by: Sid Yingze Bao and Silvio Savarese Presentation by: Ian Lenz.
CSE 252C, Fall 2006UCSD1 Tracking objects across cameras by incrementally learning inter- camera colour calibration and patterns of activity (ECCV 2006)
10/11/2001Random walks and spectral segmentation1 CSE 291 Fall 2001 Marina Meila and Jianbo Shi: Learning Segmentation by Random Walks/A Random Walks View.
A Generalized Model for Financial Time Series Representation and Prediction Author: Depei Bao Presenter: Liao Shu Acknowledgement: Some figures in this.
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes (CVPR’10) Shengcai Liao, Guoying Zhao, Vili Kellokumpu,
HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.
1 Robust Video Stabilization Based on Particle Filter Tracking of Projected Camera Motion (IEEE 2009) Junlan Yang University of Illinois,Chicago.
MULTI-TARGET TRACKING THROUGH OPPORTUNISTIC CAMERA CONTROL IN A RESOURCE CONSTRAINED MULTIMODAL SENSOR NETWORK Jayanth Nayak, Luis Gonzalez-Argueta, Bi.
Segmentation and Tracking of Multiple Humans in Crowded Environments Tao Zhao, Ram Nevatia, Bo Wu IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE,
Probabilistic video stabilization using Kalman filtering and mosaicking.
Adaptive Rao-Blackwellized Particle Filter and It’s Evaluation for Tracking in Surveillance Xinyu Xu and Baoxin Li, Senior Member, IEEE.
Motion based Correspondence for Distributed 3D tracking of multiple dim objects Ashok Veeraraghavan.
Incremental Learning of Temporally-Coherent Gaussian Mixture Models Ognjen Arandjelović, Roberto Cipolla Engineering Department, University of Cambridge.
Multiple Human Objects Tracking in Crowded Scenes Yao-Te Tsai, Huang-Chia Shih, and Chung-Lin Huang Dept. of EE, NTHU International Conference on Pattern.
A Probabilistic Approach to Collaborative Multi-robot Localization Dieter Fox, Wolfram Burgard, Hannes Kruppa, Sebastin Thrun Presented by Rajkumar Parthasarathy.
1 Integration of Background Modeling and Object Tracking Yu-Ting Chen, Chu-Song Chen, Yi-Ping Hung IEEE ICME, 2006.
Probability Grid: A Location Estimation Scheme for Wireless Sensor Networks Presented by cychen Date : 3/7 In Secon (Sensor and Ad Hoc Communications and.
Face Processing System Presented by: Harvest Jang Group meeting Fall 2002.
Jacinto C. Nascimento, Member, IEEE, and Jorge S. Marques
Lecture II-2: Probability Review
Joint Histogram Based Cost Aggregation For Stereo Matching Dongbo Min, Member, IEEE, Jiangbo Lu, Member, IEEE, Minh N. Do, Senior Member, IEEE IEEE TRANSACTION.
SINGLE CHANNEL SPEECH MUSIC SEPARATION USING NONNEGATIVE MATRIXFACTORIZATION AND SPECTRAL MASKS Jain-De,Lee Emad M. GraisHakan Erdogan 17 th International.
Autonomous Learning of Object Models on Mobile Robots Xiang Li Ph.D. student supervised by Dr. Mohan Sridharan Stochastic Estimation and Autonomous Robotics.
Tracking Pedestrians Using Local Spatio- Temporal Motion Patterns in Extremely Crowded Scenes Louis Kratz and Ko Nishino IEEE TRANSACTIONS ON PATTERN ANALYSIS.
1 Physical Fluctuomatics 5th and 6th Probabilistic information processing by Gaussian graphical model Kazuyuki Tanaka Graduate School of Information Sciences,
A General Framework for Tracking Multiple People from a Moving Camera
3D SLAM for Omni-directional Camera
Memory Bounded Inference on Topic Models Paper by R. Gomes, M. Welling, and P. Perona Included in Proceedings of ICML 2008 Presentation by Eric Wang 1/9/2009.
Style & Topic Language Model Adaptation Using HMM-LDA Bo-June (Paul) Hsu, James Glass.
Handover and Tracking in a Camera Network Presented by Dima Gershovich.
Experiments Test different parking lot images captured in different luminance conditions The test samples include 1300 available parking spaces and 1500.
ISQS 6347, Data & Text Mining1 Ensemble Methods. ISQS 6347, Data & Text Mining 2 Ensemble Methods Construct a set of classifiers from the training data.
Stable Multi-Target Tracking in Real-Time Surveillance Video
Robust Object Tracking by Hierarchical Association of Detection Responses Present by fakewen.
Sparse Bayesian Learning for Efficient Visual Tracking O. Williams, A. Blake & R. Cipolloa PAMI, Aug Presented by Yuting Qi Machine Learning Reading.
Jiann-Ming Wu, Ya-Ting Zhou, Chun-Chang Wu National Dong Hwa University Department of Applied Mathematics Hualien, Taiwan Learning Markov-chain embedded.
Boosted Particle Filter: Multitarget Detection and Tracking Fayin Li.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Unsupervised Learning with Mixed Numeric and Nominal Data.
Reducing MCMC Computational Cost With a Two Layered Bayesian Approach
Inference of Non-Overlapping Camera Network Topology by Measuring Statistical Dependence Date :
Visual Tracking by Cluster Analysis Arthur Pece Department of Computer Science University of Copenhagen
1 Chapter 8: Model Inference and Averaging Presented by Hui Fang.
Matching of Objects Moving Across Disjoint Cameras Eric D. Cheng and Massimo Piccardi IEEE International Conference on Image Processing
Semantic Alignment Spring 2009 Ben-Gurion University of the Negev.
Kevin Stevenson AST 4762/5765. What is MCMC?  Random sampling algorithm  Estimates model parameters and their uncertainty  Only samples regions of.
Learning and Removing Cast Shadows through a Multidistribution Approach Nicolas Martel-Brisson, Andre Zaccarin IEEE TRANSACTIONS ON PATTERN ANALYSIS AND.
Ch 1. Introduction Pattern Recognition and Machine Learning, C. M. Bishop, Updated by J.-H. Eom (2 nd round revision) Summarized by K.-I.
Generalization Performance of Exchange Monte Carlo Method for Normal Mixture Models Kenji Nagata, Sumio Watanabe Tokyo Institute of Technology.
Summary of “Efficient Deep Learning for Stereo Matching”
Yun-FuLiu Jing-MingGuo Che-HaoChang
Dynamical Statistical Shape Priors for Level Set Based Tracking
Outline Image Segmentation by Data-Driven Markov Chain Monte Carlo
Markov chain monte carlo
Latent Space Model for Road Networks to Predict Time-Varying Traffic
Unfolding Problem: A Machine Learning Approach
Outline S. C. Zhu, X. Liu, and Y. Wu, “Exploring Texture Ensembles by Efficient Markov Chain Monte Carlo”, IEEE Transactions On Pattern Analysis And Machine.
Robust Full Bayesian Learning for Neural Networks
Related Work in Camera Network Tracking
Unfolding with system identification
EM Algorithm and its Applications
NON-NEGATIVE COMPONENT PARTS OF SOUND FOR CLASSIFICATION Yong-Choon Cho, Seungjin Choi, Sung-Yang Bang Wen-Yi Chu Department of Computer Science &
Presentation transcript:

An Adaptive Learning Method for Target Tracking across Multiple Cameras Kuan-Wen Chen, Chih-Chuan Lai, Yi-Ping Hung, Chu-Song Chen National Taiwan University CVPR2008 Reporter: Chia-Hao Hsieh 2009/1/19

Outline Introduction Visual cues for tracking across camera – Spatio-Temporal Relationships – Brightness Transfer Functions Experimental Results

Introduction Adaptive learning method Tracking targets across multiple cameras with disjoint views Using prior knowledge – Camera network topology Sudden lighting changes

Spatio-Temporal Relationships Prior knowledge of camera network topology Which pair of cameras are adjacent The blind regions are closed or open – Advantage Decrease computation complexity Help remove the redundant links

Spatio-Temporal Relationships Batch + Adaptive learning method Batch learning phase – Estimate entry/exit zones for each single image – Model each entry/exit zones as a GMM, and use EM to estimate parameter of GMM Adaptive learning phase – Learn the transition probability for each possible link

Spatio-Temporal Relationships transition probability Valid link – If exceeds double of the median value

Spatio-Temporal Relationships Problems – Misclassify two zones into one single zone Update the entry/exit zones by using on-line K-means approximation Propose some operators – Zone Addition, Zone Merging, Zone Split

Brightness Transfer Functions In [7], m x m matrix – The appearance is modeled as an m-bin histogram Propose an unsupervised learning method – Low dimensional subspace – Using spatio-temporal information and Markov chain Monte Carlo (MCMC) sampling [7] Tracking objects across cameras by incrementally learning inter-camera color calibration and patterns of activity. In ECCV, 2006

Brightness Transfer Functions Model – Normalized cumulative histogram H i, H j. – The percentage of image points in O i with brightness less than or equal to B i is equal to the percentage of image points in O j with brightness less than or equal to B j. – f ij is the BTF for every pair of observations O i and O j in the training set

Brightness Transfer Functions Learning – Probabilistic Principal Component Analysis PPCA – f ij can be written as BTF can be learnt with less data The average reconstruction error decreases when the number of learning data increases

Criterion for BTF estimation The transformed histogram gives a much better match as compared to direct histogram matching A correct BTF learnt by using correct correspondences would have a more diverse reconstruction error distribution and lower errors than the one learnt by using incorrect correspondences

Criterion for BTF estimation criterion p(π) for BTF estimation similarity(pair i ): the similarity score of the ith corresponding pair, which is calculated by (1- reconstruction_error(pair i ))

Spatio-temporal information and MCMC sampling BTF is learnt – without hand-labeled correspondence – by sampling from the training data set – By choosing the best BTF according to the criterion – NOT practical to sample all of the permutations directly

Spatio-temporal information and MCMC sampling For example – n observations – n! matching permutations – But, n pairs at most the correct correspondence Sample by using Markov Chain Monte Carlo and Metropolis-Hastings algorithm

Experimental Results

Makris’s method This paper

Experimental Results faster learning rate. Gilbert and Bowden’s method never learns a stable BTF in the testing period

Experimental Results Tracking Results The overall tracking accuracy is 89.4% by using unseen ground-truth of half an hour

Experimental Results Outdoor environment Performs well and achieves high tracking accuracy in both indoor and outdoor environment

Conclusion Unlike the other approaches assuming that the monitored environments remain unchanged Incrementally refine the clustering results of the entry/exit zones Learns the appearance relationship in a short period of time – Combing the spatio-temporal information and efficient MCMC sampling Can re-build the appearance relationship models soon after sudden lighting changes