Skip to main content

Questions tagged [compressive-sensing]

the field of study that aims to solve an underdetermined linear system of equations by exploiting the structure of the unknown data

Filter by
Sorted by
Tagged with
4 votes
1 answer
124 views

Implementation of Block Orthogonal Matching Pursuit (BOMP) Algorithm - Fix Given Code [closed]

This is my implementation which doesn't work: ...
sujit das's user avatar
2 votes
2 answers
641 views

Implementation of Block Orthogonal Matching Pursuit (BOMP) Algorithm [closed]

How would one implement the Block Orthogonal Matching Pursuit (BOMP) Algorithm in MATLAB?
sujit das's user avatar
5 votes
1 answer
139 views

Convex Optimization with $ {L}_{1, 2} $ Regularization Term

I have an optimization problem such as follow: $$\underset{X}{\operatorname{argmin}}\sum _s \left \| T_sX_{:,s} - Y_{:,s} \right \|^2_2 +\lambda\left \| GX \right \|_{2,1} \tag{1}$$ I have introduced ...
strahd's user avatar
  • 169
4 votes
1 answer
153 views

Why Does FISTA Algorithm Not Work for Signed Signals?

Using the FISTA Algorithm for compressive sensing from Tiep H. Vu - FISTA, I created the matlab example below. I created 2 sparse signals x_signed and x_pos, where the latter only contains positive ...
Mr Vinagi's user avatar
  • 173
4 votes
1 answer
165 views

Resources on Solving Convex Optimization Problems in the Compressed Sensing Field

When I read papers of compressed sensing, sparse representation and whatever requiring optimization of a cost function, I just find the final results as an iterative equation or so which will converge ...
MJay's user avatar
  • 467
0 votes
0 answers
73 views

why restricted isometry property constant $\delta_{2k}<\sqrt{2}-1$?

It's said that $\delta_{2k} < \sqrt{2} -1$ , the solution of the $l_{1}$ problem is that of $l_{0}$ problem. I checked the proof of $||x^{*}-x||_{l_{2}}\leq C_{0}s^{-1/2}||x-x_{s}||_{l_{1}}+C_{1}\...
Jue Wu's user avatar
  • 1
0 votes
0 answers
52 views

What is the error rate in compressed sensing?

