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.

A.3. DETAILS 141<br />

(a) Lenna <strong>image</strong><br />

(b) Filtered lenna <strong>image</strong><br />

(c) Edgelet trans. coeff.(best−5000/428032)<br />

100<br />

200<br />

300<br />

400<br />

100<br />

200<br />

300<br />

400<br />

10 4<br />

500<br />

100 200 300 400 500<br />

500<br />

100 200 300 400 500<br />

1000 3000 5000<br />

(d) Largest−1000 coeff.(log scale)<br />

(e) Largest−2000 coeff.<br />

(f) Largest−4000 coeff.<br />

100<br />

100<br />

100<br />

200<br />

200<br />

200<br />

300<br />

300<br />

300<br />

400<br />

400<br />

400<br />

500<br />

100 200 300 400 500<br />

500<br />

100 200 300 400 500<br />

500<br />

100 200 300 400 500<br />

Figure A.4: Edgelet transform of Lenna <strong>image</strong>: (a) is the original Lenna <strong>image</strong>; (b) is the<br />

filtered version; (c) is the sorted largest 5, 000 coefficients out of 428032. (d), (e) and (f)<br />

are the reconstructions based on the largest 1000, 2000 and 4000 coefficients, respectively.<br />

A.3.2<br />

Cardinality<br />

In this subsection, we discuss the size of edgelet coefficients.<br />

For fixed scale j (l ≤ j ≤ n), the number of dyadic squares is<br />

N/2 j × N/2 j =2 n−j × 2 n−j =2 2n−2j .<br />

In each 2 j × 2 j dyadic square, every side has 1 + 2 j−l vertices; hence the total number of<br />

edgelets is<br />

1<br />

{<br />

}<br />

4 · (2 · 2 j−l − 1) + 4 · (2 j−l − 1)(3 · 2 j−l − 1) =6· 2 j−l · 2 j−l − 4 · 2 j−l .<br />

2

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

Saved successfully!

Ooh no, something went wrong!