Automatic User Interaction Correction via Multi-label Graph-cuts Antonio Hernández-Vela, Carlos Primo and Sergio Escalera Workshop on Human Interaction.

Slides:

Advertisements

Similar presentations

POSE–CUT Simultaneous Segmentation and 3D Pose Estimation of Humans using Dynamic Graph Cuts Mathieu Bray Pushmeet Kohli Philip H.S. Torr Department of.

Advertisements

Pose Estimation and Segmentation of People in 3D Movies Karteek Alahari, Guillaume Seguin, Josef Sivic, Ivan Laptev Inria, Ecole Normale Superieure ICCV.

Interactively Co-segmentating Topically Related Images with Intelligent Scribble Guidance Dhruv Batra, Carnegie Mellon University Adarsh Kowdle, Cornell.

Graph cut Chien-chi Chen.

Segmentation from Examples By: A’laa Kryeem Lecturer: Hagit Hel-Or.

Interactive Segmentation with Super-Labels Andrew Delong Western Yuri BoykovOlga VekslerLena GorelickFrank Schmidt TexPoint fonts used in EMF. Read the.

I Images as graphs Fully-connected graph – node for every pixel – link between every pair of pixels, p,q – similarity w ij for each link j w ij c Source:

1School of CS&Eng The Hebrew University

The University of Ontario CS 4487/9687 Algorithms for Image Analysis Multi-Label Image Analysis Problems.

Human Pose detection Abhinav Golas S. Arun Nair. Overview Problem Previous solutions Solution, details.

S I E M E N S C O R P O R A T E R E S E A R C H 1 1 A Seeded Image Segmentation Framework Unifying Graph Cuts and Random Walker Which Yields A New Algorithm.

