A System Identification Approach to Estimating a Dynamic Model of Head Motion for MRI Motion Correction
|
|
- Arabella Woods
- 6 years ago
- Views:
Transcription
1 A System Identification Approach to Estimating a Dynamic Model of Head Motion for MRI Motion Correction Burak Erem 1, Onur Afacan 1, Ali Gholipour 1, Sanjay P. Prabhu 2, and Simon K. Warfield 1 1 Computational Radiology Laboratory, Radiology Department, Boston Children s Hospital 2 Advanced Image Analysis Lab, Radiology Department, Boston Children s Hospital Abstract. Motion-compensated MRI is a promising technique to mitigate the effects of motion on MRI. This works best when accurate realtime motion measurements are available. Many measurement techniques track motion with a delay and produce noisy measurements. We propose an estimator that uses a dynamic system identification approach to estimate rigid body head motion from concurrent measurements of position and orientation, which can be used to predict motion shortly into the future. We compare our method to static estimates and a Kalman filter-based method in our experiments, in which we evaluate the effects of motion using real and simulated tracking data. 1 Introduction Magnetic resonance imaging (MRI) is highly sensitive to patient motion, resulting in image artifacts that can severely limit the diagnostic quality of images. In neuroimaging, uncontrolled motion of the patient s head can be a particularly problematic source of image artifacts, and a common clinical solution is to perform imaging after the patient has been sedated or anesthetized, both of which are associated with various health risks. An alternative solution motioncompensated MRI is possible when measurements of the patient s head motion during scanning are available. Given motion measurements, a number of different approaches have been proposed to compensate for motion that occurs during a scan (e.g., [1, 2]). These approaches model the motion of the head as rigid body motion, and can work well when motion measurements are accurate and available in real time. In practice, however, the effective precision of any motion measurement technology will be limited because measurements will invariably contain some amount of noise, which in turn will adversely affect the estimates of rigid body motion parameters. Moreover, many such technologies are limited in the rate at which they can make motion measurements, and, crucially, they measure the motion that occurs before (and not during) the stages of a pulse sequence when the field-of-view (FOV) needs to be adjusted to acquire the correct data. These limitations prevent current methods from fully realizing the potential of motion-compensated MRI.
2 2 Authors Suppressed Due to Excessive Length In this paper, we propose an algorithmic method that addresses some of the aforementioned limitations of motion measurements for motion-compensated MRI. Given concurrent measurements of multiple correspondence points and orientations from the head, we are able to simultaneously estimate rigid body motion parameters and their dynamics, which can be used to predict parameters that occur shortly after measurement times. The method is based on recent work on fast methods for robust dynamical system identification, published in the control theory literature, that allows for simultaneously denoising and estimating the dynamics of a noisy sequence of data [3]. The present work extends that work by incorporating a model of rigid body motion that directly relates motion parameters to measurements, and otherwise paring down the optimization problem to suit the present application. We evaluate the proposed method using experiments on real and simulated data, and compare the results of our approach to previous approaches. The dynamic estimates resulting from this algorithm outperform static estimates of rigid body motion parameters, as well as an approach based on a previously published Kalman filtering method that was proposed for this purpose [4]. 2 Background 2.1 Measurements of Positions and Orientations Several technologies exist that offer the possibility of measuring motion in an MRI scanner, such as image registration of navigators acquired between repetitions of a pulse sequence, optical trackers, and electromagnetic trackers. It would be useful to have a common framework to use the data measured from them. One possibility, which is the one we will adopt in the sequel, is that each tracker returns one or more of two basic types of tracking data: (1) corresponding points (i.e., time-varying points that move with the object of interest), or (2) corresponding orientations (i.e., time-varying vectors that move with the orientation of the object). 2.2 Model of Rigid Body Motion In MRI motion compensation for neuroimaging, the head and brain are typically modeled as a single rigid body. This is an approximation, since the brain itself is able to move within the head, and thus the true transformation of the geometry is not strictly limited to rotation and translation. However, as an MRI scanner is also limited to adjusting the FOV using only rotation and translation, it is also an adequate approximation for the purposes of motion compensation. Mathematically, rigid body motion of a set of points at any given time can be stated as the rotation and translation of a set of reference points. Let P (t) = [ p1 (t) p N (t) ] be a 3 N matrix containing a set of position vectors (one in each column) in R 3 at time t. Also let P (0) be the matrix containing the set of reference points (which we always take to be the initial positions measured from
3 Sys. Ident. Estimation of Dynamic Head Motion for MRI Motion Correction 3 the trackers). Then rigid body motion of the object containing these reference points can be described by rotation, R(t) SO(3) R 3 3, and translation, p(t) R 3, as P (t) = R(t)P (0) + p(t)1 1 N, (1) where 1 1 N is a constant 1 N matrix (i.e., row vector) containing N ones. Note that SO(3) here denotes the rotation group, or equivalently the special orthogonal group in 3 dimensions. One could also perform a similar transformation on orientation vectors, which can simply be regarded as correspondence points at the origin which never undergo translation. Therefore, if we let V (t) = [ v 1 (t) v M (t) ] be a 3 M matrix containing set of orientation vectors (one in each column) in R 3 at time t, one can describe the effect of rigid body motion on the reference orientation vectors, V (0) (again, taken as the initial orientations measured from the trackers), as V (t) = R(t)V (0). (2) 2.3 Dynamic System Identification from the Hankel Matrix The problem of dynamic system identification from noisy measurements is a classic problem in control theory as well as one that is the focus of ongoing research (e.g., fast methods [3]). A discrete-time linear time invariant system with states, x(t) R n, and observations, y(t) R m, that has no inputs can be described using state space equations x(t + 1) = Ax(t) (3) y(t) = Bx(t) + η(t), (4) where η(t) is noise that perturbs the observations. The problem of system identification in this case is to estimate A and x(t) from a sequence of noisy measurements, y(t), and given the observation matrix B. Note that, in general, the model order n is also unknown and must either be estimated or assumed a priori. A well-known result in the control theory literature is that the rank of a Hankel matrix H x,w (t) = x(t w) x(t w/2) x(t w/2) x(t) (5) constructed from the sequence of states x(t τ),..., x(t) is n. Such a matrix can be used to solve for the matrix A using the Ho-Kalman realization theorem [3], which can be used to predict future states of the system from known previous states. In theory, when the system is observable, and in the absence of noise, one can construct a similar Hankel matrix from the sequence of observations y(t τ),..., y(t) whose rank should also be n, but in practice noise prevents this from being the case. To overcome this, the problem can been recast as an optimization problem that aims to approximate the sequence of observations within a specified error bound, ɛ, while minimizing the nuclear norm (, as a
4 4 Authors Suppressed Due to Excessive Length surrogate for the rank) of the Hankel matrix constructed from them. Formally, this is stated as min ŷ(t w),...,ŷ(t) H ŷ,w(t) subject to ŷ(t ) y(t ) ɛ, t = t w,..., t. This allows one to simultaneously filter y(t), while estimating a low-rank Hankel matrix that can be factored to find the matrix A. Note that this problem can also be used for prediction of y(t + 1), without needing to explicitly solve for A, by adding ŷ(t + 1) as an optimization variable, substituting Hŷ,w+1 (t + 1) as the objective function, but only imposing the bound constraints for t = t w,..., t. This is a so-called inpainting approach to prediction, which works by forcing ŷ(t + 1) to obey the dynamics in ŷ(t w),..., ŷ(t) due to nuclear norm minimization. A fast algorithm was proposed by Ayazoglu et al. to solve problems of this form, based on the alternating directions method of multipliers (ADMM) [3]. For our work, we have implemented a pared-down version of the more general solver, which enables our problem to be solved on the order of tens of milliseconds on commonly available computing hardware. (6) 3 Methods In (1) & (2), we specified the relationship between correspondence points (and orientations) and rigid body motion parameters, R(t) and p(t). However, these equations are not in the expected form for the observation equations of a dynamical system, as written in (4). In this section, we first transform the equations into the appropriate form for use in system identification, i.e., such that they can be adapted to the estimation framework presented in Sec Then we present the complete dynamical parameter estimation problem, combining the rigid body motion model and the optimization problem for system identification. 3.1 Observation Model from Rigid Body Motion Parameters Let vec( ) denote the vectorization operator that takes a matrix as input and returns a vector by linearly indexing the matrix, effectively stacking the columns of the matrix on top of each other, and denote the Kronecker product. A wellknown result is vec(abc) = (C T A) vec(b). We use this relationship to convert (1) & (2) into the form of (4). Thus (1) and (2) become vec(p (t)) = (P (0) T I) vec(r(t)) + (1 N 1 I) p(t), (7) vec(v (t)) = (V (0) T I) vec(r(t)), (8) where I is a 3 3 identity matrix. These equations can be consolidated into a block matrix-vector system, y(t) = Bx(t), where [ ] [ ] [ ] vec(p (t)) (P (0) y(t) =, B = T I) (1 N 1 I) vec(r(t)) vec(v (t)) (V (0) T, x(t) =, (9) I) (0 3M 3 ) p(t)
5 Sys. Ident. Estimation of Dynamic Head Motion for MRI Motion Correction 5 and 0 3M 3 denotes a 3M 3 constant matrix of zeros. Note that, although the rotation matrices R(t) belong to a nonlinear manifold, namely SO(3), this result shows that our observation model is linear (i.e., it linearly maps between nonlinear manifolds). In the sequel, we will use these matrices in an estimation problem, similar to one presented in (6), to predict rigid body motion from a sequence of measured correspondence points and orientations. 3.2 Simultaneous Estimation of Rigid Body Motion Parameters and their Dynamics Here we combine the system identification framework in Sec. 2.3 with the observation equation, (9), by imposing additional constraints on the optimization problem in (6). This results in simultaneous predictions of R(t + 1) R 3 3 and p(t + 1) R 3, as well as their dynamics. Note that, rather than constraining solutions such that R(t + 1) SO(3) during the optimization problem, we first solve a relaxed version of the problem in R 3 3 and then project the solution to SO(3). Thus the dynamic prediction problem can be stated as min ˆx(t w),...,ˆx(t+1) H ŷ,w+1(t + 1) subject to ŷ(t ) y(t ) ɛ, t = t w,..., t ŷ(t ) = Bˆx(t ), t = t w,..., t + 1, (10) where y, B, and x are as defined in (9). We adapted our solver for (6) to also solve problem (10). After optimization, the matrix ˆR(t + 1) is extracted from ˆx(t + 1) and then projected to the nearest matrix (in the Frobenius norm sense) in SO(3). The projection is performed using the Kabsch algorithm, first by computing the singular value decomposition USV = ˆR(t + 1), and then replacing ˆR(t + 1) by UDV, where D = diag([1 1 sign(det(uv ))]). The parameters p(t + 1) can be extracted directly from ˆx(t + 1) without further processing. An important parameter of this algorithm is w, which is an upper bound on the order of the dynamical system that can be identified, and thus we study the sensitivity of the algorithm to choice of w in the experiments. 4 Experiments We evaluate our methods using experiments on both simulated and measured motion and image data. In the first experiment, we analyze the effect of parameter choices on the performance of the proposed estimator on motion measurements from an electromagnetic tracker placed on an adult volunteer undergoing MRI. In the next experiment, we simulate motion on an image of a phantom as well as noisy motion measurements, and show how the proposed estimator affects motion correction results when motion correction is applied prospectively (i.e., when FOV adjustments are made in real time). For a comparison, we implemented an unscented Kalman filter (UKF) using the state update equation x(t + 1) = x(t) + γ(t) (i.e., purely noise-driven
6 6 Authors Suppressed Due to Excessive Length Fig. 1. Sensitivity of our proposed estimator and the unscented Kalman filter (UKF) to their respective parameter choices that control the tracking dynamics. Top-left shows tracking results during motion and motion-free time (MFT). Top-right shows the performance tradeoff of both estimators during MFT. Topleft and bottom-left show that it is difficult to tune the UKF to converge to the measured data after motion ceases and MFT commences, whereas our proposed method converges quickly in both cases. dynamics as in [4]). Here γ is random process noise, assumed to be normally distributed with zero mean and covariance νi. We also used our observation model, but with a nonlinear parameterization of the rotation matrix using the matrix exponential, R(t) = exp(s(t)), of a skew symmetric matrix, S(t), whose only free parameters are its three upper triangular elements s 1,2 (t), s 1,3 (t), and s 2,3 (t). In all experiments, in both our method and the UKF, we assumed that the observation noise was normally distributed with zero mean and standard deviation ɛ = 0.1mm. When appropriate, we also compared our results to static estimates of rigid body motion parameters, obtained by projecting the least squares solution of the observation equation at one time instant to SO(3). The purpose of these comparisons was to evaluate the effect of incorporating system identification as part of the estimation procedure, as opposed to assuming a priori that there are only noise-driven dynamics (e.g., UKF) or that the dynamics can be ignored during estimation (e.g., static estimate). 4.1 Parameter Sensitivity In the method we proposed, the parameter w controls the maximum order of the dynamic system that can be identified. In the UKF, since A = I, the dynamics are assumed to be solely influenced by the noise variance parameter, ν. In this
7 Sys. Ident. Estimation of Dynamic Head Motion for MRI Motion Correction 7 Fig. 2. Simulated prospective motion correction results using: ground truth motion (top-left), the proposed approach (top-right, NRMSE=0.08), static estimate (bottomleft, NRMSE=0.10), and UKF estimate (bottom-right, NRMSE=0.13). A zoomed in view of the dots in the phantom show the effects of each approach on image details. experiment, we obtained real motion measurements from an electromagnetic tracker placed on the head of an adult volunteer that was instructed when to move. The scan contained ample motion-free time (MFT) (Fig. 1 top-left), and it is critical to correctly estimate patient motion during this time in order to efficiently utilize as much uncorrupted data as possible. To test the sensitivity of each algorithm to parameter choices, we applied our method using a large range of w parameters, from 10 to 100, and the UKF for a large range of ν parameters, from 1e-10 to 1. The performance of each estimate was evaluated using two criteria: (1) the mean absolute error between the predicted observations and the measured observations during MFT, and (2) the standard deviation of the estimates about their own means during MFT. In Fig. 1 top-right we show a plot of how the performance of each estimator varies according to these two criteria
8 8 Authors Suppressed Due to Excessive Length as the parameters are varied. This plot shows that there is a tradeoff between the two performance criteria, and that our estimator outperforms the UKF. The two plots on the left show the tracking results for two different parameter choices of both our method and the UKF. The top-left plot shows how choosing the parameter for the UKF that corresponds to the corner of the tradeoff curve can yield poor tracking results, and the bottom-left plot shows that even when it is fined-tuned for this specific example, it is slower to converge than our method during MFT. Each tracking sample corresponds to one k-space line, which means that even in the better case (bottom-left), the slow convergence of the UKF means that it can corrupt several hundred k-space lines, which will result in lower quality images. 4.2 Simulated Prospective Motion Correction For our second experiment, we simulated prospective motion correction using static motion estimates, UKF motion estimates, and our proposed method. It was necessary for this experiment to use simulated data to be able to identically repeat the same experiment for each of the estimators. Thus we used a 2D image of the American College of Radiology (ACR) phantom acquired in simulations with 2D radial sampling. During radial sampling, simulated translations and rotations were applied according to a predetermined ground truth trajectory of motions that were applied for each experiment identically. The same motion transformations were also applied to correspondence points and vectors, and noise was added to simulate noisy measurements from an electromagnetic tracker (as though it were placed on the phantom to track its motion). Each of the estimation procedures were applied to the same noisy sequence of data, and our method was used to predict one discrete time step into the future. Motion correction was applied prospectively in the simulated radial sampling for each of the three estimators. In addition, a gold standard radial reconstruction was produced by performing prospective correction using the ground truth motion parameters as input, which is essentially a radial reconstruction with no motion. The resulting reconstructed images are shown in Fig. 2. We also show zoomed in views of the dots in each image, which demonstrate the effects of the different types of estimation errors on the image details. The gold standard radial reconstruction was used to calculate normalized root mean squared errors (NRMSE) for each of the reconstructions based on motion estimates. Our method performed the best (NRMSE=0.08), the static estimate was second-best (NRMSE=0.10), and the UKF estimate performed the worst (NRMSE=0.13). 5 Conclusion In this work we show that a dynamic system identification approach can be used to improve motion correction of MRI. In our experiments, we found that the performance of our proposed method was less sensitive to the parameter choice (of maximum allowed system order) than the UKF s parameter choice (of the
9 Sys. Ident. Estimation of Dynamic Head Motion for MRI Motion Correction 9 amplitude of the noise assumed to be driving the dynamics). Our results suggest that learning the dynamics from the data is better than ignoring them with a static estimate, and that both are better than assuming an incorrect model of the dynamics a priori. References 1. Pipe, J.G., et al.: Motion correction with propeller mri: application to head motion and free-breathing cardiac imaging. Magnetic Resonance in Medicine 42(5) (1999) Zaitsev, M., Dold, C., Sakas, G., Hennig, J., Speck, O.: Magnetic resonance imaging of freely moving objects: prospective real-time motion correction using an external optical motion tracking system. Neuroimage 31(3) (2006) Ayazoglu, M., Sznaier, M.: An algorithm for fast constrained nuclear norm minimization and applications to systems identification. In: IEEE CDC (2012) 4. White, N., Roddey, C., Shankaranarayanan, A., Han, E., Rettmann, D., Santos, J., Kuperman, J., Dale, A.: Promo: Real-time prospective motion correction in mri using image-based tracking. Magnetic Resonance in Medicine 63(1) (2010)
Functional MRI in Clinical Research and Practice Preprocessing
Functional MRI in Clinical Research and Practice Preprocessing fmri Preprocessing Slice timing correction Geometric distortion correction Head motion correction Temporal filtering Intensity normalization
More informationSPM8 for Basic and Clinical Investigators. Preprocessing. fmri Preprocessing
SPM8 for Basic and Clinical Investigators Preprocessing fmri Preprocessing Slice timing correction Geometric distortion correction Head motion correction Temporal filtering Intensity normalization Spatial
More informationEPI Data Are Acquired Serially. EPI Data Are Acquired Serially 10/23/2011. Functional Connectivity Preprocessing. fmri Preprocessing
Functional Connectivity Preprocessing Geometric distortion Head motion Geometric distortion Head motion EPI Data Are Acquired Serially EPI Data Are Acquired Serially descending 1 EPI Data Are Acquired
More informationSPM8 for Basic and Clinical Investigators. Preprocessing
SPM8 for Basic and Clinical Investigators Preprocessing fmri Preprocessing Slice timing correction Geometric distortion correction Head motion correction Temporal filtering Intensity normalization Spatial
More informationBasic fmri Design and Analysis. Preprocessing
Basic fmri Design and Analysis Preprocessing fmri Preprocessing Slice timing correction Geometric distortion correction Head motion correction Temporal filtering Intensity normalization Spatial filtering
More informationClassification of Subject Motion for Improved Reconstruction of Dynamic Magnetic Resonance Imaging
1 CS 9 Final Project Classification of Subject Motion for Improved Reconstruction of Dynamic Magnetic Resonance Imaging Feiyu Chen Department of Electrical Engineering ABSTRACT Subject motion is a significant
More informationRECOVERY OF PARTIALLY OBSERVED DATA APPEARING IN CLUSTERS. Sunrita Poddar, Mathews Jacob
RECOVERY OF PARTIALLY OBSERVED DATA APPEARING IN CLUSTERS Sunrita Poddar, Mathews Jacob Department of Electrical and Computer Engineering The University of Iowa, IA, USA ABSTRACT We propose a matrix completion
More informationSuper-resolution Reconstruction of Fetal Brain MRI
Super-resolution Reconstruction of Fetal Brain MRI Ali Gholipour and Simon K. Warfield Computational Radiology Laboratory Children s Hospital Boston, Harvard Medical School Worshop on Image Analysis for
More informationMRI Reconstruction using Real-Time Motion Tracking: A Simulation Study
MRI Reconstruction using Real-Time Motion Tracking: A Simulation Study Jeff Orchard David R. Cheriton School of Computer Science University of Waterloo Waterloo, ON Canada, N2L 3G1 e-mail: jorchard@uwaterloo.ca
More informationData-driven modeling: A low-rank approximation problem
1 / 31 Data-driven modeling: A low-rank approximation problem Ivan Markovsky Vrije Universiteit Brussel 2 / 31 Outline Setup: data-driven modeling Problems: system identification, machine learning,...
More informationSubspace Clustering with Global Dimension Minimization And Application to Motion Segmentation
Subspace Clustering with Global Dimension Minimization And Application to Motion Segmentation Bryan Poling University of Minnesota Joint work with Gilad Lerman University of Minnesota The Problem of Subspace
More informationPartial Calibration and Mirror Shape Recovery for Non-Central Catadioptric Systems
Partial Calibration and Mirror Shape Recovery for Non-Central Catadioptric Systems Abstract In this paper we present a method for mirror shape recovery and partial calibration for non-central catadioptric
More informationTHE COMPUTER MODELLING OF GLUING FLAT IMAGES ALGORITHMS. Alekseí Yu. Chekunov. 1. Introduction
MATEMATIČKI VESNIK MATEMATIQKI VESNIK 69, 1 (2017), 12 22 March 2017 research paper originalni nauqni rad THE COMPUTER MODELLING OF GLUING FLAT IMAGES ALGORITHMS Alekseí Yu. Chekunov Abstract. In this
More informationParameter Estimation in Differential Equations: A Numerical Study of Shooting Methods
Parameter Estimation in Differential Equations: A Numerical Study of Shooting Methods Franz Hamilton Faculty Advisor: Dr Timothy Sauer January 5, 2011 Abstract Differential equation modeling is central
More informationFunction approximation using RBF network. 10 basis functions and 25 data points.
1 Function approximation using RBF network F (x j ) = m 1 w i ϕ( x j t i ) i=1 j = 1... N, m 1 = 10, N = 25 10 basis functions and 25 data points. Basis function centers are plotted with circles and data
More informationTHE COMPUTER MODELLING OF GLUING FLAT IMAGES ALGORITHMS. Alekseí Yu. Chekunov. 1. Introduction
MATEMATIQKI VESNIK Corrected proof Available online 01.10.2016 originalni nauqni rad research paper THE COMPUTER MODELLING OF GLUING FLAT IMAGES ALGORITHMS Alekseí Yu. Chekunov Abstract. In this paper
More informationarxiv: v3 [math.na] 14 Jun 2018
LAP: A LINEARIZE AND PROJECT METHOD FOR SOLVING INVERSE PROBLEMS WITH COUPLED VARIABLES JAMES L. HERRING, JAMES G. NAGY, AND LARS RUTHOTTO arxiv:1705.09992v3 [math.na] 14 Jun 2018 Abstract. Many inverse
More informationUsing Subspace Constraints to Improve Feature Tracking Presented by Bryan Poling. Based on work by Bryan Poling, Gilad Lerman, and Arthur Szlam
Presented by Based on work by, Gilad Lerman, and Arthur Szlam What is Tracking? Broad Definition Tracking, or Object tracking, is a general term for following some thing through multiple frames of a video
More informationLocally Weighted Least Squares Regression for Image Denoising, Reconstruction and Up-sampling
Locally Weighted Least Squares Regression for Image Denoising, Reconstruction and Up-sampling Moritz Baecher May 15, 29 1 Introduction Edge-preserving smoothing and super-resolution are classic and important
More informationAN ALGORITHM FOR BLIND RESTORATION OF BLURRED AND NOISY IMAGES
AN ALGORITHM FOR BLIND RESTORATION OF BLURRED AND NOISY IMAGES Nader Moayeri and Konstantinos Konstantinides Hewlett-Packard Laboratories 1501 Page Mill Road Palo Alto, CA 94304-1120 moayeri,konstant@hpl.hp.com
More informationA Novel Iterative Thresholding Algorithm for Compressed Sensing Reconstruction of Quantitative MRI Parameters from Insufficient Data
A Novel Iterative Thresholding Algorithm for Compressed Sensing Reconstruction of Quantitative MRI Parameters from Insufficient Data Alexey Samsonov, Julia Velikina Departments of Radiology and Medical
More informationPartial Calibration and Mirror Shape Recovery for Non-Central Catadioptric Systems
Partial Calibration and Mirror Shape Recovery for Non-Central Catadioptric Systems Nuno Gonçalves and Helder Araújo Institute of Systems and Robotics - Coimbra University of Coimbra Polo II - Pinhal de
More informationFMRI Pre-Processing and Model- Based Statistics
FMRI Pre-Processing and Model- Based Statistics Brief intro to FMRI experiments and analysis FMRI pre-stats image processing Simple Single-Subject Statistics Multi-Level FMRI Analysis Advanced FMRI Analysis
More informationData-driven modeling: A low-rank approximation problem
1 / 34 Data-driven modeling: A low-rank approximation problem Ivan Markovsky Vrije Universiteit Brussel 2 / 34 Outline Setup: data-driven modeling Problems: system identification, machine learning,...
More informationMotion Artifacts and Suppression in MRI At a Glance
Motion Artifacts and Suppression in MRI At a Glance Xiaodong Zhong, PhD MR R&D Collaborations Siemens Healthcare MRI Motion Artifacts and Suppression At a Glance Outline Background Physics Common Motion
More informationPre-processing of ASL data T CT
Wed October 2, 2013 Image Processing Pre-processing: motion correction, denoising, outlier detection Alessandra Bertoldo Pre-processing of ASL data T CT C T C Single TI ASL T T T T C CCC average Pre-processing
More informationCompressed Sensing for Rapid MR Imaging
Compressed Sensing for Rapid Imaging Michael Lustig1, Juan Santos1, David Donoho2 and John Pauly1 1 Electrical Engineering Department, Stanford University 2 Statistics Department, Stanford University rapid
More information55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography Estimating homography from point correspondence
More informationCS231A Course Notes 4: Stereo Systems and Structure from Motion
CS231A Course Notes 4: Stereo Systems and Structure from Motion Kenji Hata and Silvio Savarese 1 Introduction In the previous notes, we covered how adding additional viewpoints of a scene can greatly enhance
More informationCS 664 Structure and Motion. Daniel Huttenlocher
CS 664 Structure and Motion Daniel Huttenlocher Determining 3D Structure Consider set of 3D points X j seen by set of cameras with projection matrices P i Given only image coordinates x ij of each point
More informationDENOISING OF COMPUTER TOMOGRAPHY IMAGES USING CURVELET TRANSFORM
VOL. 2, NO. 1, FEBRUARY 7 ISSN 1819-6608 6-7 Asian Research Publishing Network (ARPN). All rights reserved. DENOISING OF COMPUTER TOMOGRAPHY IMAGES USING CURVELET TRANSFORM R. Sivakumar Department of Electronics
More informationStereo and Epipolar geometry
Previously Image Primitives (feature points, lines, contours) Today: Stereo and Epipolar geometry How to match primitives between two (multiple) views) Goals: 3D reconstruction, recognition Jana Kosecka
More informationClassification: Feature Vectors
Classification: Feature Vectors Hello, Do you want free printr cartriges? Why pay more when you can get them ABSOLUTELY FREE! Just # free YOUR_NAME MISSPELLED FROM_FRIEND... : : : : 2 0 2 0 PIXEL 7,12
More informationShape-based Diffeomorphic Registration on Hippocampal Surfaces Using Beltrami Holomorphic Flow
Shape-based Diffeomorphic Registration on Hippocampal Surfaces Using Beltrami Holomorphic Flow Abstract. Finding meaningful 1-1 correspondences between hippocampal (HP) surfaces is an important but difficult
More informationMRI Hot Topics Motion Correction for MR Imaging. medical
MRI Hot Topics Motion Correction for MR Imaging s medical Motion Correction for MR Imaging Kyle A. Salem, PhD Motion Artifacts in a Clinical Setting Patient motion is probably the most common cause of
More informationAn idea which can be used once is a trick. If it can be used more than once it becomes a method
An idea which can be used once is a trick. If it can be used more than once it becomes a method - George Polya and Gabor Szego University of Texas at Arlington Rigid Body Transformations & Generalized
More informationA Non-Linear Image Registration Scheme for Real-Time Liver Ultrasound Tracking using Normalized Gradient Fields
A Non-Linear Image Registration Scheme for Real-Time Liver Ultrasound Tracking using Normalized Gradient Fields Lars König, Till Kipshagen and Jan Rühaak Fraunhofer MEVIS Project Group Image Registration,
More informationAlgebraic Iterative Methods for Computed Tomography
Algebraic Iterative Methods for Computed Tomography Per Christian Hansen DTU Compute Department of Applied Mathematics and Computer Science Technical University of Denmark Per Christian Hansen Algebraic
More informationAN ANALYSIS OF ITERATIVE ALGORITHMS FOR IMAGE RECONSTRUCTION FROM SATELLITE EARTH REMOTE SENSING DATA Matthew H Willis Brigham Young University, MERS Laboratory 459 CB, Provo, UT 8462 8-378-4884, FAX:
More informationAdaptive algebraic reconstruction technique
Adaptive algebraic reconstruction technique Wenkai Lua) Department of Automation, Key State Lab of Intelligent Technology and System, Tsinghua University, Beijing 10084, People s Republic of China Fang-Fang
More informationDirect Matrix Factorization and Alignment Refinement: Application to Defect Detection
Direct Matrix Factorization and Alignment Refinement: Application to Defect Detection Zhen Qin (University of California, Riverside) Peter van Beek & Xu Chen (SHARP Labs of America, Camas, WA) 2015/8/30
More informationBlur Space Iterative De-blurring
Blur Space Iterative De-blurring RADU CIPRIAN BILCU 1, MEJDI TRIMECHE 2, SAKARI ALENIUS 3, MARKKU VEHVILAINEN 4 1,2,3,4 Multimedia Technologies Laboratory, Nokia Research Center Visiokatu 1, FIN-33720,
More informationI How does the formulation (5) serve the purpose of the composite parameterization
Supplemental Material to Identifying Alzheimer s Disease-Related Brain Regions from Multi-Modality Neuroimaging Data using Sparse Composite Linear Discrimination Analysis I How does the formulation (5)
More informationProspective Motion Correction for Functional MRI Using Sparsity and Kalman Filtering
Prospective Motion Correction for Functional MRI Using Sparsity and Kalman Filtering Daniel S. Weller a, Douglas C. Noll b, and Jeffrey A. Fessler a,b a EECS Department, University of Michigan, Ann Arbor,
More informationClinical Importance. Aortic Stenosis. Aortic Regurgitation. Ultrasound vs. MRI. Carotid Artery Stenosis
Clinical Importance Rapid cardiovascular flow quantitation using sliceselective Fourier velocity encoding with spiral readouts Valve disease affects 10% of patients with heart disease in the U.S. Most
More informationSparse sampling in MRI: From basic theory to clinical application. R. Marc Lebel, PhD Department of Electrical Engineering Department of Radiology
Sparse sampling in MRI: From basic theory to clinical application R. Marc Lebel, PhD Department of Electrical Engineering Department of Radiology Objective Provide an intuitive overview of compressed sensing
More informationIndex. 3D reconstruction, point algorithm, point algorithm, point algorithm, point algorithm, 253
Index 3D reconstruction, 123 5+1-point algorithm, 274 5-point algorithm, 260 7-point algorithm, 255 8-point algorithm, 253 affine point, 43 affine transformation, 55 affine transformation group, 55 affine
More informationIntensity Augmented ICP for Registration of Laser Scanner Point Clouds
Intensity Augmented ICP for Registration of Laser Scanner Point Clouds Bharat Lohani* and Sandeep Sashidharan *Department of Civil Engineering, IIT Kanpur Email: blohani@iitk.ac.in. Abstract While using
More informationTwo-View Geometry (Course 23, Lecture D)
Two-View Geometry (Course 23, Lecture D) Jana Kosecka Department of Computer Science George Mason University http://www.cs.gmu.edu/~kosecka General Formulation Given two views of the scene recover the
More informationT 2 -Relaxometry for Myelin Water Fraction Extraction Using Wald Distribution and Extended Phase Graph
T -Relaxometry for Myelin Water Fraction Extraction Using Wald Distribution and Extended Phase Graph Alireza Akhondi-Asl, Onur Afacan, Robert V. Mulkern, Simon K. Warfield Computational Radiology Laboratory,
More informationSOM+EOF for Finding Missing Values
SOM+EOF for Finding Missing Values Antti Sorjamaa 1, Paul Merlin 2, Bertrand Maillet 2 and Amaury Lendasse 1 1- Helsinki University of Technology - CIS P.O. Box 5400, 02015 HUT - Finland 2- Variances and
More informationSupplementary Material : Partial Sum Minimization of Singular Values in RPCA for Low-Level Vision
Supplementary Material : Partial Sum Minimization of Singular Values in RPCA for Low-Level Vision Due to space limitation in the main paper, we present additional experimental results in this supplementary
More informationOutline. Data Association Scenarios. Data Association Scenarios. Data Association Scenarios
Outline Data Association Scenarios Track Filtering and Gating Global Nearest Neighbor (GNN) Review: Linear Assignment Problem Murthy s k-best Assignments Algorithm Probabilistic Data Association (PDAF)
More informationBias-Variance Tradeos Analysis Using Uniform CR Bound. Mohammad Usman, Alfred O. Hero, Jerey A. Fessler and W. L. Rogers. University of Michigan
Bias-Variance Tradeos Analysis Using Uniform CR Bound Mohammad Usman, Alfred O. Hero, Jerey A. Fessler and W. L. Rogers University of Michigan ABSTRACT We quantify fundamental bias-variance tradeos for
More informationPrototype of Silver Corpus Merging Framework
www.visceral.eu Prototype of Silver Corpus Merging Framework Deliverable number D3.3 Dissemination level Public Delivery data 30.4.2014 Status Authors Final Markus Krenn, Allan Hanbury, Georg Langs This
More informationRobotics: Science and Systems
Robotics: Science and Systems System Identification & Filtering Zhibin (Alex) Li School of Informatics University of Edinburgh 1 Outline 1. Introduction 2. Background 3. System identification 4. Signal
More informationIndex. 3D reconstruction, point algorithm, point algorithm, point algorithm, point algorithm, 263
Index 3D reconstruction, 125 5+1-point algorithm, 284 5-point algorithm, 270 7-point algorithm, 265 8-point algorithm, 263 affine point, 45 affine transformation, 57 affine transformation group, 57 affine
More informationGuidelines for proper use of Plate elements
Guidelines for proper use of Plate elements In structural analysis using finite element method, the analysis model is created by dividing the entire structure into finite elements. This procedure is known
More informationLecture 28 Intro to Tracking
Lecture 28 Intro to Tracking Some overlap with T&V Section 8.4.2 and Appendix A.8 Recall: Blob Merge/Split merge occlusion occlusion split When two objects pass close to each other, they are detected as
More informationRecall: Blob Merge/Split Lecture 28
Recall: Blob Merge/Split Lecture 28 merge occlusion Intro to Tracking Some overlap with T&V Section 8.4.2 and Appendix A.8 occlusion split When two objects pass close to each other, they are detected as
More informationWeighted-CS for reconstruction of highly under-sampled dynamic MRI sequences
Weighted- for reconstruction of highly under-sampled dynamic MRI sequences Dornoosh Zonoobi and Ashraf A. Kassim Dept. Electrical and Computer Engineering National University of Singapore, Singapore E-mail:
More informationCompressed Sensing Reconstructions for Dynamic Contrast Enhanced MRI
1 Compressed Sensing Reconstructions for Dynamic Contrast Enhanced MRI Kevin T. Looby klooby@stanford.edu ABSTRACT The temporal resolution necessary for dynamic contrast enhanced (DCE) magnetic resonance
More informationThis Time. fmri Data analysis
This Time Reslice example Spatial Normalization Noise in fmri Methods for estimating and correcting for physiologic noise SPM Example Spatial Normalization: Remind ourselves what a typical functional image
More informationcalibrated coordinates Linear transformation pixel coordinates
1 calibrated coordinates Linear transformation pixel coordinates 2 Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration with partial
More informationRobust Signal-Structure Reconstruction
Robust Signal-Structure Reconstruction V. Chetty 1, D. Hayden 2, J. Gonçalves 2, and S. Warnick 1 1 Information and Decision Algorithms Laboratories, Brigham Young University 2 Control Group, Department
More informationA Nuclear Norm Minimization Algorithm with Application to Five Dimensional (5D) Seismic Data Recovery
A Nuclear Norm Minimization Algorithm with Application to Five Dimensional (5D) Seismic Data Recovery Summary N. Kreimer, A. Stanton and M. D. Sacchi, University of Alberta, Edmonton, Canada kreimer@ualberta.ca
More informationSparse multidimensional scaling for blind tracking in sensor networks
Sparse multidimensional scaling for blind tracking in sensor networks R. Rangarajan 1, R. Raich 2, and A. O. Hero III 3 1 University of Michigan rangaraj@eecs.umich.edu 2 University of Michigan ravivr@eecs.umich.edu
More informationComputer Vision: Lecture 3
Computer Vision: Lecture 3 Carl Olsson 2019-01-29 Carl Olsson Computer Vision: Lecture 3 2019-01-29 1 / 28 Todays Lecture Camera Calibration The inner parameters - K. Projective vs. Euclidean Reconstruction.
More informationEuclidean Reconstruction Independent on Camera Intrinsic Parameters
Euclidean Reconstruction Independent on Camera Intrinsic Parameters Ezio MALIS I.N.R.I.A. Sophia-Antipolis, FRANCE Adrien BARTOLI INRIA Rhone-Alpes, FRANCE Abstract bundle adjustment techniques for Euclidean
More informationMobile Robotics. Mathematics, Models, and Methods. HI Cambridge. Alonzo Kelly. Carnegie Mellon University UNIVERSITY PRESS
Mobile Robotics Mathematics, Models, and Methods Alonzo Kelly Carnegie Mellon University HI Cambridge UNIVERSITY PRESS Contents Preface page xiii 1 Introduction 1 1.1 Applications of Mobile Robots 2 1.2
More informationCSE 252B: Computer Vision II
CSE 252B: Computer Vision II Lecturer: Serge Belongie Scribe: Haowei Liu LECTURE 16 Structure from Motion from Tracked Points 16.1. Introduction In the last lecture we learned how to track point features
More informationMotion Correction in fmri by Mapping Slice-to-Volume with Concurrent Field-Inhomogeneity Correction
Motion Correction in fmri by Mapping Slice-to-Volume with Concurrent Field-Inhomogeneity Correction Desmond T.B. Yeo 1,2, Jeffery A. Fessler 2, and Boklye Kim 1 1 Department of Radiology, University of
More informationConstructing System Matrices for SPECT Simulations and Reconstructions
Constructing System Matrices for SPECT Simulations and Reconstructions Nirantha Balagopal April 28th, 2017 M.S. Report The University of Arizona College of Optical Sciences 1 Acknowledgement I would like
More informationThree-dimensional nondestructive evaluation of cylindrical objects (pipe) using an infrared camera coupled to a 3D scanner
Three-dimensional nondestructive evaluation of cylindrical objects (pipe) using an infrared camera coupled to a 3D scanner F. B. Djupkep Dizeu, S. Hesabi, D. Laurendeau, A. Bendada Computer Vision and
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Structure Computation Lecture 18 March 22, 2005 2 3D Reconstruction The goal of 3D reconstruction
More informationof Iterative Closest Point ICP algorithm to
Iterative Closest Point Algorithm. L Error Approach via Linear Programming Yaroslav O. Halchenko PhD Student, CS@NJIT yh42@njit.edu Abstract The original goal of this project was a straightforward implementation
More informationReconstruction of the Vibro-Acoustic Field on the Surface of the Refrigerator Compressor by Using the BEM-Based Acoustic Holography
Purdue University Purdue e-pubs International Compressor Engineering Conference School of Mechanical Engineering 1998 Reconstruction of the Vibro-Acoustic Field on the Surface of the Refrigerator Compressor
More informationVariable Selection 6.783, Biomedical Decision Support
6.783, Biomedical Decision Support (lrosasco@mit.edu) Department of Brain and Cognitive Science- MIT November 2, 2009 About this class Why selecting variables Approaches to variable selection Sparsity-based
More informationStatistical Analysis of Neuroimaging Data. Phebe Kemmer BIOS 516 Sept 24, 2015
Statistical Analysis of Neuroimaging Data Phebe Kemmer BIOS 516 Sept 24, 2015 Review from last time Structural Imaging modalities MRI, CAT, DTI (diffusion tensor imaging) Functional Imaging modalities
More informationOccluded Facial Expression Tracking
Occluded Facial Expression Tracking Hugo Mercier 1, Julien Peyras 2, and Patrice Dalle 1 1 Institut de Recherche en Informatique de Toulouse 118, route de Narbonne, F-31062 Toulouse Cedex 9 2 Dipartimento
More informationTutorial: Using Tina Vision s Quantitative Pattern Recognition Tool.
Tina Memo No. 2014-004 Internal Report Tutorial: Using Tina Vision s Quantitative Pattern Recognition Tool. P.D.Tar. Last updated 07 / 06 / 2014 ISBE, Medical School, University of Manchester, Stopford
More informationTracking system. Danica Kragic. Object Recognition & Model Based Tracking
Tracking system Object Recognition & Model Based Tracking Motivation Manipulating objects in domestic environments Localization / Navigation Object Recognition Servoing Tracking Grasping Pose estimation
More informationDenoising the Spectral Information of Non Stationary Image using DWT
Denoising the Spectral Information of Non Stationary Image using DWT Dr.DolaSanjayS 1, P. Geetha Lavanya 2, P.Jagapathi Raju 3, M.Sai Kishore 4, T.N.V.Krishna Priya 5 1 Principal, Ramachandra College of
More informationMapping of Hierarchical Activation in the Visual Cortex Suman Chakravartula, Denise Jones, Guillaume Leseur CS229 Final Project Report. Autumn 2008.
Mapping of Hierarchical Activation in the Visual Cortex Suman Chakravartula, Denise Jones, Guillaume Leseur CS229 Final Project Report. Autumn 2008. Introduction There is much that is unknown regarding
More informationMarquette University Iain P. Bruce Marquette University, M. Muge Karaman Marquette University
Marquette University e-publications@marquette Mathematics, Statistics and omputer Science Faculty Research and Publications Mathematics, Statistics and omputer Science, Department of 10-1-2012 The SENSE-Isomorphism
More informationRuch (Motion) Rozpoznawanie Obrazów Krzysztof Krawiec Instytut Informatyki, Politechnika Poznańska. Krzysztof Krawiec IDSS
Ruch (Motion) Rozpoznawanie Obrazów Krzysztof Krawiec Instytut Informatyki, Politechnika Poznańska 1 Krzysztof Krawiec IDSS 2 The importance of visual motion Adds entirely new (temporal) dimension to visual
More informationModel-based Real-Time Estimation of Building Occupancy During Emergency Egress
Model-based Real-Time Estimation of Building Occupancy During Emergency Egress Robert Tomastik 1, Satish Narayanan 2, Andrzej Banaszuk 3, and Sean Meyn 4 1 Pratt & Whitney 400 Main St., East Hartford,
More informationDifferential Structure in non-linear Image Embedding Functions
Differential Structure in non-linear Image Embedding Functions Robert Pless Department of Computer Science, Washington University in St. Louis pless@cse.wustl.edu Abstract Many natural image sets are samples
More information13. Learning Ballistic Movementsof a Robot Arm 212
13. Learning Ballistic Movementsof a Robot Arm 212 13. LEARNING BALLISTIC MOVEMENTS OF A ROBOT ARM 13.1 Problem and Model Approach After a sufficiently long training phase, the network described in the
More informationSuper-Resolution Reconstruction of Diffusion-Weighted Images from Distortion Compensated Orthogonal Anisotropic Acquisitions.
Super-Resolution Reconstruction of Diffusion-Weighted Images from Distortion Compensated Orthogonal Anisotropic Acquisitions. Benoit Scherrer Ali Gholipour Simon K. Warfield Children s Hospital Boston,
More informationAlgebraic Iterative Methods for Computed Tomography
Algebraic Iterative Methods for Computed Tomography Per Christian Hansen DTU Compute Department of Applied Mathematics and Computer Science Technical University of Denmark Per Christian Hansen Algebraic
More informationFundamental Matrix & Structure from Motion
Fundamental Matrix & Structure from Motion Instructor - Simon Lucey 16-423 - Designing Computer Vision Apps Today Transformations between images Structure from Motion The Essential Matrix The Fundamental
More informationMERGING POINT CLOUDS FROM MULTIPLE KINECTS. Nishant Rai 13th July, 2016 CARIS Lab University of British Columbia
MERGING POINT CLOUDS FROM MULTIPLE KINECTS Nishant Rai 13th July, 2016 CARIS Lab University of British Columbia Introduction What do we want to do? : Use information (point clouds) from multiple (2+) Kinects
More informationEpipolar Geometry and the Essential Matrix
Epipolar Geometry and the Essential Matrix Carlo Tomasi The epipolar geometry of a pair of cameras expresses the fundamental relationship between any two corresponding points in the two image planes, and
More informationPerturbation Estimation of the Subspaces for Structure from Motion with Noisy and Missing Data. Abstract. 1. Introduction
Perturbation Estimation of the Subspaces for Structure from Motion with Noisy and Missing Data Hongjun Jia, Jeff Fortuna and Aleix M. Martinez Department of Electrical and Computer Engineering The Ohio
More informationA Lagrange method based L-curve for image restoration
Journal of Physics: Conference Series OPEN ACCESS A Lagrange method based L-curve for image restoration To cite this article: G Landi 2013 J. Phys.: Conf. Ser. 464 012011 View the article online for updates
More informationIEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS /$ IEEE
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 1 Exploration of Heterogeneous FPGAs for Mapping Linear Projection Designs Christos-S. Bouganis, Member, IEEE, Iosifina Pournara, and Peter
More information1 2 (3 + x 3) x 2 = 1 3 (3 + x 1 2x 3 ) 1. 3 ( 1 x 2) (3 + x(0) 3 ) = 1 2 (3 + 0) = 3. 2 (3 + x(0) 1 2x (0) ( ) = 1 ( 1 x(0) 2 ) = 1 3 ) = 1 3
6 Iterative Solvers Lab Objective: Many real-world problems of the form Ax = b have tens of thousands of parameters Solving such systems with Gaussian elimination or matrix factorizations could require
More informationDigital Image Processing Laboratory: MAP Image Restoration
Purdue University: Digital Image Processing Laboratories 1 Digital Image Processing Laboratory: MAP Image Restoration October, 015 1 Introduction This laboratory explores the use of maximum a posteriori
More information2D and 3D Far-Field Radiation Patterns Reconstruction Based on Compressive Sensing
Progress In Electromagnetics Research M, Vol. 46, 47 56, 206 2D and 3D Far-Field Radiation Patterns Reconstruction Based on Compressive Sensing Berenice Verdin * and Patrick Debroux Abstract The measurement
More information