Joint Sensing Matrix and Sparsifying Dictionary Optimization for Tensor Compressive Sensing

被引:39
作者
Ding, Xin [1 ]
Chen, Wei [2 ]
Wassell, Ian J. [1 ]
机构
[1] Univ Cambridge, Comp Lab, Cambridge CB2 1TN, England
[2] Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R China
基金
英国工程与自然科学研究理事会;
关键词
Multidimensional system; compressive sensing; tensor compressive sensing; dictionary learning; sensing matrix optimization; PROJECTION DESIGN; SPARSE; REPRESENTATIONS; RECOVERY; MRI;
D O I
10.1109/TSP.2017.2699639
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Tensor compressive sensing (TCS) is a multidimensional framework of compressive sensing (CS), and it is advantageous in terms of reducing the amount of storage, easing hardware implementations, and preserving multidimensional structures of signals in comparison to a conventional CS system. In a TCS system, instead of using a random sensing matrix and a predefined dictionary, the average-case performance can be further improved by employing an optimized multidimensional sensing matrix and a learned multilinear sparsifying dictionary. In this paper, we propose an approach that jointly optimizes the sensing matrix and dictionary for a TCS system. For the sensing matrix design in TCS, an extended separable approach with a closed form solution and a novel iterative nonseparable method are proposed when the multilinear dictionary is fixed. In addition, a multidimensional dictionary learning method that takes advantages of the multidimensional structure is derived, and the influence of sensing matrices is taken into account in the learning process. A joint optimization is achieved via alternately iterating the optimization of the sensing matrix and dictionary. Numerical experiments using both synthetic data and real images demonstrate the superiority of the proposed approaches.
引用
收藏
页码:3632 / 3646
页数:15
相关论文
共 55 条
  • [1] K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    Aharon, Michal
    Elad, Michael
    Bruckstein, Alfred
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) : 4311 - 4322
  • [2] Compressive hyperspectral imaging by random separable projections in both the spatial and the spectral domains
    August, Yitzhak
    Vachman, Chaim
    Rivenson, Yair
    Stern, Adrian
    [J]. APPLIED OPTICS, 2013, 52 (10) : D46 - D54
  • [3] Alternating Optimization of Sensing Matrix and Sparsifying Dictionary for Compressed Sensing
    Bai, Huang
    Li, Gang
    Li, Sheng
    Li, Qiuwei
    Jiang, Qianru
    Chang, Liping
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2015, 63 (06) : 1581 - 1594
  • [4] Iterative hard thresholding for compressed sensing
    Blumensath, Thomas
    Davies, Mike E.
    [J]. APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 27 (03) : 265 - 274
  • [5] Multidimensional compressed sensing and their applications
    Caiafa, Cesar F.
    Cichocki, Andrzej
    [J]. WILEY INTERDISCIPLINARY REVIEWS-DATA MINING AND KNOWLEDGE DISCOVERY, 2013, 3 (06) : 355 - 380
  • [6] Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
    Caiafa, Cesar F.
    Cichocki, Andrzej
    [J]. NEURAL COMPUTATION, 2013, 25 (01) : 186 - 220
  • [7] Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information
    Candès, EJ
    Romberg, J
    Tao, T
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) : 489 - 509
  • [8] Decoding by linear programming
    Candes, EJ
    Tao, T
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) : 4203 - 4215
  • [9] Exact Matrix Completion via Convex Optimization
    Candes, Emmanuel
    Recht, Benjamin
    [J]. COMMUNICATIONS OF THE ACM, 2012, 55 (06) : 111 - 119
  • [10] The restricted isometry property and its implications for compressed sensing
    Candes, Emmanuel J.
    [J]. COMPTES RENDUS MATHEMATIQUE, 2008, 346 (9-10) : 589 - 592