Enforcing Constraints for Human Body Tracking David Demirdjian Artificial Intelligence Laboratory, MIT.

Slides:



Advertisements
Similar presentations
Using Strong Shape Priors for Multiview Reconstruction Yunda SunPushmeet Kohli Mathieu BrayPhilip HS Torr Department of Computing Oxford Brookes University.
Advertisements

IEEE CDC Nassau, Bahamas, December Integration of shape constraints in data association filters Integration of shape constraints in data.
Computer vision: models, learning and inference
Two-View Geometry CS Sastry and Yang
Modeling the Shape of People from 3D Range Scans
Reducing Drift in Parametric Motion Tracking
Kiyoshi Irie, Tomoaki Yoshida, and Masahiro Tomono 2011 IEEE International Conference on Robotics and Automation Shanghai International Conference Center.
Model base human pose tracking. Papers Real-Time Human Pose Tracking from Range Data Simultaneous Shape and Pose Adaption of Articulated Models using.
Silhouette Lookup for Automatic Pose Tracking N ICK H OWE.
Optimization & Learning for Registration of Moving Dynamic Textures Junzhou Huang 1, Xiaolei Huang 2, Dimitris Metaxas 1 Rutgers University 1, Lehigh University.
Reverse Engineering Niloy J. Mitra.
Registration of two scanned range images using k-d tree accelerated ICP algorithm By Xiaodong Yan Dec
Accurate Non-Iterative O( n ) Solution to the P n P Problem CVLab - Ecole Polytechnique Fédérale de Lausanne Francesc Moreno-Noguer Vincent Lepetit Pascal.
Some useful linear algebra. Linearly independent vectors span(V): span of vector space V is all linear combinations of vectors v i, i.e.
1 GEOMETRIE Geometrie in der Technik H. Pottmann TU Wien SS 2007.
Real-time Combined 2D+3D Active Appearance Models Jing Xiao, Simon Baker,Iain Matthew, and Takeo Kanade CVPR 2004 Presented by Pat Chan 23/11/2004.
Multi-view stereo Many slides adapted from S. Seitz.
Ch. 4: Velocity Kinematics
Canonical correlations
Optical flow and Tracking CISC 649/849 Spring 2009 University of Delaware.
Recovering Articulated Object Models from 3D Range Data Dragomir Anguelov Daphne Koller Hoi-Cheung Pang Praveen Srinivasan Sebastian Thrun Computer Science.
Recognizing and Tracking Human Action Josephine Sullivan and Stefan Carlsson.
Improved Approximation Bounds for Planar Point Pattern Matching (under rigid motions) Minkyoung Cho Department of Computer Science University of Maryland.
COMP 290 Computer Vision - Spring Motion II - Estimation of Motion field / 3-D construction from motion Yongjik Kim.
Goal: Fast and Robust Velocity Estimation P1P1 P2P2 P3P3 P4P4 Our Approach: Alignment Probability ●Spatial Distance ●Color Distance (if available) ●Probability.
Algorithm Evaluation and Error Analysis class 7 Multiple View Geometry Comp Marc Pollefeys.
Segmentation and tracking of the upper body model from range data with applications in hand gesture recognition Navin Goel Intel Corporation Department.
Bootstrapping a Heteroscedastic Regression Model with Application to 3D Rigid Motion Evaluation Bogdan Matei Peter Meer Electrical and Computer Engineering.
An Integrated Pose and Correspondence Approach to Image Matching Anand Rangarajan Image Processing and Analysis Group Departments of Electrical Engineering.
Structure Computation. How to compute the position of a point in 3- space given its image in two views and the camera matrices of those two views Use.
CSE554Laplacian DeformationSlide 1 CSE 554 Lecture 8: Laplacian Deformation Fall 2012.
Machine Learning CUNY Graduate Center Lecture 3: Linear Regression.
Multimodal Interaction Dr. Mike Spann
Niloy J. Mitra Leonidas J. Guibas Mark Pauly TU Vienna Stanford University ETH Zurich SIGGRAPH 2007.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
Ordinary Least-Squares Emmanuel Iarussi Inria. Many graphics problems can be seen as finding the best set of parameters for a model, given some data Surface.
ALIGNMENT OF 3D ARTICULATE SHAPES. Articulated registration Input: Two or more 3d point clouds (possibly with connectivity information) of an articulated.
EMIS 8381 – Spring Netflix and Your Next Movie Night Nonlinear Programming Ron Andrews EMIS 8381.
A Method for Registration of 3D Surfaces ICP Algorithm
CSCE 643 Computer Vision: Structure from Motion
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
Efficient computation of Robust Low-Rank Matrix Approximations in the Presence of Missing Data using the L 1 Norm Anders Eriksson and Anton van den Hengel.
Raquel A. Romano 1 Scientific Computing Seminar May 12, 2004 Projective Geometry for Computer Vision Projective Geometry for Computer Vision Raquel A.
Temporally Coherent Completion of Dynamic Shapes AUTHORS:HAO LI,LINJIE LUO,DANIEL VLASIC PIETER PEERS,JOVAN POPOVIC,MARK PAULY,SZYMON RUSINKIEWICZ Presenter:Zoomin(Zhuming)
EFFICIENT VARIANTS OF THE ICP ALGORITHM
David Levin Tel-Aviv University Afrigraph 2009 Shape Preserving Deformation David Levin Tel-Aviv University Afrigraph 2009 Based on joint works with Yaron.
Globally Consistent Range Scan Alignment for Environment Mapping F. LU ∗ AND E. MILIOS Department of Computer Science, York University, North York, Ontario,
Vision-based SLAM Enhanced by Particle Swarm Optimization on the Euclidean Group Vision seminar : Dec Young Ki BAIK Computer Vision Lab.
A Kernel Approach for Learning From Almost Orthogonal Pattern * CIS 525 Class Presentation Professor: Slobodan Vucetic Presenter: Yilian Qin * B. Scholkopf.
Affine Registration in R m 5. The matching function allows to define tentative correspondences and a RANSAC-like algorithm can be used to estimate the.
Searching a Linear Subspace Lecture VI. Deriving Subspaces There are several ways to derive the nullspace matrix (or kernel matrix). ◦ The methodology.
Photoconsistency constraint C2 q C1 p l = 2 l = 3 Depth labels If this 3D point is visible in both cameras, pixels p and q should have similar intensities.
MOTION Model. Road Map Motion Model Non Parametric Motion Field : Algorithms 1.Optical flow field estimation. 2.Block based motion estimation. 3.Pel –recursive.
Shape2Pose: Human Centric Shape Analysis CMPT888 Vladimir G. Kim Siddhartha Chaudhuri Leonidas Guibas Thomas Funkhouser Stanford University Princeton University.
11/25/03 3D Model Acquisition by Tracking 2D Wireframes Presenter: Jing Han Shiau M. Brown, T. Drummond and R. Cipolla Department of Engineering University.
CENG 789 – Digital Geometry Processing 08- Rigid-Body Alignment
ROBUST SUBSPACE LEARNING FOR VISION AND GRAPHICS
Motion Segmentation with Missing Data using PowerFactorization & GPCA
René Vidal and Xiaodong Fan Center for Imaging Science
You can check broken videos in this slide here :
Two-view geometry Computer Vision Spring 2018, Lecture 10
Dynamical Statistical Shape Priors for Level Set Based Tracking
Multiway Cut for Stereo and Motion with Slanted Surfaces
Estimating 2-view relationships
Some useful linear algebra
Combining Geometric- and View-Based Approaches for Articulated Pose Estimation David Demirdjian MIT Computer Science and Artificial Intelligence Laboratory.
George Mason University
Synthesis of Motion from Simple Animations
Multi-view geometry.
Biointelligence Laboratory, Seoul National University
Presentation transcript:

