Tensors for Improving Compressed Sensing Reconstruction

Authors

  • Saad Jamal Institute of Space Technology, Islamabad
  • Khurram Khurshid Institute of Space Technology, Islamabad

Abstract

Compressed Sensing (CS) proposes a framework that any signal can be efficiently reconstructed by observing fewer measurements than required by the famous Shannon-Nyquist theorem, the observing signal must be sparse in some transform domain. Many methods have been proposed to further improve the quality of reconstructed images such as Group Sparsity, Structural Group Sparsity, Total-Variation etc. In this paper we unify tensor based approach with compressed sensing to efficiently reconstruct the original signal. Tensor based approach helps in preserving the intrinsic structure of the signal. Two methods of tensor decomposition Tucker and CANDE/PARAFAC (CP) are unified to give the best low-rank representation of the sparse signal.

Author Biography

Khurram Khurshid, Institute of Space Technology, Islamabad

Associate Professor and Head of Department (EE, IST)

References

[1] E. J. Candes and M. B. Wakin, “An Introduction To Compressive Sampling,” IEEE Signal Process. Mag., vol. 25, no. 2, pp. 21–30, Mar. 2008.

[2] D. L. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289–1306, Apr. 2006.

[3] A. Masoum, N. Meratnia, and P. J. M. Havinga, “A distributed compressive sensing technique for data gathering in Wireless Sensor Networks,” Procedia Comput. Sci., vol. 21, pp. 207–216, 2013.

[4] J. M. Lustig, Michael and Donoho, David L and Santos, Juan M and Pauly, “Compressed sensing MRI,” Signal Process. Mag. IEEE, vol. 25, no. 2, pp. 72–82, 2008.

[5] L. C. Potter, E. Ertin, J. T. Parker, and M. Çetin, “Sparsity and compressed sensing in radar imaging,” Proc. IEEE, vol. 98, no. 6, pp. 1006–1020, 2010.

[6] W. Jin, Z. Liu, and G. Li, “Block-Based Compressed Sensing for Neutron Radiation Image Using WDFB,” vol. 2015, 2015.

[7] E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489–509, 2006.

[8] M. B. Wakin et al., “Compressive imaging for video representation and coding,” Pict. Coding Symp., vol. 1, p. 13, 2006.

[9] V. Stankovic, L. Stankovic, and S. Cheng, “Compressive video sampling,” Proc. Eur., pp. 2–6, 2008.

[10] Lu Gan, “Block Compressed Sensing of Natural Images,” in 2007 15th International Conference on Digital Signal Processing, 2007, no. 1, pp. 403–406.

[11] Sungkwang Mun and J. E. Fowler, “Block compressed sensing of images using directional transforms,” in 2009 16th IEEE International Conference on Image Processing (ICIP), 2009, no. November, pp. 3021–3024.

[12] C. Chen, E. W. Tramel, and J. E. Fowler, “Compressed-sensing recovery of images and video using multihypothesis predictions,” in 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), 2011, no. November, pp. 1193–1198.

[13] Jian Zhang, Debin Zhao, Feng Jiang, and Wen Gao, “Structural Group Sparse Representation for Image Compressive Sensing Recovery,” in 2013 Data Compression Conference, 2013, pp. 331–340.

[14] J. Mairal, F. Bach, J. Ponce, G. Sapiro, and A. Zisserman, “Non-local sparse models for image restoration,” in 2009 IEEE 12th International Conference on Computer Vision, 2009, vol. 2, no. Iccv, pp. 2272–2279.
[15] Y. Peng, D. Meng, Z. Xu, C. Gao, Y. Yang, and B. Zhang,
“Decomposable Nonlocal Tensor Dictionary Learning for Multispectral Image Denoising.”

[16] Z. Zha et al., “Compressed sensing image reconstruction via adaptive sparse nonlocal regularization,” Vis. Comput., 2016.
[17] Yong-Deok Kim and Seungjin Choi, “Nonnegative Tucker Decomposition,” pp. 1–8, 2007.

[18] M. Mørup, L. K. Hansen, and S. M. Arnfred, “Algorithms for sparse nonnegative Tucker decompositions.,” Neural Comput., vol. 20, no. 8, pp. 2112–31, 2008.

[19] T. G. Kolda and B. W. Bader, “Tensor Decompositions and Applications,” SIAM Rev., vol. 51, no. 3, pp. 455–500, Aug. 2009.

[20] K. Dabov, A. Foi, and K. Egiazarian, “Image denoising by sparse 3D transform-domain collaborative filtering,” Eur. Signal Process. Conf., vol. 16, no. 8, pp. 145–149, 2007.
[21] Q. Xie et al., “Multispectral Images Denoising by Intrinsic Tensor Sparsity Regularization,” Comput. Vis. Pattern Recognit., pp. 1692–1700, 2016.

[22] E. Ghadimi and A. Teixeira, “Optimal parameter selection for the alternating direction method of multipliers (ADMM): quadratic problems,” IEEE Trans. Automat. Contr., vol. 60, no. 3, pp. 644–658, 2015.

[23] S. Boyd, “Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers,” Found. Trends® Mach. Learn., vol. 3, no. 1, pp. 1–122, 2010.

[24] H. Sedghi, A. Anandkumar, and E. Jonckheere, “Multi-Step Stochastic ADMM in High Dimensions: Applications in Sparse Optimization and Noisy Matrix Decomposition,” Newport.Eecs.Uci.Edu, pp. 1–33, 2012.

[25] P. Gong, C. Zhang, Z. Lu, J. Huang, and J. Ye, “A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems,” Proc. 30th Int. Conf. Mach. Learn. ICML 2013, vol. 28, Mar. 2013.

[26] C. Li, W. Yin, and Y. Zhang, “TVAL3: TV Minimization by Augmented Lagrangian and Alternating Direction Algorithms,” 2009.

Downloads

Published

2018-09-11

Issue

Section

Computer Science