English
Related papers

Related papers: An Efficient Method for Robust Projection Matrix D…

200 papers

Compressive sensing (CS) is a promising technology for realizing energy-efficient wireless sensors for long-term health monitoring. However, conventional model-driven CS frameworks suffer from limited compression ratio and reconstruction…

Machine Learning · Computer Science 2016-12-19 Kai Xu , Yixing Li , Fengbo Ren

In this paper, we investigate power-constrained sensing matrix design in a sparse Gaussian linear dimensionality reduction framework. Our study is carried out in a single--terminal setup as well as in a multi--terminal setup consisting of…

Information Theory · Computer Science 2015-10-28 Amirpasha Shirazinia , Subhrakanti Dey

In this paper, we propose a method of structured construction of the optimal measurement matrix for noiseless compressed sensing (CS), which achieves the minimum number of measurements which only needs to be as large as the sparsity of the…

Information Theory · Computer Science 2014-12-30 Linbo Li , Hessam Mahdavifar , Inyup Kang

Compressive Sensing (CS) theory states that real-world signals can often be recovered from much fewer measurements than those suggested by the Shannon sampling theorem. Nevertheless, recoverability does not only depend on the signal, but…

Information Theory · Computer Science 2017-05-10 Miguel Heredia Conde , Otmar Loffeld

Many large-scale systems rely on high-quality deep representations (embeddings) to facilitate tasks like retrieval, search, and generative modeling. Matryoshka Representation Learning (MRL) recently emerged as a solution for adaptive…

Machine Learning · Computer Science 2025-05-21 Tiansheng Wen , Yifei Wang , Zequn Zeng , Zhong Peng , Yudi Su , Xinyang Liu , Bo Chen , Hongwei Liu , Stefanie Jegelka , Chenyu You

We propose a data-driven approach for deep convolutional neural network compression that achieves high accuracy with high throughput and low memory requirements. Current network compression methods either find a low-rank factorization of…

Computer Vision and Pattern Recognition · Computer Science 2019-03-13 Breton Minnehan , Andreas Savakis

Expressing a matrix as the sum of a low-rank matrix plus a sparse matrix is a flexible model capturing global and local features in data popularized as Robust PCA (Candes et al., 2011; Chandrasekaran et al., 2009). Compressed sensing,…

Numerical Analysis · Mathematics 2022-04-28 Jared Tanner , Simon Vary

Compressed sensing (CS) is a signal acquisition paradigm to simultaneously acquire and reduce dimension of signals that admit sparse representation. This is achieved by collecting linear, non-adaptive measurements of a signal, which can be…

Information Theory · Computer Science 2019-11-19 Arman Arian , Ozgur Yilmaz

We propose a robust and efficient approach to the problem of compressive phase retrieval in which the goal is to reconstruct a sparse vector from the magnitude of a number of its linear measurements. The proposed framework relies on…

Information Theory · Computer Science 2015-10-28 Sohail Bahmani , Justin Romberg

Compressive spectral imaging (CSI) has emerged as an alternative spectral image acquisition technology, which reduces the number of measurements at the cost of requiring a recovery process. In general, the reconstruction methods are based…

Image and Video Processing · Electrical Eng. & Systems 2021-05-19 Jorge Bacca , Yesid Fonseca , Henry Arguello

We propose to reduce the original well-posed problem of compressive sensing to weighted-MAX-SAT. Compressive sensing is a novel randomized data acquisition approach that linearly samples sparse or compressible signals at a rate much below…

Information Theory · Computer Science 2019-05-28 Ramin Ayanzadeh , Milton Halem , Tim Finin

A class of recovering algorithms for 1-bit compressive sensing (CS) named Soft Consistency Reconstructions (SCRs) are proposed. Recognizing that CS recovery is essentially an optimization problem, we endeavor to improve the characteristics…

Information Theory · Computer Science 2014-02-25 Xiao Cai , Zhaoyang Zhang , Huazi Zhang , Chunguang Li

We consider the problem of learning a sparse rule model, a prediction model in the form of a sparse linear combination of rules, where a rule is an indicator function defined over a hyper-rectangle in the input space. Since the number of…

Machine Learning · Statistics 2025-03-13 Hiroki Kato , Hiroyuki Hanada , Ichiro Takeuchi

Matrix completion constantly receives tremendous attention from many research fields. It is commonly applied for recommender systems such as movie ratings, computer vision such as image reconstruction or completion, multi-task learning such…

Machine Learning · Computer Science 2019-10-08 Abdallah Chehade , Zunya Shi

From many fewer acquired measurements than suggested by the Nyquist sampling theory, compressive sensing (CS) theory demonstrates that, a signal can be reconstructed with high probability when it exhibits sparsity in some domain. Most of…

Computer Vision and Pattern Recognition · Computer Science 2014-05-01 Jian Zhang , Chen Zhao , Debin Zhao , Wen Gao

Conventional compressive sensing (CS) reconstruction is very slow for its characteristic of solving an optimization problem. Convolu- tional neural network can realize fast processing while achieving compa- rable results. While CS image…

Computer Vision and Pattern Recognition · Computer Science 2017-10-04 Xuemei Xie , Yuxiang Wang , Guangming Shi , Chenye Wang , Jiang Du , Zhifu Zhao

Estimating covariance matrices with high-dimensional complex data presents significant challenges, particularly concerning positive definiteness, sparsity, and numerical stability. Existing robust sparse estimators often fail to guarantee…

Methodology · Statistics 2025-12-30 Shaoxin Wang , Ziyun Ma

In orthogonal frequency division modulation (OFDM) communication systems, channel state information (CSI) is required at receiver due to the fact that frequency-selective fading channel leads to disgusting inter-symbol interference (ISI)…

Information Theory · Computer Science 2015-04-22 Guan Gui , Li Xu , Lin Shan , Fumiyuki Adachi

Random projection, a dimensionality reduction technique, has been found useful in recent years for reducing the size of optimization problems. In this paper, we explore the use of sparse sub-gaussian random projections to approximate…

Optimization and Control · Mathematics 2024-06-21 Monse Guedes-Ayala , Pierre-Louis Poirion , Lars Schewe , Akiko Takeda

The discovery of the theory of compressed sensing brought the realisation that many inverse problems can be solved even when measurements are "incomplete". This is particularly interesting in magnetic resonance imaging (MRI), where long…