Outline Texture modeling - continued Markov Random Field models

Slides:



Advertisements
Similar presentations
Weakly supervised learning of MRF models for image region labeling Jakob Verbeek LEAR team, INRIA Rhône-Alpes.
Advertisements

On Complexity, Sampling, and -Nets and -Samples. Range Spaces A range space is a pair, where is a ground set, it’s elements called points and is a family.
Markov Networks Alan Ritter.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Markov Chain Monte Carlo Prof. David Page transcribed by Matthew G. Lee.
Markov Networks.
Андрей Андреевич Марков. Markov Chains Graduate Seminar in Applied Statistics Presented by Matthias Theubert Never look behind you…
Contextual Classification by Melanie Ganz Lecture 6, Medical Image Analysis 2008.
Markov random field Institute of Electronics, NCTU
. PGM: Tirgul 8 Markov Chains. Stochastic Sampling  In previous class, we examined methods that use independent samples to estimate P(X = x |e ) Problem:
Texture Turk, 91.
1 On the Statistical Analysis of Dirty Pictures Julian Besag.
The Markov property Discrete time: A time symmetric version: A more general version: Let A be a set of indices >k, B a set of indices
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
1 Markov random field: A brief introduction Tzu-Cheng Jen Institute of Electronics, NCTU
Announcements Readings for today:
E.G.M. PetrakisTexture1 Repeative patterns of local variations of intensity on a surface –texture pattern: texel Texels: similar shape, intensity distribution.
Computer vision: models, learning and inference Chapter 10 Graphical Models.
Sampling Distributions  A statistic is random in value … it changes from sample to sample.  The probability distribution of a statistic is called a sampling.
Image Analysis and Markov Random Fields (MRFs) Quanren Xiong.
Methods in Medical Image Analysis Statistics of Pattern Recognition: Classification and Clustering Some content provided by Milos Hauskrecht, University.
Presenter : Kuang-Jui Hsu Date : 2011/5/23(Tues.).
Statistical Decision Theory
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.
A Markov Random Field Model for Term Dependencies Donald Metzler W. Bruce Croft Present by Chia-Hao Lee.
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
Markov Random Fields Probabilistic Models for Images
Course 9 Texture. Definition: Texture is repeating patterns of local variations in image intensity, which is too fine to be distinguished. Texture evokes.
Graphical Models for Machine Learning and Computer Vision.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: ML and Simple Regression Bias of the ML Estimate Variance of the ML Estimate.
Image Analysis, Random Fields and Dynamic MCMC By Marc Sobel.
1 Markov random field: A brief introduction (2) Tzu-Cheng Jen Institute of Electronics, NCTU
November 30, PATTERN RECOGNITION. November 30, TEXTURE CLASSIFICATION PROJECT Characterize each texture so as to differentiate it from one.
Markov Chain Monte Carlo Prof. David Page transcribed by Matthew G. Lee.
The generalization of Bayes for continuous densities is that we have some density f(y|  ) where y and  are vectors of data and parameters with  being.
Seminar on random walks on graphs Lecture No. 2 Mille Gandelsman,
Multi Scale CRF Based RGB-D Image Segmentation Using Inter Frames Potentials Taha Hamedani Robot Perception Lab Ferdowsi University of Mashhad The 2 nd.
6.4 Random Fields on Graphs 6.5 Random Fields Models In “Adaptive Cooperative Systems” Summarized by Ho-Sik Seok.
CS Statistical Machine learning Lecture 25 Yuan (Alan) Qi Purdue CS Nov
Markov Random Fields in Vision
Ch 6. Markov Random Fields 6.1 ~ 6.3 Adaptive Cooperative Systems, Martin Beckerman, Summarized by H.-W. Lim Biointelligence Laboratory, Seoul National.
Outline Time series prediction Find k-nearest neighbors Lag selection Weighted LS-SVM.
6.8 Maximizer of the Posterior Marginals 6.9 Iterated Conditional Modes of the Posterior Distribution Jang, HaYoung.
CS498-EA Reasoning in AI Lecture #19 Professor: Eyal Amir Fall Semester 2011.
Slide 15.1 Stochastic Choice MathematicalMarketing Chapter 15: Stochastic Choice The sequence of coverage is:  Key Terminology  The Brand Switching Matrix.
Biointelligence Laboratory, Seoul National University
Availability Availability - A(t)
LECTURE 09: BAYESIAN ESTIMATION (Cont.)
Markov Random Fields with Efficient Approximations
Maximum Likelihood Estimation
Outline Texture modeling - continued Filtering-based approaches.
Outline Statistical Modeling and Conceptualization of Visual Patterns
Markov Networks.
Outline S. C. Zhu, X. Liu, and Y. Wu, “Exploring Texture Ensembles by Efficient Markov Chain Monte Carlo”, IEEE Transactions On Pattern Analysis And Machine.
Computer Vision Lecture 16: Texture II
Markov Random Fields for Edge Classification
Computer Vision Chapter 9
Outline Neural networks - reviewed Texture modeling
Multidimensional Integration Part I
Texture.
Shashi Shekhar Weili Wu Sanjay Chawla Ranga Raju Vatsavai
Texture, optics and shading
Markov Random Fields Presented by: Vladan Radosavljevic.
Outline Texture modeling - continued Julesz ensemble.
Bayesian Classification
Parametric Methods Berlin Chen, 2005 References:
Markov Networks.
Discrete Random Variables: Joint PMFs, Conditioning and Independence
Sequences II Prof. Noah Snavely CS1114
Random Neural Network Texture Model
Presentation transcript:

