TY - GEN
T1 - Neighborhood matching for curved domains with application to denoising in diffusion MRI
AU - Chen, Geng
AU - Dong, Bin
AU - Zhang, Yong
AU - Shen, Dinggang
AU - Yap, Pew Thian
N1 - Funding Information:
This work was supported in part by NIH grants (NS093842, EB022880, EB006733, EB009634, AG041721, MH100217, and AA012388) and a NSFC grant (11671022).
PY - 2017
Y1 - 2017
N2 - In this paper, we introduce a strategy for performing neighborhood matching on general non-Euclidean and non-flat domains. Essentially, this involves representing the domain as a graph and then extending the concept of convolution from regular grids to graphs. Acknowledging the fact that convolutions are features of local neighborhoods, neighborhood matching is carried out using the outcome of multiple convolutions at multiple scales. All these concepts are encapsulated in a sound mathematical framework, called graph framelet transforms (GFTs), which allows signals residing on non-flat domains to be decomposed according to multiple frequency subbands for rich characterization of signal patterns. We apply GFTs to the problem of denoising of diffusion MRI data, which can reside on domains defined in very different ways, such as on a shell, on multiple shells, or on a Cartesian grid. Our non-local formulation of the problem allows information of diffusion signal profiles of drastically different orientations to be borrowed for effective denoising.
AB - In this paper, we introduce a strategy for performing neighborhood matching on general non-Euclidean and non-flat domains. Essentially, this involves representing the domain as a graph and then extending the concept of convolution from regular grids to graphs. Acknowledging the fact that convolutions are features of local neighborhoods, neighborhood matching is carried out using the outcome of multiple convolutions at multiple scales. All these concepts are encapsulated in a sound mathematical framework, called graph framelet transforms (GFTs), which allows signals residing on non-flat domains to be decomposed according to multiple frequency subbands for rich characterization of signal patterns. We apply GFTs to the problem of denoising of diffusion MRI data, which can reside on domains defined in very different ways, such as on a shell, on multiple shells, or on a Cartesian grid. Our non-local formulation of the problem allows information of diffusion signal profiles of drastically different orientations to be borrowed for effective denoising.
UR - http://www.scopus.com/inward/record.url?scp=85029391947&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85029391947&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-66182-7_72
DO - 10.1007/978-3-319-66182-7_72
M3 - Conference contribution
AN - SCOPUS:85029391947
SN - 9783319661810
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 629
EP - 637
BT - Medical Image Computing and Computer Assisted Intervention − MICCAI 2017 - 20th International Conference, Proceedings
A2 - Descoteaux, Maxime
A2 - Duchesne, Simon
A2 - Franz, Alfred
A2 - Jannin, Pierre
A2 - Collins, D. Louis
A2 - Maier-Hein, Lena
PB - Springer Verlag
T2 - 20th International Conference on Medical Image Computing and Computer-Assisted Intervention, MICCAI 2017
Y2 - 11 September 2017 through 13 September 2017
ER -