A non-convex regularization approach for compressive sensing

Buccini A.;Donatelli M.;
2019-01-01

Abstract

Compressive sensing (CS) aims at reconstructing high dimensional data from a small number of samples or measurements. In this paper, we propose the minimization of a non-convex functional for the solution of the CS problem. The considered functional incorporates information on the self-similarity of the image by measuring the rank of some appropriately constructed matrices of fairly small dimensions. However, since the rank minimization is a NP hard problem, we consider, as a surrogate function for the rank, a non-convex, but smooth function. We provide a theoretical analysis of the proposed functional and develop an iterative algorithm to compute one of its stationary points. We prove the convergence of such algorithm and show, with some selected numerical experiments, that the proposed approach achieves good performances, even when compared with the state of the art.
2019
2018
Inglese
45
2
563
588
26
Esperti anonimi
scientifica
Compressive sensing; Non-convex low-rank regularization; Smoothed rank function
Fan, Y. -R.; Buccini, A.; Donatelli, M.; Huang, T. -Z.
1.1 Articolo in rivista
info:eu-repo/semantics/article
1 Contributo su Rivista::1.1 Articolo in rivista
262
4
open
Files in This Item:
File Size Format  
A_non-convex_regularization_approach_for_cs.pdf

open access

Type: versione pre-print
Size 1.85 MB
Format Adobe PDF
1.85 MB Adobe PDF View/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Questionnaire and social

Share on:
Impostazioni cookie