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.

32 CHAPTER 3. IMAGE TRANSFORMS AND IMAGE FEATURES<br />

the set of eigenvalues of this system. Note: when the signal is infinitely long and the<br />

impulse response is relatively short, we can drop the cyclic constraint. Since an LTI<br />

system is a widely assumed model in signal processing, the Fourier transform plays<br />

an important role in analyzing this type of system.<br />

2. A covariance matrix of a stationary Gaussian (i.e., Normal) time series is Toeplitz<br />

and symmetric. If we can assume that the time series does not have long-range dependency<br />

2 , which implies that off-diagonal elements diminish when they are far from<br />

the diagonal, then the covariance matrix is almost circulant. Hence, the Fourier series<br />

again become the eigenvectors of this matrix. The DFT matrix DFT N nearly diagonalizes<br />

the covariance matrix, which implies that after the discrete Fourier transform<br />

of the time series, the coefficients are almost independently distributed. This idea can<br />

be depicted as<br />

DFT N ·{the covariance matrix}·DFT T N ≈{a diagonal matrix}.<br />

Generally speaking, it is easier to process independent coefficients than a correlated<br />

time series. The eigenvalue amplitudes determine the variance of the associated coefficients.<br />

Usually, the eigenvalue amplitudes decay fast: say, exponentially. The<br />

coefficients corresponding to the eigenvalues having large amplitudes are important<br />

coefficients in analysis. The remaining coefficients could almost be considered constant.<br />

Some research in this direction can be found in [58], [59] and [101].<br />

From the above two examples, we see that FT plays an important role in both DSP and<br />

time series analysis.<br />

Fast Fourier Transform<br />

To illustrate the importance of the fast Fourier transform in contemporary computational<br />

science, we find that the following sentences (the first paragraph of the Preface in [136]) say<br />

exactly what we would like to say.<br />

The fast Fourier transform (FFT) is one of the truly great computational developments<br />

of this century. It has changed the face of science and engineering so<br />

2 No long-range dependency means that if two locations are far away in the series, then the corresponding<br />

two random variables are nearly independent.

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

Saved successfully!

Ooh no, something went wrong!