Continuous State MRF s

Similar documents
Markov Random Fields

Nonnegative Tensor Factorization with Smoothness Constraints

Markov Random Fields and Stochastic Image Models

Simultaneous Multi-frame MAP Super-Resolution Video Enhancement using Spatio-temporal Priors

Nonnegative Tensor Factorization with Smoothness Constraints

Implicit Priors for Model-Based Inversion

Notes on Regularization and Robust Estimation Psych 267/CS 348D/EE 365 Prof. David J. Heeger September 15, 1998

Bayesian Image Segmentation Using MRF s Combined with Hierarchical Prior Models

Comparison of Lesion Detection and Quantification in MAP Reconstruction with Gaussian and Non-Gaussian Priors

Automated Segmentation of Low Light Level Imagery using Poisson MAP- MRF Labelling

ANALYTICAL BOUNDS ON THE MINIMIZERS OF (NONCONVEX) REGULARIZED LEAST-SQUARES. Mila Nikolova. (Communicated by Jackie (Jianhong) Shen)

Discriminative Fields for Modeling Spatial Dependencies in Natural Images

Objective Functions for Tomographic Reconstruction from. Randoms-Precorrected PET Scans. gram separately, this process doubles the storage space for

MAP Reconstruction From Spatially Correlated PET Data

Pattern Theory and Its Applications

Probing the covariance matrix

Energy Minimization via Graph Cuts

MMSE DECODING FOR ANALOG JOINT SOURCE CHANNEL CODING USING MONTE CARLO IMPORTANCE SAMPLING

Regularizing inverse problems using sparsity-based signal models

Image restoration: edge preserving

ENGINEERING TRIPOS PART IIB: Technical Milestone Report

Approximate Message Passing Algorithms

Minimizing Isotropic Total Variation without Subiterations

Towards inference for skewed alpha stable Levy processes

Probabilistic Graphical Models Lecture Notes Fall 2009

Erkut Erdem. Hacettepe University February 24 th, Linear Diffusion 1. 2 Appendix - The Calculus of Variations 5.

1 Introduction Robust statistics methods provide tools for statistics problems in which underlying assumptions are inexact. A robust procedure should

Probabilistic Graphical Models

SEC: Stochastic ensemble consensus approach to unsupervised SAR sea-ice segmentation

Markov Chains and Hidden Markov Models

Message-Passing Algorithms for GMRFs and Non-Linear Optimization

Efficient Variational Inference in Large-Scale Bayesian Compressed Sensing

INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATION ENGINEERING & TECHNOLOGY (IJECET)

A Study of Numerical Algorithms for Regularized Poisson ML Image Reconstruction

MCMC Sampling for Bayesian Inference using L1-type Priors

Markov chain Monte Carlo methods for visual tracking

WAVELET BASED DENOISING FOR IMAGES DEGRADED BY POISSON NOISE

Covariance Matrix Simplification For Efficient Uncertainty Management

Fusion of SPOT HRV XS and Orthophoto Data Using a Markov Random Field Model

Random Field Models for Applications in Computer Vision

Nonlinear Multigrid Algorithms for Bayesian Optical Diffusion Tomography

Model-Based Dynamic Sampling (MBDS) in 2D and 3D. Dilshan Godaliyadda Gregery Buzzard Charles Bouman Purdue University

Image Segmentation by Convex Quadratic Programming

Optimal Mean-Square Noise Benefits in Quantizer-Array Linear Estimation Ashok Patel and Bart Kosko

A Generative Model Based Approach to Motion Segmentation

Time Series Prediction by Kalman Smoother with Cross-Validated Noise Density

Discriminative Random Fields: A Discriminative Framework for Contextual Interaction in Classification

Accelerated MRI Image Reconstruction

Satellite image deconvolution using complex wavelet packets

A Partial Differential Equation Approach to Image Zoom

Convex Optimization: Applications

High-dimensional graphical model selection: Practical and information-theoretic limits

A Graph Cut Algorithm for Generalized Image Deconvolution

Estimation Error Bounds for Frame Denoising

Inference for latent variable models with many hyperparameters

Statistical Estimation of the Parameters of a PDE

Statistics 352: Spatial statistics. Jonathan Taylor. Department of Statistics. Models for discrete data. Stanford University.

High-dimensional graphical model selection: Practical and information-theoretic limits

Shankar Shivappa University of California, San Diego April 26, CSE 254 Seminar in learning algorithms

