Results 21 to 30 of about 31,241 (250)
Decay Properties of Restricted Isometry Constants [PDF]
Many sparse approximation algorithms accurately recover the sparsest solution to an underdetermined system of equations provided the matrix's restricted isometry constants (RICs) satisfy certain bounds. There are no known large deterministic matrices that satisfy the desired RIC bounds; however, members of many random matrix ensembles typically satisfy
Jeffrey D. Blanchard +2 more
openaire +2 more sources
Currently, the use of microseismic detection technology for crack detection and localization in rock masses has great potential in detecting structural damage.
Jinfeng Chen, Meng Mei
doaj +1 more source
A Method of Reweighting the Sensing Matrix for Compressed Sensing
In compressed sensing, a small enough restricted isometry constant (RIC) of the sensing matrix satisfying the restricted isometry property (RIP) is the powerful guarantee on the precise reconstruction of a sparse discrete signal.
Lei Shi, Gangrong Qu, Qian Wang
doaj +1 more source
Suprema of Chaos Processes and the Restricted Isometry Property [PDF]
We present a new bound for suprema of a special type of chaos process indexed by a set of matrices, which is based on a chaining method. As applications we show significantly improved estimates for the restricted isometry constants of partial random circulant matrices and time‐frequency structured random matrices.
Krahmer, Felix +2 more
openaire +4 more sources
An Armijo-Type Hard Thresholding Algorithm for Joint Sparse Recovery
Joint sparse recovery (JSR) in compressed sensing simultaneously recovers sparse signals with a common sparsity structure from their multiple measurement vectors obtained through a common sensing matrix.
Lili Pan, Xunzhi Zhu
doaj +1 more source
Efficiency of orthogonal super greedy algorithm under the restricted isometry property
We investigate the efficiency of orthogonal super greedy algorithm (OSGA) for sparse recovery and approximation under the restricted isometry property (RIP).
Xiujie Wei, Peixin Ye
doaj +1 more source
A new bound on the block restricted isometry constant in compressed sensing
This paper focuses on the sufficient condition of block sparse recovery with the l 2 / l 1 $l_{2}/l_{1}$ -minimization. We show that if the measurement matrix satisfies the block restricted isometry property with δ 2 s | I < 0.6246 $\delta_{2s|\mathcal{I}
Yi Gao, Mingde Ma
doaj +1 more source
Orthogonal matching pursuit (OMP) is a widely used greedy algorithm for recovering the support of a sparse signal x from the underdetermined model y = Ax. In practice, we should analyze the performance of OMP under general perturbations, which means that
Haifeng Li, Guoqi Liu
doaj +1 more source
Survey on compressed sensing over the past two decades
Compressed Sensing (CS) is a novel data acquisition theorem exploiting the signals sparsity differing from traditional Nyquist theorem in the ability of obtaining all information of such signal in fewer samples.
Sherif Hosny +2 more
doaj +1 more source
Restricted Isometry Property of Principal Component Pursuit with Reduced Linear Measurements
The principal component prsuit with reduced linear measurements (PCP_RLM) has gained great attention in applications, such as machine learning, video, and aligning multiple images.
Qingshan You, Qun Wan, Haiwen Xu
doaj +1 more source

