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.

Slides:



Advertisements
Similar presentations
Active Appearance Models
Advertisements

3D Geometry for Computer Graphics
Chapter 28 – Part II Matrix Operations. Gaussian elimination Gaussian elimination LU factorization LU factorization Gaussian elimination with partial.
The fundamental matrix F
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
3D Reconstruction – Factorization Method Seong-Wook Joo KG-VISA 3/10/2004.
Computer vision: models, learning and inference
3D Face Modeling Michaël De Smet.
Wangfei Ningbo University A Brief Introduction to Active Appearance Models.
AAM based Face Tracking with Temporal Matching and Face Segmentation Dalong Du.
1cs542g-term High Dimensional Data  So far we’ve considered scalar data values f i (or interpolated/approximated each component of vector values.
Principal Component Analysis CMPUT 466/551 Nilanjan Ray.
Computer Graphics Recitation 5.
3D Geometry for Computer Graphics
Some useful linear algebra. Linearly independent vectors span(V): span of vector space V is all linear combinations of vectors v i, i.e.
Real-Time Non-Rigid Shape Recovery via AAMs for Augmented Reality Jackie Zhu Oct. 24, 2006.
Appearance Models Shape models represent shape variation Eigen-models can represent texture variation Combined appearance models represent both.
Epipolar geometry. (i)Correspondence geometry: Given an image point x in the first view, how does this constrain the position of the corresponding point.
Structure from motion. Multiple-view geometry questions Scene geometry (structure): Given 2D point matches in two or more images, where are the corresponding.
Uncalibrated Geometry & Stratification Sastry and Yang
Face Recognition Based on 3D Shape Estimation
Previously Two view geometry: epipolar geometry Stereo vision: 3D reconstruction epipolar lines Baseline O O’ epipolar plane.
3D Geometry for Computer Graphics
Active Appearance Models Computer examples A. Torralba T. F. Cootes, C.J. Taylor, G. J. Edwards M. B. Stegmann.
3D Geometry for Computer Graphics
Augmented Reality: Object Tracking and Active Appearance Model
Presented by Pat Chan Pik Wah 28/04/2005 Qualifying Examination
Tutorial 10 Iterative Methods and Matrix Norms. 2 In an iterative process, the k+1 step is defined via: Iterative processes Eigenvector decomposition.
Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.
Computer Graphics Recitation The plan today Least squares approach  General / Polynomial fitting  Linear systems of equations  Local polynomial.
CSCE 641 Computer Graphics: Image-based Modeling (Cont.) Jinxiang Chai.
1cs542g-term Notes  Extra class next week (Oct 12, not this Friday)  To submit your assignment: me the URL of a page containing (links to)
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka Virginia de Sa (UCSD) Cogsci 108F Linear.
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
SVD(Singular Value Decomposition) and Its Applications
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
Point set alignment Closed-form solution of absolute orientation using unit quaternions Berthold K. P. Horn Department of Electrical Engineering, University.
CSC 589 Lecture 22 Image Alignment and least square methods Bei Xiao American University April 13.
Lecture 11 Stereo Reconstruction I Lecture 11 Stereo Reconstruction I Mata kuliah: T Computer Vision Tahun: 2010.
Statistical Models of Appearance for Computer Vision
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2014.
Computer Graphics Group Tobias Weyand Mesh-Based Inverse Kinematics Sumner et al 2005 presented by Tobias Weyand.
Multimodal Interaction Dr. Mike Spann
Epipolar geometry The fundamental matrix and the tensor
Homogeneous Coordinates (Projective Space) Let be a point in Euclidean space Change to homogeneous coordinates: Defined up to scale: Can go back to non-homogeneous.
CSE554AlignmentSlide 1 CSE 554 Lecture 5: Alignment Fall 2011.
Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.
1 ECE 738 Paper presentation Paper: Active Appearance Models Author: T.F.Cootes, G.J. Edwards and C.J.Taylor Student: Zhaozheng Yin Instructor: Dr. Yuhen.
1 Recognition by Appearance Appearance-based recognition is a competing paradigm to features and alignment. No features are extracted! Images are represented.
CSCE 643 Computer Vision: Structure from Motion
Elementary Linear Algebra Anton & Rorres, 9th Edition
Plenoptic Modeling: An Image-Based Rendering System Leonard McMillan & Gary Bishop SIGGRAPH 1995 presented by Dave Edwards 10/12/2000.
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2013.
CSE 185 Introduction to Computer Vision Face Recognition.
AAM based Face Tracking with Temporal Matching and Face Segmentation Mingcai Zhou 1 、 Lin Liang 2 、 Jian Sun 2 、 Yangsheng Wang 1 1 Institute of Automation.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
Determining 3D Structure and Motion of Man-made Objects from Corners.
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.
Statistical Models of Appearance for Computer Vision 主講人:虞台文.
Chapter 61 Chapter 7 Review of Matrix Methods Including: Eigen Vectors, Eigen Values, Principle Components, Singular Value Decomposition.
Face detection and recognition Many slides adapted from K. Grauman and D. Lowe.
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.
CSE 554 Lecture 8: Alignment
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
Motion Segmentation with Missing Data using PowerFactorization & GPCA
René Vidal and Xiaodong Fan Center for Imaging Science
Homogeneous Coordinates (Projective Space)
Two-view geometry Computer Vision Spring 2018, Lecture 10
Epipolar geometry.
Parallelization of Sparse Coding & Dictionary Learning
Presentation transcript:

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

Outline Introduction Active Appearance Models AAMs 3D Morphable Models 3DMMs Representational Power of AAM Combined 2D+3D AAMs Conclusion

Introduction Active Appearance Models are generative models commonly used to model faces Another closely related type of face models are 3D Morphable Models In this paper, it tries to model 3D phenomena by using the 2D AAM Constrain the AAM with the 3D models to achieve a real-time algorithm for fitting the AAM

Active Appearance Models (AAMs) 2D linear shape is defined by 2D triangulated mesh and in particular the vertex locations of the mesh. Shape s can be expressed as a base shape s 0. p i are the shape parameter. s 0 is the mean shape and the matrices s i are the eigenvectors corresponding to the m largest eigenvalues

Active Appearance Models (AAMs) The appearance of an independent AAM is defined within the base mesh s 0. A(u) defined over the pixels u ∈ s 0 A(u) can be expressed as a base appearance A 0 (u) plus a linear combination of l appearance Coefficients λ i are the appearance parameters. A 0 (u) A 1 (u) A 2 (u) A 3 (u)

Active Appearance Models (AAMs) The AAM model instance with shape parameters p and appearance parameters λ is then created by warping the appearance A from the base mesh s 0 to the model shape s. Piecewise affine warp W(u; p): (1) for any pixel u in s 0 find out which triangle it lies in, (2) warp u with the affine warp for that triangle. M(W(u;p))

Fitting AAMs Minimize the error between I (u) and M(W(u; p)) = A(u). If u is a pixel in s 0, then the corresponding pixel in the input image I is W(u; p). At pixel u the AAM has the appearance At pixel W(u; p), the input image has the intensity I (W(u; p)). Minimize the sum of squares of the difference between these two quantities: u uuu

DEMO Video – 2D AAMs

3D Morphable Models (3DMMS) 3D shape of 3DMM is defined by 3D triangulated mesh and in particular the vertex location of the mesh. The ŝ can be expressed as a based shape ŝ 0 plus a linear combination of m shape matrices ŝ i :

3D Morphable Models (3DMMS) The appearance of a 3DMM is defined within a 2D triangulated mesh that has the same topology as the base mesh ŝ 0. The appearance Â(u) can be expressed as a based appearance  0 (u) plus a linear combination of l appearance images  i (u).

3D Morphable Models (3DMMS) To generate a 3DMM model instance, an image formation model is used to convert the 3D shape ŝ in to 2D mesh. The result of the imaging 3D point x = (x, y, z) T is: i, j are the projection axes, o is the offset of the origin Given shape parameters p i  compute 3D shape  map to 2D  compute appearance  warp onto 2D mesh (defined by mapping from 2D vertices in ŝ 0 to 2D vertices for 3D ŝ.)

Representational Power of AAM Can 2D shape models represent 3D? The 2D shape variation of the 3D model: The projection matrix can be expressed as: Therefore 3D model can be represented as combination of: The variation of the 3D model can therefore be represented by an appropriate set of 2D shape vectors, such as: 6*(m^+1) 2D shape vectors needed to represent a 3D model

Representational Power of AAM Experiments  Use 3D-cube : ŝ = ŝ 0 + p 1 ŝ 1  Generate 60 sets p 1 and P randomly  Synthesize 2D shapes of 60 3D model instances  Compute 2D shape model by performing PCA on 60 2D shapes  Result: 12 shapes vectors for each 2D shape mode  Confirm: 6*(m^+1) 2D vector is required However, 2D models generate invalid cases. Constrains is need to add on the model

Combined 2D + 3D AAMs At time t, we have 2D AAM shape vector in all N images into a matrix: Represent as a 3D linear shape modes W = MB =

Compute the 3D Model Perform singular value decomposition (SVD) on W and factorize it into: The scaled projection matrix M and the shape vector matrix B are given by: G is the corrective matrix. Additional rotational and basis constrain to compute G  M and B can be determined Thus, the 3D shape modes can be computed from the 2D AMM shape modes and the 2D AAM tracking results.

Calculate the Corrective Matrix Rotational constraints and basis constraints are used. Rotational constraints (denote GG T by Q): where ˜M 2*i−1:2*i represents the i th two-row of ˜M c is the coefficient and R is rotation matrices Due to orthogonormality of rotation matrices and Q is symmetric,

Calculate the Corrective Matrix Basis constraints: We find K frames including independent shapes and treat those shapes as a set of bases, the bases are determined uniquely, we have

Compute the 3D Model AAM shapes AAM appearance First three 3D shapes modes

Constraining an AAM with 3D Shape Constraints on the 2D AAM shape parameters p = (p 1, …, p m ) that force the AAM to only move in a way that is consistent with the 3D shape modes: and the 2D shape variation of the 3D shape modes over all imaging condition is: Legitimate values of P and p such that the 2D projected 3D shape equals the 2D shape of AAM. The constraint is written as:

Fitting with 3D Shape Constraints AAM fitting is to minimize: I.e the error between the appearance and the original image Impose the constrains of 2D projected 3D shape equals the 2D shape of AAM as soft constrains on the above equation with a large K:

Fitting with 3D Shape Constraints Optimize for the AAM shape p, q, and the appearance λ parameters: Calculate the square difference between the appearance and the original image and project the difference into orthogonal complement of the linear subspace spanned by the vectors A 1, …, A l. It is optimized by using inverse compositional algorithm, I.e. iteratively minimizing: Then, solve the appearance parameters using the linear closed form solution:

Experimental Results Initialization After 30 IterationsConverged Estimates of the 3D Pose extracted from the current estimate of the camera matrix P 2D AAM Estimated 3D shape

Experimental Results Results of using the algorithm to track a face in 180 frame video sequence by fitting the model in each frame

DEMO Video -- 2D+3D AAMs

2D+3D AAM Model Reconstruction Input Image Tracked result (2D+3D fit result) 2D+3D model reconstruction Shows two new view reconstruction

Compare the fitting speed with 2D AAMs Frames per second of 2D+3D > 2D AAM Iteration per second of 2D > 2D+3D, but 2D need more iteration for convergence

Conclusion 2D AAMs can represent any phenomena that 3DMMs can. Showed how to compute the equivalent 3D shape models from a 2D AAM with basis constrains, rotational constrains. Improve the fitting speed of the 2D AAMs with 3D shapes constrains 2D + 3D AAM is the ability to render the 3D model from novel viewpoint.

Q & A