Adaptive Cooperative Systems Chapter 6 Markov Random Fields

Slides:



Advertisements
Similar presentations
Bayesian Belief Propagation
Advertisements

Various Regularization Methods in Computer Vision Min-Gyu Park Computer Vision Lab. School of Information and Communications GIST.
Approximation Algorithms Chapter 14: Rounding Applied to Set Cover.
Biointelligence Laboratory, Seoul National University
Ch 11. Sampling Models Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by I.-H. Lee Biointelligence Laboratory, Seoul National.
Proportion Priors for Image Sequence Segmentation Claudia Nieuwenhuis, etc. ICCV 2013 Oral.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Jensen’s Inequality (Special Case) EM Theorem.
Smoothing 3D Meshes using Markov Random Fields
CS774. Markov Random Field : Theory and Application Lecture 06 Kyomin Jung KAIST Sep
Visual Recognition Tutorial
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-
1 Markov random field: A brief introduction Tzu-Cheng Jen Institute of Electronics, NCTU
Announcements Readings for today:
Automatic Estimation and Removal of Noise from a Single Image
Advanced Image Processing Image Relaxation – Restoration and Feature Extraction 02/02/10.
Biointelligence Laboratory, Seoul National University
Physics Fluctuomatics (Tohoku University) 1 Physical Fluctuomatics 7th~10th Belief propagation Appendix Kazuyuki Tanaka Graduate School of Information.
Ch 2. Probability Distributions (1/2) Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by Yung-Kyun Noh and Joo-kyung Kim Biointelligence.
Markov Random Fields Probabilistic Models for Images
Artificial Intelligence Chapter 6 Robot Vision Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Ch 8. Graphical Models Pattern Recognition and Machine Learning, C. M. Bishop, Revised by M.-O. Heo Summarized by J.W. Nam Biointelligence Laboratory,
1 Markov random field: A brief introduction (2) Tzu-Cheng Jen Institute of Electronics, NCTU
Biointelligence Laboratory, Seoul National University
MECH4450 Introduction to Finite Element Methods
Lecture 2: Statistical learning primer for biologists
Ch.8 Efficient Coding of Visual Scenes by Grouping and Segmentation Bayesian Brain Tai Sing Lee and Alan L. Yuille Heo, Min-Oh.
Adaptive Cooperative Systems Chapter 8 Synaptic Plasticity 8.11 ~ 8.13 Summary by Byoung-Hee Kim Biointelligence Lab School of Computer Sci. & Eng. Seoul.
Unique Games Approximation Amit Weinstein Complexity Seminar, Fall 2006 Based on: “Near Optimal Algorithms for Unique Games" by M. Charikar, K. Makarychev,
Approaches to Selection and their Effect on Fitness Modelling in an Estimation of Distribution Algorithm A. E. I. Brownlee, J. A. McCall, Q. Zhang and.
Bayesian Brain: Probabilistic Approaches to Neural Coding Chapter 12: Optimal Control Theory Kenju Doya, Shin Ishii, Alexandre Pouget, and Rajesh P.N.Rao.
Graduate School of Information Sciences, Tohoku University
Ch 5. The Patterning of Neural Connections 5.5 ~ 5.6 Adaptive Cooperative Systems, Martin Beckerman, Summarized by Kwonill, Kim Biointelligence Laboratory,
6.4 Random Fields on Graphs 6.5 Random Fields Models In “Adaptive Cooperative Systems” Summarized by Ho-Sik Seok.
Regularization of energy-based representations Minimize total energy E p (u) + (1- )E d (u,d) E p (u) : Stabilizing function - a smoothness constraint.
Ch 2. Probability Distributions (1/2) Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by Joo-kyung Kim Biointelligence Laboratory,
Ch 1. Introduction (Latter) Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by J.W. Ha Biointelligence Laboratory, Seoul National.
Bayesian Brain Probabilistic Approaches to Neural Coding 1.1 A Probability Primer Bayesian Brain Probabilistic Approaches to Neural Coding 1.1 A Probability.
Ch 6. Markov Random Fields 6.1 ~ 6.3 Adaptive Cooperative Systems, Martin Beckerman, Summarized by H.-W. Lim Biointelligence Laboratory, Seoul National.
Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller.
Ch 1. Introduction Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by J.W. Ha Biointelligence Laboratory, Seoul National University.
1 (c) SNU CSE Biointelligence Lab, Chap 3.8 – 3.10 Joon Shik Kim BI study group.
Ch 1. Introduction Pattern Recognition and Machine Learning, C. M. Bishop, Updated by J.-H. Eom (2 nd round revision) Summarized by K.-I.
Ch 2. THERMODYNAMICS, STATISTICAL MECHANICS, AND METROPOLIS ALGORITHMS 2.6 ~ 2.8 Adaptive Cooperative Systems, Martin Beckerman, Summarized by J.-W.
Artificial Intelligence Chapter 11 Alternative Search Formulations and Applications.
Bayesian Brain - Chapter 11 Neural Models of Bayesian Belief Propagation Rajesh P.N. Rao Summary by B.-H. Kim Biointelligence Lab School of.
Markov Random Fields Tomer Michaeli Graduate Course
Biointelligence Laboratory, Seoul National University
Biointelligence Laboratory, Seoul National University
Markov Random Fields with Efficient Approximations
LECTURE 10: EXPECTATION MAXIMIZATION (EM)
Probabilistic Models for Linear Regression
LECTURE 05: THRESHOLD DECODING
Akio Utsugi National Institute of Bioscience and Human-technology,
Biointelligence Lab School of Computer Sci. & Eng.
SMEM Algorithm for Mixture Models
LECTURE 05: THRESHOLD DECODING
Presented by Rhee, Je-Keun
Multi-Objective Optimization
Biointelligence Laboratory, Seoul National University
Biointelligence Laboratory, Seoul National University
Expectation-Maximization & Belief Propagation
Biointelligence Lab School of Computer Sci. & Eng.
(c) SNU CSE Biointelligence Lab,
Biointelligence Laboratory, Seoul National University
Chapter 5 Language Change: A Preliminary Model (2/2)
Adaptive Cooperative Systems Chapter 3 Coperative Lattice Systems
Ch 3. Linear Models for Regression (2/2) Pattern Recognition and Machine Learning, C. M. Bishop, Previously summarized by Yung-Kyun Noh Updated.
LECTURE 05: THRESHOLD DECODING
Information Processing by Neuronal Populations Chapter 5 Measuring distributed properties of neural representations beyond the decoding of local variables:
Biointelligence Laboratory, Seoul National University
Presentation transcript:

