Biointelligence Laboratory, Seoul National University

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.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Ch 11. Sampling Models Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by I.-H. Lee Biointelligence Laboratory, Seoul National.
EE462 MLCV Lecture Introduction of Graphical Models Markov Random Fields Segmentation Tae-Kyun Kim 1.
Smoothing 3D Meshes using Markov Random Fields
Chapter 8-3 Markov Random Fields 1. Topics 1. Introduction 1. Undirected Graphical Models 2. Terminology 2. Conditional Independence 3. Factorization.
EE 7730 Image Segmentation.
Digital Image Processing Chapter 5: Image Restoration.
Primal Sketch Integrating Structure and Texture Ying Nian Wu UCLA Department of Statistics Keck Meeting April 28, 2006 Guo, Zhu, Wu (ICCV, 2003; GMBV,
Announcements Readings for today:
Deriving Intrinsic Images from Image Sequences Mohit Gupta Yair Weiss.
CS292 Computational Vision and Language Visual Features - Colour and Texture.
Advanced Image Processing Image Relaxation – Restoration and Feature Extraction 02/02/10.
Image Analysis and Markov Random Fields (MRFs) Quanren Xiong.
1 Intelligent Robotics Research Centre (IRRC) Department of Electrical and Computer Systems Engineering Monash University, Australia Visual Perception.
Summarized by Soo-Jin Kim
Image Restoration and Reconstruction (Noise Removal)
Introduction to Visible Watermarking IPR Course: TA Lecture 2002/12/18 NTU CSIE R105.
INDEPENDENT COMPONENT ANALYSIS OF TEXTURES based on the article R.Manduchi, J. Portilla, ICA of Textures, The Proc. of the 7 th IEEE Int. Conf. On Comp.
Lecture 2b Readings: Kandell Schwartz et al Ch 27 Wolfe et al Chs 3 and 4.
Markov Random Fields Probabilistic Models for Images
Artificial Intelligence Chapter 6 Robot Vision Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
14 October, 2010LRI Seminar 2010 (Univ. Paris-Sud)1 Statistical performance analysis by loopy belief propagation in probabilistic image processing Kazuyuki.
1 Markov random field: A brief introduction (2) Tzu-Cheng Jen Institute of Electronics, NCTU
(c) 2000, 2001 SNU CSE Biointelligence Lab Finding Region Another method for processing image  to find “regions” Finding regions  Finding outlines.
CS654: Digital Image Analysis
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.
Motion Estimation using Markov Random Fields Hrvoje Bogunović Image Processing Group Faculty of Electrical Engineering and Computing University of Zagreb.
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.
Ch 9. Rhythms and Synchrony 9.7 Adaptive Cooperative Systems, Martin Beckerman, Summarized by M.-O. Heo Biointelligence Laboratory, Seoul National.
1 Multi Scale Markov Random Field Image Segmentation Taha hamedani.
Ch 6. Markov Random Fields 6.1 ~ 6.3 Adaptive Cooperative Systems, Martin Beckerman, Summarized by H.-W. Lim Biointelligence Laboratory, Seoul National.
Ch 2. THERMODYNAMICS, STATISTICAL MECHANICS, AND METROPOLIS ALGORITHMS 2.6 ~ 2.8 Adaptive Cooperative Systems, Martin Beckerman, Summarized by J.-W.
6.8 Maximizer of the Posterior Marginals 6.9 Iterated Conditional Modes of the Posterior Distribution Jang, HaYoung.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
1 Nonlinear models for Natural Image Statistics Urs Köster & Aapo Hyvärinen University of Helsinki.
Biointelligence Laboratory, Seoul National University
Biointelligence Laboratory, Seoul National University
Summary of “Efficient Deep Learning for Stereo Matching”
CSE 554 Lecture 1: Binary Pictures
Markov Random Fields with Efficient Approximations
Biointelligence Laboratory, Seoul National University
Chapter 6. Robot Vision.
Ch 14. Active Vision for Goal-Oriented Humanoid Robot Walking (1/2) Creating Brain-Like Intelligence, Sendhoff et al. (eds), Robots Learning from.
Computer Vision Lecture 9: Edge Detection II
Iterative Optimization
Presented by Rhee, Je-Keun
Parallel Integration of Video Modules
Presented by Rhee, Je-Keun
Presented by Rhee, Je-Keun
Computer and Robot Vision I
Neutrosophic Mathematical Morphology for Medical Image
A Volumetric Method for Building Complex Models from Range Images
Outline Texture modeling - continued Julesz ensemble.
Handwritten Characters Recognition Based on an HMM Model
(c) SNU CSE Biointelligence Lab,
Biointelligence Laboratory, Seoul National University
Adaptive Cooperative Systems Chapter 6 Markov Random Fields
IT523 Digital Image Processing
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.
Fourier Transform of Boundaries
Biointelligence Laboratory, Seoul National University
Computer and Robot Vision I
DIGITAL IMAGE PROCESSING Elective 3 (5th Sem.)
Outline Texture modeling - continued Markov Random Field models
Presentation transcript:

Biointelligence Laboratory, Seoul National University Ch 6. Markov Random Fields 6.10 Coupled Markov Random Fields 6.11 Compound Gauss-Markov Random Fields Adaptive Cooperative Systems, Martin Beckerman, 1997. Summarized by J.-W. Ha Biointelligence Laboratory, Seoul National University http://bi.snu.ac.kr/

(C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Contents 6.10 Coupled Markov Random Fields 6.10.1 The Line Process 6.10.2 Coupled Markov Random Fields and Integration 6.11 Compound Gauss-Markov Random Fields (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/ The Line Process Coupled Pixel Process + Line Process Line process : discontinuity-preserving, boundary-strengthening The Line Process Second Markov random fields Employ the Gibbs-Markov equivalence to produce a simple in terms of clique potentials. Is defined over a dual lattice and encodes discontinuity information Be visualized as a 2-D array of 2N2 line elements, one horizontal and one vertical line for each pixel in the primary pixel lattice. (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/ The Line Process the first order relations The Suspension of smoothing at surface boundary Line element is ON → second term = 0 Prevents the unwanted phase transitions by suspending Small islands of pixels (6.120) (6.121) (6.122) (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/ The Line Process Off-on system of line elements Six elements : empty, isolated singleton, corner, straight line, tee, crossing Clique potentials Generalized Ising Hamilton A simple way of strengthening boundaries The lowest energies : All ON or All Off (6.123) (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Coupled Markov Random Fields and Integration The goal Image reconstruction : remove noise, blur, distortions and artifacts while preserving boundaries Segmenting : reconstruct and identify the individual surfaces Removing noise and artifacts while preserving and strengthening boundaries. Integration Added task : combine 2D image from many perceptual domains It can be done by coupled MRF (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Coupled Markov Random Fields and Integration Underlying Assumptions 3D physical scenes are composed of surfaces Input : 2D projection of 3D scene Output : image description in terms of surfaces, attendant discontinuities, stable physical properties J.J. Gibson : invariant properties of surfaces were perceived directly from the spatiotemporal patterns of light reaching the observer as contained in the ambient optic array. Barrow et al. replace the concept of direct perception with a computational theory for the reconstruction of surfaces (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Coupled Markov Random Fields and Integration Computational theory of perception Intrinsic images Arrays of elements that are in precise registrations with respect to the original images Each array describes an invariant physical characteristic of the underlying physical surfaces and also contains information regarding the discontinuities associated with that property. Ex : distance(depth), albedo, local surface orientation, illumination Constrains to reconstruct Problems of recovering the properties of 3D surfaces from 2D images Needed to restrict the many possible surface reconstructions to physically meaningful one (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Coupled Markov Random Fields and Integration Coupling Model Simultaneously extract surface and boundary information Consider the integration of information contained in the various intrinsic images One for the pixel process and one for the line process (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Coupled Markov Random Fields and Integration An Example of the integration of data from multiple moduels (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Coupled Markov Random Fields and Integration ICM algorithms for Coupled MRF Initialize the pixel lattice by choosing the value at each site that maximizes the likehood. Initialize all dual lattices using the initial pixel values according to Eq.(6.120) Select a primary dual lattice pair Select a lattice site in the manner of a raster scan Replace the pixel grey values with the mode for the neighborhood. Go back to step 4 and continue the raster scan Initialize the dual lattice using the updated pixel values Select a dual lattice site in the manner of a raster scan If flipping the spin lowers the energy, then flip the spin; otherwise do not flip. Go back to step 8 and continue the raster scan Repeat steps 3 to 10 for the next pair of coupled lattices Iterate five or six times, repeating steps 3 to 10 for the three lattice pairs (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Coupled Markov Random Fields and Integration Compound Gauss-MRF These models extend the method of Geman and Geman to non-compact, continuous-valued range spaces Reconstruction Given the degraded observed image g, reconstruct f Appending a line or structure process (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Coupled Markov Random Fields and Integration A model consisting of a continuous valued pixel process plus a discrete valued line process (C) 2009, SNU Biointelligence Lab, http://bi.snu.ac.kr/