Image-based Shaving Eurographics 2008 19 Apr 2008 Minh Hoai Nguyen, Jean-Francois Lalonde, Alexei A. Efros & Fernando de la Torre Robotics Institute, Carnegie.

Slides:



Advertisements
Similar presentations
Real-Time Detection, Alignment and Recognition of Human Faces
Advertisements

O BJ C UT M. Pawan Kumar Philip Torr Andrew Zisserman UNIVERSITY OF OXFORD.
Active Appearance Models
Model-based Image Interpretation with Application to Facial Expression Recognition Matthias Wimmer
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Lena Gorelick Joint work with Frank Schmidt and Yuri Boykov Rochester Institute of Technology, Center of Imaging Science January 2013 TexPoint fonts used.
Joint Optimisation for Object Class Segmentation and Dense Stereo Reconstruction Ľubor Ladický, Paul Sturgess, Christopher Russell, Sunando Sengupta, Yalin.
Shape Sharing for Object Segmentation
Tyler Ambroziak Ryan Fox Cs /3/10 Virtual Barber.
The University of Ontario CS 4487/9687 Algorithms for Image Analysis Multi-Label Image Analysis Problems.
Face Alignment at 3000 FPS via Regressing Local Binary Features
1 s-t Graph Cuts for Binary Energy Minimization  Now that we have an energy function, the big question is how do we minimize it? n Exhaustive search is.
Graph-based image segmentation Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering Department of Cybernetics Prague, Czech.
Wangfei Ningbo University A Brief Introduction to Active Appearance Models.
A Versatile Depalletizer of Boxes Based on Range Imagery Dimitrios Katsoulas*, Lothar Bergen*, Lambis Tassakos** *University of Freiburg **Inos Automation-software.
Silhouettes in Multiview Stereo Ian Simon. Multiview Stereo Problem Input: – a collection of images of a rigid object (or scene) – camera parameters for.
Robust Higher Order Potentials For Enforcing Label Consistency
Real-Time Non-Rigid Shape Recovery via AAMs for Augmented Reality Jackie Zhu Oct. 24, 2006.
P 3 & Beyond Solving Energies with Higher Order Cliques Pushmeet Kohli Pawan Kumar Philip H. S. Torr Oxford Brookes University CVPR 2007.
UPM, Faculty of Computer Science & IT, A robust automated attendance system using face recognition techniques PhD proposal; May 2009 Gawed Nagi.
Improved Moves for Truncated Convex Models M. Pawan Kumar Philip Torr.
2010/5/171 Overview of graph cuts. 2010/5/172 Outline Introduction S-t Graph cuts Extension to multi-label problems Compare simulated annealing and alpha-
Stereo & Iterative Graph-Cuts Alex Rav-Acha Vision Course Hebrew University.
MRF Labeling With Graph Cut CMPUT 615 Nilanjan Ray.
Lecture 11: Structure from motion CS6670: Computer Vision Noah Snavely.
Active Appearance Models Computer examples A. Torralba T. F. Cootes, C.J. Taylor, G. J. Edwards M. B. Stegmann.
Stereo Computation using Iterative Graph-Cuts
Measuring Uncertainty in Graph Cut Solutions Pushmeet Kohli Philip H.S. Torr Department of Computing Oxford Brookes University.
PhD Thesis. Biometrics Science studying measurements and statistics of biological data Most relevant application: id. recognition 2.
Automatic User Interaction Correction via Multi-label Graph-cuts Antonio Hernández-Vela, Carlos Primo and Sergio Escalera Workshop on Human Interaction.
Selective Transfer Machine for Personalized Facial Action Unit Detection Wen-Sheng Chu, Fernando De la Torre and Jeffery F. Cohn Robotics Institute, Carnegie.
Image Renaissance Using Discrete Optimization Cédric AllèneNikos Paragios ENPC – CERTIS ESIEE – A²SI ECP - MAS France.
Recognition Part II Ali Farhadi CSE 455.
Last tuesday, you talked about active shape models Data set of 1,500 hand-labeled faces 20 facial features (eyes, eye brows, nose, mouth, chin) Train 40.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
MRFs and Segmentation with Graph Cuts Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 02/24/10.
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.
Graph Cut 韋弘 2010/2/22. Outline Background Graph cut Ford–Fulkerson algorithm Application Extended reading.
City University of Hong Kong 18 th Intl. Conf. Pattern Recognition Self-Validated and Spatially Coherent Clustering with NS-MRF and Graph Cuts Wei Feng.
Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images (Fri) Young Ki Baik, Computer Vision Lab.
TTH 1:30-2:48 Winter DL266 CIS 788v04 Zhu Topic 5. Human Faces Human face is extensively studied.
Graph Cuts Marc Niethammer. Segmentation by Graph-Cuts A way to compute solutions to the optimization problems we looked at before. Example: Binary Segmentation.
1 Markov Random Fields with Efficient Approximations Yuri Boykov, Olga Veksler, Ramin Zabih Computer Science Department CORNELL UNIVERSITY.
Real-Time Detection, Alignment and Recognition of Human Faces Rogerio Schmidt Feris Changbo Hu Matthew Turk Pattern Recognition Project June 12, 2003.
O BJ C UT M. Pawan Kumar Philip Torr Andrew Zisserman UNIVERSITY OF OXFORD.
Gaussian Mixture Models and Expectation-Maximization Algorithm.
CS654: Digital Image Analysis Lecture 28: Advanced topics in Image Segmentation Image courtesy: IEEE, IJCV.
A global approach Finding correspondence between a pair of epipolar lines for all pixels simultaneously Local method: no guarantee we will have one to.
3D Face Recognition Using Range Images Literature Survey Joonsoo Lee 3/10/05.
Cutting Images: Graphs and Boundary Finding Computational Photography Derek Hoiem, University of Illinois 09/20/12 “The Double Secret”, Magritte.
Image segmentation.
Martina Uray Heinz Mayer Joanneum Research Graz Institute of Digital Image Processing Horst Bischof Graz University of Technology Institute for Computer.
Energy minimization Another global approach to improve quality of correspondences Assumption: disparities vary (mostly) smoothly Minimize energy function:
Face Detection & Recognition
ROBUST SUBSPACE LEARNING FOR VISION AND GRAPHICS
Markov Random Fields with Efficient Approximations
Face Recognition and Feature Subspaces
Recognition: Face Recognition
Unsupervised Face Alignment by Robust Nonrigid Mapping
Multiway Cut for Stereo and Motion with Slanted Surfaces
Efficient Graph Cut Optimization for Full CRFs with Quantized Edges
Learning to Combine Bottom-Up and Top-Down Segmentation
Normalized Cut meets MRF
Automatic User Interaction Correction via Multi-label Graph-cuts
Announcements more panorama slots available now
Paper Reading Dalong Du April.08, 2011.
Clustering appearance and shape by Jigsaw, and comparing it with Epitome. Papers (1) Clustering appearance and shape by learning jigsaws (2006 NIPS) (2)
Announcements more panorama slots available now
“Traditional” image segmentation
Presentation transcript:

