Inexact gradient projection and fast data driven compressed sensing: theory and application | Vidéo | Carmin.tv

00:00:00 / 00:00:00

Chapters

Inexact gradient projection and fast data driven compressed sensing: theory and application

By Michael E. Davies

Appears in collections : International traveling workshop on interactions between low-complexity data models and sensing techniques / Colloque international et itinérant sur les interactions entre modèles de faible complexité et acquis, Ecoles de recherche

We consider the convergence of the iterative projected gradient (IPG) algorithm for arbitrary (typically nonconvex) sets and when both the gradient and projection oracles are only computed approximately. We consider different notions of approximation of which we show that the Progressive Fixed Precision (PFP) and (1+epsilon) optimal oracles can achieve the same accuracy as for the exact IPG algorithm. We also show that the former scheme is also able to maintain the (linear) rate of convergence of the exact algorithm, under the same embedding assumption, while the latter requires a stronger embedding condition, moderate compression ratios and typically exhibits slower convergence. We apply our results to accelerate solving a class of data driven compressed sensing problems, where we replace iterative exhaustive searches over large datasets by fast approximate nearest neighbour search strategies based on the cover tree data structure. Finally, if there is time we will give examples of this theory applied in practice for rapid enhanced solutions to an emerging MRI protocol called magnetic resonance fingerprinting for quantitative MRI.

Information about the video

Date of recording 21/11/2018
Date of publication 10/12/2018
Institution CIRM
Licence CC BY NC ND
Language English
Director(s) Guillaume Hennenfent
Format MP4

Citation data

DOI 10.24350/CIRM.V.19476703
Cite this video Davies, Michael E. (21/11/2018). Inexact gradient projection and fast data driven compressed sensing: theory and application. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19476703
URL https://dx.doi.org/10.24350/CIRM.V.19476703

Domain(s)

Bibliography

Benjamin, A.J.V., Gómez, P.A., Golbabaee, M., Sprenger, T., Menzel, M.I., Davies, M., & Marshall, I. (2018). Balanced multi-shot EPI for accelerated Cartesian MRF: An alternative to spiral MRF. <arXiv:1809.02506> - https://arxiv.org/abs/1809.02506
Davies, M., Puy, G., Vandergheynst, P., & Wiaux, Y. (2014). A compressed sensing framework for magnetic resonance fingerprinting. SIAM Journal on Imaging Sciences, 7(4), 2623-2656 - https://doi.org/10.1137/130947246
Golbabaee, M., Chen, Z., Wiaux, Y., & Davies, M. (2018). CoverBLIP: accelerated and scalable iterative matched-filtering for Magnetic Resonance Fingerprint reconstruction. <arXiv:1810.01967> - https://arxiv.org/abs/1810.01967
Golbabaee, M., & Davies, M. (2018). Inexact gradient projection and fast data driven compressed sensing. <arXiv:1706.00092> - https://arxiv.org/abs/1706.00092
Golbabaee, M., Chen, Z., Wiaux, Y., & Davies, M. (2018). CoverBLIP: scalable iterative matched filtering for MR Fingerprint recovery. <arXiv:1809.02503> - https://arxiv.org/abs/1809.02503
Golbabaee, M., Chen, Z., Wiaux, Y., & Davies, M. (2017). Cover tree compressed sensing for fast MR fingerprint recovery. <arXiv:1706.07834> - https://arxiv.org/abs/1706.07834

MSC codes

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow

Copyright Carmin.tv 2025

Give feedback