HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A Fast Algorithm Based on a Sylvester-like Equation for LS Regression with GMRF Prior

Abstract : This paper presents a fast approach for penalized least squares (LS) regression problems using a 2D Gaussian Markov random field (GMRF) prior. More precisely, the computation of the proximity operator of the LS criterion regularized by different GMRF potentials is formulated as solving a Sylvester-like matrix equation. By exploiting the structural properties of GMRFs, this matrix equation is solved column-wise in an analytical way. The proposed algorithm can be embedded into a wide range of proximal algorithms to solve LS regression problems including a convex penalty. Experiments carried out in the case of a constrained LS regression problem arising in a multichannel image processing application, provide evidence that an alternating direction method of multipliers performs quite efficiently in this context.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

Contributor : Emilie Chouzenoux Connect in order to contact the contributor
Submitted on : Wednesday, November 15, 2017 - 1:57:19 PM
Last modification on : Thursday, January 20, 2022 - 5:29:47 PM
Long-term archiving on: : Friday, February 16, 2018 - 2:32:36 PM


Files produced by the author(s)


  • HAL Id : hal-01635601, version 1


Qi Wei, Emilie Chouzenoux, Jean-Yves Tourneret, Jean-Christophe Pesquet. A Fast Algorithm Based on a Sylvester-like Equation for LS Regression with GMRF Prior. CAMSAP 2017- IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, Dec 2017, Curaçao, Netherlands Antilles. ⟨hal-01635601⟩



Record views


Files downloads