A Generative Perspective on MRFs in Low-Level Vision Supplemental Material

Motivation Sparse Signal Recovery is an interesting area with many potential applications. Methods developed for solving sparse signal recovery proble

Bayesian approach to image reconstruction in photoacoustic tomography

STAT 518 Intro Student Presentation

Linear Dependency Between and the Input Noise in -Support Vector Regression

HMM part 1. Dr Philip Jackson

The Kalman Filter ImPr Talk

Chapter V. Image Restoration

Defect Detection Using Hidden Markov Random Fields

MMSE Denoising of 2-D Signals Using Consistent Cycle Spinning Algorithm

MAP Examples. Sargur Srihari

MINIMUM EXPECTED RISK PROBABILITY ESTIMATES FOR NONPARAMETRIC NEIGHBORHOOD CLASSIFIERS. Maya Gupta, Luca Cazzanti, and Santosh Srivastava

Bayesian SAE using Complex Survey Data Lecture 4A: Hierarchical Spatial Bayes Modeling

Undirected Graphical Models: Markov Random Fields

Markov Random Fields (A Rough Guide)

A Background Layer Model for Object Tracking through Occlusion

CS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling

PILCO: A Model-Based and Data-Efficient Approach to Policy Search

Inverse problems in atmospheric dispersion with randomly scattered sensors

High dimensional Ising model selection

Clustering K-means. Clustering images. Machine Learning CSE546 Carlos Guestrin University of Washington. November 4, 2014.

Introduction to Systems Analysis and Decision Making Prepared by: Jakub Tomczak

Stochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions

Probabilistic Inference of Hand Motion from Neural Activity in Motor Cortex

Fast Wavelet-Based Image Deconvolution Using the EM Algorithm

ECE521 week 3: 23/26 January 2017

Density Propagation for Continuous Temporal Chains Generative and Discriminative Models

Generalized Laplacian as Focus Measure

TWO METHODS FOR ESTIMATING OVERCOMPLETE INDEPENDENT COMPONENT BASES. Mika Inki and Aapo Hyvärinen

Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels

Uniform Quadratic Penalties Cause Nonuniform Spatial Resolution

Scale-Invariance of Support Vector Machines based on the Triangular Kernel. Abstract

EEL 851: Biometrics. An Overview of Statistical Pattern Recognition EEL 851 1

Bayesian Methods for Sparse Signal Recovery

Intelligent Systems (AI-2)

Contre-examples for Bayesian MAP restoration. Mila Nikolova

Markov Random Fields and Bayesian Image Analysis. Wei Liu Advisor: Tom Fletcher

Gaussian processes for inference in stochastic differential equations

Sequence labeling. Taking collective a set of interrelated instances x 1,, x T and jointly labeling them

Scan Time Optimization for Post-injection PET Scans

Laplace-distributed increments, the Laplace prior, and edge-preserving regularization

Transcription:

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 Digital Image Processing II: Purdue University VISE - December 4, Why use Non-Gaussian MRF s? Gaussian MRF s do not model edges well. In applications such as image restoration and tomography, Gaussian MRF s either Blur edges Leave excessive amounts of noise

EE64 Digital Image Processing II: Purdue University VISE - December 4, Gaussian MRF s Zero mean Gaussian MRF s have density functions with the form It can be shown that where p(x) = Z exp Bx σ xt x t Bx = a sx s + s S a s = {s,r} C r S B s,r b s,r = B s,r b sr x s x r We will further assume that a s = and r b sr =, so that log p(x) = σ {s,r} C b sr x s x r log Z

EE64 Digital Image Processing II: Purdue University VISE - December 4, 4 MAP Estimation with Gaussian MRF s MAP estimate has the form ˆx = arg min x log p(y x) + {s,r} C b sr x s x r Problem: The terms x s x r penalize rapid changes in gray level. Quadratic function,, excessively penalizes image edges.

EE64 Digital Image Processing II: Purdue University VISE - December 4, 5 Non-Gaussian MRF s Based on Pair-Wise Cliques We will consider MRF s with pair-wise cliques p(x) = Z exp {s,r} C b sr ρ x s x r - is the change in gray level. σ - controls the gray level variation or scale. x s x r σ ρ( ): Known as the potential function. Determines the cost of abrupt changes in gray level. ρ( ) = is the Gaussian model. ρ ( ) = dρ( ) d : Known as the influence function from M-estimation [4, ]. Determines the attraction of a pixel to neighboring gray levels.

