DOI: 10.31274/etd-180810-898
|View full text |Cite
|
Sign up to set email alerts
|

Stability (over time) of regularized modified CS (noisy) for recursive causal sparse reconstruction

Abstract: LIST OF FIGURES 3.1 (a) Sorted MRI signal coefficient values in Wavelet domain (b) Sorted proposed signal model coefficient values in Wavelet domain. .. .. .. 4.1 Normalized MSE (NMSE), number of extras and number of misses over time for CS, modified CS, modified BPDN, and regularized modified CSN. In part (b) and (c), NMSE for CS was more than 20%.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…On the other end, we are also working on obtaining conditions under which it will remain "stable" (its error will be bounded by a time-invariant and small value) for a recursive recovery problem. In [30], this has been done for the constrained version of reg-mod-BPDN. That result uses the restricted isometry constants (RIC) and the restricted orthogonality constants (ROC) [17], [11] in its sufficient conditions and bounds.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…On the other end, we are also working on obtaining conditions under which it will remain "stable" (its error will be bounded by a time-invariant and small value) for a recursive recovery problem. In [30], this has been done for the constrained version of reg-mod-BPDN. That result uses the restricted isometry constants (RIC) and the restricted orthogonality constants (ROC) [17], [11] in its sufficient conditions and bounds.…”
Section: Discussionmentioning
confidence: 99%
“…We briefly discuss here the stability of dynamic reg-mod-BPDN (reconstruction error and support estimation errors bounded by a time-invariant and small value at all times). Using an approach similar to that of [30], it should be possible to show the following. If (i) ρ is large enough (so thatN t does not falsely detect any element that got removed from N t ); (ii) the newly added elements to the current support, N t , either get added at a large enough value to get detected immediately, or within a finite delay their magnitude becomes large enough to get detected; and (iii) the matrix A satisfies certain conditions (for a given support size and support change size); reg-mod-BPDN will be stable.…”
Section: B Dynamic Reg-mod-bpdn For Recursive Recoverymentioning
confidence: 99%
“…In this work [17], we first propose two convex optimization problem, reg-mod-CSN and reg-mod-BPDN, to use these extra information for signal recovery. Regularized modified CS(noisy)(reg-mod-CSN) is the noisy relaxation of regularized modified CS (reg-mod-cs) proposed in [16].…”
Section: Past Work and Our Contributionmentioning
confidence: 99%
“…In [23], [24], the authors propose techniques for recursive sparse reconstruction of dynamic natural signal/image sequences for small changes in sparsity with time. In [20], the authors address the problem of stability of the aforementioned techniques. All the aforementioned work assume an apriori knowledge about the sparsity of the signal.…”
Section: Introductionmentioning
confidence: 99%