Abstract
The last decade has witnessed rapidly growing interest in the studies of compressed sensing. \(\ell _{p}\) norm, an approximation to \(\ell _{0}\) norm, can be used to recover a sparse signal from underdetermined linear systems. In comparison with \(\ell _{p}\) norm, another approximation called Laplace norm is a closer approximation to \(\ell _{0}\) norm. The thresholding algorithm is a simple and efficient iterative process to solve the regularization problem. In this paper, we derive the thresholding point and a quasi-analytic thresholding representation for the Laplace regularization, and then a thresholding algorithm for the Laplace regularization is proposed. The numerical results show that the proposed algorithm has higher recovery rate than the \(\ell _{p}\) thresholding algorithms. This thresholding representation can be easily incorporated into the iterative thresholding framework to provide a tool for sparsity problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Candès, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489–509 (2006)
Candès, E.J., Romberg, J.K.: Practical signal recovery from random projections. In: Proceedings of SPIE—The International Society for Optical Engineering, p. 5674 (2004)
Candès, E.J., Tao, T.: Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inf. Theory 52(12), 5406–5425 (2007)
Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289–1306 (2006)
Abolghasemi, V., Ferdowsi, S., Sanei, S.: Fast and incoherent dictionary learning algorithms with application to fMRI. Signal Image Video Process. 9(1), 147–158 (2015)
Lustig, M., Donoho, D., Pauly, J.M.: Sparse MRI: the application of compressed sensing for rapid mr imaging. Magn. Reson. Med. 58(6), 1182–1195 (2007)
Liu, J., Xu, S., Gao, X., Li, X.: Compressive radar imaging methods based on fast smoothed \(\ell _{0}\) algorithm. Procedia Eng. 29(4), 2209–2213 (2012)
Duarte, M.F., Davenport, M.A., Takhar, D., Laska, J.N., Sun, T., Kelly, K.F., Baraniuk, R.G.: Single-pixel imaging via compressive sampling. IEEE Signal Process. Mag. 25(2), 83–91 (2008)
Du, H., Zhang, X., Hu, Q., Hou, Y.: Sparse representation-based robust face recognition by graph regularized low-rank sparse representation recovery. Neurocomputing 164, 220–229 (2015)
Mao, Q., Zhou, B., Zou, Q., Li, Q.: Efficient and lossless compression of raster maps. Signal Image Video Process. 9(1), 133–145 (2015)
Wang, Q., Qu, G.: Extended omp algorithm for sparse phase retrieval. Signal Image Video Process. 11(8), 1397–1403 (2017)
Ahmed, A.A.: An optimal complexity H. 264/AVC encoding for video streaming over next generation of wireless multimedia sensor networks. Signal Image Video Process. 10(6), 1143–1150 (2016)
Haupt, J., Bajwa, W.U., Rabbat, M., Nowak, R.: Compressed sensing for networked data. IEEE Signal Process. Mag. 25(2), 92–101 (2008)
Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227–234 (1995)
Zou, H.: The adaptive lasso and its oracle properties. J. Am. Stat. Assoc. 101(476), 1418–1429 (2006)
Chartrand, R., Staneva, V.: Restricted isometry properties and nonconvex compressive sensing. Inverse Probl. 24(3), 657–682 (2008)
Xu, Z., Zhang, H., Wang, Y.: \({L}_{1/2}\) regularization. Sci. China 53(6), 1159–1169 (2010)
He, R., Yuan, X., Zheng, W.S.: A fast convex conjugated algorithm for sparse recovery. Neurocomputing 115, 178–185 (2013)
Huang, X., Liu, Y., Shi, L., Huffel, S.V., Suykens, J.: Two-level \(\ell _{1}\) minimization for compressed sensing. Signal Process. 108, 459–475 (2015)
Yang, Z.Z., Yang, Z.: Fast linearized alternating direction method of multipliers for the augmented \(\ell _{1}\)-regularized problem. Signal Image Video Process. 9(7), 1601–1612 (2015)
Blumensath, T., Davies, M.E.: Iterative thresholding for sparse approximations. J. Fourier Anal. Appl. 14(5), 629–654 (2008)
Daubechies, I., Defrise, M., Mol, C.D.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57(11), 1413–1457 (2004)
Xu, Z., Chang, X., Xu, F., Zhang, H.: \({L}_{1/2}\) regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23(7), 1013–1027 (2012)
Yu, H., Miao, C.: General thresholding representation for the \({L}_{p}\) regularization problem. In: Biomedical Imaging (ISBI), 2014 IEEE 11th International Symposium on IEEE (2014)
Wang, Y., Liu, P., Li, Z., Sun, T., Yang, C., Zheng, Q.: Data regularization using Gaussian beams decomposition and sparse norms. J. Inverse Ill-Posed Probl. 21(1), 1–23 (2013)
Zeng, J., Lin, S., Xu, Z.: Sparse regularization: convergence of iterative jumping thresholding algorithm. IEEE Trans. Signal Process. 64(19), 5106–5118 (2016)
Miao, C., Yu, H.: A general-thresholding solution for \(\ell _{p}(0<p<1)\) regularized CT reconstruction. IEEE Trans. Image Process. 24(12), 5455–5468 (2015)
Acknowledgements
This work is partially supported by the National Natural Science Foundation of China under Grants 61271012 and 61671004.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, Q., Qu, G. & Han, G. A thresholding algorithm for sparse recovery via Laplace norm. SIViP 13, 389–395 (2019). https://doi.org/10.1007/s11760-018-1367-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11760-018-1367-9