EE64 Digital Image Processing II: Purdue University VISE - December 4, 6 Weak Spring Model Proposed by Blake and Zisserman [, ] as a model of a weak spring that can break if the values of adjacent pixels differ too much. ρ( ) = min {, } Blake_Zisserman Potential Function Blake_Zisserman Influence Function.5.5.5.5.5.5.5 Potential Function T - Edge magnitude.5.5.5.5 Influence Function > T no attraction from influence function < T Gaussian smoothing

EE64 Digital Image Processing II: Purdue University VISE - December 4, 7 Non-Convex Potential Functions Authors ρ( ) Ref. Potential func. Influence func. Geman_McClure Potential Function Geman_McClure Influence Function.5.5 Geman and McClure + [7, 8].5.5.5.5.5.5.5.5.5 Blake_Zisserman Potential Function Blake_Zisserman Influence Function.5.5 Blake and Zisserman min {, } [, ].5.5.5.5.5.5.5.5.5 Hebert_Leahy Potential Function Hebert_Leahy Influence Function.5.5 Hebert and Leahy log ( + ) [].5.5.5.5.5.5.5.5.5 Geman_Reynolds Potential Function Geman_Reynolds Influence Function.5.5 Geman and Reynolds + [6].5.5.5.5.5.5.5.5.5

EE64 Digital Image Processing II: Purdue University VISE - December 4, 8 Properties of Non-Convex Potential Functions Advantages Very sharp edges Very general class of potential functions Disadvantages Difficult (impossible) to compute MAP estimate Usually requires the choice of an edge threshold MAP estimate is a discontinuous function of the data

EE64 Digital Image Processing II: Purdue University VISE - December 4, 9 Continuous (Stable) MAP Estimation[4] Minimum of non-convex function can change abruptly. x x location of minimum x x location of minimum Discontinuous MAP estimate for Blake and Zisserman potential. Noisy Signals 6 5 signal # 4 signal # - - 5 5 5 5 4 45 5 Unstable Reconstructions 6 5 signal # 4 signal # - - 5 5 5 5 4 45 5 Theorem:[4] - If the log of the posterior density is strictly convex, then the MAP estimate is a continuous function of the data.

EE64 Digital Image Processing II: Purdue University VISE - December 4, Convex Potential Functions Authors(Name) ρ( ) Ref. Potential func. Influence func. Besage Potential Function Besage Influence Function.5.5 Besag [].5.5.5.5.5.5.5.5.5 Green Potential Function Green Influence Function.5.5 Green log cosh [9].5.5.5.5.5.5.5.5.5 Stevenson_Delp Potential Function Stevenson_Delp Influence Function.5 Stevenson and Delp (Huber function) min {, } [7].5.5.5.5.5.5.5.5.5.5 Bouman_Sauer Potential Function Bouman_Sauer Influence Function.5 Bouman and Sauer (Generalized Gaussian MRF) p [4].5.5.5.5.5.5.5.5.5.5

EE64 Digital Image Processing II: Purdue University VISE - December 4, Properties of Convex Potential Functions Both log cosh( ) and Huber functions Quadratic for << Linear for >> Transition from quadratic to linear determines edge threshold. Generalized Gaussian MRF (GGMRF) functions Include function Do not require an edge threshold parameter. Convex and differentable for p >.

EE64 Digital Image Processing II: Purdue University VISE - December 4, Parameter Estimation for Continuous MRF s Topics to be covered: Estimation of scale parameter, σ Estimation of temperature, T, and shape, p

EE64 Digital Image Processing II: Purdue University VISE - December 4, ML Estimation of Scale Parameter, σ, for Continuous MRF s [5] For any continuous state Gibbs distribution p(x) = Z(σ) the partition function has the form exp { U(x/σ)} Z(σ) = σ N Z() Using this result the ML estimate of σ is given by σ N d dσ U(x/σ) σ=ˆσ = This equation can be solved numerically using any root finding method.

EE64 Digital Image Processing II: Purdue University VISE - December 4, 4 ML Estimation of σ for GGMRF s [, 5] For a Generalized Gaussian MRF (GGMRF) p(x) = σ N Z() exp pσ pu(x) where the energy function has the property that for all α > U(αx) = α p U(x) Then the ML estimate of σ is ˆσ = N U(x) (/p) Notice for that for the i.i.d. Gaussian case, this is ˆσ = N s x s

