A Coordinate Descent Approach to Atomic Norm Denoising
원문 초록
Atomic norm minimization is of great interest in various applications of sparse signal processing including super-resolution line-spectral estimation and signal denoising. In practice, atomic norm minimization (ANM) is formulated as semi-definite programming (SDP) that is generally hard to solve. This work introduces a low-complexity solver for a type of ANM known as atomic norm soft thresholding (AST). The proposed method uses the framework of coordinate descent and exploits the sparsity-inducing nature of atomic-norm regularization. Specifically, this work first provides an equivalent, non-convex formulation of AST. It is then proved that applying a coordinate descent algorithm on the non-convex formulation leads to convergence to the global solution. For the case of a single measurement vector of length N and complex exponential basis, the complexity of each step in the coordinate descent procedure is O(N log N ), rendering the method efficient for large-scale problems. Through simulations, the proposed solver is shown to be faster than alternating direction method of multiplier (ADMM) or customized interior point SDP solver if the problems are sparse. It is demonstrated that the coordinate descent solver can be modified for AST with multiple dimensions and multiple measurement vectors as well as a variety of general basis.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
EAMamba: Efficient All-Around Vision State Space Model for Image Restoration
Plug-and-Play Linear Attention for Pre-trained Image and Video Restoration Models
Grids Often Outperform Implicit Neural Representations
Exploring Diffusion with Test-Time Training on Efficient Image Restoration
Exploiting the Exact Denoising Posterior Score in Training-Free Guidance of Diffusion Models
Multi-Step Guided Diffusion for Image Restoration on Edge Devices: Toward Lightweight Perception in Embodied AI
토론
이 논문과 연결된 포럼 글이 아직 없습니다.