Outline Texture modeling - continued Markov Random Field models Fractals

Visual Perception Modeling Some Texture Examples 11/20/2019 Visual Perception Modeling

Visual Perception Modeling Texture Modeling Texture modeling is to find feature statistics that characterize perceptual appearance of textures There are two major computational issues What kinds of feature statistics shall we use? How to verify the sufficiency or goodness of chosen feature statistics? 11/20/2019 Visual Perception Modeling

Texture Modeling – cont. The structures of images The structures in images are due to the inter-pixel relationships The key issue is how to characterize the relationships 11/20/2019 Visual Perception Modeling

Co-occurrence Matrices Gray-level co-occurrence matrix One of the early texture models Was widely used Suppose that there are G different gray values in a texture image I For a given displacement vector (dx, dy), the entry (i, j) of the co-occurrence matrix Pd is 11/20/2019 Visual Perception Modeling

Autocorrelation Features Many textures have repetitive nature of texture elements The autocorrelation function can be used to assess the amount of regularity as well as the fineness/coarseness of the texture present in the image 11/20/2019 Visual Perception Modeling

Visual Perception Modeling Geometrical Models Geometrical models Applies to textures with texture elements First texture elements are extracted Then one can compute the statistics of local elements or extract the placement rule that describes the texture Voronoi tessellation features Structural methods 11/20/2019 Visual Perception Modeling

Visual Perception Modeling Markov Random Fields Markov random fields Have been popular for image modeling, including textures Able to capture the local contextual information in an image 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. Sites Let S index a discrete set of m sites S = {1, ...., m} A site represents a point or a region in the Euclidean space Such as an image pixel Labels A label is an event that may happen to a site Such as pixel values 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. Labeling problem Assign a label from the label set L to each of the sites in S Also a mapping from S  L A labeling is called a configuration In texture modeling, a configuration is a texture image The set of all possible configurations is called the configuration space  11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. Neighborhood systems The sites in S are related to one another via a neighborhood A neighborhood system for S is defined as The neighborhood relationship has the following properties A site is not a neighbor to itself The neighborhood relationship is mutual 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. Let F={F1, ...., Fm} be a family of random variables defined on the set S in which each random variable Fi takes a value from L F is said to be a Markov random field on S with respect to a neighborhood system N if an only if the following two conditions are satisfied: 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. Homogenous MRFs If P(fi | fNi) is regardless of the relative position of site i in S How to specify a Markov random field Conditional probabilities P(fi | fNi) Joint probability P(f) 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. Gibbs random fields A set of random variables F is said to be a Gibbs random field on S with respect to N if and only if its configurations obey a Gibbs distribution and 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. Cliques A clique c for (S, N) is defined as a subset of sites in S and it consists of A single site A pair of neighboring sites A triple of neighboring sites ....... 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. Markov-Gibbs equivalence Hammersley-Clifford theorm F is an Markov random field on S respect to N if and only if F is a Gibbs random field on S with respect to N Practical value of the theorem It provides a simple way to specify the joint probability by specifying the clique potentials 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. Markov random field models for textures Homogeneity of Markov random fields is assumed A texture type is characterized by a set of parameters associated with clique types Texture images can be generated (synthesized) by sampling from the Markov random field model 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. The -model The energy function is of the form with 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. Parameter estimation Parameters are generally estimated using Maximum-Likelihood estimator or Maximum-A-Posterior estimator Computationally, the partition function can not be evaluated Markov chain Monte Carlo is often used to estimate the partition function by generating typical samples from the distribution 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. Pseudo-likelihood Instead of maximizing P(f), the joint probability, we maximize the products of conditional probabilities 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. Texture synthesis Generate samples from the Gibbs distributions Two sampling techniques Metropolis sampler Gibbs sampler 11/20/2019 Visual Perception Modeling

Markov Random Fields – cont. 11/20/2019 Visual Perception Modeling

Visual Perception Modeling Fractals Fractals Many natural surfaces have a statistical quality of roughness and self-similarity at different scales Fractals are very useful in modeling self-similarity Texture features based on fractals Fractal dimension Lacunarity 11/20/2019 Visual Perception Modeling

Visual Perception Modeling Fractals – An Example 11/20/2019 Visual Perception Modeling