sparse image representation via combined transforms - Convex ...
sparse image representation via combined transforms - Convex ...
sparse image representation via combined transforms - Convex ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
6.5. COMPARISON WITH MATCHING PURSUIT 125<br />
approach ultimately falls well below the curve associated with the <strong>combined</strong> approach.<br />
(This seems to imply that the wavelet-only approach gives a <strong>sparse</strong>r asymptotic <strong>representation</strong>.)<br />
Particularly, it is important to remember that amplitudes are plotted on a logarithmic<br />
scale. A big drop at the beginning can not be shown significantly. The advantage<br />
of <strong>combined</strong> <strong>representation</strong> at very high levels of compression is difficult to discuss<br />
in this display. Note that the curve associated with the wavelet-only approach falls<br />
below the curve associated with the <strong>combined</strong> approach when the order index is large.<br />
If we study carefully the first few largest amplitudes, the curve associated with the<br />
<strong>combined</strong> approach goes down faster. This fact is evident for Overlap. Asweknow,in<br />
the compression or <strong>sparse</strong> <strong>representation</strong>, the decay of the first few biggest amplitudes<br />
is the most important factor, so we think our <strong>combined</strong> approach still gives better<br />
results, even for Pentagon and Overlap.<br />
2. The DCT only approach always gives the least <strong>sparse</strong> coefficients. As we have mentioned,<br />
the DCT is good for <strong>image</strong>s with homogeneous components. Unfortunately,<br />
in our examples, none of them seems to have a high proportion of homogeneous components.<br />
This may explain why here DCT is far from optimal.<br />
3. For more “realistic” <strong>image</strong>s, as in the case of Car, the wavelet-only approach works<br />
only as well as the DCT-only approach, but our <strong>combined</strong> approach is significantly<br />
better. This may imply that our approach is better-suited for natural <strong>image</strong>s than<br />
existing methods. Of course more careful study and extensive experiments are required<br />
to verify this statement.<br />
6.5 Comparison with Matching Pursuit<br />
Our approach is a global approach, in the sense that we minimize a global objective function.<br />
Our method is computationally expensive. A potentially cheaper method is Matching<br />
Pursuit (MP) [102]. MP is a greedy algorithm. In a Hilbert space, MP at every step picks<br />
up the atom that is the most correlated with the residual at that step. But MP runs the<br />
danger of being trapped by unfortunate choices at early steps into badly suboptimal decompositions<br />
[27, 40, 25]. We examine the decay of the amplitudes of coefficients for both<br />
MP and our approach.