scholarly journals Blind calibration for compressed sensing by convex optimization

Author(s):  
R. Gribonval ◽  
G. Chardon ◽  
L. Daudet
2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Weijian Si ◽  
Xinggen Qu ◽  
Yilin Jiang ◽  
Tao Chen

A novel direction of arrival (DOA) estimation method in compressed sensing (CS) is proposed, in which the DOA estimation problem is cast as the joint sparse reconstruction from multiple measurement vectors (MMV). The proposed method is derived through transforming quadratically constrained linear programming (QCLP) into unconstrained convex optimization which overcomes the drawback thatl1-norm is nondifferentiable when sparse sources are reconstructed by minimizingl1-norm. The convergence rate and estimation performance of the proposed method can be significantly improved, since the steepest descent step and Barzilai-Borwein step are alternately used as the search step in the unconstrained convex optimization. The proposed method can obtain satisfactory performance especially in these scenarios with low signal to noise ratio (SNR), small number of snapshots, or coherent sources. Simulation results show the superior performance of the proposed method as compared with existing methods.


2020 ◽  
Vol 53 (33) ◽  
pp. 334004
Author(s):  
Marylou Gabrié ◽  
Jean Barbier ◽  
Florent Krzakala ◽  
Lenka Zdeborová

2019 ◽  
Vol 48 (2) ◽  
pp. 357-365
Author(s):  
Peng-bo Zhou ◽  
Wei Wei ◽  
Marcin Wozniak ◽  
Zhuo-ming Du ◽  
Hong-an Li

It is challenging to recover the required compressed CT (Computed Tomography, CT) image, which is got by transferred through the internet or is stored in a signal library after being compressed. We present a recovery method for compressed sensing CT images. At present, minimizing 0-norm, 1-norm and p-norm is used to recover compressed sensing signals. However, sometimes 0-norm is an NP problem, 1-norm has no solution in theory and p-norm is not a convex function. We introduce a recovery method of compressed sensing signal based on regularized smooth convex optimization. In order to avoid solving the non-convex optimization problems and no solution condition, a convex function is designed as the objective function of optimization to fit 0-norm of signal and a fast iterative shrinkage-thresholding algorithm is proposed to find solution with the convergence speed is quadratic convergence. Experimental results show that our method has a sound recovery effect and is well suitable for processing big data of compressed CT images.


2020 ◽  
pp. 147592172095064
Author(s):  
Hedong Li ◽  
Demi Ai ◽  
Hongping Zhu ◽  
Hui Luo

Considerable amount of electromechanical admittance data needs to be collected, transmitted and stored during in-situ and long-term structural health monitoring applications, and data loss could be inevitably met when processing the monitoring electromechanical admittance signals. In this article, an innovative compressed sensing–based approach is proposed to implement data recovery for electromechanical admittance technique–based concrete structural health monitoring. The basis of this approach is to first project the original conductance signature onto an observation vector as sampled data, and then transmit the observation vector with data loss to storage station, and finally recover the missing data via a compressed sensing process. For comparison, both convex optimization theory and orthogonal matching pursuit algorithm are introduced to accomplish the compressed sensing–based electromechanical admittance data loss recovery. Prior detection test of a concrete cube subjected to varied temperatures and practical monitoring experiment of full-scale concrete shield tunnel segment undergone bolt-loosened defects are utilized to validate the feasibility of the proposed approach. In lost electromechanical admittance data recovery process, two types of data loss, namely, single-consecutive-segment loss and multiple-consecutive-segment losses, in sampled data are taken into consideration for sufficiently interpreting the effectiveness and accuracy of the convex optimization and orthogonal matching pursuit approaches. In the temperature recognition and damage identification stage, amplitude and frequency shifts in resonance peaks, cooperated with a common statistical index called root-mean-squared-deviation, are harnessed to achieve the goal after the lossy conductance signatures are recovered. The results show that the orthogonal matching pursuit–based data recovery approach is superior to the convex optimization approach because of its smaller calculation of consumption as well as lower recovered errors.


Sign in / Sign up

Export Citation Format

Share Document