English

Sparsity Based Methods for Overparameterized Variational Problems

Computer Vision and Pattern Recognition 2015-08-17 v5 Machine Learning

Abstract

Two complementary approaches have been extensively used in signal and image processing leading to novel results, the sparse representation methodology and the variational strategy. Recently, a new sparsity based model has been proposed, the cosparse analysis framework, which may potentially help in bridging sparse approximation based methods to the traditional total-variation minimization. Based on this, we introduce a sparsity based framework for solving overparameterized variational problems. The latter has been used to improve the estimation of optical flow and also for general denoising of signals and images. However, the recovery of the space varying parameters involved was not adequately addressed by traditional variational methods. We first demonstrate the efficiency of the new framework for one dimensional signals in recovering a piecewise linear and polynomial function. Then, we illustrate how the new technique can be used for denoising and segmentation of images.

Keywords

Cite

@article{arxiv.1405.4969,
  title  = {Sparsity Based Methods for Overparameterized Variational Problems},
  author = {Raja Giryes and Michael Elad and Alfred M. Bruckstein},
  journal= {arXiv preprint arXiv:1405.4969},
  year   = {2015}
}

Comments

16 pages, 11 figures

R2 v1 2026-06-22T04:18:37.122Z