Image-based Shaving Eurographics Apr 2008 Minh Hoai Nguyen, Jean-Francois Lalonde, Alexei A. Efros & Fernando de la Torre Robotics Institute, Carnegie Mellon University

Nguyen et al., 2008 A goal synthesize

Nguyen et al., 2008 Active Appearance Models (Cootes et al ECCV98) Issues: –Global model –No support for modification of local structure.

Nguyen et al., 2008 Layered AAMs (Jones & Soatto ICCV05) Layers: –Defined manually –Require extensive set of hand labeled landmarks. This work: –Attempt to extract layers automatically.

Nguyen et al., 2008 The idea

Nguyen et al., 2008 The idea Differences ??? Beard Layer Model + ……

Nguyen et al., 2008 Processing steps 68 landmarks

Nguyen et al., 2008 A naïve approach Reconstruct a bearded face by non-beard subspace +… a1×a1×+a 2 ×+a 3 ×≈ -a 1 × - a 2 ×- a 3 ×-… ( ) 2 This is equivalent to minimizing: Reconstructed Image

Nguyen et al., 2008 Naïve reconstruction Problem: reconstruct what we don’t want to! -a 1 × - a 2 ×- a 3 ×-… ( ) 2

Nguyen et al., 2008 Least square fitting robust fitting Iteratively Reweighted Least Square Fitting

