Cluster globally, Reduce locally: Scalable efficient dictionary compression for magnetic resonance fingerprinting
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917834643210240 |
|---|---|
| author | Oudoumanessah, Geoffroy Coudert, Thomas Meyer, Luc Delphin, Aurelien Dojat, Michel Lartizien, Carole Forbes, Florence |
| author_facet | Oudoumanessah, Geoffroy Coudert, Thomas Meyer, Luc Delphin, Aurelien Dojat, Michel Lartizien, Carole Forbes, Florence |
| contents | With the rapid advancements in medical data acquisition and production, increasingly richer representations exist to characterize medical information. However, such large-scale data do not usually meet computing resource constraints or algorithmic complexity, and can only be processed after compression or reduction, at the potential loss of information. In this work, we consider specific Gaussian mixture models (HD-GMM), tailored to deal with high dimensional data and to limit information loss by providing component-specific lower dimensional representations. We also design an incremental algorithm to compute such representations for large data sets, overcoming hardware limitations of standard methods. Our procedure is illustrated in a magnetic resonance fingerprinting study, where it achieves a 97% dictionary compression for faster and more accurate map reconstructions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_07415 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cluster globally, Reduce locally: Scalable efficient dictionary compression for magnetic resonance fingerprinting Oudoumanessah, Geoffroy Coudert, Thomas Meyer, Luc Delphin, Aurelien Dojat, Michel Lartizien, Carole Forbes, Florence Applications With the rapid advancements in medical data acquisition and production, increasingly richer representations exist to characterize medical information. However, such large-scale data do not usually meet computing resource constraints or algorithmic complexity, and can only be processed after compression or reduction, at the potential loss of information. In this work, we consider specific Gaussian mixture models (HD-GMM), tailored to deal with high dimensional data and to limit information loss by providing component-specific lower dimensional representations. We also design an incremental algorithm to compute such representations for large data sets, overcoming hardware limitations of standard methods. Our procedure is illustrated in a magnetic resonance fingerprinting study, where it achieves a 97% dictionary compression for faster and more accurate map reconstructions. |
| title | Cluster globally, Reduce locally: Scalable efficient dictionary compression for magnetic resonance fingerprinting |
| topic | Applications |
| url | https://arxiv.org/abs/2411.07415 |