Fast Signal Recovery from Saturated Measurements by Linear Loss and Nonconvex Penalties

He, Fan, Huang, Xiaolin, Liu, Yipeng, Yan, Ming

arXiv.org Machine Learning 

Sign information is the key to overcoming the inevitable saturation error in compressive sensing systems, which causes information loss and results in bias. For sparse signal recovery from saturation, we propose to use a linear loss to improve the effectiveness from existing methods that utilize hard constraints/hinge loss for sign consistency. Due to the use of linear loss, an analytical solution in the update progress is obtained, and some nonconvex penalties are applicable, e.g., the minimax concave penalty, the l Theoretical analysis reveals that the estimation error can still be bounded. Generally, with linear loss and nonconvex penalties, the recovery performance is significantly improved, and the computational time is largely saved, which is verified by the numerical experiments. When there are saturated measurements, the observation is nonlinear, and the performance of algorithms using linear observations degrades.

Duplicate Docs Excel Report

Title
None found

Similar Docs  Excel Report  more

TitleSimilaritySource
None found