Enforcing Constraints for Human Body Tracking David Demirdjian Artificial Intelligence Laboratory, MIT

WOMOT 2003 Goal Real-time articulated body tracking from stereo accounting for constraints on pose

WOMOT 2003 Approach Differential tracking: assuming the articulated body pose  t-1 is known, estimate the pose  t (or equivalently the set of limb rigid motions  i =(t i  i ) between poses  t-1 and  t ) that minimizes the distance between the articulated model and the observed 3D data  tracking as a constrained optimization problem

WOMOT 2003 Approach Differential tracking: assuming the articulated body pose  t-1 is known, estimate the pose  t (or equivalently the set of limb rigid motions  i =(t i  i ) between poses  t-1 and  t ) that minimizes the distance between the articulated model and the observed 3D data  tracking as a constrained optimization problem –Solve unconstrained optimization problem –Project solution on constraint surface

WOMOT 2003 Projection-based approach   unconstrained optimum)  human motion manifold

WOMOT 2003 Approach Estimate limb motions  i =(t i  i ) independently using standard multi-object tracking algorithm Projection: find the closest body motion   =(  i ’) to  =(  i ) that satisfies human body constraints: –articulated constraints –other constraints: joint limit, …

WOMOT 2003 Previous work Particle sampling: Sidenbladh & al. ECCV’00 Sminchisescu & Triggs CVPR’01 Differential tracking: Plankers & Fua ICCV’99 Jojic & al. ICCV’99 Delamarre & Faugeras ICCV’99

WOMOT 2003 Plan Unconstrained problem Articulated constraints enforcing Other constraints Tracking results Application (Multimodal interface) Conclusion

WOMOT 2003 Multi-object tracking Assuming the articulated body pose  t-1 is known, estimate the set of limb rigid motions  i =(t i  i ) minimizes the distance between the (moved) limb and the observed 3D data Consists in estimating limb motions  i =(t i  i ) independently: –Estimate visible 3D mesh of each limb –Current implementation uses the ICP algorithm to register each limb w.r.t 3D data

WOMOT 2003 Iterative Closest Point 3D registration –find the rigid transformation  that maps shape S t (limb model) to shape S r (3D data) SrSr StSt 

