Hierarchized block wise image approximation by greedy pursuit strategies
Computer Vision and Pattern Recognition
2015-06-17 v1
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.
Cite
@article{arxiv.1308.5876,
title = {Hierarchized block wise image approximation by greedy pursuit strategies},
author = {Laura Rebollo-Neira and Ryszard Maciol and Shabnam Bibi},
journal= {arXiv preprint arXiv:1308.5876},
year = {2015}
}
Comments
4 pages. An example and the computing routines for implementing the approach are available on http://www.nonlinear-approx.info/examples/node0.html