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.

150 APPENDIX B. FAST EDGELET-LIKE TRANSFORM<br />

published work came to light only in the final stages of editing this thesis. The first Matlab<br />

version of the algorithm being presented was coded by David Donoho. The author made<br />

several modifications to the algorithm, and also some analysis is presented at the end of<br />

this chapter.<br />

The rest of the chapter is organized as following: In Section B.1, we introduce the<br />

Fourier slice Theorem and the continuous Radon transform. Note both are for continuous<br />

functions. Section B.2 describes in detail the main algorithm—an algorithm for fast edgeletlike<br />

transform. The tools necessary to derive the adjoint of this transform are presented<br />

in Section B.3. Some discussion about miscellaneous properties of the fast edgelet-like<br />

transform are in Section B.4, including storage, computational complexity, effective region,<br />

and ill-conditioning. Finally, we present some examples in Section B.5.<br />

B.1 Transforms for 2-D Continuous Functions<br />

B.1.1<br />

Fourier Slice Theorem<br />

The Fourier slice theorem is the key for us to utilize the fast Fourier transform to implement<br />

the fast Radon transform. The basic idea is that for a 2-D continuous function, if we do a<br />

2-D Fourier transform of it, then sampling along a straight line traversing the origin, the<br />

result is the same as the result of projecting the original function onto the same straight<br />

line then taking 1-D Fourier transform.<br />

We will just sketch the idea of a proof. Suppose f(x, y) is a continuous function in 2-D,<br />

where (x, y) ∈ R 2 . We use f to denote the continuous interpolation of the <strong>image</strong> I, andf<br />

to denote a general 2-D function. Let ˆf(ξ,η) denote its 2-D Fourier transform. Then we<br />

have<br />

∫<br />

ˆf(ξ,η) =<br />

y<br />

∫<br />

x<br />

f(x, y)e −2π√ −1xξ e −2π√ −1yη dxdy.<br />

Taking polar coordinates in both the original domain and the Fourier domain, we have<br />

(B.1)<br />

ξ = ρ cos θ, η = ρ sin θ, x = ρ ′ cos θ ′ , y = ρ ′ sin θ ′ .<br />

Let<br />

(s) ˆf<br />

θ<br />

(ρ) stand for the sampling of the function ˆf along the line {(ρ cos θ, ρ sin θ) :ρ ∈

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

Saved successfully!

Ooh no, something went wrong!