# Dictionary Learning on the Manifold of Square Root Densities and Application to Reconstruction of Diffusion Propagator Fields

@article{Sun2013DictionaryLO, title={Dictionary Learning on the Manifold of Square Root Densities and Application to Reconstruction of Diffusion Propagator Fields}, author={Jiaqi Sun and Yuchen Xie and Wenxing Ye and Jeffrey Ho and Alireza Entezari and Stephen J. Blackband and Baba C. Vemuri}, journal={Information processing in medical imaging : proceedings of the ... conference}, year={2013}, volume={23}, pages={ 619-31 } }

In this paper, we present a novel dictionary learning framework for data lying on the manifold of square root densities and apply it to the reconstruction of diffusion propagator (DP) fields given a multi-shell diffusion MRI data set. Unlike most of the existing dictionary learning algorithms which rely on the assumption that the data points are vectors in some Euclidean space, our dictionary learning algorithm is designed to incorporate the intrinsic geometric structure of manifolds and…

## 13 Citations

Global Optimality in Separable Dictionary Learning with Applications to the Analysis of Diffusion MRI

- Computer ScienceSIAM J. Imaging Sci.
- 2019

This work proposes a framework that builds upon recent developments in matrix factorization to provide theoretical and numerical guarantees of global optimality for separable dictionary learning and proposes an algorithm to find such a globally optimal solution.

Sparse and Adaptive Diffusion Dictionary (SADD) for recovering intra-voxel white matter structure

- Materials ScienceMedical Image Anal.
- 2015

TL-HARDI: Transform learning based accelerated reconstruction of HARDI data.

- Computer ScienceComputers in biology and medicine
- 2022

Low Rank Representation on Riemannian Manifold of Square Root Densities

- Computer Science, MathematicsArXiv
- 2015

A novel low rank representation (LRR) algorithm for data lying on the manifold of square root densities that is designed to incorporate the intrinsic geometric structure and geodesic distance of the manifold.

Efficient Global Spatial-Angular Sparse Coding for Diffusion MRI with Separable Dictionaries

- Computer ScienceArXiv
- 2016

Joint spatial‐angular sparse coding for dMRI with separable dictionaries

- Computer ScienceMedical Image Anal.
- 2018

An efficient recursive estimator of the Fréchet mean on a hypersphere with applications to Medical Image Analysis

- Computer Science
- 2015

The incremental Fréchet mean estimator (iFME) for data on the hypersphere is presented and it is proved the asymptotic convergence of iFME to the true FM of the underlying distribution from which the data samples were drawn.

Efficient recursive estimation of the Riemannian barycenter on the hypersphere and the special orthogonal group with applications

- Computer Science, Mathematics
- 2020

Enforcing necessary non-negativity constraints for common diffusion MRI models using sum of squares programming

- Computer ScienceNeuroImage
- 2019

Fingerprinting Orientation Distribution Functions in diffusion MRI detects smaller crossing angles

- Computer ScienceNeuroImage
- 2019

## References

SHOWING 1-10 OF 29 REFERENCES

An over-complete dictionary based regularized reconstruction of a field of ensemble average propagators

- Computer Science2012 9th IEEE International Symposium on Biomedical Imaging (ISBI)
- 2012

A dictionary-based framework for the reconstruction of a field of ensemble average propagators (EAPs), given a high angular resolution diffusion MRI data set, wherein, the dictionary atoms are learned from the data via an initial regression using adaptive spline kernels.

Parametric Dictionary Learning for Modeling EAP and ODF in Diffusion MRI

- Computer ScienceMICCAI
- 2012

This work proposes to learn and design a sparse and parametric dictionary from a set of training diffusion data and proposes a framework to analytically estimate in closed form two important diffusion features: the EAP and the ODF.

Accelerated diffusion spectrum imaging with compressed sensing using adaptive dictionaries

- PhysicsMICCAI
- 2012

This work reduces the scan time of whole brain diffusion spectrum imaging acquisition from 50 to 17 min while retaining high image quality, and demonstrates that a dictionary trained using probability density functions from a single slice of a particular subject generalizes well to other slices from the same subject, as well as to slices from other subjects.

Sparse Riemannian manifold clustering for HARDI segmentation

- Computer Science2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro
- 2011

We address the problem of segmenting high angular resolution diffusion images of the brain into cerebral regions corresponding to distinct white matter fiber bundles. We cast this problem as a…

Estimation of Non-negative ODFs Using the Eigenvalue Distribution of Spherical Functions

- MathematicsMICCAI
- 2012

This paper studies the distribution of the eigenvalues of Toeplitz-like matrices constructed from the spherical harmonic representation of the ODF to derive an iterative semi-definite program that enforces non-negativity on the continuous domain.

Generalized Dictionary Learning for Symmetric Positive Definite Matrices with Application to Nearest Neighbor Retrieval

- Computer ScienceECML/PKDD
- 2011

Experiments on several covariance matrix datasets show that GDL achieves performance rivaling state-of-the-art techniques, and allows performing "sparse coding" of positive definite matrices, which enables better NN retrieval.

K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation

- Computer Science
- 2005

A novel algorithm for adapting dictionaries in order to achieve sparse signal representations, K-SVD, an iterative method that alternates between sparse coding of the examples based on the current dictionary, and a process of updating the dictionary atoms to better fit the data.

Riemannian geometry for the statistical analysis of diffusion tensor data

- MathematicsSignal Process.
- 2007

$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

- Computer ScienceIEEE Transactions on Signal Processing
- 2006

A novel algorithm for adapting dictionaries in order to achieve sparse signal representations, the K-SVD algorithm, an iterative method that alternates between sparse coding of the examples based on the current dictionary and a process of updating the dictionary atoms to better fit the data.