Towards minimal assumptions for the infimal convolution regularization
نویسندگان
چکیده
منابع مشابه
Multiframe Motion Coupling via Infimal Convolution Regularization for Video Super Resolution
The idea of video super resolution is to use the temporal information of seeing a scene from many slightly different viewpoints in the successive frames of a video to enhance the overall resolution and quality of each frame. Classical energy minimization approaches first establish a correspondence of the current video frame to several of its neighbors and then use this temporal information to e...
متن کاملInfimal Convolution of Data Discrepancies for Mixed Noise Removal
We consider the problem of image denoising in the presence of noise whose statistical properties are a combination of two different distributions. We focus on noise distributions that are frequently considered in applications, in particular mixtures of salt & pepper and Gaussian noise, and Gaussian and Poisson noise. We derive a variational image denoising model that features a total variation ...
متن کاملInfimal convolution of total generalized variation functionals for dynamic MRI.
PURPOSE To accelerate dynamic MR applications using infimal convolution of total generalized variation functionals (ICTGV) as spatio-temporal regularization for image reconstruction. THEORY AND METHODS ICTGV comprises a new image prior tailored to dynamic data that achieves regularization via optimal local balancing between spatial and temporal regularity. Here it is applied for the first tim...
متن کاملInfimal Convolution Regularizations with Discrete l1-type Functionals
As first demonstrated by Chambolle and Lions the staircasing effect of the RudinOsher-Fatemi model can be reduced by using infimal convolutions of functionals containing higher order derivatives. In this paper, we examine a modification of such infimal convolutions in a general discrete setting. For the special case of finite difference matrices, we show the relation of our approach to the cont...
متن کاملA quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions
In this paper we present an algorithm of quasi-linear complexity for exactly calculating the infimal convolution of convex quadratic functions. The algorithm exactly and simultaneously solves a separable uniparametric family of quadratic programming problems resulting from varying the equality constraint.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1991
ISSN: 0021-9045
DOI: 10.1016/0021-9045(91)90062-f