Focused Inference with Local Primal-Dual Gaps

Slides:



Advertisements
Similar presentations
MAP Estimation Algorithms in M. Pawan Kumar, University of Oxford Pushmeet Kohli, Microsoft Research Computer Vision - Part I.
Advertisements

Mean-Field Theory and Its Applications In Computer Vision1 1.
Primal-dual Algorithm for Convex Markov Random Fields Vladimir Kolmogorov University College London GDR (Optimisation Discrète, Graph Cuts et Analyse d'Images)
Algorithms for MAP estimation in Markov Random Fields Vladimir Kolmogorov University College London Tutorial at GDR (Optimisation Discrète, Graph Cuts.
1 LP, extended maxflow, TRW OR: How to understand Vladimirs most recent work Ramin Zabih Cornell University.
Solving Markov Random Fields using Second Order Cone Programming Relaxations M. Pawan Kumar Philip Torr Andrew Zisserman.
Solving Markov Random Fields using Dynamic Graph Cuts & Second Order Cone Programming Relaxations M. Pawan Kumar, Pushmeet Kohli Philip Torr.
Diverse M-Best Solutions in Markov Random Fields
Generating Classic Mosaics with Graph Cuts Y. Liu, O. Veksler and O. Juan University of Western Ontario, Canada Ecole Centrale de Paris, France.
Linear Time Methods for Propagating Beliefs Min Convolution, Distance Transforms and Box Sums Daniel Huttenlocher Computer Science Department December,
Variational Inference Amr Ahmed Nov. 6 th Outline Approximate Inference Variational inference formulation – Mean Field Examples – Structured VI.
Active Learning for Streaming Networked Data Zhilin Yang, Jie Tang, Yutao Zhang Computer Science Department, Tsinghua University.
Constrained Approximate Maximum Entropy Learning (CAMEL) Varun Ganapathi, David Vickrey, John Duchi, Daphne Koller Stanford University TexPoint fonts used.
Tutorial at ICCV (Barcelona, Spain, November 2011)
Introduction to Markov Random Fields and Graph Cuts Simon Prince
ICCV 2007 tutorial Part III Message-passing algorithms for energy minimization Vladimir Kolmogorov University College London.
An Analysis of Convex Relaxations (PART I) Minimizing Higher Order Energy Functions (PART 2) Philip Torr Work in collaboration with: Pushmeet Kohli, Srikumar.
Discrete optimization methods in computer vision Nikos Komodakis Ecole Centrale Paris ICCV 2007 tutorial Rio de Janeiro Brazil, October 2007.
Efficient Inference for Fully-Connected CRFs with Stationarity
Learning with Inference for Discrete Graphical Models Nikos Komodakis Pawan Kumar Nikos Paragios Ramin Zabih (presenter)
1 Fast Primal-Dual Strategies for MRF Optimization (Fast PD) Robot Perception Lab Taha Hamedani Aug 2014.
Markov Nets Dhruv Batra, Recitation 10/30/2008.
F IXING M AX -P RODUCT : A U NIFIED L OOK AT M ESSAGE P ASSING A LGORITHMS Nicholas Ruozzi and Sekhar Tatikonda Yale University.
Distributed Message Passing for Large Scale Graphical Models Alexander Schwing Tamir Hazan Marc Pollefeys Raquel Urtasun CVPR2011.
Robust Higher Order Potentials For Enforcing Label Consistency
An Analysis of Convex Relaxations M. Pawan Kumar Vladimir Kolmogorov Philip Torr for MAP Estimation.
P 3 & Beyond Solving Energies with Higher Order Cliques Pushmeet Kohli Pawan Kumar Philip H. S. Torr Oxford Brookes University CVPR 2007.
Efficiently Solving Convex Relaxations M. Pawan Kumar University of Oxford for MAP Estimation Philip Torr Oxford Brookes University.
Graph Cut based Inference with Co-occurrence Statistics Ľubor Ladický, Chris Russell, Pushmeet Kohli, Philip Torr.
Relaxations and Moves for MAP Estimation in MRFs M. Pawan Kumar STANFORDSTANFORD Vladimir KolmogorovPhilip TorrDaphne Koller.
Measuring Uncertainty in Graph Cut Solutions Pushmeet Kohli Philip H.S. Torr Department of Computing Oxford Brookes University.
Computer vision: models, learning and inference
Extensions of submodularity and their application in computer vision
MAP Estimation Algorithms in M. Pawan Kumar, University of Oxford Pushmeet Kohli, Microsoft Research Computer Vision - Part I.
Multiplicative Bounds for Metric Labeling M. Pawan Kumar École Centrale Paris École des Ponts ParisTech INRIA Saclay, Île-de-France Joint work with Phil.
Probabilistic Inference Lecture 4 – Part 2 M. Pawan Kumar Slides available online
CS774. Markov Random Field : Theory and Application Lecture 08 Kyomin Jung KAIST Sep
Minimizing Sparse Higher Order Energy Functions of Discrete Variables (CVPR’09) Namju Kwak Applied Algorithm Lab. Computer Science Department KAIST 1Namju.
Procedural Modeling of Architectures towards 3D Reconstruction Nikos Paragios Ecole Centrale Paris / INRIA Saclay Ile-de-France Joint Work: P. Koutsourakis,
CS774. Markov Random Field : Theory and Application Lecture 13 Kyomin Jung KAIST Oct
Planar Cycle Covering Graphs for inference in MRFS The Typhon Algorithm A New Variational Approach to Ground State Computation in Binary Planar Markov.
Multiplicative Bounds for Metric Labeling M. Pawan Kumar École Centrale Paris Joint work with Phil Torr, Daphne Koller.
Lena Gorelick joint work with O. Veksler I. Ben Ayed A. Delong Y. Boykov.
An Efficient Message-Passing Algorithm for the M-Best MAP Problem Dhruv Batra (Currently) Research Assistant Professor TTI-Chicago (Spring 2013) Assistant.
Algorithms for MAP estimation in Markov Random Fields Vladimir Kolmogorov University College London.
Associative Hierarchical CRFs for Object Class Image Segmentation Ľubor Ladický 1 1 Oxford Brookes University 2 Microsoft Research Cambridge Based on the.
Discrete Optimization Lecture 3 – Part 1 M. Pawan Kumar Slides available online
Fast and accurate energy minimization for static or time-varying Markov Random Fields (MRFs) Nikos Komodakis (Ecole Centrale Paris) Nikos Paragios (Ecole.
Probabilistic Inference Lecture 5 M. Pawan Kumar Slides available online
Dynamic Tree Block Coordinate Ascent Daniel Tarlow 1, Dhruv Batra 2 Pushmeet Kohli 3, Vladimir Kolmogorov 4 1: University of Toronto3: Microsoft Research.
Update any set S of nodes simultaneously with step-size We show fixed point update is monotone for · 1/|S| Covering Trees and Lower-bounds on Quadratic.
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
Associative Hierarchical CRFs for Object Class Image Segmentation
MRF optimization based on Linear Programming relaxations Nikos Komodakis University of Crete IPAM, February 2008.
CVPR 2013 Diversity Tutorial Beyond MAP: Making Multiple Predictions: Diversity, DPPs and more. Dhruv Batra Virginia Tech Alex Kulesza Univ. of Michigan.
Tractable Higher Order Models in Computer Vision (Part II) Slides from Carsten Rother, Sebastian Nowozin, Pusohmeet Khli Microsoft Research Cambridge Presented.
Discrete Optimization Lecture 2 – Part 2 M. Pawan Kumar Slides available online
Beyond Trees: MRF Inference via Outer-Planar Decomposition [(To appear) CVPR ‘10] Dhruv Batra Carnegie Mellon University Joint work: Andrew Gallagher (Eastman.
Inference for Learning Belief Propagation. So far... Exact methods for submodular energies Approximations for non-submodular energies Move-making ( N_Variables.
Join-graph based cost-shifting Alexander Ihler, Natalia Flerova, Rina Dechter and Lars Otten University of California Irvine Introduction Mini-Bucket Elimination.
Tightening LP Relaxations for MAP using Message-Passing David Sontag Joint work with Talya Meltzer, Amir Globerson, Tommi Jaakkola, and Yair Weiss.
MAP Estimation in Binary MRFs using Bipartite Multi-Cuts Sashank J. Reddi Sunita Sarawagi Sundar Vishwanathan Indian Institute of Technology, Bombay TexPoint.
IEEE 2015 Conference on Computer Vision and Pattern Recognition Active Learning for Structured Probabilistic Models with Histogram Approximation Qing SunAnkit.
Markov Random Fields in Vision
Rounding-based Moves for Metric Labeling M. Pawan Kumar École Centrale Paris INRIA Saclay, Île-de-France.
The M-Best Mode Problem
Alexander Shekhovtsov and Václav Hlaváč
Nonparametric Semantic Segmentation
Efficient Graph Cut Optimization for Full CRFs with Quantized Edges
Discrete Inference and Learning
Presentation transcript:

Focused Inference with Local Primal-Dual Gaps Dhruv Batra (TTIC) Joint work with: Daniel Tarlow (U Toronto), Sebastian Nowozin (MSRC), Pushmeet Kohli (MSRC), Vladimir Kolmogorov (UCL)

Overview Discrete Labelling Problems in Computer Vision Focused Inference Local Primal-Dual Gap [Batra, Nowozin, Kohli AISTATS ‘11] [Batra, Kohli CVPR ‘11] [Tarlow, Batra, Kohli, Kolmogorov ICML ‘11] (C) Dhruv Batra

Labelling Problems in Vision Segmentation Stereo Left image Right image Disparity map Motion Flow Geometric Labelling Denoising Name-Face Association (C) Dhruv Batra

MAP Inference in MRFs Set of discrete random variables (Pairwise) Cost/Energy Function MAP Inference X1 X2 … Xn Edge Energies / Distributed Prior Node Energies / Local Costs kx1 kxk (C) Dhruv Batra

Inference MAP problem In general NP-hard [Shimony ‘94] Approximate Inference Loopy BP [Pearl, ‘88] α-Expansion [Boykov ’01, Komodakis ‘05] LP Relaxations [Schlesinger ‘76, Wainwright ’05, Sontag ‘08] Outer-Planar & High-order Decompositions [Batra ‘10, Kappes ‘10] (C) Dhruv Batra

Approximate Inference Carpet Bombing (C) Dhruv Batra

Focused Inference (C) Dhruv Batra

Focused Inference (C) Dhruv Batra Focused Inference Energy-Aware Message-Passing ICML ‘11 Label Re-ordering in α-Expansion CVPR ‘11 Tightening LP Relaxations AISTATS ‘11 Ordering of Labels Move Number Classical Expansions Our Guided Expansions 1 Airplane Sheep 2 Bicycle Dog 3 Bird 4 Boat Cow 5 Bottle Cat (C) Dhruv Batra

Common Theme LP-relaxation [Schlesinger ‘76, Koster ’98, Chekuri ‘01, Wainwright ’05] Primal LP Computation Objective Dual LP (C) Dhruv Batra

Current Primal-Dual Gap Common Theme LP-relaxation [Schlesinger ‘76, Koster ’98, Chekuri ‘01, Wainwright ’05] Local Primal-Dual Gaps Primal contribution minus Dual Contribution Distributed Primal-Dual Gap Generalization of Complimentary Slackness Conditions Computation Objective Current Primal-Dual Gap (C) Dhruv Batra

MAP-MRF Over-Complete Representation kx1 k2x1 (C) Dhruv Batra

MAP-MRF Energy kx1 k2x1 (C) Dhruv Batra

Consistent Assignments MAP-MRF Integer Program Indicator Variables Unique Label Consistent Assignments (C) Dhruv Batra

Tractable (but not scalable) LP Relaxation Linear Program Tractable (but not scalable) (C) Dhruv Batra

LP Relaxation Linear Program --- Dual Program (C) Dhruv Batra

LP Relaxation Interpretation of Dual Program Independently minimize terms Subject to Reparameterization (C) Dhruv Batra

LP Relaxation Solving LP Block Co-ordinate Ascent on Dual Choose a block (set) of variables Optimize block; fix rest Repeat (C) Dhruv Batra

LP Relaxation Linear Program --- Dual Program Complementary Slackness: (C) Dhruv Batra

Local Primal-Dual Gap Local Primal-Dual Gap Defined for nodes & edges (higher order extensions later) Contribution of each node and edge to the Primal-Dual Gap Dual Primal (C) Dhruv Batra

Local Primal-Dual Gap Intuition (C) Dhruv Batra

Local Primal-Dual Gap Properties Decomposability Quickly Computable Sums to the total Primal-Dual Gap Can easily define LPDG for sub-graphs If no sub-graph with strictly positive LPDG exists, LP is tight (C) Dhruv Batra

Focused Inference (C) Dhruv Batra Focused Inference Energy-Aware Message-Passing ICML ‘11 Label Re-ordering in α-Expansion CVPR ‘11 Tightening LP Relaxations AISTATS ‘11 Ordering of Labels Move Number Classical Expansions Our Guided Expansions 1 Airplane Sheep 2 Bicycle Dog 3 Bird 4 Boat Cow 5 Bottle Cat (C) Dhruv Batra

Focused Inference Dynamic Tree Block Coordinate Ascent [ICML ‘11] Image Current Seg. Update Mask Updated Seg. Messages (C) Dhruv Batra

Focused Inference (C) Dhruv Batra Focused Inference Energy-Aware Message-Passing ICML ‘11 Label Re-ordering in α-Expansion CVPR ‘11 Tightening LP Relaxations AISTATS ‘11 Ordering of Labels Move Number Classical Expansions Our Guided Expansions 1 Airplane Sheep 2 Bicycle Dog 3 Bird 4 Boat Cow 5 Bottle Cat (C) Dhruv Batra

Dynamic Re-ordering of Blocks Goal: Category Segmentation α-Expansion solves the standard LP relaxation Loop over α Current Soln 2-Label Problem + GC New Soln α-Expansion α (C) Dhruv Batra

Dynamic Re-ordering of Blocks Ordering of Labels Move Number Classical Expansions Our Guided Expansions Image 1 1 Airplane Car 2 Bicycle Person 3 Bird Motorbike 4 Boat Train 5 Bottle Image 2 Sheep Dog Cow Cat (C) Dhruv Batra

Dynamic Re-ordering of Blocks LPDG score For each node i, label Dual Primal (C) Dhruv Batra

Experiments (C) Dhruv Batra

Focused Inference (C) Dhruv Batra Focused Inference Energy-Aware Message-Passing ICML ‘11 Label Re-ordering in α-Expansion CVPR ‘11 Tightening LP Relaxations AISTATS ‘11 Ordering of Labels Move Number Classical Expansions Our Guided Expansions 1 Airplane Sheep 2 Bicycle Dog 3 Bird 4 Boat Cow 5 Bottle Cat (C) Dhruv Batra

LP Relaxation LP-relaxation [Schlesinger ‘76, Koster ’98, Chekuri ‘01, Wainwright ’05] Primal LP Computation Objective Dual LP (C) Dhruv Batra

LP Relaxation LP-relaxation [Schlesinger ‘76, Koster ’98, Chekuri ‘01, Wainwright ’05] Primal LP Computation Objective Dual LP (C) Dhruv Batra

Hierarchy of LPs LPDG to the rescue! Increasingly Complex Sub-problems Edge-Consistent LP Triplet-Clique Consistent LP LPDG to the rescue! -- Score Clusters / Constraints -- Add high scoring ones (C) Dhruv Batra

Experiments (C) Dhruv Batra

Summary Focused Inference vs. Energy-Agnostic Inference Exploiting structure of the problem First wave of success Submodularity Distance Transforms Truncated Convex Potentials Second wave of success Focused Message Passing Task Specific Computation (C) Dhruv Batra

Thank You!