10.03.2015 Views

sparse image representation via combined transforms - Convex ...

sparse image representation via combined transforms - Convex ...

sparse image representation via combined transforms - Convex ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

3.1. DCT AND HOMOGENEOUS COMPONENTS 47<br />

Theorem 3.4 (Hammersley-Clifford Theorem) Every Markov random field on a domain<br />

D is a Gibbs random field on D and vice versa.<br />

The rigorous statement and the actual proof is too long to be presented here, readers<br />

are referred to [12, 129] for technical details.<br />

Definition of a Gaussian Markov random field. In (3.13), if the p.d.f. p(ω) isalsothe<br />

p.d.f. of a multivariate Normal distribution, then there are two consequences: first, from<br />

the Hammersley-Clifford Theorem, it is a Markov random field; second, the random field is<br />

also Gaussian. We call such a random field a Gaussian Markov random field (GMRF). Let<br />

⃗ω denote a vector corresponding to a realization ω. (The vector ⃗ω is simply a list of all the<br />

values taken by ω.) We further suppose the vector ⃗ω is a column vector. Let Σ denote the<br />

covariance matrix of the corresponding multivariate Normal distribution. We have<br />

(<br />

p(ω) =(2π) − 1 2 dim(D) 1<br />

det 1/2 (Σ) exp − 1 )<br />

2 ⃗ωT Σ −1 ⃗ω .<br />

This is a p.d.f. of a GMRF.<br />

A Gaussian Markov random field is a way to model homogeneous <strong>image</strong>s. In the <strong>image</strong><br />

case, the dimensionality of the domain is 2 (d = 2). The gray scale at each integer point in<br />

Z 2 is a continuous value. The fact that an <strong>image</strong> is homogeneous and only has the second<br />

order correlation, is equivalent to the fact that the <strong>image</strong> is a GMRF.<br />

For a GMRF, if there is a transform that diagonalizes the covariance matrix Σ, then this<br />

transform is the KLT of the GMRF. Since we are discussing the connection between DCT<br />

and the homogeneous signal, the interesting question to ask is “Which kind of covariance<br />

matrices does the DCT diagonalize?”. We answer in the next subsubsection.<br />

There have been some efforts to extend the GMRF model; for example, the work by<br />

Zhu, Wu and Mumford [145].<br />

Covariance Matrix Diagonalization<br />

In this subsubsection, we answer the question raised in the previous subsubsection. We<br />

answer it in a converse manner. Instead of giving the conditions of the covariance matrices<br />

and then discussing the diagonalizability of matrices associated with this type of DCT, we<br />

try to find out which group of matrices can be diagonalized by which type of DCT.<br />

The following Theorem is a general result. A reason we list it here is that we have not<br />

seen it documented explicitly in any other references.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!