English
Related papers

Related papers: Low-Rank and Sparse Matrix Decomposition with a-pr…

200 papers

Compressed sensing (CS) shows that a signal having a sparse or compressible representation can be recovered from a small set of linear measurements. In classical CS theory, the sampling matrix and representation matrix are assumed to be…

Information Theory · Computer Science 2015-07-03 Yipeng Liu

We present an algorithm to reduce the computational effort for the multiplication of a given matrix with an unknown column vector. The algorithm decomposes the given matrix into a product of matrices whose entries are either zero or integer…

Information Theory · Computer Science 2020-02-28 Ralf R. Müller , Bernhard Gäde , Ali Bereyhi

We introduce a "learning-based" algorithm for the low-rank decomposition problem: given an $n \times d$ matrix $A$, and a parameter $k$, compute a rank-$k$ matrix $A'$ that minimizes the approximation loss $\|A-A'\|_F$. The algorithm uses a…

Machine Learning · Computer Science 2019-10-31 Piotr Indyk , Ali Vakilian , Yang Yuan

Magnetic Resonance Imaging (MRI) is a widely used medical imaging technique, but its long acquisition time can be a limiting factor in clinical settings. To address this issue, researchers have been exploring ways to reduce the acquisition…

Computer Vision and Pattern Recognition · Computer Science 2024-04-09 Pu Yang , Bin Dong

In this paper we revisit the sparse multiple measurement vector (MMV) problem where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurements. This problem has received increasing interest as an…

Information Theory · Computer Science 2015-03-14 Mike E. Davies , Yonina C. Eldar

In this work we present Low-rank Deconvolution, a powerful framework for low-level feature-map learning for efficient signal representation with application to signal recovery. Its formulation in multi-linear algebra inherits properties…

Computer Vision and Pattern Recognition · Computer Science 2023-05-04 David Reixach

The problem of how to find a sparse representation of a signal is an important one in applied and computational harmonic analysis. It is closely related to the problem of how to reconstruct a sparse vector from its projection in a much…

Functional Analysis · Mathematics 2018-04-13 Enrico Au-Yeung

Recent research in tomographic reconstruction is motivated by the need to efficiently recover detailed anatomy from limited measurements. One of the ways to compensate for the increasingly sparse sets of measurements is to exploit the…

Computer Vision and Pattern Recognition · Computer Science 2017-12-08 Preeti Gopal , Ritwick Chaudhry , Sharat Chandran , Imants Svalbe , Ajit Rajwade

In this paper, we study the problem of image recovery from given partial (corrupted) observations. Recovering an image using a low-rank model has been an active research area in data analysis and machine learning. But often, images are not…

Computer Vision and Pattern Recognition · Computer Science 2020-03-13 Pawan Goyal , Hussam Al Daas , Peter Benner

Deep learning has shown astonishing performance in accelerated magnetic resonance imaging (MRI). Most state-of-the-art deep learning reconstructions adopt the powerful convolutional neural network and perform 2D convolution since many…

Image and Video Processing · Electrical Eng. & Systems 2021-12-10 Zi Wang , Chen Qian , Di Guo , Hongwei Sun , Rushuai Li , Bo Zhao , Xiaobo Qu

Magnetic resonance imaging (MRI) is mainly limited by long scanning time and vulnerable to human tissue motion artifacts, in 3D clinical scenarios. Thus, k-space undersampling is used to accelerate the acquisition of MRI while leading to…

Image and Video Processing · Electrical Eng. & Systems 2022-01-11 Shengke Xue , Ruiliang Bai , Xinyu Jin

This paper studies the problem of reconstructing spectrally sparse signals from a small random subset of time domain samples via low-rank Hankel matrix completion with the aid of prior information. By leveraging the low-rank structure of…

Information Theory · Computer Science 2021-05-05 Xu Zhang , Yulong Liu , Wei Cui

Compressed sensing is a relatively new mathematical paradigm that shows a small number of linear measurements are enough to efficiently reconstruct a large dimensional signal under the assumption the signal is sparse. Applications for this…

Numerical Analysis · Mathematics 2018-01-08 Lenny Fukshansky , Deanna Needell , Benny Sudakov

Sparsity-based approaches have been popular in many applications in image processing and imaging. Compressed sensing exploits the sparsity of images in a transform domain or dictionary to improve image recovery from undersampled…

Machine Learning · Statistics 2019-06-14 Saiprasad Ravishankar , Brian E. Moore , Raj Rao Nadakuditi , Jeffrey A. Fessler

In this paper, we consider the challenge of reconstructing jointly sparse vectors from linear measurements. Firstly, we show that by utilizing the rank of the output data matrix we can reduce the problem to a full column rank case. This…

Numerical Analysis · Mathematics 2019-05-28 Armenak Petrosyan , Hoang Tran , Clayton Webster

Natural signals and images are well-known to be approximately sparse in transform domains such as Wavelets and DCT. This property has been heavily exploited in various applications in image processing and medical imaging. Compressed sensing…

Machine Learning · Computer Science 2015-10-26 Saiprasad Ravishankar , Yoram Bresler

We study the low-rank phase retrieval problem, where the objective is to recover a sequence of signals (typically images) given the magnitude of linear measurements of those signals. Existing solutions involve recovering a matrix…

Image and Video Processing · Electrical Eng. & Systems 2022-02-18 Soo Min Kwon , Xin Li , Anand D. Sarwate

Cardiac MRI (CMRI) is a cornerstone imaging modality that provides in-depth insights into cardiac structure and function. Multi-contrast CMRI (MCCMRI), which acquires sequences with varying contrast weightings, significantly enhances…

Image and Video Processing · Electrical Eng. & Systems 2024-11-05 George Yiasemis , Nikita Moriakov , Jan-Jakob Sonke , Jonas Teuwen

The choice of the sensing matrix is crucial in compressed sensing. Random Gaussian sensing matrices satisfy the restricted isometry property, which is crucial for solving the sparse recovery problem using convex optimization techniques.…

Signal Processing · Electrical Eng. & Systems 2023-12-29 Kartheek Kumar Reddy Nareddy , Abijith Jagannath Kamath , Chandra Sekhar Seelamantula

Optimal sensor placement is a central challenge in the design, prediction, estimation, and control of high-dimensional systems. High-dimensional states can often leverage a latent low-dimensional representation, and this inherent…

Optimization and Control · Mathematics 2020-05-18 Krithika Manohar , Bingni W. Brunton , J. Nathan Kutz , Steven L. Brunton
‹ Prev 1 4 5 6 7 8 10 Next ›