Efficient Schemes for Total Variation Minimization Under Constraints in Image Processing
DOI10.1137/070696143zbMath1191.94029OpenAlexW2048511268MaRDI QIDQ3567017
Laure Blanc-Féraud, Gilles Aubert, Pierre Weiss
Publication date: 10 June 2010
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070696143
complexitydualitytotal variation minimizationNesterov scheme\(l^1\)-norm minimization\(l^p\)-normsbounded and nonbounded noisesgradient and subgradient descentstexture+geometry decomposition
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (66)
This page was built for publication: Efficient Schemes for Total Variation Minimization Under Constraints in Image Processing