GrabCut Interactive Image (and Stereo) Segmentation Carsten Rother Vladimir Kolmogorov Andrew Blake Antonio Criminisi Geoffrey Cross [based on Siggraph.

GrabCut Interactive Foreground Extraction using Iterated Graph Cuts Carsten Rother Vladimir Kolmogorov Andrew Blake Microsoft Research Cambridge-UK.

Graph-based image segmentation Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering Department of Cybernetics Prague, Czech.

GrabCut Interactive Image (and Stereo) Segmentation Joon Jae Lee Keimyung University Welcome. I will present Grabcut – an Interactive tool for foreground.

Markov Nets Dhruv Batra, Recitation 10/30/2008.

Learning to Detect A Salient Object Reporter: 鄭綱 (3/2)

Boundary matting for view synthesis Samuel W. Hasinoff Sing Bing Kang Richard Szeliski Computer Vision and Image Understanding 103 (2006) 22–32.

Segmentation Using Max Flow/Min Cut Graph Cuts Based on "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.“

Robust Higher Order Potentials For Enforcing Label Consistency

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

P 3 & Beyond Solving Energies with Higher Order Cliques Pushmeet Kohli Pawan Kumar Philip H. S. Torr Oxford Brookes University CVPR 2007.

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.

Lecture#6: segmentation Anat Levin Introduction to Computer Vision Class Fall 2009 Department of Computer Science and App math, Weizmann Institute of Science.

Stereo Computation using Iterative Graph-Cuts

Measuring Uncertainty in Graph Cut Solutions Pushmeet Kohli Philip H.S. Torr Department of Computing Oxford Brookes University.

Graph-Cut Algorithm with Application to Computer Vision Presented by Yongsub Lim Applied Algorithm Laboratory.

Perceptual Organization: Segmentation and Optical Flow.

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 11, NOVEMBER 2011 Qian Zhang, King Ngi Ngan Department of Electronic Engineering, the Chinese university.

Manhattan-world Stereo Y. Furukawa, B. Curless, S. M. Seitz, and R. Szeliski 2009 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp.

Graph-based Segmentation

Image Renaissance Using Discrete Optimization Cédric AllèneNikos Paragios ENPC – CERTIS ESIEE – A²SI ECP - MAS France.

Interactive Image Segmentation of Non-Contiguous Classes using Particle Competition and Cooperation Fabricio Breve São Paulo State University (UNESP)

MRFs and Segmentation with Graph Cuts Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 03/31/15.

Fast Approximate Energy Minimization via Graph Cuts

Mutual Information-based Stereo Matching Combined with SIFT Descriptor in Log-chromaticity Color Space Yong Seok Heo, Kyoung Mu Lee, and Sang Uk Lee.

Minimizing Sparse Higher Order Energy Functions of Discrete Variables (CVPR’09) Namju Kwak Applied Algorithm Lab. Computer Science Department KAIST 1Namju.

MRFs and Segmentation with Graph Cuts Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 02/24/10.

Graph Cut Algorithms for Binocular Stereo with Occlusions

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.

CS774. Markov Random Field : Theory and Application Lecture 13 Kyomin Jung KAIST Oct

Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images (Fri) Young Ki Baik, Computer Vision Lab.

Relative Volume Constraints for 3D Image Editing Computer Vision Group TU Munich Eno Töppe, Claudia Nieuwenhuis, Daniel Cremers May 25th, 2012.

Object Stereo- Joint Stereo Matching and Object Segmentation Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on Michael Bleyer Vienna.

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.

Mixture of Gaussians This is a probability distribution for random variables or N-D vectors such as… –intensity of an object in a gray scale image –color.

Lecture 19: Solving the Correspondence Problem with Graph Cuts CAP 5415 Fall 2006.

The University of Ontario CS 4487/9687 Algorithms for Image Analysis Multi-Label Image Analysis Problems.

Gaussian Mixture Models and Expectation-Maximization Algorithm.

Solving for Stereo Correspondence Many slides drawn from Lana Lazebnik, UIUC.

Machine Learning – Lecture 15

Journal of Visual Communication and Image Representation

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.

Cutting Images: Graphs and Boundary Finding Computational Photography Derek Hoiem, University of Illinois 09/20/12 “The Double Secret”, Magritte.

Energy minimization Another global approach to improve quality of correspondences Assumption: disparities vary (mostly) smoothly Minimize energy function:

MRFs and Segmentation with Graph Cuts Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 03/27/12.

GrabCut Interactive Foreground Extraction using Iterated Graph Cuts Carsten Rother Vladimir Kolmogorov Andrew Blake Microsoft Research Cambridge-UK.

Markov Random Fields with Efficient Approximations

Counting In High Density Crowd Videos

Counting in High-Density Crowd Videos

Graph Cut Weizhen Jing

Multiway Cut for Stereo and Motion with Slanted Surfaces

Efficient Graph Cut Optimization for Full CRFs with Quantized Edges

Automatic User Interaction Correction via Multi-label Graph-cuts

Clustering appearance and shape by Jigsaw, and comparing it with Epitome. Papers (1) Clustering appearance and shape by learning jigsaws (2006 NIPS) (2)

“Traditional” image segmentation

Presentation transcript:

Automatic User Interaction Correction via Multi-label Graph-cuts Antonio Hernández-Vela, Carlos Primo and Sergio Escalera Workshop on Human Interaction in Computer Vision 12 nd November 2011

Semi-automatic segmentation 2

3

Outline 1.Introduction 2.Methodology 3.Experiments & results 4.Conclusion 4

Introduction How much interaction is required from the user? What if the user makes a mistake? Automatic correction Multi-label approach 5 X X

Outline 1.Introduction 2.Methodology 3.Experiments & results 4.Conclusion 6

Multi-label graph-cuts 1 7 Energy minimization framework Image restorationStereo reconstruction Image segmentation 1 Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. PAMI, nov 2001.

Segmentation with Multi-label graph-cuts 8 1.User initialization 2.Unary potential 3.Pairwise potential 4.Segmentation (α-expansion)

Likelihood-based correction 9 Color model: Gaussian Mixture Model :Seeds for label : weight of GMM component

Likelihood-based correction: example 10

Likelihood-based correction: example 11

Outline 1.Introduction 2.Methodology 3.Experiments & results 4.Conclusion 12

Experiments: Data 13 Human Limb DB 2 : 227 images from 25 people, GT provided Random selection of 10 images –from 10 different people– 2

Experiments: Setup 14 Random interaction simulation Select 0.2% of total pixels from each label Repeat the process 10 times 4 scenarios: With/Without error Single/Combined mode

Results without errors 15

Results with 25% of error 16

Results with 45% of error 17

Qualitatve Results (single mode) 18

Qualitatve Results (combined mode) 19

Outline 1.Introduction 2.Methodology 3.Experiments & results 4.Conclusion 20

Conclusion 21 Methodology for automatic user interaction correction in multi-label graph-cuts image segmentation. Study on the influence of the amount of interaction from the user. –With and without errors. Future work Further experiment using real user interactions. Adapt the algorithm to the user.

Automatic User Interaction Correction via Multi-label Graph-cuts Antonio Hernández-Vela, Carlos Primo and Sergio Escalera Workshop on Human Interaction in Computer Vision 12 nd November 2011 Thank You! Questions?