Adaptive Cooperative Systems Chapter 6 Markov Random Fields 6.12 ~ 6.13 Summary by Byoung-Hee Kim Biointelligence Lab School of Computer Sci. & Eng. Seoul National University

(C) 2009 SNU CSE Biointelligence Lab Contents 6.12 Mean-field annealing Mechanical models, graduated nonconvexity, and mean-field theory Mean-field annealing Convex functions and Jensen’s inequality The mean-field annealing algorithm 6.13 Graduated nonconvexity Weak continuity constraints Elimination of the line process Nonconvexity and convex approximation (C) 2009 SNU CSE Biointelligence Lab

Potentials and Deterministic Approaches One of our main objectives in studying image-processing applications is to explore ways of constructing useful potential functions Sources of inspiration: regularization theory, mechanical models Potentials using mean-field annealing and graduated nonconvexity Deterministic approximations to the stochastic method of Geman and Geman Mean field formalism and resulting potentials Corresponding graduated nonconvexity potential functions Problem domain: image reconstruction problem (C) 2009 SNU CSE Biointelligence Lab

Image Reconstruction Problem Goal Simultaneously remove noise and strengthen and preserve boundaries (C) 2009 SNU CSE Biointelligence Lab

(C) 2009 SNU CSE Biointelligence Lab Mean Field Annealing We approximate the posterior hamiltonian by the mean-field hamiltoniam Illustration with the simple, piecewise constant image model Starting point: the posterior hamiltonian Choose a piecewise constant prior potential (C) 2009 SNU CSE Biointelligence Lab

(C) 2009 SNU CSE Biointelligence Lab For continuous-valued variables Neglecting independent terms Mean-field hamiltonian Form: a Gibbs distribution with a Gaussian normalization We want to determine the form of the mean-field x (C) 2009 SNU CSE Biointelligence Lab

Convex Functions and Jensen’s Inequality We want to determine the form of the mean-field x How to find the approximation? Self-consistency procedure based on Jensen’s inequality Upper bound to the free energy  Minimize this w.r.t x to get Emf that best approximates E (C) 2009 SNU CSE Biointelligence Lab

The Mean-Field Annealing Algorithm (C) 2009 SNU CSE Biointelligence Lab

Graduated Nonconvexity Mechanical approach to solving optimization problems in visual surface reconstruction Key elements Having the cooperativity intrinsic to mechanical systems (rods, springs, flexible plates, …) These systems develop global order from local interactions Posses all the properties expected of cooperative systems Examples Spring-loaded dipole model Having piecewise continuity Analogous to piecewise smoothness of curves and surfaces in discrete systems Having nonconvex optimization  piecewise convex ` (C) 2009 SNU CSE Biointelligence Lab

(C) 2009 SNU CSE Biointelligence Lab