Skip to content
AI News HubLIVE
Original source2 min read

A Cone-Constrained Bilinear Decomposition for Total Scaled-Gradient Variation Models

Summary

The paper addresses the computational challenges of the highly nonconvex total scaled-gradient variation (TSGV) regularizer by proposing a bilinear decomposition that reformulates the problem as an equivalent optimization with cone or sphere constraints. It solves the reformulation via alternating minimization with majorization-minimization, proves global convergence to a critical point under the Kurdyka-Łojasiewicz framework, and demonstrates competitive or superior PSNR/SSIM on Gaussian denoising and NLOS imaging, especially at high noise levels.

SourcearXiv Computer VisionAuthor: Haibin Su, Chunlin Wu, Huibin Chang, Zhifang Liu
A Cone-Constrained Bilinear Decomposition for Total Scaled-Gradient Variation Models
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 29 Aug 2026]

Title:A Cone-Constrained Bilinear Decomposition for Total Scaled-Gradient Variation Models

View a PDF of the paper titled A Cone-Constrained Bilinear Decomposition for Total Scaled-Gradient Variation Models, by Haibin Su and 3 other authors

View PDF HTML (experimental)

Abstract: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.

Subjects:

Computer Vision and Pattern Recognition (cs.CV)

Cite as: arXiv:2609.00036 [cs.CV]

(or arXiv:2609.00036v1 [cs.CV] for this version)

https://doi.org/10.48550/arXiv.2609.00036

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Haibin Su [view email] [v1] Sat, 29 Aug 2026 08:13:34 UTC (9,235 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled A Cone-Constrained Bilinear Decomposition for Total Scaled-Gradient Variation Models, by Haibin Su and 3 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.CV

new | recent | 2026-09

Change to browse by:

cs

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

ResearchersAdvanced

Key points

  • Introduces a tailored bilinear decomposition that decouples the nonlinear weighted gradient in TSGV into cone or sphere constraints.
  • Solves the constrained problem with alternating minimization plus majorization-minimization, ensuring monotonic energy decrease without step-size tuning.
  • Establishes global convergence to a critical point under the Kurdyka-Łojasiewicz framework and gives a geometric interpretation of edge preservation.
  • Experiments on Gaussian denoising and NLOS imaging show competitive or better PSNR/SSIM, particularly at high noise, and improved structural reconstruction.

Highlights and analysis are generated automatically and may contain errors. Check the original source.