Hierarchized block wise image approximation by greedy pursuit strategies

Abstract

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.

4 pages. An example and the computing routines for implementing the approach are available on http://www.nonlinear-approx.info/examples/node0.html

References in corpus (2)

• Sparse Representation of Astronomical Images
• Self Contained Encrypted Image Folding

Cited by in corpus (4)

• Cooperative Greedy Pursuit Strategies for Sparse Signal Representation by Partitioning
• Trigonometric dictionary based codec for music compression with high quality recovery
• Effective sparse representation of X-Ray medical images
• Sparse Representation of 3D Images for Piecewise Dimensionality Reduction with High Quality Reconstruction