WOMOT 2003 Iterative Closest Point Matching points For all points in S t, we search for the closest point in S r by computing the distance and keep the closest SrSr StSt

WOMOT 2003 Iterative Closest Point Energy function minimization Estimate the rigid transformation that minimizes the sum of squared distances between corresponding matched points SrSr StSt

WOMOT 2003 Iterative Closest Point Energy function minimization Estimate the rigid transformation that minimizes the sum of squared distances between corresponding matched points SrSr StSt

WOMOT 2003 Iterative Closest Point Optimal rigid transformation  (and uncertainty   ) found by combining all the elementary displacements

WOMOT 2003 Plan Unconstrained problem Articulated constraints enforcing Other constraints Tracking results Application (Multimodal interface) Conclusion

WOMOT 2003 Projection The unconstrained optimal body motion is given by  =(  1,  2 …  N ) With uncertainty  =(  1,  2 …  N ) with  =(  1 ’,  2 ’ …  N ’) satisfying articulated constraints Articulated constraints enforcement: find  that minimizes the Mahalanobis distance:

WOMOT 2003 Articulated motion estimation If M ij is a joint between objects i and j: M ij joint (R i,t i ) (R j,t j ) obj. i obj. j Motion of point M ij on limb i Motion of point M ij on limb j =

WOMOT 2003 Articulated motion estimation If M ij is a joint between objects i and j: M ij joint (R i,t i ) (R j,t j ) obj. i obj. j Motion of point M ij on limb i Motion of point M ij on limb j =

WOMOT 2003 Articulated motion estimation If M ij is a joint between objects i and j: M ij joint (R i,t i ) (R j,t j ) obj. i obj. j Motion of point M ij on limb i Motion of point M ij on limb j = [.] x denotes skew-symmetric matrix

WOMOT 2003 Articulated motion estimation If M ij is a joint between objects i and j: M ij joint (R i,t i ) (R j,t j ) obj. i obj. j Motion of point M ij on limb i Motion of point M ij on limb j = [.] x denotes skew-symmetric matrix

WOMOT 2003 Articulated motion estimation If M ij is a joint between objects i and j: M ij joint (R i,t i ) (R j,t j ) obj. i obj. j Motion of point M ij on limb i Motion of point M ij on limb j =  =(  1 ’,  2 ’ …  N ’)

WOMOT 2003 Articulated motion estimation If M ij is a joint between objects i and j: M ij joint (R i,t i ) (R j,t j ) obj. i obj. j Motion of point M ij on limb i Motion of point M ij on limb j = (Stack for all joints)  =(  1 ’,  2 ’ …  N ’)

WOMOT 2003 Articulated motion estimation All the joint constraints can be written as a linear constraint:  is a linear combination of vectors in the nullspace of  Therefore there exists a matrix V such that: V can be estimated by SVD of 

WOMOT 2003 Articulated motion estimation unconstrained motion articulated motion Find minimum of E 2 in nullspace of … (linear projection)

WOMOT 2003 Plan Unconstrained problem Articulated constraints enforcing Other constraints Tracking results Application (Multimodal interface) Conclusion

WOMOT 2003 Other constraints Constraints: –Static: Joint angle bounds, gravity law, … –Dynamic: Maximum velocity, … Motivation: –Using more constraints to reduce local minima and therefore increase tracking robustness –Application context can reduce tremendously the dimension of the pose space

WOMOT 2003 Other constraints Pose constraints modeled by a (user-defined) function f, such that valid poses correspond to f(  )>0 ex: f(  )=min(g 1 (  ), g 2 (  ), … g N (  )) withg 1 (  ) = angle(l-arm, l-forearm) – min_angle g 2 (  ) = max_angle - angle(l-arm, l-forearm) …. Constraints enforcement: find  * that minimizes the Mahalanobis distance: with  * satisfying F  t-1 (  *)=f(  *(  t-1 ))>0

WOMOT 2003 Other constraints articulated motion articulated constrained motion with (local parameterization)

WOMOT 2003 Constrained optimization algorithm Alternate between binary and stochastic searches 

WOMOT 2003 Constrained optimization algorithm Alternate between binary and stochastic searches 

WOMOT 2003 Constrained optimization algorithm Alternate between binary and stochastic searches  E 2 = E0

WOMOT 2003 Constrained optimization algorithm Alternate between binary and stochastic searches  E 2 = E1

WOMOT 2003 Constrained optimization algorithm Alternate between binary and stochastic searches  

WOMOT 2003 TRACKING SEQUENCE

WOMOT 2003 Future work Quantitative measurement (comparing results with tethered motion capture system) Appearance/Shape information (learning color distribution + shape of limbs) Motion/gesture (including dynamic constraints) Learning human motion constraints (instead of giving them explicitly.. [ICCV’03])

WOMOT 2003 Applications Multimodal Human-Computer Interaction (gesture + speech)

WOMOT 2003

Conclusion Projection-based approach for articulated body tracking –articulated constraints enforced by (linearly) projecting unconstrained limb motion on articulated motion manifold –other constraints enforced using a stochastic constrained optimization algorithm