Let $x \in \mathbb{R}^n$ be a $k$-sparse vector. Given $A \in \mathbb{R}^{m \times n}$, we have a measurement vector $y$ given by $$y=Ax$$ Let $\hat{x}$ be defined as follows $$\hat{x}:=\arg\min_{z\...
Shashank Ranjan's user avatar
0 votes
0 answers
166 views

The origin of the restricted isometry property (RIP)

I have been looking for the origin of the restricted isometry property (RIP). Many papers cite the origin of the RIP in the following paper Emmanuel Candès, Terence Tao, Decoding by Linear ...
Lord's user avatar
  • 11
2 votes
1 answer
467 views

Sparsity Representation of a Signal Using the DCT Matrix

I have a signal $\mathbf x$, and I need to know how to obtain the matrix which is the corresponding sparsity basis $\mathbf\Psi$ such that $\mathbf x = \mathbf{\Psi\theta}$, where $\mathbf\theta$ is ...
Karem Adam's user avatar
0 votes
1 answer
133 views

Coherence Calculation in Sparse Sensing

i have an image I of size 32*32. I perform the DCT of this image using the matlab function DCT2(I). I get a sparse representation of my image which is again a 32*32 image. I construct a circulant ...
ffff's user avatar
  • 1
0 votes
1 answer
55 views

Wireless Body Area Networks with Minimum Energy Consumption [closed]

For adaptive compressive sensing(cs),the sensing matrix is related to the input signal. For example, in rakeness-based(cs), the sensing matrix is obtained by solving an optimization problem which ...
Mohamed Aly's user avatar
0 votes
1 answer
136 views

Energy of compressed signals

I have tried a code to compress a signal using Compressed Sensing(CS). The input signal is $x$ and the compressed signal $y$ is given by : $y=Φ*x$ where $Φ$ is the sensing matrix. I have used ...
Mohamed Aly's user avatar
4 votes
1 answer
1k views

How Is Mixed Norm ($ {L}_{1, 2 }$) Better than $ {L}_{1} $ Norm for Sparse Representation?

Using $ {l}_{1} $-norm regularization for the purpose of achieving sparsity of the solution has been successfully applied a lot. But many times, I found the paper using mixed-norm instead of $l_1$-...
Jan's user avatar
  • 189
3 votes
1 answer
195 views

Compressed Sensing Mathematical Concept in Signal Processing

I am new in the field of compressive sensing, I've read many papers explaining that compressive sensing is used widely in sparse signal reconstruction. I've tried to understand how compressive sensing ...
Fatima_Ali's user avatar
4 votes
0 answers
72 views

Designing a fast linear operator with $\pm 1$ entries with low condition number and low Hamming distance between consecutive rows

I need to design a matrix for compressive imaging where each row represents an $N$-pixel filter in a focal plane through which light is masked, summed, and measured (think of Rice's single-pixel ...
Mark Borgerding's user avatar
4 votes
1 answer
144 views

Sparse Recovery Best Algorithms

In the big data era, in order to control the cost, complexity, and bandwidth of collecting and processing high-dimensional data systems, it is critical to exploit models that ...
Issa's user avatar
  • 127
2 votes
2 answers
170 views

Compressive Sensing and Sparsity

We apply compressive sensing to reconstruct a signal if it is sparse in the original domain or has a sparse represetation in some basis. How we may know a if a signal is sparse or has a sparse ...
Issa's user avatar
  • 127
5 votes
2 answers
175 views

Orthonormal Dictionaries for Band Limited Signals

If $\mathbf{x} = [x_0, x_1, \ldots, x_{N-1}]^T$ is the time sampled input signal and $\mathbf{Y} = [Y_0, Y_1, \ldots, Y_{N-1}]^T$ is the Fourier transform of the input signal, then a linear ...
Maxtron's user avatar
  • 396
1 vote
1 answer
60 views

What Is Adaptive Compressive Sampling?

I have just started my work in compressive sensing. the measurement vectors are obtain by multiplying the sensing matrix with input signal. the thing i cant figure out adaptive compressive sampling. ...
Hebah's user avatar
  • 23
1 vote
0 answers
45 views

Required number of measrments for signal recovery in a compressed sensing MMV problem?

For multiple measurement vector (MMV) problem $Y=AX$ where $A$ is $m \times n$ sensing matrix and $X$ is $n \times L$ matrix haveing K non zero rows. What are the necessary conditions on the ...
Digi1's user avatar
  • 171
0 votes
1 answer
197 views

Difference Between Iteratively Reweighted Least Squares (IRLS) and Sequential Quadratic Programming?

Part of my work is concerned with applications in Sparse Bayesian Learning and therefore I occasionally stumble over interesting papers in the field of compressed sensing. I recently read ...
Effesian's user avatar
2 votes
2 answers
574 views

Compressive Sensing - Sparse in frequency example

I am learning about compressed sensing. I have a question regarding a common MATLAB "sparse in frequency" example that can be find online, for example here and here. What confuses me in these ...
Cesare's user avatar
  • 151
2 votes
2 answers
293 views

Higher-order Kronecker product

I am trying to generate a 2D DFT matrix in matlab, which I need for 2D compressed sensing (CS) problems. Lets say $N_1=8$, $N_2=16$, then according to the requirement of CS, to generate a 2D DFT ...
user33184's user avatar
0 votes
2 answers
109 views

Compressive Sensing: Reconstruct Gap in Antenna Array

I have an antenna array with $N$ elements spaced half a wavelength apart. I have a second, identical antenna array that is the distance $D$ apart from the first one. Could I use compressive sensing ...
torpedo's user avatar
  • 141
6 votes
1 answer
386 views

Why doesn't compressive sensing work for any signal?

My (probably naive) understanding of compressive sensing is that it is a technique that allows to efficiently reconstruct an $N$-dimensional signal $\boldsymbol x$, provided that it is sparse in some ...
glS's user avatar
  • 163
6 votes
2 answers
731 views

Reference Code for Positive Basis Pursuit Denoising

I am trying to reconstruct a positive sparse signal using compressed sensing (friedlanders code), I cannot find a way to impose the positivity constraint for this implementation. I have seen some ...
Pavan's user avatar
  • 63
3 votes
1 answer
218 views

Sub nyquist sampling, required number of samples for time sparse grouped signals

Question: Does it make sense to perform compressed sampling if the non zero samples are grouped in time? If so, what is the minimal length of the vector x that should be acquired to allow full signal ...
user1345112's user avatar
9 votes
2 answers
2k views

Compressive Sensing vs. Sparse Coding

There apparently are different terminologies used to refer to the same field called "compressive sensing" such as (see this wiki page): compressed sensing, compressive sampling, or sparse sampling. I ...
Learn_and_Share's user avatar
1 vote
0 answers
81 views

Sufficient conditions for exact signal recovery using OMP?

For a compressive sensing model : $$y_{_{MXN}}=A_{_{MXN}}x_{_{NX1}}$$ where $x$ is $K$ sparse, what is the sufficient condition for Orthogonal matching Pursuit (OMP) to exactly recover the data for ...
Digi1's user avatar
  • 171
3 votes
1 answer
209 views

How to scale Phase Transition Diagram for Compressed Sensing?

I want to compute a Phase Transition Diagram as shown here ($A \in \mathbb{R}^{n \times N}$ and $k$ is the sparsity: $\vert \vert x \vert \vert_0 = k $ ) My question is: For $n=1$ I can only compute $...
N8_Coder's user avatar
  • 223
1 vote
0 answers
90 views

Iterative Hard Thresholding always thresholds same indices

I am confused by the fact that the thresholded indices in IHT do not change during the recovery. I used the code from this question and also added the condition that $$\vert \vert \Phi \vert \vert_2 &...
IdleRunner's user avatar
1 vote
2 answers
279 views

Why do we need deterministic measurement matrices in compressed sensing?

I recently introduced myself into the field of CS, but I do not understand why some people try to find deterministic measurement matrices? If I am correct, gaussian random matrices are very powerful ...
IdleRunner's user avatar
1 vote
0 answers
72 views

Linear Systems, Sparse Solutions, and $4 \times 4$ Sudoku Algorithm [closed]

I am unable to understand the paper Linear Systems, Sparse Solutions, and Sudoku. I have to form a $4 \times 4$ Sudoku using the algorithm in this paper. Can somebody please provide me the algorithm ...
user29264's user avatar
6 votes
1 answer
1k views

Terminologies - sparse channel, sparse input, compressed sensing

The term sparse in general means that there are more elements that are zero valued or very close to zero in comparison to the number of non-zero. In speech deonvolution research papers, the channel ...
SKM's user avatar
  • 621
5 votes
1 answer
127 views

Compression Sensing for Blind Source Separation

I am new to Signal Processing, and am interested in compression sensing for audio files. CS is based on the algorithm that, given some sampling of a signal $f$ in order to obtain a smaller (compressed)...
Yada Pruksachatkun's user avatar
2 votes
1 answer
445 views

Does the use of a sparse basis in Compressed Sensing imply the need to have access to all the information beforehand?

According to literature, the CS framework operates on the knowledge that most natural signals are sparse in some domain given by a sparsifying transform operation $\Phi$ (Fourier, Haar, WHT, etc.). ...
Xavier's user avatar
  • 23
5 votes
2 answers
1k views

Best Metric to Compare Sparsity of Vectors

I solved the Basis Pursuit Denoising Problem looking for a sparse solution (I am in compressive sensing): $$ {x}^{\ast} = \arg \min_{x} \left\{ \frac{1}{2} {\left\| A x - y \right\|}_{2}^{2} + \lambda ...
Tatackola's user avatar
1 vote
1 answer
2k views

How to implement compressed sensing reconstruction?

I am new to the field of Compressive Sensing. I'm trying to implement an example in this link. This example have described and implemented a sample tone reconstruction carefully, but unfortunately, ...
MJay's user avatar
  • 467
6 votes
1 answer
855 views

Is the basis of the sparse signal assumed known in compressed sensing?

I'm new to compressed sensing, and am a little confused about the assumption of the basis matrix $\Psi$. Is $\Psi$ assumed known in compressed sensing? Specifically, suppose that a signal $x$ is ...
syeh_106's user avatar
  • 223
1 vote
1 answer
76 views

$l_2/l_2$ guarantee on sparse Fourier transform

I am starting my studies now on signal processing, and really didn't find nothing on "$l_2/l_2$ guarantee" of a certain function, in my case: $$||\hat{x} - \hat{x}'||_2 \leq C\text{ min }_{\text{k-...
Gustavo Higuchi's user avatar
3 votes
1 answer
121 views

Restriction of Fourier Transform

I am currently reading Candes et. al.'s 2006 paper[1] on recovery of sparse signals from incomplete frequency samples. I am having trouble figuring out what is the form of the Fourier transform ...
VHarisop's user avatar
  • 163
2 votes
1 answer
2k views

Sensing matrix for compressed sensing

What are the differences between random binary sensing matrix  and random Gaussian sensing matrix? What the advantages and disadvantages of each matrix? How can I choose the suitable matrix for a ...
Mohamed Aly's user avatar
2 votes
3 answers
859 views

Difference between compressive sensing and DCT-based compression?

I am working on transmitting EEG signals over wireless body area network. I have applied two different compression techniques: DCT-based and compressive sensing (CS-based) approach. I noticed that the ...
Mohamed Aly's user avatar
4 votes
2 answers
420 views

What are the practical constraints on designing Sensing matrix in compressed Sensing?

In a typical compressed sensing scenario, $y=Ax$, where $x$ is a sparse signal and $A$ is the sensing matrix. To reconstruct the sparse signal $x$ from $y$, $A$ should posses the Restricted Isometry ...
Digi1's user avatar
  • 171
7 votes
2 answers
777 views

Alternative to Orthogonal Matching Pursuit (OMP) Algorithm

In the Compressed Sensing context, assume there is a signal $ x \in {\mathbb{R}}^{n} $ which is $ k $ sparse. Namely its Pseudo $ {\ell}_{0} $ Norm is $ {\left\| x \right\|}_{0} = k $ (The signal has ...
Digi1's user avatar
  • 171
1 vote
0 answers
41 views

Number of trials to judge performance of Compressive Sensing recovery algorithms

I'm trying to get a conclusive numerical value for Mean Squared Error (MSE) as the performance metric of a few CS sparse recovery algorithms. To do this, I vary the number of measurements ($M$) taken ...
user25397's user avatar
3 votes
3 answers
376 views

Real world application of signal sparsity?

There are theories based on signal sparsity in frequency domain like Compressive Sensing, Sparse FFT, etc. Throughout searching and studying papers I found out Cognitive Radio is a good example of ...
MimSaad's user avatar
  • 1,976
1 vote
1 answer
471 views

Signal sparsity: with noise or without noise?

In compressive-sensing, signal should be sparse. Is this with or without noise? When I differentiate signal, it is supposed to be sparse. But when I add noise on it, it isn't sparse anymore. Should ...
zahra's user avatar
  • 13
2 votes
1 answer
191 views

Estimation of occupied frequency bins (location of non-zero fourier coefficients)

I'm working in circuits fields and I am not very familiar with spectrum sensing techniques. Is there a method to identify location of non-zero Fourier coefficients of a signal (just locations, not ...
MimSaad's user avatar
  • 1,976
6 votes
1 answer
535 views

Approximating $ {L}_{0} $ Norm Minimization with Non Linear Convex Inequality Constraints using Reweighted $ {L}_{1} $ Minimization

I have an optimization problem consisting of the $ {\ell}_{0} $ norm as the objective and a nonlinear (convex) constraint as well as a linear constraint. I am wondering if the reweighted $ {\ell}_{1} $...
Undertherainbow's user avatar