Answers are grounded in this paper and cite their sources.
Cartoon-texture image decomposition is a critical preprocessing problem bottlenecked by the numerical intractability of classical variational or optimization models and the tedious manual tuning of global regularization parameters. We propose a Guided Variational Decomposition (GVD) model which introduces spatially adaptive quadratic norms whose pixelwise weights are learned either through local probabilistic statistics or via a lightweight neural network within a bilevel framework. This leads to a unified, interpretable, and computationally efficient model that bridges classical variational ideas with modern adaptive and data-driven methodologies. Numerical experiments on this framework, which inherently includes automatic parameter selection, delivers GVD as a robust, self-tuning, and superior solution for reliable image decomposition.
No takes yet. Share an insight, caveat, or question.
Lanza et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: