motivation approach …gunnar.xyz/sigurdssonspie2014poster.pdf · smoothi motivation w approach...

1
Smoothing fields of weighted collections with applications to diffusion MRI processing Gunnar A. Sigurdsson and Jerry L. Prince Motivation Prior Work Approach Acknowledgements References Results This research was supported in part by Y”“ grants R-CYS-Dk(-F and RPCYS-EPEzCM Image Analysis and Communications Lab, Electrical and Computer Engineering, Johns Hopkins University, Baltimore, MD, USA •Smoothing in the measurement domain •qnisotriopic noise filtering] Sijbers et alM [)] •Yonlocal means] Zuurstra et alM [D] •”mage restoration ¨cJraw et alM [k] •SingleKTensor deKnoising •Tabelow et alM [F]] Uhen et alM [E] No)method)extends)to)multi/tensor)models Phantom This)method Jaussian smoothing ,measurement domainj /T” Uolor map from ¨ultiKtensor data Color)map) after)smoothing Simple fiber tracking before smoothing Simple)fiber)tracking) after)smoothing ”U Oiber tracking before smoothing IC)Fiber)tracking) after)smoothing Internal)Capsule and)Corpus)Callosum ,Coronal)view2 Conclusions •Vnergy minimization for smoothing multiKtensor data •”f populations are sufficiently smooth] the method smooths individual populations without blending •”nfers populations] potential new appliactions •¨ay be combined with measurement domain methods [C] Peled ] SM] Oriman] OM] – olesz] OM] and Westin] UMKOM] “Jeometrically constrained twoKtensor model for crossing tracts in dwi]” ¨agnetic resonance imaging H) ,zj] CPk(–CPF- ,P--kjM [P] ’andman] BM qM] Bogovic] – M qM] Wan] “M] VlShahaby] OM VM ZM] Bazin] PMK’M] and Prince] – M ’M] “Resolution of crossing bers with constrained compressed sensing using diusion tensor mri]” Yeuro”mage Dz,(j] PCFD–PCEk ,P-CPjM [(] Zreher] BM] Schneider] – M] ¨ader] ”M] ¨artin] VM] “ennig] – M] and ”l’yasov] ZM] “¨ultitensor approach for analysis and tracking of complex ber congurations]” ¨agnetic resonance in medicine D),Dj] CPCk–CPPD ,P--DjM [)] Sijbers] – M] den /ekker] qM – M] Van der ’inden] qM] Verhoye] ¨M] and Van /yck] /M] “qdaptive anisotropic noise ltering for magnitude mr data]” ¨agnetic resonance imaging CF,C-j] CD((–CD(z ,CzzzjM [ D] Zuurstra] qM] /olui] SM] and ¨ichailovich] OM] ““ardi denoising using nonlocal means on sP]” in [S P”V ¨edical ”maging] ] E(C)-”–E(C)-”] ”nternational Society for Optics and Photonics , P-CPjM [k] ¨cJraw ] TM] Vemuri] BM]¨Ozarslan] VM] Uhen] YM] and ¨areci] TM] “Variational denoising of diusion weighted mri]” ”nverse Problems and ”maging (k ,)j] kPD ,P--zjM [F] Tabelow ] ZM] Polzehl] – M] Spokoiny] VM] and Voss] “M UM] “/iusion tensor imagingv Structural adaptive smoothing]” Yeuro”mage ([ ,)j] CFk(–CFF( ,P--EjM [E] Uhen] BM and “su] VM WM] “Yoise removal in magnetic resonance diusion tensor imaging]” ¨agnetic Resonance in ¨edicine D),Pj] (z(–)-C ,P--DjM Algorithm •qssumptionsv •The individual)populations)of)orientations)are)smooth •’ocally] each population composes a similar)fraction ,eMgM Population X is F-A of voxel q and neighborsj , j Average CM Oind Uorrespondences ,Separates down to pairs of voxelsj PM ¨ake an orientation more similar to its)relativesA ,qlong the correct geodesicj We define a global smoothness)energy)function),sum of edgesj is the neighborhood of voxel is the squared distance between the orientations is a weight ,edgej between orientations ,nodesj •We can minimize this energy function for using linear programming and using gradient descent along geodesic •Solution for is the smoothest association into populations •Jraphv Between two voxels] all edges leaving a node sum to Standard) DT/MRI Multi/tensor) reconstruction)[G:•:3] Crossing)regions)in)practice: ”deal crossing voxel Yoise Splits Uneven weights qdditional populations SuperiorP Inferior AnteriorP Posterior LeftP Right Goal: ”nfer the populations and smooth them individually Problem: Populations are only locally separable Vxample neural fibers in a region of crossing neural tracts /T” Uolor ¨ap httpvGGiaclMeceMjhuMeduGgunnar •”n this examplev • Two populations of orientations ,population of diffusing water molecules along a fiber orientationj Uorticospinal tract and transverse pontine fibers ,qxial viewj •Idea:)For)a)given)orientation:)parts)of)each)neighboring)voxel) correspond)to)this)and)only)this)orientation •The)weight))))))))))is)the)ʺamount)sharedʺ)between)two) neighboring)orientations •The)energy)function)becomes)a)sum)of)costs)between)ʺrelatedʺ) orientations •/ata after multiKtensor reconstructionv [P] Population (/ ’ocations Voxel Orientation ,Oractional Uontributionj , j Approach

Upload: others

Post on 06-Aug-2020

6 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Motivation Approach …gunnar.xyz/SigurdssonSPIE2014poster.pdf · Smoothi  Motivation W Approach Acknowledgements References Results 8888888Y”“8 8-CY-Dk(-F88PCY-EPEzCM

SmoothingWfieldsWofWweightedWcollectionsWwithWapplicationsWtoWdiffusionWMRIWprocessing

GunnarWA.WSigurdssonWandWJerryWL.WPrince

Motivation

PriorWWork

Approach

Acknowledgements

References

Results

This8research8was8supported8in8part8by8Y”“8grants8R-CYS-Dk(-F8and8RPCYS-EPEzCM

ImageWAnalysisWandWCommunicationsWLab,WElectricalWandWComputerWEngineering,WJohnsWHopkinsWUniversity,WBaltimore,WMD,WUSA

•Smoothing8in8the8measurement8domain888•qnisotriopic8noise8filtering]8Sijbers8et8alM8[)]888•Yonlocal8means]8Zuurstra8et8alM8[D]888•”mage8restoration8¨cJraw8et8alM8[k]•SingleKTensor8deKnoising888•Tabelow8et8alM8[F]]8Uhen8et8alM8[E]

