sparse image representation via combined transforms - Convex ...
sparse image representation via combined transforms - Convex ...
sparse image representation via combined transforms - Convex ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
122 CHAPTER 6. SIMULATIONS<br />
fourth sub-<strong>image</strong> should be close to the original.<br />
We have some interesting observations:<br />
1. Overall, we observe the wavelet parts possess features resembling points (fine scale<br />
wavelets) and patches (coarse scale scaling functions), while the edgelet parts possess<br />
features resembling lines. This is most obvious in Car and least obvious in Pentagon.<br />
The reason could be that Pentagon does not contain many linear features. (Boundaries<br />
are not lines.)<br />
2. We observe some artifacts in the decompositions. For example, in the wavelet part of<br />
Car, we see a lot of fine scale features that are not similar to points, but are similar to<br />
line segments. This implies that they are made by many small wavelets. The reason<br />
for this is the intrinsic disadvantage of the edgelet-like transform that we have used.<br />
As in Figure B.3, the representers of our edgelet-like transform have a fixed width.<br />
This prevents it from efficiently representing narrow features. The same phenomena<br />
emerge in Overlap and Separate. A way to overcome it is to develop a transform<br />
whose representers have not only various locations, lengths and orientations, but also<br />
various widths. This will be an interesting topic of future research.<br />
6.4 Decay of Coefficients<br />
As we discussed in Chapter 2, one can measure sparsity of <strong>representation</strong> by studying the<br />
decay of the coefficient amplitudes. The faster the decay of coefficient amplitudes, the<br />
<strong>sparse</strong>r the <strong>representation</strong>.<br />
We compare our approach with two other approaches. One is an approach using merely<br />
the 2-D DCT; the other is an approach using merely the discrete 2-D wavelet transform.<br />
The reasons we choose to compare with these <strong>transforms</strong>:<br />
1. The 2-D DCT, especially the one localized to 8 × 8 blocks, has been applied in an<br />
important industry standard for <strong>image</strong> compression and transmission known as JPEG.<br />
2. The 2-D wavelet transform is a modern alternative to 2-D DCT. In some developing<br />
industry standards (e.g., draft standards for JPEG-2000), the 2-D wavelet transform<br />
has been adopted as an option. It has been proven to be more efficient than 2-D DCT<br />
in many cases.