Compressed sensing with structured sparsity and structured acquisition
| hal.structure.identifier | Institut de Mathématiques de Toulouse UMR5219 [IMT] | |
| dc.contributor.author | BOYER, Claire | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | BIGOT, Jérémie | |
| hal.structure.identifier | Institut des Technologies Avancées en sciences du Vivant [ITAV] | |
| hal.structure.identifier | Institut de Mathématiques de Toulouse UMR5219 [IMT] | |
| dc.contributor.author | WEISS, Pierre | |
| dc.date.accessioned | 2024-04-04T03:10:20Z | |
| dc.date.available | 2024-04-04T03:10:20Z | |
| dc.date.issued | 2017-05-26 | |
| dc.identifier.issn | 1063-5203 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/193682 | |
| dc.description.abstractEn | Compressed Sensing (CS) is an appealing framework for applications such as Magnetic Resonance Imaging (MRI). However, up-to-date, the sensing schemes suggested by CS theories are made of random isolated measurements, which are usually incompatible with the physics of acquisition. To reflect the physical constraints of the imaging device, we introduce the notion of blocks of measurements: the sensing scheme is not a set of isolated measurements anymore, but a set of groups of measurements which may represent any arbitrary shape (parallel or radial lines for instance).Structured acquisition with blocks of measurements are easy to implement, and provide good reconstruction results in practice.However, very few results exist on the theoretical guarantees of CS reconstructions in this setting.In this paper, we derive new CS results for structured acquisitions and signals satisfying a prior structured sparsity.The obtained results provide a recovery probability of sparse vectors that explicitly depends on their support. Our results are thus support-dependent and offer the possibility for flexible assumptions on the sparsity structure. Moreover, the results are drawing-dependent, since we highlight an explicit dependency between the probability of reconstructing a sparse vector and the way of choosing the blocks of measurements.Numerical simulations show that the proposed theory is faithful to experimental observations. | |
| dc.language.iso | en | |
| dc.publisher | Elsevier | |
| dc.subject.en | Compressed Sensing | |
| dc.subject.en | blocks of measurements | |
| dc.subject.en | structured sparsity | |
| dc.subject.en | MRI | |
| dc.subject.en | exact recovery | |
| dc.subject.en | l1 minimization | |
| dc.title.en | Compressed sensing with structured sparsity and structured acquisition | |
| dc.type | Article de revue | |
| dc.subject.hal | Mathématiques [math]/Théorie de l'information et codage [math.IT] | |
| bordeaux.journal | Applied and Computational Harmonic Analysis | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-01149456 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01149456v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Applied%20and%20Computational%20Harmonic%20Analysis&rft.date=2017-05-26&rft.eissn=1063-5203&rft.issn=1063-5203&rft.au=BOYER,%20Claire&BIGOT,%20J%C3%A9r%C3%A9mie&WEISS,%20Pierre&rft.genre=article |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||