Energy Minimization via Graph Cuts
|
|
- Janel Tate
- 6 years ago
- Views:
Transcription
1 Energy Minimization via Graph Cuts Xiaowei Zhou, June 11, 2010, Journal Club Presentation 1
2 outline Introduction MAP formulation for vision problems Min-cut and Max-flow Problem Energy Minimization via Graph Cuts Binary labeling problem Multiple labeling problem Connecting Graph-cuts with Active Contour Discussion 2
3 outline Introduction MAP formulation for vision problems Min-cut and Max-flow Problem Energy Minimization via Graph Cuts Binary labeling problem Multiple labeling problem Connecting Graph-cuts with Active Contour Discussion 3
4 MAP Framework (MRF) Many vision problems require estimating some spatially varying quantity from noisy measurements. Markov Random Field (Geman and Geman, 1984) A Graphic Model to describe the posterior probability of the quantity to be estimated given the measurements. 4
5 MAP Framework (MRF) fˆ fˆ arg max Pr ( f O) f arg max Pr( O f ) Pr( f ) Likelihood function (data term or unary term) f arg max exp ln g p( O fp) f p ( p, q Prior (MRF model or interaction term) ) V ( p, q) ( fp, fq) The interaction term makes the optimization of MRF very hard! 5
6 Min-cut Problem Find the minimum s-t cut of a graph An s-t cut C = (S,T) of a graph G = (V, E) is a cut of G such that s S and t T, where s and t are the source and the sink of N respectively. Cost of an s-t cut: C uv, (u,v) E,uS,v T Source Min-Cut = Max-Flow Polynomial-time solution Augmenting Path: O( E 2 V ) Push-Relabel: O( E V 2 ) v 1 v Sink
7 Intuition Image Graph n-links t s Segmentation Cut 7
8 outline Overview MAP formulation for vision problems Min-cut and Max-flow Problem Energy Minimization via Graph Cuts Binary labeling problem Multiple labeling problem Connecting Graph-cuts with Active Contour Discussion 8
9 Questions How can the graph-based algorithms help to solve the energy minimization problem? What kind of energy can be minimized via Graph Cuts? What about multi-labeling problem? 9
10 Main idea The main idea of graph-cut based MRF optimization is to construct a graph such that 1. there is a one-to-one correspondence between cuts of graph and configurations of the MRF 2. the total cost of the cut is exactly the same as the total energy of the configuration. 10
11 Example: Generalized Potts Model V Clique potential ( fp, fq) u{ p, q} ( f ( p, q) p q f ) Penalty Weight for discontinuity at (p,q) E f D f u f f ( ) p( p) { p, q} ( p q) p { p, q} 11
12 Solve the Potts model via Graph Cuts E f D f u f f ( ) p( p) { p, q} ( p q) p { p, q} D p (s) n-links t w pq s t-links a cut D p (t) n-links f p { s, t} A s-t cut corresponds to one configuration of binary labeling C( S, T) E( f ) 12
13 What about other energy functions? Let E be a function of n binary variables with the following form: E( L) D ( f ) V ( f, f ) p p p p q p, qn Then, E is graph-representable if and only if [3]: V(0,0) V(1,1) V(0,1) V(1,0) Functions satisfying above condition are called regular 13
14 Constructive Proof [3] To prove: given a regular function, a graph can be constructed to represent the function. Additivity Theorem: The sum of two graph-representable functions is graphrepresentable. Graph Construction: Dp( fp) is easy to represent. How to represent V ( f p, fq)? 14
15 Graph Construction Decompose the original function into: Part 1 Part 2 Part 3 Part 1 and Part 2 must be Graph-representable Part 3 depends on the sign of B+C-A-D If B+C-A-D >= 0, it s ok Else, impossible S C-A B+C-A-D p t q C-D 15
16 Alternative understanding Equations describing correspondence p S x1 2 x 3 x 5 x 4 t Conditions of existence of solution: x x q x 6 x5 x6 A k x1 x2 D k x2 x3 x5 B k x1 x4 x6 C k xi 0 3 x4 B C A D 0 To construct the graph: Minimize Cardinality of X to reduce the number of edges, subject to above constraints 16
17 Multi-label energy minimization break multi-way cut into a sequence of binary s-t cuts a-expansion move: a other labels 1. Start with any initial solution 2. For each label a in any order 1. Compute optimal a- expansion move (s-t graph cuts) 2. Decline the move if there is no energy decrease 3. Stop when no expansion move would decrease energy 17
18 How to construct graph? How to construct the graph for a-expansion move? Energy function for each a-expansion move: Define a mapping: f( x ) p xp 0 0 fp xp 1 We can get an binary-label energy function, and it is consistent with the original energy function: E( x) D ( f ( x )) V ( f ( x ), f ( x )) p p p p q p, qn s-t cuts can be used to minimize the above energy 18
19 More about a-expansion Conditions: Graph-representable: V ( f (0), f (0)) V ( f (1), f (1)) V ( f (0), f (1)) V ( f (1), f (0)) V (, ) V (, ) V (, ) V (, ) Optimality: Guaranteed approximation within a constant factor from the global minima (2 for the Potts model). Detailed proof is given in [1]. 19
20 outline Overview MAP formulation for vision problems Min-cut and Max-flow Problem Energy Minimization via Graph Cuts Binary labeling problem Multiple labeling problem Connecting Graph-cuts with Active Contour Discussion 20
21 Geodesic Active Contour The shortest curve between two points is a geodesic distance map B distance map B A A Euclidian metric (constant) Riemannian metric (space varying, tensor D(p)) E C g I C s C s ds ' geodesic ( ) ( ( ( )) ) ( ) C Image gradient based Riemannian metric 21
22 Another View of Curve Length C C e ec Curve length can be measured by how many edges are cut by the curve. How to determine the edge weight? 22
23 Curve length in integral geometry Cauchy-Crofton formula: C 2 a subset of lines L intersecting contour C a set of all lines L L C 0 Euclidean length of C : C 1 2 n L d d the number of times line L intersects C 23
24 Discrete Approximation Edges of any regular neighborhood system generate families of lines C C Euclidean length 1 2 k n k the number of edges of family k intersecting C k k C gc graph cut cost for edge weights: w k k k 2 24
25 Riemannian metric Riemannian length of C : det D C n d d R 1 2 T 3/2 L 2( uldul) w k det D k k T 3/2 2( uldul) 2 D is the local Riemannian metric u L is the unit vector along the direction of curve 25
26 Region-based Active Contour E C I u d I u d length C 2 2 CV ( ) ( ) ( ) ( ) outside( C) in X outside( C) out X {( I u ) ( f ' in') ( I u ) ( f ' out ')} dx length( C) 2 2 in X out X Boundary term (prior term) Region term (data term) E( L) D ( f ) w ( f f ) p p p pq p q pqn Both are formulated in MAP framework Continuous representation vs. Discrete representation Variational Optimization vs. Discrete Optimization 26
27 outline Overview MAP formulation for vision problems Min-cut and Max-flow Problem Energy Minimization via Graph Cuts Binary labeling problem Multiple labeling problem Connecting Graph-cuts with Active Contour Discussion 27
28 Benefits of Graph-cuts based segmentation Global optimal solution via combinatorial optimization Numerically stable Convenient to add hard constraints Interactive segmentation e.g. Grab-cut [5]: Commercial application in Office
29 Limitations of Graph-cuts Discrete artifacts Geometric artifacts Can t reach sub-pixel accuracy Higher requirements on energy function design Global optimal solution of the energy function is not guaranteed to be what we what. Model bias Model inaccuracy Parameter setting 29
30 Other Issues Non-regular Energy Minimization QPBO [6] Other optimization methods ICM Message Passing Higher Order Potential Transform to sum of first order potentials [7] Comparison to other discrete optimization methods 30
31 Key References [1] Y. Boykov, O. Veksler and R. Zabih, "Fast approximate energy minimization via graph cuts," IEEE Trans. Pattern Anal. Mach. Intell., vol. 23, pp , [2] Y. Boykov and V. Kolmogorov, "Computing geodesics and minimal surfaces via graph cuts," in Proceedings of the Ninth IEEE International Conference on Computer Vision- Volume 2, 2003, pp. 26. [3] V. Kolmogorov and R. Zabih, "What Energy Functions Can Be Minimized via Graph Cuts?" IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, pp. 147, [4] Y. Boykov and G. Funka-Lea, "Graph cuts and efficient n-d image segmentation," International Journal of Computer Vision, vol. 70, pp , [5] C. Rother, V. Kolmogorov and A. Blake, "Grabcut: Interactive foreground extraction using iterated graph cuts," in ACM SIGGRAPH 2004 Papers, 2004, pp [6] V. Kolmogorov and C. Rother, "Minimizing nonsubmodular functions with graph cutsa review," IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, pp , [7] Hiroshi Ishikawa, "Transformation of General Binary MRF Minimization to the First Order Case," IEEE Transactions on Pattern Analysis and Machine Intelligence, 31 Mar
Markov Random Fields for Computer Vision (Part 1)
Markov Random Fields for Computer Vision (Part 1) Machine Learning Summer School (MLSS 2011) Stephen Gould stephen.gould@anu.edu.au Australian National University 13 17 June, 2011 Stephen Gould 1/23 Pixel
More informationEnergy minimization via graph-cuts
Energy minimization via graph-cuts Nikos Komodakis Ecole des Ponts ParisTech, LIGM Traitement de l information et vision artificielle Binary energy minimization We will first consider binary MRFs: Graph
More informationIntelligent Systems:
Intelligent Systems: Undirected Graphical models (Factor Graphs) (2 lectures) Carsten Rother 15/01/2015 Intelligent Systems: Probabilistic Inference in DGM and UGM Roadmap for next two lectures Definition
More informationPart 6: Structured Prediction and Energy Minimization (1/2)
Part 6: Structured Prediction and Energy Minimization (1/2) Providence, 21st June 2012 Prediction Problem Prediction Problem y = f (x) = argmax y Y g(x, y) g(x, y) = p(y x), factor graphs/mrf/crf, g(x,
More informationCS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling
CS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling Professor Erik Sudderth Brown University Computer Science October 27, 2016 Some figures and materials courtesy
More informationHigher-Order Clique Reduction Without Auxiliary Variables
Higher-Order Clique Reduction Without Auxiliary Variables Hiroshi Ishikawa Department of Computer Science and Engineering Waseda University Okubo 3-4-1, Shinjuku, Tokyo, Japan hfs@waseda.jp Abstract We
More informationHigher-Order Energies for Image Segmentation
IEEE TRANSACTIONS ON IMAGE PROCESSING 1 Higher-Order Energies for Image Segmentation Jianbing Shen, Senior Member, IEEE, Jianteng Peng, Xingping Dong, Ling Shao, Senior Member, IEEE, and Fatih Porikli,
More informationA Graph Cut Algorithm for Higher-order Markov Random Fields
A Graph Cut Algorithm for Higher-order Markov Random Fields Alexander Fix Cornell University Aritanan Gruber Rutgers University Endre Boros Rutgers University Ramin Zabih Cornell University Abstract Higher-order
More informationA Graph Cut Algorithm for Generalized Image Deconvolution
A Graph Cut Algorithm for Generalized Image Deconvolution Ashish Raj UC San Francisco San Francisco, CA 94143 Ramin Zabih Cornell University Ithaca, NY 14853 Abstract The goal of deconvolution is to recover
More informationMarkov Random Fields and Bayesian Image Analysis. Wei Liu Advisor: Tom Fletcher
Markov Random Fields and Bayesian Image Analysis Wei Liu Advisor: Tom Fletcher 1 Markov Random Field: Application Overview Awate and Whitaker 2006 2 Markov Random Field: Application Overview 3 Markov Random
More informationWhat Metrics Can Be Approximated by Geo-Cuts, or Global Optimization of Length/Area and Flux
Proceedings of International Conference on Computer Vision (ICCV), Beijing, China, October 2005 vol.., p.1 What Metrics Can Be Approximated by Geo-Cuts, or Global Optimization of Length/Area and Flux Vladimir
More informationJoint Optimization of Segmentation and Appearance Models
Joint Optimization of Segmentation and Appearance Models David Mandle, Sameep Tandon April 29, 2013 David Mandle, Sameep Tandon (Stanford) April 29, 2013 1 / 19 Overview 1 Recap: Image Segmentation 2 Optimization
More informationHigher-Order Clique Reduction in Binary Graph Cut
CVPR009: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Miami Beach, Florida. June 0-5, 009. Hiroshi Ishikawa Nagoya City University Department of Information and Biological
More informationMarkov random fields and the optical flow
Markov random fields and the optical flow Felix Opitz felix.opitz@cassidian.com Abstract: The optical flow can be viewed as the assignment problem between the pixels of consecutive video frames. The problem
More informationSuperdifferential Cuts for Binary Energies
Superdifferential Cuts for Binary Energies Tatsunori Taniai University of Tokyo, Japan Yasuyuki Matsushita Osaka University, Japan Takeshi Naemura University of Tokyo, Japan taniai@iis.u-tokyo.ac.jp yasumat@ist.osaka-u.ac.jp
More informationPseudo-Bound Optimization for Binary Energies
In European Conference on Computer Vision (ECCV), Zurich, Switzerland, 2014 p. 1 Pseudo-Bound Optimization for Binary Energies Meng Tang 1 Ismail Ben Ayed 1,2 Yuri Boykov 1 1 University of Western Ontario,
More informationA note on the primal-dual method for the semi-metric labeling problem
A note on the primal-dual method for the semi-metric labeling problem Vladimir Kolmogorov vnk@adastral.ucl.ac.uk Technical report June 4, 2007 Abstract Recently, Komodakis et al. [6] developed the FastPD
More informationMANY problems in computer vision, such as segmentation,
134 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 33, NO. 6, JUNE 011 Transformation of General Binary MRF Minimization to the First-Order Case Hiroshi Ishikawa, Member, IEEE Abstract
More informationMarkov Random Fields
Markov Random Fields Umamahesh Srinivas ipal Group Meeting February 25, 2011 Outline 1 Basic graph-theoretic concepts 2 Markov chain 3 Markov random field (MRF) 4 Gauss-Markov random field (GMRF), and
More informationBetter restore the recto side of a document with an estimation of the verso side: Markov model and inference with graph cuts
June 23 rd 2008 Better restore the recto side of a document with an estimation of the verso side: Markov model and inference with graph cuts Christian Wolf Laboratoire d InfoRmatique en Image et Systèmes
More informationMAP Estimation Algorithms in Computer Vision - Part II
MAP Estimation Algorithms in Comuter Vision - Part II M. Pawan Kumar, University of Oford Pushmeet Kohli, Microsoft Research Eamle: Image Segmentation E() = c i i + c ij i (1- j ) i i,j E: {0,1} n R 0
More informationDiscrete Optimization Lecture 5. M. Pawan Kumar
Discrete Optimization Lecture 5 M. Pawan Kumar pawan.kumar@ecp.fr Exam Question Type 1 v 1 s v 0 4 2 1 v 4 Q. Find the distance of the shortest path from s=v 0 to all vertices in the graph using Dijkstra
More informationA Structural Matching Algorithm Using Generalized Deterministic Annealing
A Structural Matching Algorithm Using Generalized Deterministic Annealing Laura Davlea Institute for Research in Electronics Lascar Catargi 22 Iasi 6600, Romania )QEMPPHEZPIE$QEMPHRXMWVS Abstract: We present
More informationMAP Examples. Sargur Srihari
MAP Examples Sargur srihari@cedar.buffalo.edu 1 Potts Model CRF for OCR Topics Image segmentation based on energy minimization 2 Examples of MAP Many interesting examples of MAP inference are instances
More informationMaking the Right Moves: Guiding Alpha-Expansion using Local Primal-Dual Gaps
Making the Right Moves: Guiding Alpha-Expansion using Local Primal-Dual Gaps Dhruv Batra TTI Chicago dbatra@ttic.edu Pushmeet Kohli Microsoft Research Cambridge pkohli@microsoft.com Abstract 5 This paper
More informationMarkov Random Fields (A Rough Guide)
Sigmedia, Electronic Engineering Dept., Trinity College, Dublin. 1 Markov Random Fields (A Rough Guide) Anil C. Kokaram anil.kokaram@tcd.ie Electrical and Electronic Engineering Dept., University of Dublin,
More informationNonlinear Diffusion. Journal Club Presentation. Xiaowei Zhou
1 / 41 Journal Club Presentation Xiaowei Zhou Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology 2009-12-11 2 / 41 Outline 1 Motivation Diffusion process
More informationDoes Better Inference mean Better Learning?
Does Better Inference mean Better Learning? Andrew E. Gelfand, Rina Dechter & Alexander Ihler Department of Computer Science University of California, Irvine {agelfand,dechter,ihler}@ics.uci.edu Abstract
More informationChapter 7. Network Flow. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 7 Network Flow Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 7.5 Bipartite Matching Bipartite Matching Bipartite matching. Input: undirected, bipartite graph
More informationAccelerated MRI Image Reconstruction
IMAGING DATA EVALUATION AND ANALYTICS LAB (IDEAL) CS5540: Computational Techniques for Analyzing Clinical Data Lecture 15: Accelerated MRI Image Reconstruction Ashish Raj, PhD Image Data Evaluation and
More informationGeneralized Roof Duality for Pseudo-Boolean Optimization
Generalized Roof Duality for Pseudo-Boolean Optimization Fredrik Kahl Petter Strandmark Centre for Mathematical Sciences, Lund University, Sweden {fredrik,petter}@maths.lth.se Abstract The number of applications
More informationEfficient Inference with Cardinality-based Clique Potentials
Rahul Gupta IBM Research Lab, New Delhi, India Ajit A. Diwan Sunita Sarawagi IIT Bombay, India Abstract Many collective labeling tasks require inference on graphical models where the clique potentials
More informationWE address a general class of binary pairwise nonsubmodular
IN IEEE TRANS. ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI), 2017 - TO APPEAR 1 Local Submodularization for Binary Pairwise Energies Lena Gorelick, Yuri Boykov, Olga Veksler, Ismail Ben Ayed, Andrew
More informationExact Bounds for Steepest Descent Algorithms of L-convex Function Minimization
Exact Bounds for Steepest Descent Algorithms of L-convex Function Minimization Kazuo Murota Graduate School of Information Science and Technology, University of Tokyo, Tokyo 113-8656, Japan Akiyoshi Shioura
More informationCS 664 Segmentation (2) Daniel Huttenlocher
CS 664 Segmentation (2) Daniel Huttenlocher Recap Last time covered perceptual organization more broadly, focused in on pixel-wise segmentation Covered local graph-based methods such as MST and Felzenszwalb-Huttenlocher
More informationQuadratic Programming Relaxations for Metric Labeling and Markov Random Field MAP Estimation
Quadratic Programming Relaations for Metric Labeling and Markov Random Field MAP Estimation Pradeep Ravikumar John Lafferty School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213,
More informationSpatial Bayesian Nonparametrics for Natural Image Segmentation
Spatial Bayesian Nonparametrics for Natural Image Segmentation Erik Sudderth Brown University Joint work with Michael Jordan University of California Soumya Ghosh Brown University Parsing Visual Scenes
More informationDiscriminative Fields for Modeling Spatial Dependencies in Natural Images
Discriminative Fields for Modeling Spatial Dependencies in Natural Images Sanjiv Kumar and Martial Hebert The Robotics Institute Carnegie Mellon University Pittsburgh, PA 15213 {skumar,hebert}@ri.cmu.edu
More informationUndirected graphical models
Undirected graphical models Semantics of probabilistic models over undirected graphs Parameters of undirected models Example applications COMP-652 and ECSE-608, February 16, 2017 1 Undirected graphical
More informationDiscrete Inference and Learning Lecture 3
Discrete Inference and Learning Lecture 3 MVA 2017 2018 h
More informationChapter 3. Riemannian Manifolds - I. The subject of this thesis is to extend the combinatorial curve reconstruction approach to curves
Chapter 3 Riemannian Manifolds - I The subject of this thesis is to extend the combinatorial curve reconstruction approach to curves embedded in Riemannian manifolds. A Riemannian manifold is an abstraction
More informationPart I. C. M. Bishop PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS
Part I C. M. Bishop PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS Probabilistic Graphical Models Graphical representation of a probabilistic model Each variable corresponds to a
More informationShared Segmentation of Natural Scenes. Dependent Pitman-Yor Processes
Shared Segmentation of Natural Scenes using Dependent Pitman-Yor Processes Erik Sudderth & Michael Jordan University of California, Berkeley Parsing Visual Scenes sky skyscraper sky dome buildings trees
More informationMinimizing Count-based High Order Terms in Markov Random Fields
EMMCVPR 2011, St. Petersburg Minimizing Count-based High Order Terms in Markov Random Fields Thomas Schoenemann Center for Mathematical Sciences Lund University, Sweden Abstract. We present a technique
More informationRandom walks and anisotropic interpolation on graphs. Filip Malmberg
Random walks and anisotropic interpolation on graphs. Filip Malmberg Interpolation of missing data Assume that we have a graph where we have defined some (real) values for a subset of the nodes, and that
More informationCS Lecture 4. Markov Random Fields
CS 6347 Lecture 4 Markov Random Fields Recap Announcements First homework is available on elearning Reminder: Office hours Tuesday from 10am-11am Last Time Bayesian networks Today Markov random fields
More informationContinuous State MRF s
EE64 Digital Image Processing II: Purdue University VISE - December 4, Continuous State MRF s Topics to be covered: Quadratic functions Non-Convex functions Continuous MAP estimation Convex functions EE64
More informationOptimization of Max-Norm Objective Functions in Image Processing and Computer Vision
Optimization of Max-Norm Objective Functions in Image Processing and Computer Vision Filip Malmberg 1, Krzysztof Chris Ciesielski 2,3, and Robin Strand 1 1 Centre for Image Analysis, Department of Information
More informationProbabilistic Graphical Models Lecture Notes Fall 2009
Probabilistic Graphical Models Lecture Notes Fall 2009 October 28, 2009 Byoung-Tak Zhang School of omputer Science and Engineering & ognitive Science, Brain Science, and Bioinformatics Seoul National University
More informationarxiv: v1 [cs.cv] 23 Mar 2015
Superpixelizing Binary MRF for Image Labeling Problems arxiv:1503.06642v1 [cs.cv] 23 Mar 2015 Junyan Wang and Sai-Kit Yeung Singapore University of Technology and Design, 8 Somapah Road, Singapore, 487372
More informationBasics on the Graphcut Algorithm. Application for the Computation of the Mode of the Ising Model
Basics on the Graphcut Algorithm. Application for the Computation of the Mode of the Ising Model Bruno Galerne bruno.galerne@parisdescartes.fr MAP5, Université Paris Descartes Master MVA Cours Méthodes
More informationSome links between extremum spanning forests, watersheds and min-cuts
Some links between extremum spanning forests, watersheds and min-cuts Cédric Allène a,b, Jean-Yves Audibert a, Michel Couprie b and Renaud Keriven a a Université Paris-Est, CERTIS, Ecole des Ponts ParisTech,
More informationIntegrating Local Classifiers through Nonlinear Dynamics on Label Graphs with an Application to Image Segmentation
Integrating Local Classifiers through Nonlinear Dynamics on Label Graphs with an Application to Image Segmentation Yutian Chen Andrew Gelfand Charless C. Fowlkes Max Welling Bren School of Information
More informationAutomated Segmentation of Low Light Level Imagery using Poisson MAP- MRF Labelling
Automated Segmentation of Low Light Level Imagery using Poisson MAP- MRF Labelling Abstract An automated unsupervised technique, based upon a Bayesian framework, for the segmentation of low light level
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning More Approximate Inference Mark Schmidt University of British Columbia Winter 2018 Last Time: Approximate Inference We ve been discussing graphical models for density estimation,
More informationWhat Energy Functions can be Minimized via Graph Cuts?
What Energy Functions can be Minimized via Graph Cuts? Vladimir Kolmogorov and Ramin Zabih Computer Science Department, Cornell University, Ithaca, NY 14853 vnk@cs.cornell.edu, rdz@cs.cornell.edu Abstract.
More informationWhat Energy Functions can be Minimized via Graph Cuts?
What Energy Functions can be Minimized via Graph Cuts? Vladimir Kolmogorov and Ramin Zabih Computer Science Department, Cornell University, Ithaca, NY 14853 vnk@cs.cornell.edu, rdz@cs.cornell.edu Abstract.
More informationLecture 15. Probabilistic Models on Graph
Lecture 15. Probabilistic Models on Graph Prof. Alan Yuille Spring 2014 1 Introduction We discuss how to define probabilistic models that use richly structured probability distributions and describe how
More informationImage Segmentation by Convex Quadratic Programming
Image Segmentation by Convex Quadratic Programming Mariano Rivera, Oscar Dalmau and Josue Tago Centro de Investigacion en Matematicas A.C. {mrivera, dalmau, tago}@cimat.mx Abstract A quadratic programming
More informationMultiresolution Graph Cut Methods in Image Processing and Gibbs Estimation. B. A. Zalesky
Multiresolution Graph Cut Methods in Image Processing and Gibbs Estimation B. A. Zalesky 1 2 1. Plan of Talk 1. Introduction 2. Multiresolution Network Flow Minimum Cut Algorithm 3. Integer Minimization
More informationSHAPE MODELLING WITH CONTOURS AND FIELDS
SHAPE MODELLING WITH CONTOURS AND FIELDS Ian Jermyn Josiane Zerubia Zoltan Kato Marie Rochery Peter Horvath Ting Peng Aymen El Ghoul INRIA University of Szeged INRIA INRIA, Szeged INRIA, CASIA INRIA Overview
More informationQuadratization of symmetric pseudo-boolean functions
of symmetric pseudo-boolean functions Yves Crama with Martin Anthony, Endre Boros and Aritanan Gruber HEC Management School, University of Liège Liblice, April 2013 of symmetric pseudo-boolean functions
More informationGeneralizing Diffusion Tensor Model Using Probabilistic Inference in Markov Random Fields
Generalizing Diffusion Tensor Model Using Probabilistic Inference in Markov Random Fields Çağatay Demiralp and David H. Laidlaw Brown University Providence, RI, USA Abstract. We give a proof of concept
More informationCourse 16:198:520: Introduction To Artificial Intelligence Lecture 9. Markov Networks. Abdeslam Boularias. Monday, October 14, 2015
Course 16:198:520: Introduction To Artificial Intelligence Lecture 9 Markov Networks Abdeslam Boularias Monday, October 14, 2015 1 / 58 Overview Bayesian networks, presented in the previous lecture, are
More informationClassification Error Correction: A Case Study in Brain-Computer Interfacing
Classification Error Correction: A Case Study in Brain-Computer Interfacing Hasan A. Poonawala, Mohammed Alshiekh, Scott Niekum and Ufuk Topcu Abstract Classification techniques are useful for processing
More informationSubmodularization for Binary Pairwise Energies
IEEE conference on Computer Vision and Pattern Recognition (CVPR), Columbus, Ohio, 214 p. 1 Submodularization for Binary Pairwise Energies Lena Gorelick Yuri Boykov Olga Veksler Computer Science Department
More informationRandom Field Models for Applications in Computer Vision
Random Field Models for Applications in Computer Vision Nazre Batool Post-doctorate Fellow, Team AYIN, INRIA Sophia Antipolis Outline Graphical Models Generative vs. Discriminative Classifiers Markov Random
More informationPushmeet Kohli. Microsoft Research Cambridge. IbPRIA 2011
Pushmeet Kohli Microsoft Research Cambridge IbPRIA 2011 2:30 4:30 Labelling Problems Graphical Models Message Passing 4:30 5:00 - Coffee break 5:00 7:00 - Graph Cuts Move Making Algorithms Speed and Efficiency
More informationOn Partial Optimality in Multi-label MRFs
Pushmeet Kohli 1 Alexander Shekhovtsov 2 Carsten Rother 1 Vladimir Kolmogorov 3 Philip Torr 4 pkohli@microsoft.com shekhovt@cmp.felk.cvut.cz carrot@microsoft.com vnk@adastral.ucl.ac.uk philiptorr@brookes.ac.uk
More informationBayesian Image Segmentation Using MRF s Combined with Hierarchical Prior Models
Bayesian Image Segmentation Using MRF s Combined with Hierarchical Prior Models Kohta Aoki 1 and Hiroshi Nagahashi 2 1 Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology
More informationRounding-based Moves for Semi-Metric Labeling
Rounding-based Moves for Semi-Metric Labeling M. Pawan Kumar, Puneet K. Dokania To cite this version: M. Pawan Kumar, Puneet K. Dokania. Rounding-based Moves for Semi-Metric Labeling. Journal of Machine
More informationUndirected Graphical Models
Outline Hong Chang Institute of Computing Technology, Chinese Academy of Sciences Machine Learning Methods (Fall 2012) Outline Outline I 1 Introduction 2 Properties Properties 3 Generative vs. Conditional
More informationGaussian Process Based Image Segmentation and Object Detection in Pathology Slides
Gaussian Process Based Image Segmentation and Object Detection in Pathology Slides CS 229 Final Project, Autumn 213 Jenny Hong Email: jyunhong@stanford.edu I. INTRODUCTION In medical imaging, recognizing
More information3 : Representation of Undirected GM
10-708: Probabilistic Graphical Models 10-708, Spring 2016 3 : Representation of Undirected GM Lecturer: Eric P. Xing Scribes: Longqi Cai, Man-Chia Chang 1 MRF vs BN There are two types of graphical models:
More informationAlgorithms for Picture Analysis. Lecture 07: Metrics. Axioms of a Metric
Axioms of a Metric Picture analysis always assumes that pictures are defined in coordinates, and we apply the Euclidean metric as the golden standard for distance (or derived, such as area) measurements.
More informationDiscriminative Random Fields: A Discriminative Framework for Contextual Interaction in Classification
Discriminative Random Fields: A Discriminative Framework for Contextual Interaction in Classification Sanjiv Kumar and Martial Hebert The Robotics Institute, Carnegie Mellon University Pittsburgh, PA 15213,
More informationTransformation of Markov Random Fields for Marginal Distribution Estimation
Transformation of Markov Random Fields for Marginal Distribution Estimation Masaki Saito Takayuki Okatani Tohoku University, Japan {msaito, okatani}@vision.is.tohoku.ac.jp Abstract This paper presents
More informationA Generative Perspective on MRFs in Low-Level Vision Supplemental Material
A Generative Perspective on MRFs in Low-Level Vision Supplemental Material Uwe Schmidt Qi Gao Stefan Roth Department of Computer Science, TU Darmstadt 1. Derivations 1.1. Sampling the Prior We first rewrite
More informationChapter 16. Structured Probabilistic Models for Deep Learning
Peng et al.: Deep Learning and Practice 1 Chapter 16 Structured Probabilistic Models for Deep Learning Peng et al.: Deep Learning and Practice 2 Structured Probabilistic Models way of using graphs to describe
More informationA Background Layer Model for Object Tracking through Occlusion
A Background Layer Model for Object Tracking through Occlusion Yue Zhou and Hai Tao UC-Santa Cruz Presented by: Mei-Fang Huang CSE252C class, November 6, 2003 Overview Object tracking problems Dynamic
More informationGrouping with Bias. Stella X. Yu 1,2 Jianbo Shi 1. Robotics Institute 1 Carnegie Mellon University Center for the Neural Basis of Cognition 2
Grouping with Bias Stella X. Yu, Jianbo Shi Robotics Institute Carnegie Mellon University Center for the Neural Basis of Cognition What Is It About? Incorporating prior knowledge into grouping Unitary
More informationPushmeet Kohli Microsoft Research
Pushmeet Kohli Microsoft Research E(x) x in {0,1} n Image (D) [Boykov and Jolly 01] [Blake et al. 04] E(x) = c i x i Pixel Colour x in {0,1} n Unary Cost (c i ) Dark (Bg) Bright (Fg) x* = arg min E(x)
More informationCheng Soon Ong & Christian Walder. Canberra February June 2018
Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2018 Outlines Overview Introduction Linear Algebra Probability Linear Regression
More informationSIMU L TED ATED ANNEA L NG ING
SIMULATED ANNEALING Fundamental Concept Motivation by an analogy to the statistical mechanics of annealing in solids. => to coerce a solid (i.e., in a poor, unordered state) into a low energy thermodynamic
More informationQuadratization of Symmetric Pseudo-Boolean Functions
R u t c o r Research R e p o r t Quadratization of Symmetric Pseudo-Boolean Functions Martin Anthony a Endre Boros b Yves Crama c Aritanan Gruber d RRR 12-2013, December 2013 RUTCOR Rutgers Center for
More informationConnectedness of Random Walk Segmentation
Connectedness of Random Walk Segmentation Ming-Ming Cheng and Guo-Xin Zhang TNList, Tsinghua University, Beijing, China. Abstract Connectedness of random walk segmentation is examined, and novel properties
More informationQuadratic Markovian Probability Fields for Image Binary Segmentation
Quadratic Markovian Probability Fields for Image Binary Segmentation Mariano Rivera and Pedro P. Mayorga Centro de Investigacion en Matematicas A.C. Apdo Postal 402, Guanajuato, Gto. 36000 Mexico mrivera@cimat.mx
More information1 Overview. CS348a: Computer Graphics Handout #8 Geometric Modeling Original Handout #8 Stanford University Thursday, 15 October 1992
CS348a: Computer Graphics Handout #8 Geometric Modeling Original Handout #8 Stanford University Thursday, 15 October 1992 Original Lecture #1: 1 October 1992 Topics: Affine vs. Projective Geometries Scribe:
More informationMin-Max Message Passing and Local Consistency in Constraint Networks
Min-Max Message Passing and Local Consistency in Constraint Networks Hong Xu, T. K. Satish Kumar, and Sven Koenig University of Southern California, Los Angeles, CA 90089, USA hongx@usc.edu tkskwork@gmail.com
More informationHigher-order Graph Cuts
ACCV2014 Area Chairs Workshop Sep. 3, 2014 Nanyang Technological University, Singapore 1 Higher-order Graph Cuts Hiroshi Ishikawa Department of Computer Science & Engineering Waseda University Labeling
More informationA weighted Mirror Descent algorithm for nonsmooth convex optimization problem
Noname manuscript No. (will be inserted by the editor) A weighted Mirror Descent algorithm for nonsmooth convex optimization problem Duy V.N. Luong Panos Parpas Daniel Rueckert Berç Rustem Received: date
More informationFast Approximate Energy Minimization with Label Costs
ISBN: 978-0-7714-2823-4, Tech.Report #731, CS Dept., UWO, December 4, 2009. Revised April 25, 2010. 1 Fast Approximate Energy Minimization with Label Costs Anton Osokin Andrew Delong* * Department of Computer
More informationA Compact Linear Programming Relaxation for Binary Sub-modular MRF
A Compact Linear Programming Relaxation for Binary Sub-modular MRF Junyan Wang and Sai-Kit Yeung Singapore University of Technology and Design {junyan_wang,saikit}@sutd.edu.sg Abstract. Direct linear programming
More informationApplications of Information Geometry to Hypothesis Testing and Signal Detection
CMCAA 2016 Applications of Information Geometry to Hypothesis Testing and Signal Detection Yongqiang Cheng National University of Defense Technology July 2016 Outline 1. Principles of Information Geometry
More informationSpectral and Spatial Methods for the Classification of Urban Remote Sensing Data
Spectral and Spatial Methods for the Classification of Urban Remote Sensing Data Mathieu Fauvel gipsa-lab/dis, Grenoble Institute of Technology - INPG - FRANCE Department of Electrical and Computer Engineering,
More informationMACHINE LEARNING 2 UGM,HMMS Lecture 7
LOREM I P S U M Royal Institute of Technology MACHINE LEARNING 2 UGM,HMMS Lecture 7 THIS LECTURE DGM semantics UGM De-noising HMMs Applications (interesting probabilities) DP for generation probability
More informationEfficient Inference in Fully Connected CRFs with Gaussian Edge Potentials
Efficient Inference in Fully Connected CRFs with Gaussian Edge Potentials by Phillip Krahenbuhl and Vladlen Koltun Presented by Adam Stambler Multi-class image segmentation Assign a class label to each
More informationGIBBS CLASSIFIERS B. A. ZALESKY
Teor Imov r.tamatem.statist. Theor. Probability and Math. Statist. Vip. 70, 2004 No. 70, 2005, Pages 41 51 S 0094-9000(05)00629-0 Article electronically published on August 5, 2005 UDC 519.21 GIBBS CLASSIFIERS
More informationReformulations of nonlinear binary optimization problems
1 / 36 Reformulations of nonlinear binary optimization problems Yves Crama HEC Management School, University of Liège, Belgium Koper, May 2018 2 / 36 Nonlinear 0-1 optimization Outline 1 Nonlinear 0-1
More informationJakarta International School 8 th Grade AG1
Jakarta International School 8 th Grade AG1 Practice Test - Black Points, Lines, and Planes Name: Date: Score: 40 Goal 5: Solve problems using visualization and geometric modeling Section 1: Points, Lines,
More information