N-Dimensional Tensor Completion for Nuclear Magnetic Resonance Relaxometry

DOI10.1137/18M1193037MaRDI QIDQ5108470zbMATH OpenOpenAlexFDO

Authors Ariel Hafftka, Wojciech Czaja, Hasan Celik, Richard G. Spencer

Publication date 4 May 2020

Published in SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/18m1193037

zbMATH Keywords

compressed sensingmultidimensional inverse problemsnonuniform samplingnuclear magnetic resonancerestricted isometry propertytensor completion

Mathematics Subject Classification ID

Matrix completion problems (15A83) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical methods for inverse problems for integral equations (65R32) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites work

• A Fixed Point Iterative Method for Low $n$-Rank Tensor Pursuit
• Compressed sensing
• Decoding by Linear Programming
• Dimensionality reduction with subgaussian matrices: a unified theory
• Discrete inverse problems. Insight and algorithms.
• Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• scientific article; zbMATH DE number 1082089 (Why is no real title available?)
• scientific article; zbMATH DE number 2166998 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Low rank tensor recovery via iterative hard thresholding
• Minimum n-rank approximation via iterative hard thresholding
• Most tensor problems are NP-hard
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• On tensor completion via nuclear norm minimization
• Rank Regularization and Bayesian Inference for Tensor Completion and Extrapolation
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
• Solving 2D Fredholm integral from incomplete measurements using compressive sensing
• Solving Fredholm integrals of the first kind with tensor product structure in 2 and 2.5 dimensions
• Sparsity and incoherence in compressive sampling
• Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
• Tensor completion in hierarchical tensor representations
• Tensor Decompositions and Applications
• Tensor spaces and numerical tensor calculus
• Tensor theta norms and low rank recovery
• The Generic Chaining

Cited in

(3)

• Uniform Penalty inversion of two-dimensional NMR relaxation data
• Efficient Maximum Entropy Reconstruction of Nuclear Magnetic Resonance T1-T2 Spectra
• Adaptive truncation of matrix decompositions and efficient estimation of NMR relaxation distributions

This page was built for publication: $N$-Dimensional Tensor Completion for Nuclear Magnetic Resonance Relaxometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5108470)