A direct algorithm for 1-D total variation denoising
L Condat - IEEE Signal Processing Letters, 2013 - ieeexplore.ieee.org
A very fast noniterative algorithm is proposed for denoising or smoothing one-dimensional
discrete signals, by solving the total variation regularized least-squares problem or the …
discrete signals, by solving the total variation regularized least-squares problem or the …
Simultaneous low-pass filtering and total variation denoising
IW Selesnick, HL Graber, DS Pfeil… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
This paper seeks to combine linear time-invariant (LTI) filtering and sparsity-based
denoising in a principled way in order to effectively filter (denoise) a wider class of signals …
denoising in a principled way in order to effectively filter (denoise) a wider class of signals …
Modular proximal optimization for multidimensional total-variation regularization
We study TV regularization, a widely used technique for eliciting structured sparsity. In
particular, we propose efficient algorithms for computing prox-operators for lp-norm TV. The …
particular, we propose efficient algorithms for computing prox-operators for lp-norm TV. The …
Geometric properties of solutions to the total variation denoising problem
This article studies the denoising performance of total variation (TV) image regularization.
More precisely, we study geometrical properties of the solution to the so-called Rudin-Osher …
More precisely, we study geometrical properties of the solution to the so-called Rudin-Osher …
Posterior expectation of the total variation model: Properties and experiments
The total variation image (or signal) denoising model is a variational approach that can be
interpreted, in a Bayesian framework, as a search for the maximum point of the posterior …
interpreted, in a Bayesian framework, as a search for the maximum point of the posterior …
An algorithmic framework for Mumford–Shah regularization of inverse problems in imaging
Abstract The Mumford–Shah model is a very powerful variational approach for edge
preserving regularization of image reconstruction processes. However, it is algorithmically …
preserving regularization of image reconstruction processes. However, it is algorithmically …
Total variation on a tree
We consider the problem of minimizing the continuous valued total variation subject to
different unary terms on trees and propose fast direct algorithms based on dynamic …
different unary terms on trees and propose fast direct algorithms based on dynamic …
[HTML][HTML] Analytical aspects of spatially adapted total variation regularisation
In this paper we study the structure of solutions of the one dimensional weighted total
variation regularisation problem, motivated by its application in signal recovery tasks. We …
variation regularisation problem, motivated by its application in signal recovery tasks. We …
Statistical multiresolution Dantzig estimation in imaging: Fundamental concepts and algorithmic framework
K Frick, P Marnitz, A Munk - 2012 - projecteuclid.org
In this paper we are concerned with fully automatic and locally adaptive estimation of
functions in a “signal+ noise”-model where the regression function may additionally be …
functions in a “signal+ noise”-model where the regression function may additionally be …
Experiments and algorithms to detect snow avalanche victims using airborne ground-penetrating radar
F Fruehauf, A Heilig, M Schneebeli… - … on Geoscience and …, 2009 - ieeexplore.ieee.org
Snow avalanche victims have only a good chance to survive when they are located within a
short time. This requires an active beacon for them to wear or a very rapid deployment of a …
short time. This requires an active beacon for them to wear or a very rapid deployment of a …