An approach for effective implementation of greedy selection methodologies, to approximate an image partitioned into blocks, is proposed. The method is specially designed for approximating partitions on a transformed image. It evolves by selecting, at each iteration step, i) the elements for approximating each of the blocks partitioning the image and ii) the hierarchized sequence in which the blocks are approximated to reach the required global condition on sparsity.
Bibliographical note© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Software for implementing the approach is available on http://www.nonlinear-approx.info/examples/node0.html
- high quality sparse image approximation with separable dictionaries
- orthogonal matching pursuit for sparse representation of partitions in the wavelet domain
Rebollo-Neira, L., MacIoł, R., & Bibi, S. (2013). Hierarchized block wise image approximation by greedy pursuit strategies. IEEE Signal Processing Letters, 20(12), 1175-1178. https://doi.org/10.1109/LSP.2013.2283510