Everybody needs somebody: Modeling social and grouping behavior on a linear programming multiple people tracker Laura Leal-Taix´e, Gerard Pons-Moll and.

Slides:



Advertisements
Similar presentations
Position-Time graphs.
Advertisements

A Discriminative Key Pose Sequence Model for Recognizing Human Interactions Arash Vahdat, Bo Gao, Mani Ranjbar, and Greg Mori ICCV2011.
School of EECS, Peking University “Advanced Compiler Techniques” (Fall 2011) SSA Guo, Yao.
Ziming Zhang, Yucheng Zhao and Yiwen Wan.  Introduction&Motivation  Problem Statement  Paper Summeries  Discussion and Conclusions.
How to Schedule a Cascade in an Arbitrary Graph F. Chierchetti, J. Kleinberg, A. Panconesi February 2012 Presented by Emrah Cem 7301 – Advances in Social.
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Dynamic Bayesian Networks (DBNs)
Global Flow Optimization (GFO) in Automatic Logic Design “ TCAD91 ” by C. Leonard Berman & Louise H. Trevillyan CAD Group Meeting Prepared by Ray Cheung.
Sequential Timing Optimization. Long path timing constraints Data must not reach destination FF too late s i + d(i,j) + T setup  s j + P s i s j d(i,j)
Ab initio gene prediction Genome 559, Winter 2011.
Doorjamb: Unobtrusive Room-level Tracking of People in Homes using Doorway Sensors Timothy W. Hnat, Erin Griffiths, Ray Dawson, Kamin Whitehouse U of Virginia.
1 Reactive Pedestrian Path Following from Examples Ronald A. Metoyer Jessica K. Hodgins Presented by Stephen Allen.
Statistical NLP: Lecture 11
Topological Mapping using Visual Landmarks ● The work is based on the "Team Localization: A Maximum Likelihood Approach" paper. ● To simplify the problem,
Motion Detection And Analysis Michael Knowles Tuesday 13 th January 2004.
Motion based Correspondence for Distributed 3D tracking of multiple dim objects Ashok Veeraraghavan.
Detecting and Tracking Moving Objects for Video Surveillance Isaac Cohen and Gerard Medioni University of Southern California.
Robust Lane Detection and Tracking
Multi-path Routing -Sridevi Bellary. Introduction Multipath routing is an alternative to single shortest path routing to distribute and alleviate congestion.
Student: Hsu-Yung Cheng Advisor: Jenq-Neng Hwang, Professor
May 11, 2005 Tracking on a Graph Songhwai Oh Shankar Sastry Target trajectoriesEstimated tracks Tracking in Sensor Networks Target tracking is a representative.
© 2003 by Davi GeigerComputer Vision November 2003 L1.1 Tracking We are given a contour   with coordinates   ={x 1, x 2, …, x N } at the initial frame.
Online Piece-wise Linear Approximation of Numerical Streams with Precision Guarantees Hazem Elmeleegy Purdue University Ahmed Elmagarmid (Purdue) Emmanuel.
Class 5 Hidden Markov models. Markov chains Read Durbin, chapters 1 and 3 Time is divided into discrete intervals, t i At time t, system is in one of.
Chapter 2 – MOTION IN ONE DIMENSION
Computer vision: models, learning and inference
Yuan Li, Chang Huang and Ram Nevatia
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
Exploring the Parameter Space of Image Segmentation Algorithms Talk at NCHU p 1 TexPoint fonts used in EMF. Read the TexPoint manual before you.
CSSE463: Image Recognition Day 30 This week This week Today: motion vectors and tracking Today: motion vectors and tracking Friday: Project workday. First.
Interpreting Motion Graphs {Forces and Motion. Distance vs Time Graphs The motion of an object is defined by its change of position over a period of time.
A General Framework for Tracking Multiple People from a Moving Camera
Advanced Algorithms Piyush Kumar (Lecture 4: MaxFlow MinCut Applications) Welcome to COT5405.
Multiple Object Tracking Using K-Shortest Paths Optimization PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 33, NO. 9, SEPTEMBER
Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.
Loris Bazzani*, Marco Cristani*†, Vittorio Murino*† Speaker: Diego Tosato* *Computer Science Department, University of Verona, Italy †Istituto Italiano.
Analysis of Algorithms These slides are a modified version of the slides used by Prof. Eltabakh in his offering of CS2223 in D term 2013.
ROBOT NAVIGATION By: Sitapa Rujikietgumjorn Harika Tandra Neeharika Jarajapu.
Algorithm Analysis (Algorithm Complexity). Correctness is Not Enough It isn’t sufficient that our algorithms perform the required tasks. We want them.
2.7 Avoiding Dynamic Obstacles and Hazards Don DeLorenzo.
Many random walks are faster than one Noga AlonTel Aviv University Chen AvinBen Gurion University Michal KouckyCzech Academy of Sciences Gady KozmaWeizmann.
Game-Theoretic Analysis of Mobile Network Coverage David K.Y. Yau.
The talk: *The problem with current thunderstorm forecasting. *What would be ideal. *Thunderstorm statistics. *Our assumptions. *The algorithm and its.
Stable Multi-Target Tracking in Real-Time Surveillance Video
Slides for “Data Mining” by I. H. Witten and E. Frank.
Course14 Dynamic Vision. Biological vision can cope with changing world Moving and changing objects Change illumination Change View-point.
E VENT D ETECTION U SING AN A TTENTION -B ASED T RACKER 22 Outubro Universidade Federal do Paraná. Gerald Dalley, Xiaogang Wang, and W. Eric L. Grimson.
Homework 1 Problem 1: (5 points) Both Dijkstras algorihm and Bellmanford Algorithm generates shortest paths to all destinations. Modify the algorithm to.
Detecting Sequences and Cycles of Web Pages Narayan L. Bhamidipati and Sankar K. Pal Indian Statistical Institute Kolkata.
Tracking Groups of People for Video Surveillance Xinzhen(Elaine) Wang Advisor: Dr.Longin Latecki.
Don’t Follow me : Spam Detection in Twitter January 12, 2011 In-seok An SNU Internet Database Lab. Alex Hai Wang The Pensylvania State University International.
Dynamically Computing Fastest Paths for Intelligent Transportation Systems - ADITI BHAUMICK ab3585.
Tree Diagrams A tree is a connected graph in which every edge is a bridge. There can NEVER be a circuit in a tree diagram!
Prof. Swarat Chaudhuri COMP 382: Reasoning about Algorithms Fall 2015.
Bo Zong, Yinghui Wu, Ambuj K. Singh, Xifeng Yan 1 Inferring the Underlying Structure of Information Cascades
Max-Confidence Boosting With Uncertainty for Visual tracking WEN GUO, LIANGLIANG CAO, TONY X. HAN, SHUICHENG YAN AND CHANGSHENG XU IEEE TRANSACTIONS ON.
1 Euler and Hamilton paths Jorge A. Cobb The University of Texas at Dallas.
I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.
3D Perception and Environment Map Generation for Humanoid Robot Navigation A DISCUSSION OF: -BY ANGELA FILLEY.
Student Gesture Recognition System in Classroom 2.0 Chiung-Yao Fang, Min-Han Kuo, Greg-C Lee, and Sei-Wang Chen Department of Computer Science and Information.
Tracking We are given a contour G1 with coordinates G1={x1 , x2 , … , xN} at the initial frame t=1, were the image is It=1 . We are interested in tracking.
Lecture 13 review Explain how distance vector algorithm works.
Presented by: Cindy Yan EE6358 Computer Vision
Globally Optimal Generalized Maximum Multi Clique Problem (GMMCP) using Python code for Pedestrian Object Tracking By Beni Mulyana.
Student: Fang Hui Supervisor: Teo Yong Meng
Lecture 19-Problem Solving 4 Incremental Method
Mechanics The study of Physics begins with mechanics.
Some graphs you may have met under different circumstances.
Topological Signatures For Fast Mobility Analysis
REU Program 2019 Week 6 Alex Ruiz Jyoti Kini.
Presentation transcript:

Everybody needs somebody: Modeling social and grouping behavior on a linear programming multiple people tracker Laura Leal-Taix´e, Gerard Pons-Moll and Bodo Rosenhahn ICCV2011

Outline Goal Multiple people tracking Modeling social behavior Experimental results Conclusion

Goal People detection is not always correct. It is important to merge the detection results into right trajectoies.

Multiple people tracking divided in two steps – object detection – data association  form complete trajectories Build a graph with the nodes  pedestrian detections The matching problem is equivalent to minimum-cost network flow problem

Multiple people tracking,trajectory of k Find the that best explains the detection. 4 P(o i |T) is the likelihood.

Multiple people tracking trajectory T k have following dependencies – Constant velocity assumption find o i depends on o i-1,o i-2 – Grouping behavior – Avoidance term

Multiple people tracking Represent by Markov chain:

Multiple people tracking

Combine (1),(2),(3)

Multiple people tracking Three kinds of edges: – Link edges – Detection edges – Entrance and exit edges

Multiple people tracking Link edges The edges (e i, b j ) connect the end nodes e i with the beginning nodes b j in following frames,with cost C i,j and flag f i,j Flag =1 if o i and o j belong to T k,and ∆f≤F max 111

Multiple people tracking Detection edges The edges (b i, e i ) connect the beginning node b i and end node e i, with cost C i and flag f i

Modeling social behavior If a pedestrian doesn’t meet any obstacles, he will naturally follow a straight line. But the pedestrian will have some social behavior. Add Social Force Model (SFM)and Group behavior(GR) into the problem.

Modeling social behavior Social forces have three main terms: – The desire to maintain certain speed – The desire to keep away from others – The desire to reach a destination We focus on first two!

Modeling social behavior Constant velocity assumpion – When a person walk at a speed V at time t – We assume he will have speed V at time t+∆t

Modeling social behavior Avoidance term

Modeling social behavior From the training sequence in [22], we learn the probabilty of P g and P i [22] S. Pellegrini, A. Ess, K. Schindler, and L. van Gool. You’ll never walk alone: modeling social behavior for multi-target tracking. ICCV, , 2, 5, 7

Experimental results Blue=>DIST Greed=>with SDM Red=>SFM+GR

Experimental results

To show the importance of social behavior and the robustness of our algorithm at low frame rates, we track at 2.5fps (taking one every tenth frame).

Experimental results DA (detection accuracy) TA (tracking accuracy) DP (detection precision) TP (tracking precision)

Experimental results [28]use network flow [22]use social behavior [27] use social and grouping

Experimental results

Conclusion It is important to have social and group relation on tracking. This paper outperform on low fps than others and have high accuracies on miss detections,false alarms and noise.