•No)method)extends)to)multi/tensor)models

Phantom This)methodJaussian8smoothing,measurement8domainj

/T”8Uolor8mapfrom8¨ultiKtensor8data

Color)map)after)smoothing

Simple8fiber8tracking8before8smoothing

Simple)fiber)tracking)after)smoothing

”U8Oiber8tracking8before8smoothing

IC)Fiber)tracking)after)smoothing

Internal)Capsuleand)Corpus)Callosum

,Coronal)view2

Conclusions•Vnergy8minimization8for8smoothing8multiKtensor8data•”f8populations8are8sufficiently8smooth]8the8method8888smooths8individual8populations8without8blending•”nfers8populations]8potential8new8appliactions•¨ay8be8combined8with8measurement8domain8methods

86 IN TRODUCT ION

Over the past dozen years5 many methods to reconst ruct neuronal fiber t racts in human white mat ter fromdi usion MRI data have been protocols the opportunity to exploit mult iple direct ions and their fract ionalcont ribut ions—generically referred to as multiGtensor models85 H—within each voxel have been developed6( here6

One way to address noise in di usion MRI data is to smooth the raw adapt ive anisot ropic noise filteringmethod of Sijbers et al6) in their MICCAI fiber cup challenge al6k used a nonlocal means approach5 andMcGraw et al6q used an image restorat ion approach specified by a variat ional formulat ion6 Another point atwhich to carry out smoothing is after tensor reconst ruct ion6 For example5 Tabelow et al6B and Chen et al6E

developed di erent approaches to smooth tensor fields6 However5 neither method generalizes to mult iGtensormodels or other representat ions specifying mult iple orientat ions at each voxel6 Although the smoothing of rawdata can certainly becarried out in mult iGtensor and mult iGorientat ion models Ssince it applies before theanalysisphasej5 the smoothing of mult iGtensor or mult iGorientat ion fields remains an open problem6

In this work we present a method to spat ially smooth an orientat ion field that has been est imated from theraw Sor smoothedj di usion MRI data6 The method considers both mult iple orientat ions and their fract ionalcont ribut ions—i6e65 their memberships—within each voxel6 In order to smooth between voxels5 a correspondenceof orientat ions between each pair of voxels is first solved6 A unique aspect of the present work is that a fuzzycorrespondence that involves both the collect ion of orientat ions and their fract ional cont ribut ions is producedby solving an opt imizat ion criterion6 In this way5 smoothing is carried out between populat ions that are likelyto be associated with each other while erroneous orientat ion associat ions are avoided6 Benefits of this approachare demonst rated on simulated phantom and in vivo data6

