Adaptively Constrained Convex Optimization for Accurate Fiber Orientation Estimation with High Order Spherical Harmonics
|
|
|
- Kristopher Matthews
- 10 years ago
- Views:
Transcription
1 Adaptively Constrained Convex Optimization for Accurate Fiber Orientation Estimation with High Order Spherical Harmonics Giang Tran 1 and Yonggang Shi 2, 1 Dept. of Mathematics, UCLA, Los Angeles, CA, USA 2 Lab of Neuro Imaging (LONI), UCLA School of Medicine, Los Angeles, CA, USA Abstract. Diffusion imaging data from the Human Connectome Project (HCP) provides a great opportunity to map the whole brain white matter connectivity to unprecedented resolution in vivo. In this paper we develop a novel method for accurately reconstruct fiber orientation distribution from cutting-edge diffusion data by solving the spherical deconvolution problem as a constrained convex optimization problem. With a set of adaptively selected constraints, our method allows the use of high order spherical harmonics to reliably resolve crossing fibers with small separation angles. In our experiments, we demonstrate on simulated data that our algorithm outperforms a popular spherical deconvolution method in resolving fiber crossings. We also successfully applied our method to the multi-shell and diffusion spectrum imaging (DSI) data from HCP to demonstrate its ability in using state-of-the-art diffusion data to study complicated fiber structures. 1 Introduction With the advance of diffusion weighted MR imaging techniques from the Human Connectome Project (HCP) [1, 2], large scale datasets acquired using sophisticated sampling schemes are becoming publicly available. This provides unprecedented opportunities for mapping the white matter fiber structure with higher spatial and angular resolutions. The vast amount of data, however, also poses significant challenges for data analysis algorithms that have focused mostly on conventional, single-shell acquisition schemes. In this work, we propose a novel method for analyzing diffusion images with arbitrary acquisition schemes by accurately reconstructing the fiber orientation distribution (FOD). We demonstrate our method can achieve superior angular resolution and resolve fiber structures on both simulated and in vivo data from the HCP. The diffusion tensor model is practically the most popular method for studying major fiber bundles with diffusion imaging data[3]. For the mapping of whole brain connectivity, however, the tensor model is vastly insufficient as complicated fiber crossings occur frequently throughout the brain. To overcome this difficulty, This work was in part supported by NIH grants K01EB013633, R01MH094343, and P41EB K. Mori et al. (Eds.): MICCAI 2013, Part III, LNCS 8151, pp , c Springer-Verlag Berlin Heidelberg 2013
2 486 G. Tran and Y. Shi various techniques for high angular resolution diffusion imaging (HARDI) were developed [4 9]. By representing the FOD with spherical harmonics, the spherical deconvolution model has demonstrated great potential in efficiently resolving complicated fiber crossings [6, 9]. The ill-posedness of the deconvolution problem, however, has hindered the use of high order spherical harmonics to resolve fibers with small separation angles. To improve numerical stability, Laplacian or Tiknohov regularizations [7, 9] were incorporated, but these models are limited to single-shell acquisition schemes and only partially overcome the difficulty. (a) b value n (b) Fig. 1. An illustration of the two acquisition schemes from the HCP. (a) The multi-shell sampling scheme with 270 directions distributed over three shells with b=1000,2000,3000 s/mm 2. (b) The DSI sampling scheme has 514 directions with b-values increasing from 400 to 10,000 s/mm 2. In this work we propose a new method for FOD estimation from data acquired with general sampling schemes, which enables us to seamlessly process HCP data collected with either the multi-shell or DSI schemes [10] illustrated in Fig. 1. At the core of our method is a constrained convex optimization problem for spherical deconvolution with adaptively chosen constraints. By adaptively selecting a minimal set of uniformly distributed constraints, our method can easily use high order spherical harmonics to reconstruct crossing fibers with very small separation angles. In our experiments, we demonstrate on simulated data that our method outperforms a previous method [9] in reliably resolving fibers with small crossing angles. We also apply it to data from the HCP to demonstrate its generality in processing cutting-edge diffusion imaging data. The rest of the paper is organized as follows. In section 2, we formulate the spherical deconvolution problem in the general setting of analyzing data from arbitrary acquisition schemes. The adaptively constrained convex optimization approach is then developed in section 3. Experimental results are presented in section 4. Finally conclusions are made in section 5. 2 Spherical Deconvolution Model In this section, we develop the spherical deconvolution model for FOD reconstruction from general acquisition schemes. At each voxel, the diffusion signal at the b-value b i and the direction u i is denoted as s(b i,u i )(i =1,,N). Let S denote the unit sphere, and f : S R + the FOD. Given the single fiber response function k(b, u, w) for a fiber in the direction w, the diffusion signal is expressed as the convolution of the FOD and the kernel: s(b, u) = f(w)k(b, u, w)dw + n(b, u) (1) S
3 Adaptively Constrained Convex Optimization 487 where n is noise. Instead of estimating the kernel directly from the data [6], which is difficult for general acquisition schemes such as DSI, we follow the single tensor model and represent the kernel parametrically as: k(b, u, w) =e b(λ2+(λ1 λ2)(u w)2 ). (2) where the only parameters λ 1 >> λ 2 = λ 3 are the eigenvalues of the tensor model. These parameters can be either chosen from previous literature or computed easily from the data. For efficient computation, the FOD is represented with the spherical harmonics up to the order L as: f(w) = l,m x m l Y m l (w) w S (3) where Yl m is the m-th real spherical harmonics at the order l =0, 2,,L, and x m l is the coefficient for the basis Yl m. Note that only even order spherical harmonics are used because the FOD is symmetric on the sphere. From a signal processing perspective, high order spherical harmonics are needed if we want to accurately represent or reconstruct crossing fibers with really small separation angles. Due to numerical difficulties, typically spherical harmonics up to the order of eight were used in previous work [6, 9], which limits their capability in reliably resolving fiber crossing of small angles. Using the Funk-Hecke theorem, we can express the diffusion signal as s(b, u) = x m l Yl m (w)e b(λ2+(λ1 λ2)(u w)2 ) dw + n(b, u) S = l,m l,m Y m l (u)g l (b, λ 1,λ 2 )x m l + n(b, u) (4) with G l (b, λ 1,λ 2 ) defined as: 1 G l (b, λ 1,λ 2 )=2π 1 P l (t)e bλ2 b(λ1 λ2)t2 dt, (5) where P l is the Legendre polynomial of degree l. Let s denote the vector of diffusion signals s(b i,u i ) sampled at a discrete set of points (b i,u i )(i =1,,N). For simplicity, we denote Yl m and x m l by Y j and x j, respectively, with j = m + l2 + l +2. Given the maximum order L of spherical 2 harmonics used, the total number of basis functions is J =(L +1)(L +2)/2. Let x =[x 1,,x j,,x J ] be the vector of coefficients for the FOD, we can write (4) in matrix form as: s = Ax + n (6)
4 488 G. Tran and Y. Shi where n denotes the vector of noise, and A = B G is the entry-wise product of two matrices B and G defined as follows: Y 1(u 1) Y 2(u 1) Y J(u 1) G 0(b 1) G 2(b 1) G 2(b 1) G L(b 1) B = Y 1(u 2) Y 2(u 2) Y J(u 2) G = G 0(b 2) G 2(b 2) G 2(b 2) G L(b 2). Y 1(u N ) Y 2(u N ) Y J(u N ) G 0(b N ) G 2(b N) G 2(b N) G L(b N ) For each order l, the element G l (b i )=G l (b i,λ 1,λ 2 ) is repeated 2l +1timeson the i-th row. 3 Adaptively Constrained Convex Optimization (a) Q = 73. (b) Q = 100. Fig. 2. FOD reconstruction from simulated diffusion data. The true fiber directions are plotted as red lines. In this section, we develop a novel approach for FOD estimation by solving the spherical deconvolution problem as a constrained convex optimization problem. The key idea is the adaptive selection of the set of constraints for every voxel to avoid overly constrain the solution and affect reconstruction accuracy. The constraint we impose on FOD reconstruction is motivated by its non-negativity condition. With the spherical harmonics representation up to a fixed order, however, it is impossible to completely eliminate negative values in the FOD. It is thus critical to limit the negative components to the minimal extent and ensure major fiber directions are captured. To achieve this goal, our strategy is to constraint the FOD to be non-negative on a minimal set of uniformly distributed points on the sphere. With a remeshing algorithm [11], we build a collection of constraint sets V = {V 1,V 2,, } with varying number of points on the sphere, where each member V Q = {vq 1,v2 Q,,vQ Q } is a set of Q uniformly distributed points on the hemisphere of the unit sphere. With the spherical harmonics representation, the requirement that f should be non-negative on V Q can be expressed as: where C Q is a matrix of size Q J defined as C Q x 0 (7) Y 1(vQ) 1 Y 2(vQ) 1 Y J(v 1 Q) C Q = Y 1(vQ) 2 Y 2(vQ) 2 Y J(vQ) 2. Y 1(v Q Q ) Y2(vQ Q ) YJ(vQ Q )
5 Adaptively Constrained Convex Optimization 489 Given a specific constraint set V Q (Q =1, 2, ), the spherical deconvolution problem for FOD reconstruction can be formulated as a constrained convex optimization problem: min s Ax 2 s.t. C Q x 0 (8) Because this problem is convex, global minimum can always be found numerically with software packages such as cvx [12]. With the FOD being non-negative on a set of uniformly distributed points, we ensure that large negative components will not occur and most of the energy of the FOD are contributed by physically meaningful, i.e., positive, components. Because the complexities of fiber crossings are spatially varying across the brain, the number of active constraints in (8) could be different as a result. Thus it is also unreasonable to fix the number of constraints. To overcome this difficulty, we adaptively search through the constraintcollection V ateveryvoxelto find the smallestq such that the solution satisfies: f(w)>0 fdw >δ. (9) f(w)<0 f dw This condition measures how successful the reconstructed FOD is able to focus its energy on positive components. For example, if we pick δ = 25, we ensure more than 95% of the L1 energy of the FOD are from positive components. As a demonstration, we show in Fig. 2 the FOD reconstruction results of two fibers using simulated diffusion data from 60 directions with b=1000 s/mm 2. The maximum order of spherical harmonics used here is L = 8. The result in Fig. 2 (a) is obtained from adaptively determined constraints, where Q = 73, and the result in Fig. 2 (b) is obtained by fixing Q = 100. We can see the overly constrained solution is less sharp and one of its peaks is obviously misaligned with the true fiber direction. For practical implementation, there is no need to start the search from Q =1. Given a maximum order L, we can pick a constraint set from experience and start the search there. For L = 8, we typically start the search at Q =60and the reconstruction of the FOD in Fig. 2(a) took less than one second. 4 Experimental Results In this section, we present experimental results to demonstrate our method on both simulated and in vivo data from the HCP. In our experience, the FOD reconstruction results from our method are very robust to the selection of the parameters in the kernel. For all experiments, we thus fix the parameters for the kernel as λ 1 = and λ 2 = following the literature [9], and the threshold in (9) as δ = 25.
6 490 G. Tran and Y. Shi 4.1 Simulated Data (a) (b) (c) Fig. 3. A comparison of 100 runs of FOD reconstruction results from simulated diffusion data. The cyan surface is the mean FOD and the shaded surface is mean plus two standard deviation of the FOD from 100 runs. Red lines indicate true fiber directions. (a) Method in [9]: L = 8. (b) Method in [9]: L = 16. (c) Our method: L = 16. In the first experiment, we compare with the spherical deconvolution method in [9] on simulated data. For two fibers with a crossing angle of 30 o, we follow the multitensor model to simulate the diffusion data from a singleshell acquisition scheme of 81 directions with b = 3000 s/mm 2. Rician noise was added to obtain a signal to noise ratio of 20. For every parameter selection from both methods, the experiments were run 100 times to obtain the mean and standard deviation of the FOD. For the spherical deconvolution method in [9], the results with the maximum order L =8andL = 16 are plotted in Fig. 3 (a) and (b). At the order of L = 8, we chose the same regularization parameter as in [9]. We can see that the reconstructed FOD at this order cannot resolve the fiber crossing. When the order was increased to L = 16, its result became highly oscillatory even though we increased the regularization parameter to With our adaptively constrained optimization method, such oscillations were successfully suppressed and accurate results were obtained as shown in Fig. 3(c). This demonstrates the superior ability of our method in resolving fiber crossings at small angles with data from single-shell acquisition schemes. 4.2 Multi-shell Data from HCP In the second experiment, we applied our method to the diffusion data of a subject from the HCP that was acquired with a multi-shell sampling scheme as illustrated in Fig. 1 (a). The reconstructed FODs of an ROI on an axial slice, which is shown in Fig. 4(b), in the right thalamus with L =8andL =16 are plotted in Fig. 4 (a) and (c). All FODs are color-coded with the directions. The reconstructed FODs are consistent with known anatomical knowledge that various fibers cross the thalamus to reach different cortical regions. The topright corner of the ROI touches the cortical spinal tract that goes from inferior to the superior part of the brain. At this location, the FOD reconstructed with our method in both Fig. 4 (a) and (c) has only one major fiber direction, which is consistent with the orientation of the cortical-spinal tract. By comparing the results in Fig. 4(a) and (c), especially regions highlighted by the dashed lines, we can clearly see that our method successfully uses high order spherical harmonics to achieve better angular resolution of crossing fibers than results reconstructed with low order spherical harmonics.
7 Adaptively Constrained Convex Optimization 491 (a) L=8. (b) ROI. (c) L=16. Fig. 4. FOD reconstruction results from multi-shell diffusion data of the HCP (a) L = 8. (b) ROI. (c) L = 16. Fig. 5. FOD reconstruction results from DSI data of the HCP 4.3 DSI Data from HCP In the third experiment, we applied our method for FOD reconstruction using DSI data of a subject from the HCP. As illustrated in Fig. 1(b), the diffusion data was acquired at 514 points in the q-space with b-values ranging from 400 to s/mm 2. For an ROI on a coronal slice shown in Fig. 5(b) that has crossing fibers possibly from the corpus callosum, cortical spinal tract, and superior longitudinal fasciculus, we applied our method with L =8andL = 16 to compute the FODs. The reconstructed FODs are plotted in Fig. 5(a) and (c). As a demonstration, we highlighted two FODs with dashed lines in Fig. 5(a) and (c). It clearly shows the
8 492 G. Tran and Y. Shi power of our method in using high order spherical harmonics to resolve crossing fibers with small separation angles. 5 Conclusions In this paper we developed a novel approach for the accurate reconstruction of FODs from arbitrarily sampled diffusion imaging data. By solving the spherical deconvolution as an adaptively constrained convex optimization problem, our method can robustly use high order spherical harmonics to resolve complicated fiber crossings. We demonstrated the power of our method on HCP data from both the multi-shell and DSI acquisition schemes. For future work, we will integrate our method with tractography algorithms and investigate its application in studying whole brain connectivity. References 1. Essen, D.V., Ugurbil, K., et al.: The human connectome project: A data acquisition perspective. NeuroImage 62(4), (2012) 2. Toga, A., Clark, K., Thompson, P., Shattuck, D., Van Horn, J.: Mapping the human connectome. Neurosurgery 71(1), 1 5 (2012) 3. Basser, P.J., Mattiello, J., LeBihan, D.: MR diffusion tensor spectroscopy and imaging. Biophys. J. 66(1), (1994) 4. Tuch, D.S., Reese, T.G., Wiegell, M.R., Makris, N., Belliveau, J.W., Wedeen, V.J.: High angular resolution diffusion imaging reveals intravoxel white matter fiber heterogeneity. Magnetic Resonance in Medicine 48(4), (2002) 5. Behrens, T., Berg, H.J., Jbabdi, S., Rushworth, M., Woolrich, M.: Probabilistic diffusion tractography with multiple fibre orientations: What can we gain? NeuroImage 34(1), (2007) 6. Tournier, J.D., Calamante, F., Gadian, D.G., Connelly, A.: Direct estimation of the fiber orientation density function from diffusion-weighted MRI data using spherical deconvolution. NeuroImage 23(3), (2004) 7. Tournier, J.D., Calamante, F., Connelly, A.: Robust determination of the fibre orientation distribution in diffusion MRI: Non-negativity constrained super-resolved spherical deconvolution. NeuroImage 35(4), (2007) 8. Jian, B., Vemuri, B.: A unified computational framework for deconvolution to reconstruct multiple fibers from diffusion weighted MRI. IEEE Trans. Med. Imag. 26(11), (2007) 9. Descoteaux, M., Deriche, R., Knosche, T., Anwander, A.: Deterministic and probabilistic tractography based on complex fibre orientation distributions. IEEE Trans. Med. Imag. 28(2), (2009) 10. Wedeen, V.J., Hagmann, P., Tseng, W.Y.I., Reese, T.G., Weisskoff, R.M.: Mapping complex tissue architecture with diffusion spectrum magnetic resonance imaging. Magnetic Resonance in Medicine 54(6), (2005) 11. Peyré, G., Cohen, L.: Geodesic remeshing using front propagation. Int l Journal of Computer Vision 69(1), (2006) 12. CVX Research, Inc.: CVX: Matlab software for disciplined convex programming, version 2.0 beta (September 2012),
IMA Preprint Series # 2233
ODF RECONSTRUCTION IN Q-BALL IMAGING WITH SOLID ANGLE CONSIDERATION By Iman Aganj Christophe Lenglet and Guillermo Sapiro IMA Preprint Series # 2233 ( January 2009 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
Generalized Constant Solid Angle ODF and Optimal Acquisition Protocol for Fiber Orientation Mapping
Generalized Constant Solid Angle ODF and Optimal Acquisition Protocol for Fiber Orientation Mapping Amith Kamath 1, Iman Aganj 3,4, Junqian Xu 2, Essa Yacoub 2, Kamil Ugurbil 2, Guillermo Sapiro 5, and
Diffusion MRI imaging for brain connectivity analysis
Diffusion MRI imaging for brain connectivity analysis principles and challenges Prof. Jean-Philippe Thiran EPFL - http://lts5www.epfl.ch - [email protected] From Brownian motion to Diffusion MRI - Motivation
Software Packages The following data analysis software packages will be showcased:
Analyze This! Practicalities of fmri and Diffusion Data Analysis Data Download Instructions Weekday Educational Course, ISMRM 23 rd Annual Meeting and Exhibition Tuesday 2 nd June 2015, 10:00-12:00, Room
Diffusione e perfusione in risonanza magnetica. E. Pagani, M. Filippi
Diffusione e perfusione in risonanza magnetica E. Pagani, M. Filippi DW-MRI DIFFUSION-WEIGHTED MRI Principles Diffusion results from a microspic random motion known as Brownian motion THE RANDOM WALK How
Brain Connectivity using Geodesics in HARDI
Brain Connectivity using Geodesics in HARDI Mickaël Péchaud 12, Renaud Keriven 2, and Maxime Descoteaux 3 1 LIENS, École Normale Supérieure 2 IMAGINE, Université Paris Est 3 Neurospin, IFR 49 CEA Saclay,
Fiber tracking in q-ball fields using regularized particle trajectories
Fiber tracking in q-ball fields using regularized particle trajectories M. Perrin, C. Poupon, Y. Cointepas, B. Rieul, N. Golestani, C. Pallier, D. Rivière, A. Constantinesco, D. Le Bihan, and J.-F. Mangin
DIFFUSION magnetic resonance imaging (MRI) has become
IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 27, NO. 10, OCTOBER 2008 1415 Reduced Encoding Diffusion Spectrum Imaging Implemented With a Bi-Gaussian Model Chun-Hung Yeh, Kuan-Hung Cho, Hsuan-Cheng Lin,
Medical Image Processing on the GPU. Past, Present and Future. Anders Eklund, PhD Virginia Tech Carilion Research Institute [email protected].
Medical Image Processing on the GPU Past, Present and Future Anders Eklund, PhD Virginia Tech Carilion Research Institute [email protected] Outline Motivation why do we need GPUs? Past - how was GPU programming
Neuroimaging module I: Modern neuroimaging methods of investigation of the human brain in health and disease
1 Neuroimaging module I: Modern neuroimaging methods of investigation of the human brain in health and disease The following contains a summary of the content of the neuroimaging module I on the postgraduate
University of California San Francisco, CA, USA 4 Department of Veterans Affairs Medical Center, San Francisco, CA, USA
Disrupted Brain Connectivity in Alzheimer s Disease: Effects of Network Thresholding Madelaine Daianu 1, Emily L. Dennis 1, Neda Jahanshad 1, Talia M. Nir 1, Arthur W. Toga 1, Clifford R. Jack, Jr. 2,
5 Factors Affecting the Signal-to-Noise Ratio
5 Factors Affecting the Signal-to-Noise Ratio 29 5 Factors Affecting the Signal-to-Noise Ratio In the preceding chapters we have learned how an MR signal is generated and how the collected signal is processed
DKE Fiber Tractography Module: User s Guide Version 1 Release Date: July 2015
DKE Fiber Tractography Module: User s Guide Version 1 Release Date: July 2015 Author: G. Russell Glenn, B.S., B.A. Medical Scientist Training Program (MD / PhD) Department of Neurosciences Department of
Graph Embedding to Improve Supervised Classification and Novel Class Detection: Application to Prostate Cancer
Graph Embedding to Improve Supervised Classification and Novel Class Detection: Application to Prostate Cancer Anant Madabhushi 1, Jianbo Shi 2, Mark Rosen 2, John E. Tomaszeweski 2,andMichaelD.Feldman
The Fourth International DERIVE-TI92/89 Conference Liverpool, U.K., 12-15 July 2000. Derive 5: The Easiest... Just Got Better!
The Fourth International DERIVE-TI9/89 Conference Liverpool, U.K., -5 July 000 Derive 5: The Easiest... Just Got Better! Michel Beaudin École de technologie supérieure 00, rue Notre-Dame Ouest Montréal
Cortical Source Localization of Human Scalp EEG. Kaushik Majumdar Indian Statistical Institute Bangalore Center
Cortical Source Localization of Human Scalp EEG Kaushik Majumdar Indian Statistical Institute Bangalore Center Cortical Basis of Scalp EEG Baillet et al, IEEE Sig Proc Mag, Nov 2001, p 16 Mountcastle,
White Matter Supervoxel Segmentation by Axial DP-means Clustering
White Matter Supervoxel Segmentation by Axial DP-means Clustering Ryan P. Cabeen, David H. Laidlaw Computer Science Department, Brown University, RI, USA Abstract. A powerful aspect of diffusion MR imaging
Derive 5: The Easiest... Just Got Better!
Liverpool John Moores University, 1-15 July 000 Derive 5: The Easiest... Just Got Better! Michel Beaudin École de Technologie Supérieure, Canada Email; [email protected] 1. Introduction Engineering
Fast and Sleek Glyph Rendering for Interactive HARDI Data Exploration
Fast and Sleek Glyph Rendering for Interactive HARDI Data Exploration T.H.J.M. Peeters, V. Prčkovska, M. van Almsick, A. Vilanova, B.M. ter Haar Romeny ABSTRACT High angular resolution diffusion imaging
Applications to Data Smoothing and Image Processing I
Applications to Data Smoothing and Image Processing I MA 348 Kurt Bryan Signals and Images Let t denote time and consider a signal a(t) on some time interval, say t. We ll assume that the signal a(t) is
Incorporating Internal Gradient and Restricted Diffusion Effects in Nuclear Magnetic Resonance Log Interpretation
The Open-Access Journal for the Basic Principles of Diffusion Theory, Experiment and Application Incorporating Internal Gradient and Restricted Diffusion Effects in Nuclear Magnetic Resonance Log Interpretation
Camino: Diffusion MRI reconstruction and processing
Camino: Diffusion MRI reconstruction and processing PA Cook, Y Bai, M J Hall, S Nedjati-Gilani, K K Seunarine and DC Alexander Centre for Medical Image Computing, Department of Computer Science, University
2. MATERIALS AND METHODS
Difficulties of T1 brain MRI segmentation techniques M S. Atkins *a, K. Siu a, B. Law a, J. Orchard a, W. Rosenbaum a a School of Computing Science, Simon Fraser University ABSTRACT This paper looks at
MRI DATA PROCESSING. Compiled by: Nicolas F. Lori and Carlos Ferreira. Introduction
MRI DATA PROCESSING Compiled by: Nicolas F. Lori and Carlos Ferreira Introduction Magnetic Resonance Imaging (MRI) is a clinical exam that is safe to the patient. Nevertheless, it s very important to attend
EECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
This material is posted here with permission of the IEEE Such permission of the IEEE does not in any way imply IEEE endorsement of any of Helsinki University of Technology's products or services Internal
Two-Frame Motion Estimation Based on Polynomial Expansion
Two-Frame Motion Estimation Based on Polynomial Expansion Gunnar Farnebäck Computer Vision Laboratory, Linköping University, SE-581 83 Linköping, Sweden [email protected] http://www.isy.liu.se/cvl/ Abstract.
SITE IMAGING MANUAL ACRIN 6698
SITE IMAGING MANUAL ACRIN 6698 Diffusion Weighted MR Imaging Biomarkers for Assessment of Breast Cancer Response to Neoadjuvant Treatment: A sub-study of the I-SPY 2 TRIAL Version: 1.0 Date: May 28, 2012
Computational Optical Imaging - Optique Numerique. -- Deconvolution --
Computational Optical Imaging - Optique Numerique -- Deconvolution -- Winter 2014 Ivo Ihrke Deconvolution Ivo Ihrke Outline Deconvolution Theory example 1D deconvolution Fourier method Algebraic method
GE Medical Systems Training in Partnership. Module 8: IQ: Acquisition Time
Module 8: IQ: Acquisition Time IQ : Acquisition Time Objectives...Describe types of data acquisition modes....compute acquisition times for 2D and 3D scans. 2D Acquisitions The 2D mode acquires and reconstructs
Integration and Visualization of Multimodality Brain Data for Language Mapping
Integration and Visualization of Multimodality Brain Data for Language Mapping Andrew V. Poliakov, PhD, Kevin P. Hinshaw, MS, Cornelius Rosse, MD, DSc and James F. Brinkley, MD, PhD Structural Informatics
A Negative Result Concerning Explicit Matrices With The Restricted Isometry Property
A Negative Result Concerning Explicit Matrices With The Restricted Isometry Property Venkat Chandar March 1, 2008 Abstract In this note, we prove that matrices whose entries are all 0 or 1 cannot achieve
MAGNETIC resonance (MR) image segmentation is fundamental
IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 29, NO. 12, DECEMBER 2010 1959 Coupled Nonparametric Shape and Moment-Based Intershape Pose Priors for Multiple Basal Ganglia Structure Segmentation Mustafa Gökhan
Texture Analysis with MTEX Free and Open Source Software Toolbox
Solid State Phenomena Vol. 160 (2010) pp 63-68 Online available since 2010/Feb/03 at www.scientific.net (2010) Trans Tech Publications, Switzerland doi:10.4028/www.scientific.net/ssp.160.63 Texture Analysis
Low-resolution Character Recognition by Video-based Super-resolution
2009 10th International Conference on Document Analysis and Recognition Low-resolution Character Recognition by Video-based Super-resolution Ataru Ohkura 1, Daisuke Deguchi 1, Tomokazu Takahashi 2, Ichiro
Clarify Some Issues on the Sparse Bayesian Learning for Sparse Signal Recovery
Clarify Some Issues on the Sparse Bayesian Learning for Sparse Signal Recovery Zhilin Zhang and Bhaskar D. Rao Technical Report University of California at San Diego September, Abstract Sparse Bayesian
VEHICLE TRACKING USING ACOUSTIC AND VIDEO SENSORS
VEHICLE TRACKING USING ACOUSTIC AND VIDEO SENSORS Aswin C Sankaranayanan, Qinfen Zheng, Rama Chellappa University of Maryland College Park, MD - 277 {aswch, qinfen, rama}@cfar.umd.edu Volkan Cevher, James
Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections
Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections Maximilian Hung, Bohyun B. Kim, Xiling Zhang August 17, 2013 Abstract While current systems already provide
QAV-PET: A Free Software for Quantitative Analysis and Visualization of PET Images
QAV-PET: A Free Software for Quantitative Analysis and Visualization of PET Images Brent Foster, Ulas Bagci, and Daniel J. Mollura 1 Getting Started 1.1 What is QAV-PET used for? Quantitative Analysis
Sparsity-promoting recovery from simultaneous data: a compressive sensing approach
SEG 2011 San Antonio Sparsity-promoting recovery from simultaneous data: a compressive sensing approach Haneet Wason*, Tim T. Y. Lin, and Felix J. Herrmann September 19, 2011 SLIM University of British
3D Model based Object Class Detection in An Arbitrary View
3D Model based Object Class Detection in An Arbitrary View Pingkun Yan, Saad M. Khan, Mubarak Shah School of Electrical Engineering and Computer Science University of Central Florida http://www.eecs.ucf.edu/
POLITECNICO DI MILANO DIPARTIMENTO DI ELETTRONICA, INFORMAZIONE E BIOINGEGNERIA (DEIB) DOCTORAL PROGRAMME IN BIOENGINEERING
POLITECNICO DI MILANO DIPARTIMENTO DI ELETTRONICA, INFORMAZIONE E BIOINGEGNERIA (DEIB) DOCTORAL PROGRAMME IN BIOENGINEERING MODEL-BASED ANALYSIS OF DIFFUSION MAGNETIC RESONANCE: STUDY OF MICROSTRUCTURAL
MUSIC-like Processing of Pulsed Continuous Wave Signals in Active Sonar Experiments
23rd European Signal Processing Conference EUSIPCO) MUSIC-like Processing of Pulsed Continuous Wave Signals in Active Sonar Experiments Hock Siong LIM hales Research and echnology, Singapore hales Solutions
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION Introduction In the previous chapter, we explored a class of regression models having particularly simple analytical
Subjects: Fourteen Princeton undergraduate and graduate students were recruited to
Supplementary Methods Subjects: Fourteen Princeton undergraduate and graduate students were recruited to participate in the study, including 9 females and 5 males. The mean age was 21.4 years, with standard
Network Analysis I & II
Network Analysis I & II Dani S. Bassett Department of Physics University of California Santa Barbara Outline Lecture One: 1. Complexity in the Human Brain from processes to patterns 2. Graph Theory and
Software package for Spherical Near-Field Far-Field Transformations with Full Probe Correction
SNIFT Software package for Spherical Near-Field Far-Field Transformations with Full Probe Correction Historical development The theoretical background for spherical near-field antenna measurements and
The File-Card-Browser View for Breast DCE-MRI Data
The File-Card-Browser View for Breast DCE-MRI Data Sylvia Glaßer 1, Kathrin Scheil 1, Uta Preim 2, Bernhard Preim 1 1 Department of Simulation and Graphics, University of Magdeburg 2 Department of Radiology,
State of Stress at Point
State of Stress at Point Einstein Notation The basic idea of Einstein notation is that a covector and a vector can form a scalar: This is typically written as an explicit sum: According to this convention,
THEORY, SIMULATION, AND COMPENSATION OF PHYSIOLOGICAL MOTION ARTIFACTS IN FUNCTIONAL MRI. Douglas C. Noll* and Walter Schneider
THEORY, SIMULATION, AND COMPENSATION OF PHYSIOLOGICAL MOTION ARTIFACTS IN FUNCTIONAL MRI Douglas C. Noll* and Walter Schneider Departments of *Radiology, *Electrical Engineering, and Psychology University
Spatial Data Analysis
14 Spatial Data Analysis OVERVIEW This chapter is the first in a set of three dealing with geographic analysis and modeling methods. The chapter begins with a review of the relevant terms, and an outlines
How To Calculate Diffusion Tensor Imaging
Magnetic Resonance in Medicine 61:1336 1349 (2009) The B-Matrix Must Be Rotated When Correcting for Subject Motion in DTI Data Alexander Leemans and Derek K. Jones To estimate diffusion tensor MRI (DTI)
Transmission Line and Back Loaded Horn Physics
Introduction By Martin J. King, 3/29/3 Copyright 23 by Martin J. King. All Rights Reserved. In order to differentiate between a transmission line and a back loaded horn, it is really important to understand
Level Set Evolution Without Re-initialization: A New Variational Formulation
Level Set Evolution Without Re-initialization: A New Variational Formulation Chunming Li 1, Chenyang Xu 2, Changfeng Gui 3, and Martin D. Fox 1 1 Department of Electrical and 2 Department of Imaging 3
32-Channel Head Coil Imaging at 3T
32-Channel Head Coil Imaging at 3T Thomas Benner Athinoula A. Martinos Center for Biomedical Imaging, Department of Radiology, Massachusetts General Hospital and Harvard Medical School, Boston, MA, USA
SYMMETRIC EIGENFACES MILI I. SHAH
SYMMETRIC EIGENFACES MILI I. SHAH Abstract. Over the years, mathematicians and computer scientists have produced an extensive body of work in the area of facial analysis. Several facial analysis algorithms
Analecta Vol. 8, No. 2 ISSN 2064-7964
EXPERIMENTAL APPLICATIONS OF ARTIFICIAL NEURAL NETWORKS IN ENGINEERING PROCESSING SYSTEM S. Dadvandipour Institute of Information Engineering, University of Miskolc, Egyetemváros, 3515, Miskolc, Hungary,
Determining optimal window size for texture feature extraction methods
IX Spanish Symposium on Pattern Recognition and Image Analysis, Castellon, Spain, May 2001, vol.2, 237-242, ISBN: 84-8021-351-5. Determining optimal window size for texture feature extraction methods Domènec
Mean-Shift Tracking with Random Sampling
1 Mean-Shift Tracking with Random Sampling Alex Po Leung, Shaogang Gong Department of Computer Science Queen Mary, University of London, London, E1 4NS Abstract In this work, boosting the efficiency of
SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
Chapter 6. The stacking ensemble approach
82 This chapter proposes the stacking ensemble approach for combining different data mining classifiers to get better performance. Other combination techniques like voting, bagging etc are also described
Feature Point Selection using Structural Graph Matching for MLS based Image Registration
Feature Point Selection using Structural Graph Matching for MLS based Image Registration Hema P Menon Department of CSE Amrita Vishwa Vidyapeetham Coimbatore Tamil Nadu - 641 112, India K A Narayanankutty
DATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
runl I IUI%I/\L Magnetic Resonance Imaging
runl I IUI%I/\L Magnetic Resonance Imaging SECOND EDITION Scott A. HuetteS Brain Imaging and Analysis Center, Duke University Allen W. Song Brain Imaging and Analysis Center, Duke University Gregory McCarthy
Bandwidth analysis of multimode fiber passive optical networks (PONs)
Optica Applicata, Vol. XXXIX, No. 2, 2009 Bandwidth analysis of multimode fiber passive optical networks (PONs) GRZEGORZ STEPNIAK *, LUKASZ MAKSYMIUK, JERZY SIUZDAK Institute of Telecommunications, Warsaw
MedINRIA : Medical Image Navigation and Research Tool by INRIA
MedINRIA : Medical Image Navigation and Research Tool by INRIA Nicolas Toussaint 1, Jean-Christophe Souplet 1, and Pierre Fillard 1 Asclepios Research Team, INRIA Sophia Antipolis, France. {Nicolas.Toussaint,
CALIBRATION OF A ROBUST 2 DOF PATH MONITORING TOOL FOR INDUSTRIAL ROBOTS AND MACHINE TOOLS BASED ON PARALLEL KINEMATICS
CALIBRATION OF A ROBUST 2 DOF PATH MONITORING TOOL FOR INDUSTRIAL ROBOTS AND MACHINE TOOLS BASED ON PARALLEL KINEMATICS E. Batzies 1, M. Kreutzer 1, D. Leucht 2, V. Welker 2, O. Zirn 1 1 Mechatronics Research
Supporting Information
S1 Supporting Information GFT NMR, a New Approach to Rapidly Obtain Precise High Dimensional NMR Spectral Information Seho Kim and Thomas Szyperski * Department of Chemistry, University at Buffalo, The
An Interactive Visualization Tool for Nipype Medical Image Computing Pipelines
An Interactive Visualization Tool for Nipype Medical Image Computing Pipelines Ramesh Sridharan, Adrian V. Dalca, and Polina Golland Computer Science and Artificial Intelligence Lab, MIT Abstract. We present
DtiStudio: Resource program for diffusion tensor computation and fiber bundle tracking
computer methods and programs in biomedicine 81 (2006) 106 116 journal homepage: www.intl.elsevierhealth.com/journals/cmpb DtiStudio: Resource program for diffusion tensor computation and fiber bundle
WAVES AND FIELDS IN INHOMOGENEOUS MEDIA
WAVES AND FIELDS IN INHOMOGENEOUS MEDIA WENG CHO CHEW UNIVERSITY OF ILLINOIS URBANA-CHAMPAIGN IEEE PRESS Series on Electromagnetic Waves Donald G. Dudley, Series Editor IEEE Antennas and Propagation Society,
Impact of Boolean factorization as preprocessing methods for classification of Boolean data
Impact of Boolean factorization as preprocessing methods for classification of Boolean data Radim Belohlavek, Jan Outrata, Martin Trnecka Data Analysis and Modeling Lab (DAMOL) Dept. Computer Science,
MEDIMAGE A Multimedia Database Management System for Alzheimer s Disease Patients
MEDIMAGE A Multimedia Database Management System for Alzheimer s Disease Patients Peter L. Stanchev 1, Farshad Fotouhi 2 1 Kettering University, Flint, Michigan, 48504 USA [email protected] http://www.kettering.edu/~pstanche
INSTRUCTOR WORKBOOK Quanser Robotics Package for Education for MATLAB /Simulink Users
INSTRUCTOR WORKBOOK for MATLAB /Simulink Users Developed by: Amir Haddadi, Ph.D., Quanser Peter Martin, M.A.SC., Quanser Quanser educational solutions are powered by: CAPTIVATE. MOTIVATE. GRADUATE. PREFACE
ParaVision 6. Innovation with Integrity. The Next Generation of MR Acquisition and Processing for Preclinical and Material Research.
ParaVision 6 The Next Generation of MR Acquisition and Processing for Preclinical and Material Research Innovation with Integrity Preclinical MRI A new standard in Preclinical Imaging ParaVision sets a
Inner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
Cryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 12 Block Cipher Standards
Tracking Moving Objects In Video Sequences Yiwei Wang, Robert E. Van Dyck, and John F. Doherty Department of Electrical Engineering The Pennsylvania State University University Park, PA16802 Abstract{Object
A Statistical Framework for Operational Infrasound Monitoring
A Statistical Framework for Operational Infrasound Monitoring Stephen J. Arrowsmith Rod W. Whitaker LA-UR 11-03040 The views expressed here do not necessarily reflect the views of the United States Government,
Comparison of Non-linear Dimensionality Reduction Techniques for Classification with Gene Expression Microarray Data
CMPE 59H Comparison of Non-linear Dimensionality Reduction Techniques for Classification with Gene Expression Microarray Data Term Project Report Fatma Güney, Kübra Kalkan 1/15/2013 Keywords: Non-linear
Accurate and robust image superresolution by neural processing of local image representations
Accurate and robust image superresolution by neural processing of local image representations Carlos Miravet 1,2 and Francisco B. Rodríguez 1 1 Grupo de Neurocomputación Biológica (GNB), Escuela Politécnica
A Performance Comparison of Five Algorithms for Graph Isomorphism
A Performance Comparison of Five Algorithms for Graph Isomorphism P. Foggia, C.Sansone, M. Vento Dipartimento di Informatica e Sistemistica Via Claudio, 21 - I 80125 - Napoli, Italy {foggiapa, carlosan,
Obtaining Knowledge. Lecture 7 Methods of Scientific Observation and Analysis in Behavioral Psychology and Neuropsychology.
Lecture 7 Methods of Scientific Observation and Analysis in Behavioral Psychology and Neuropsychology 1.Obtaining Knowledge 1. Correlation 2. Causation 2.Hypothesis Generation & Measures 3.Looking into
Discrete Frobenius-Perron Tracking
Discrete Frobenius-Perron Tracing Barend J. van Wy and Michaël A. van Wy French South-African Technical Institute in Electronics at the Tshwane University of Technology Staatsartillerie Road, Pretoria,
Models of Cortical Maps II
CN510: Principles and Methods of Cognitive and Neural Modeling Models of Cortical Maps II Lecture 19 Instructor: Anatoli Gorchetchnikov dy dt The Network of Grossberg (1976) Ay B y f (
WAVELET ANALYSIS BASED ULTRASONIC NONDESTRUCTIVE TESTING OF POLYMER BONDED EXPLOSIVE
WAVELET ANALYSIS BASED ULTRASONIC NONDESTRUCTIVE TESTING OF POLYMER BONDED EXPLOSIVE Weibin Zhang, Yong Tian, Zhanfeng Yang, Liling Wang Institute of Chemical Materials, China Academy of Engineering Physics,
