Abstract
Sparse representation of astronomical images is discussed. It is shown that a significant gain in sparsity is achieved when particular mixed dictionaries are used for approximating these types of images with greedy selection strategies. Experiments are conducted to confirm (i) the effectiveness at producing sparse representations and (ii) competitiveness, with respect to the time required to process large images. The latter is a consequence of the suitability of the proposed dictionaries for approximating images in partitions of small blocks. This feature makes it possible to apply the effective greedy selection technique called orthogonal matching pursuit, up to some block size. For blocks exceeding that size, a refinement of the original matching pursuit approach is considered. The resulting method is termed "self-projected matching pursuit," because it is shown to be effective for implementing, via matching pursuit itself, the optional backprojection intermediate steps in that approach.
| Original language | English |
|---|---|
| Pages (from-to) | 758-768 |
| Number of pages | 11 |
| Journal | Journal of the Optical Society of America A |
| Volume | 30 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Apr 2013 |
Bibliographical note
© 2013 Optical Society of AmericaThis paper was published in Journal of the Optical Society of America A and is made available as an electronic reprint with the permission of OSA. The paper can be found at the following URL on the OSA website: http://www.opticsinfobase.org/josaa/abstract.cfm?URI=josaa-30-4-758. Systematic or multiple reproduction or distribution to multiple locations via electronic or other means is prohibited and is subject to penalties under law.
Funding: EPSRC (EP/D062632/1).
Software for implementing the approach is available on http://www.nonlinear-approx.info/examples/node1.html