Nguyen et al., 2008 Robust Fitting - a 1 × - a 2 ×- a 3 ×-… ( ) 2 ρ(ρ( - a 1 × - a 2 ×- a 3 × ) Robustly reconstructed image

Nguyen et al., 2008 Reconstruction Results Original Naive reconstruction Robust reconstruction

Nguyen et al., 2008 There is a problem Beards are outliers of non-beard subspace. But there are other outliers Characteristic moles are also removed

Nguyen et al., 2008 The idea Differences ??? Beard Layer Model + ……

Nguyen et al., 2008 Subspace for beard layer … … Robust Fitting Perform PCA on the residuals: retaining 95% energy to get subspace for beard layers

Nguyen et al., 2008 The first 6 principal components of B super-imposed on the mean face

Nguyen et al., 2008 Where we are Differences ??? Beard Layer Model + …… B

Nguyen et al., 2008 Factorizing beard layer Given a face: Non-beard subspace Beard-layer subspace Non-beard layerBeard layer Residual (e.g. scar, mole)

Nguyen et al., 2008 Using the beard layer Non-beard layerBeard layer Residual (e.g. scar, mole) Remove beard Enhance beard Reduce beard

Nguyen et al., 2008 Changing contribution of the beard layer Original Beard removed Beard reduced Beard enhanced

Nguyen et al., 2008 Some results

Nguyen et al., 2008 More results

Nguyen et al., 2008 Failed cases Too much beard! Breakdown point of robust fitting is reached.

Nguyen et al., 2008 Utilizing domain knowledge So far: –Generic technique For beard removal: –Additional cues A pixel is likely to be beard pixel if most of its neighbors are.

Nguyen et al., 2008 Beard Mask Segmentation Formulate as graph labeling problem: One vertex per pixel Edges for neighboring pixels Label the vertices that minimize: unary potential binary potential

Nguyen et al., 2008 Unary Potential corresponds to i th pixel Non-beard layer Beard layer Residual (e.g. scar, mole) Beard pixel Non-beard pixel Unary potential: favors beard label ifis big.

Nguyen et al., 2008 Binary Potential Binary potential: prefers same labels for neighboring pixels

Nguyen et al., 2008 Optimization using graph-cuts (Boykov et al PAMI01) Label the vertices that minimize: Exact global optimum solution can be found efficiently!

Nguyen et al., 2008 Beard mask results

Nguyen et al., 2008 Refinement Original image Beard removal Using subspaces Linear Feathering Amount of blending Beard mask

Nguyen et al., 2008 Final results 1

Nguyen et al., 2008 Final results 2

Nguyen et al., 2008 Final results 3

Nguyen et al., 2008 Final results 4

Nguyen et al., 2008 Final results 5

Nguyen et al., 2008 Beard removal, failure Failure occurs at the robust fitting step

Nguyen et al., 2008 Where we are Differences ??? Beard Layer Model + ……

Nguyen et al., 2008 Beard Transfer

Nguyen et al., 2008 So far, we talked about Beards Lots of Beards But our method is generic!

Nguyen et al., 2008 Glasses Removal

Nguyen et al., 2008 … … Glasses Removal Differences ??? Glasses Layer Model

Nguyen et al., 2008 Preliminary results for glasses

Nguyen et al., 2008 Preliminary results for glasses

Nguyen et al., 2008 Glasses removal, failure

Nguyen et al., 2008 Multi-PIE database 1140 frontal, neutral faces –68 landmarks –From Multipie Female: 341 –With glasses: 82 –Without glasses: 259 Male: 799 –With little or no facial hair: 480 –With some facial hair: 319 –With glasses: 340 –Without glasses: additional bearded faces from the Internet.

Nguyen et al., 2008 References Nguyen, M.H., Lalonde, J.F., Efros, A.A. & De la Torre, F. ‘Image-based Shaving.’ Eurographics 08. Cootes, T, Edwards, Taylor, G. ‘Active Appearance Models’, ECCV98. Jones, E. & Soatto, S.(2005) ‘Layered Active Appearance Models.’ ICCV05. Boykov, Y., Veksler, O. & Zabih, R. ‘Fast Approximate Energy Minimization via Graph Cuts.’ PAMI01. Gross, R., Matthews, I., Cohn, J., Kanade, T. & Baker, S. ‘The CMU Multi-pose, Illumination, and Expression (Multi-PIE) Face Database.’ CMU TR