REFERENCES

[C] Peled] SM] Oriman] OM] – olesz] O M] and Westin] UMKO M] “Jeometrically constrained twoKtensor model for crossing tractsin dwi]” ¨agnetic resonance imaging H),zj] CPk(–CPF- ,P--kjM

[P] ’andman] B M qM] Bogovic] – M qM] Wan] “M] VlShahaby] O M VM ZM] Bazin] PMK’M] and Prince] – M ’M] “Resolution of crossingfibers with constrained compressed sensing using diffusion tensor mri]” Yeuro”mage Dz,(j] PCFD–PCEk ,P-CPjM

[(] Zreher] B M] Schneider] – M] ¨ader] ”M] ¨artin] VM] “ennig] – M] and ”l’yasov] ZM] “¨ultitensor approach for analysis andtracking of complex fiber configurations]” ¨agnetic resonance in medicine D),Dj] CPCk–CPPD ,P--DjM

[)] Sijbers] – M] den /ekker] qM – M] Van der ’inden] qM] Verhoye] ¨M] and Van /yck] /M] “qdaptive anisotropic noisefiltering for magnitude mr data]” ¨agnetic resonance imaging CF,C-j] CD((–CD(z ,CzzzjM

[D] Zuurstra] qM] /olui] SM] and ¨ichailovich] OM] ““ardi denoising using nonlocal means on sP]” in [SP”V ¨edical”maging]] E(C)-”–E(C)-”] ”nternational Society for Optics and Photonics ,P-CPjM

[k] ¨cJraw] T M] Vemuri] B M]¨Ozarslan] VM] Uhen] YM] and ¨areci] T M] “Variational denoising of diffusion weighted mri]””nverse Problems and ”maging (k,)j] kPD ,P--zjM

[F] Tabelow] ZM] Polzehl] – M] Spokoiny] VM] and Voss] “M UM] “/iffusion tensor imagingv Structural adaptive smoothing]”Yeuro”mage ([,)j] CFk(–CFF( ,P--EjM

[E] Uhen] B M and “su] VM WM] “Yoise removal in magnetic resonance diffusion tensor imaging]” ¨agnetic Resonance in¨edicine D),Pj] (z(–)-C ,P--DjM

Algorithm

•qssumptionsv8888•The8individual)populations)of)orientations)are)smooth8888•’ocally]8each8population8composes8a8similar)fraction888888,eMgM8Population8X8is8F-A8of8voxel8q8and8neighborsj8

, jAverage

CM8Oind8Uorrespondences8,Separates8down8to8pairs8of8voxelsj

PM8¨ake8an8orientation8more8similar8to8its)relativesA8,qlong8the8correct8geodesicj

We8define8a8global8smoothness)energy)function),sum8of8edgesj8

•8888888is8the8neighborhood8of8voxel8888•8888888888888888888is8the8squared8distance8between8the8orientations•88888888is8a8weight8,edgej8between8orientations8,nodesj8

•We8can8minimize8this8energy8function8for8888888888using8linear888programming8and888888using8gradient8descent8along8geodesic•Solution8for8888888888is8the8smoothest8association8into8populations

•Jraphv8Between8two8voxels]8all8edges8leaving8a8node8sum8to

Standard)DT/MRI

Multi/tensor)

reconstruction)[G:•:3]

•Crossing)regions)in)practice:

8888•8888888”deal8crossing8voxel8888•8888888Yoise8888888888888888•8888888Splits8888•8888888Uneven8weights888888888888888•8888888qdditional8populations88888888888888888888888888888888888888

SuperiorPInferior

AnteriorPPosterior

LeftPRight

•Goal: ”nfer8the8populations8and8smooth8them8individually•Problem: Populations8are8only8locally8separable

Vxample8neural8fibers8in8a8region8of8crossing8neural8tracts

/T”8Uolor8¨ap

httpvGGiaclMeceMjhuMeduGgunnar

•”n8this8examplev88•8Two8populations88888of8orientations8888,population8of88888888diffusing8water8888888molecules8along8a888888fiber8orientationj8

Uorticospinal8tract8and8transverse8pontine8fibers8,qxial8viewj

•Idea:)For)a)given)orientation:)parts)of)each)neighboring)voxel)correspond)to)this)and)only)this)orientation•The)weight))))))))))is)the)ʺamount)sharedʺ)between)two)neighboring)orientations•The)energy)function)becomes)a)sum)of)costs)between)ʺrelatedʺ)orientations

•/ata8after8multiKtensor8reconstructionv8[P]

Population(/8’ocations VoxelOrientation

,OractionalUontributionj

,88888888888888888888j

Approach