scispace - formally typeset
Book ChapterDOI

Tensor based dictionary learning for compressive sensing MRI reconstruction

TLDR
This work learns 2D separable dictionaries possessing Kronecker structure at low computational costs by adapting the CANDECOMP/PARAFAC (CP) tensor decomposition method on stacked 2D under-sampled MR slices of similar scan type.
Abstract
Compressed Sensing (CS) has heralded a new era in cardiac and body Magnetic Resonance (MR) imaging due to the unprecedented acceleration factors achieved within the ambit of existing scanning hardware, by exploiting the inherent sparsity of MR images in a known basis. Latter works have adopted dictionary learning strategies on vectorized image patches to enforce higher degrees of sparsity. However, the enormous computational complexity has confined them to learning from small patches, thereby foregoing any consideration of the expected structure of the MR images from prior knowledge. In order to efficiently exploit the multi-dimensional characteristic of MR data, this work learns 2D separable dictionaries possessing Kronecker structure at low computational costs by adapting the CANDECOMP/PARAFAC (CP) tensor decomposition method on stacked 2D under-sampled MR slices of similar scan type. The proposed method has been observed to obtain superior reconstruction quality in noiseless and noisy acquisition scenarios over the state-of-art. Furthermore, the learned dictionary can jointly reconstruct a stack of distinct 2D under-sampled slices of similar scan type, in significantly reduced running time.

read more

Citations
More filters
Journal ArticleDOI

Bi-smooth constraints for accelerated dynamic MRI with low-rank plus sparse tensor decomposition

TL;DR: Li et al. as mentioned in this paper proposed a low-rank plus sparse tensor decomposition model with bi-smooth constraints to reconstruct DMR images from under-sampled k-t space data.
References
More filters
Book

Compressed sensing

TL;DR: It is possible to design n=O(Nlog(m)) nonadaptive measurements allowing reconstruction with accuracy comparable to that attainable with direct knowledge of the N most important coefficients, and a good approximation to those N important coefficients is extracted from the n measurements by solving a linear program-Basis Pursuit in signal processing.
Journal ArticleDOI

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

TL;DR: In this paper, the authors considered the model problem of reconstructing an object from incomplete frequency samples and showed that with probability at least 1-O(N/sup -M/), f can be reconstructed exactly as the solution to the lscr/sub 1/ minimization problem.
Journal ArticleDOI

Tensor Decompositions and Applications

TL;DR: This survey provides an overview of higher-order tensor decompositions, their applications, and available software.
Journal ArticleDOI

$rm K$ -SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

TL;DR: A novel algorithm for adapting dictionaries in order to achieve sparse signal representations, the K-SVD algorithm, an iterative method that alternates between sparse coding of the examples based on the current dictionary and a process of updating the dictionary atoms to better fit the data.
Journal ArticleDOI

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

TL;DR: It is demonstrated theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln d) random linear measurements of that signal.
Related Papers (5)