EE64 Digital Image Processing II: Purdue University VISE - December 4, 5 Estimation of Temperature, T, and Shape, p, Parameters ML estimation of T[8] Used to estimate T for any distribution. Based on off line computation of log partition function. Adaptive method [] Used to estimate p parameter of GGMRF. Based on measurement of kurtosis. ML estimation of p[6, 5] Used to estimate p parameter of GGMRF. Based on off line computation of log partition function.

EE64 Digital Image Processing II: Purdue University VISE - December 4, 6 Example Estimation of p Parameter 6. -. -.94 log-likelihood > 6.4 6.6 6.8 7 -log-likelihood ---> -. -.4 -.5 -.6 -.7 -log likelihood ---> -.96 -.98 -. -. -.4 7. -.8 -.6 7.4.8..4.6.8 p > (a) -.9.8..4.6.8 p ---> (b) -.8.8..4.6.8 p ---> (c) ML estimation of p for (a) transmission phantom (b) natural image (c) image corrupted with Gaussian noise. The plot below each image shows the corresponding negative loglikelihood as a function of p. The ML estimate is the value of p that minimizes the plotted function.

EE64 Digital Image Processing II: Purdue University VISE - December 4, 7 References [] J. Besag. Towards Bayesian image analysis. Journal of Applied Statistics, 6():95 47, 989. [] A. Blake. Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction. IEEE Trans. on Pattern Analysis and Machine Intelligence, ():, January 989. [] A. Blake and A. Zisserman. Visual Reconstruction. MIT Press, Cambridge, Massachusetts, 987. [4] C. A. Bouman and K. Sauer. A generalized Gaussian image model for edge-preserving MAP estimation. IEEE Trans. on Image Processing, ():96, July 99. [5] C. A. Bouman and K. Sauer. Maximum likelihood scale estimation for a class of Markov random fields. In Proc. of IEEE Int l Conf. on Acoust., Speech and Sig. Proc., volume 5, pages 57 54, Adelaide, South Australia, April 9-994. [6] D. Geman and G. Reynolds. Constrained restoration and the recovery of discontinuities. IEEE Trans. on Pattern Analysis and Machine Intelligence, 4():67 8, March 99. [7] S. Geman and D. McClure. Bayesian images analysis: An application to single photon emission tomography. In Proc. Statist. Comput. sect. Amer. Stat. Assoc., pages 8, Washington, DC, 985. [8] S. Geman and D. McClure. Statistical methods for tomographic image reconstruction. Bull. Int. Stat. Inst., LII-4:5, 987. [9] P. J. Green. Bayesian reconstruction from emission tomography data using a modified EM algorithm. IEEE Trans. on Medical Imaging, 9():84 9, March 99. [] T. Hebert and R. Leahy. A generalized EM algorithm for -D Bayesian reconstruction from Poisson data using Gibbs priors. IEEE Trans. on Medical Imaging, 8():94, June 989. [] P. Huber. Robust Statistics. John Wiley & Sons, New York, 98. [] K. Lange. An overview of Bayesian methods in image reconstruction. In Proc. of the SPIE Conference on Digital Image Synthesis and Inverse Optics, volume SPIE-5, pages 7 87, San Diego, CA, 99. [] W. Pun and B. Jeffs. Shape parameter estimation for generalized Gaussian Markov random field models used in MAP image restoration. In 9th Asilomar Conference on Signals, Systems, and Computers, October 9 - November 995. [4] W. Rey. Introduction to Robust and Quasi-Robust Statistical Methods. Springer-Verlag, Berlin, 98.

EE64 Digital Image Processing II: Purdue University VISE - December 4, 8 [5] S. S. Saquib, C. A. Bouman, and K. Sauer. ML parameter estimation for Markov random fields, with applications to Bayesian tomography. Technical Report TR-ECE 95-4, School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 4797, October 995. [6] S. S. Saquib, C. A. Bouman, and K. Sauer. Efficient ML estimation of the shape parameter for generalized Gaussian MRF. In Proc. of IEEE Int l Conf. on Acoust., Speech and Sig. Proc., volume 4, pages 9, Atlanta, GA, May 7-996. [7] R. Stevenson and E. Delp. Fitting curves with discontinuities. Proc. of the first international workshop on robust computer vision, pages 7 6, October - 99.