Metraipolis › archive › dc_8a8d6311b7ec

A Globally Convergent Algorithm for Total Scaled-Gradient Variation via Cone-Constrained Bilinear Decomposition — arXiv:2609.00036

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.00036
License (as archived)
CC0-1.0
Archived
2026-10-17T07:10:21.456Z
SHA-256 of the archived text
1e510d8682c9f553a95d6f9b923495281ac59eb3a1760fb07821797b33b03951
Stable URL of this page
https://metraipolis.com/documento/dc_8a8d6311b7ec

How to cite

A Globally Convergent Algorithm for Total Scaled-Gradient Variation via Cone-Constrained Bilinear Decomposition — arXiv:2609.00036 — arXiv (en), https://arxiv.org/abs/2609.00036 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8a8d6311b7ec (Metraipolis archive dc_8a8d6311b7ec, sha256 1e510d8682c9f553a95d6f9b923495281ac59eb3a1760fb07821797b33b03951)
BibTeX
@misc{dc8a8d6311b7ec,
  title = {A Globally Convergent Algorithm for Total Scaled-Gradient Variation via Cone-Constrained Bilinear Decomposition — arXiv:2609.00036},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.00036},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8a8d6311b7ec; sha256 1e510d8682c9f553a95d6f9b923495281ac59eb3a1760fb07821797b33b03951},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.00036. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The total scaled-gradient variation (TSGV) regularizer, derived from sparse modeling of piecewise-linear structures, has been shown to preserve edges and corners in image restoration. However, its highly nonconvex and nonlinear nature poses severe computational challenges, as existing methods often suffer from parameter sensitivity or lack convergence guarantees. To overcome this, we propose a tailored bilinear decomposition that decouples the nonlinear weighted gradient in the TSGV regularizer. This approach yields an equivalent optimization problem governed by cone or sphere constraints, depending on the chosen scaling function. In particular, the cone constraint plays a central role in characterizing edge- and corner-preserving behavior. We solve this reformulation using the alternating minimization method (AMM) equipped with a majorization--minimization strategy, ensuring a monotonic decrease in energy without step-size tuning. Furthermore, we provide a geometric interpretation of the edge-preserving properties of these constraints by analyzing their asymptotic behavior near image singularities. We establish the global convergence of the proposed method to a critical point within the Kurdyka--Łojasiewicz framework. Extensive numerical experiments on Gaussian denoising and non-line-of-sight (NLOS) imaging show that the proposed method achieves PSNR and SSIM competitive with or superior to representative variational methods, especially at high noise levels, and improves the structural reconstruction under dense and sparse scanning.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-02 in cs.CV).
Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV).
Pagina del lavoro: https://arxiv.org/abs/2609.00036 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T07:00:58.888Z dalla pagina https://arxiv.org/catchup/cs.CV/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).