Efficient, Robust, Nonlinear, and Guaranteed Positive Definite Diffusion Tensor Estimation Robert W Cox & D aniel R Glen SSCC / NIMH / NIH / DHHS / USA.

Slides:



Advertisements
Similar presentations
Brian Peasley and Stan Birchfield
Advertisements

Optimizing and Learning for Super-resolution
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Engineering Optimization
R. DOSIL, X. M. PARDO, A. MOSQUERA, D. CABELLO Grupo de Visión Artificial Departamento de Electrónica e Computación Universidade de Santiago de Compostela.
CSCI 347 / CS 4206: Data Mining Module 07: Implementations Topic 03: Linear Models.
FTP Biostatistics II Model parameter estimations: Confronting models with measurements.
PACE: An Autofocus Algorithm For SAR
Nonlinear Regression Ecole Nationale Vétérinaire de Toulouse Didier Concordet ECVPT Workshop April 2011 Can be downloaded at
A Short Introduction to Curve Fitting and Regression by Brad Morantz
Modern iterative methods For basic iterative methods, converge linearly Modern iterative methods, converge faster –Krylov subspace method Steepest descent.
Classification and Prediction: Regression Via Gradient Descent Optimization Bamshad Mobasher DePaul University.
Claudia Lizet Navarro Hernández PhD Student Supervisor: Professor S.P.Banks April 2004 Monash University Australia April 2004 The University of Sheffield.
Local or Global Minima: Flexible Dual-Front Active Contours Hua Li Anthony Yezzi.
Jonathan Richard Shewchuk Reading Group Presention By David Cline
Master thesis by H.C Achterberg
Accurate Non-Iterative O( n ) Solution to the P n P Problem CVLab - Ecole Polytechnique Fédérale de Lausanne Francesc Moreno-Noguer Vincent Lepetit Pascal.
Iterative closest point algorithms
1 GEOMETRIE Geometrie in der Technik H. Pottmann TU Wien SS 2007.
Motion Analysis (contd.) Slides are from RPI Registration Class.
CSci 6971: Image Registration Lecture 4: First Examples January 23, 2004 Prof. Chuck Stewart, RPI Dr. Luis Ibanez, Kitware Prof. Chuck Stewart, RPI Dr.
Diffusion Filters S. Derin Babacan Department of Electrical and Computer Engineering Northwestern University March 7, 2006 ECE 463 Term Project.
Fitting. We’ve learned how to detect edges, corners, blobs. Now what? We would like to form a higher-level, more compact representation of the features.
1 Multiple Kernel Learning Naouel Baili MRL Seminar, Fall 2009.
CSE 245: Computer Aided Circuit Simulation and Verification
Lecture 10: Robust fitting CS4670: Computer Vision Noah Snavely.
Fast Spectral Transforms and Logic Synthesis DoRon Motter August 2, 2001.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Structural Equation Modeling Continued: Lecture 2 Psy 524 Ainsworth.
9 1 Performance Optimization. 9 2 Basic Optimization Algorithm p k - Search Direction  k - Learning Rate or.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 9. Optimization problems.
Jinhui Tang †, Shuicheng Yan †, Richang Hong †, Guo-Jun Qi ‡, Tat-Seng Chua † † National University of Singapore ‡ University of Illinois at Urbana-Champaign.
Epipolar geometry The fundamental matrix and the tensor
Frank Edward Curtis Northwestern University Joint work with Richard Byrd and Jorge Nocedal February 12, 2007 Inexact Methods for PDE-Constrained Optimization.
Non Negative Matrix Factorization
Chem Math 252 Chapter 5 Regression. Linear & Nonlinear Regression Linear regression –Linear in the parameters –Does not have to be linear in the.
Self-Calibration and Metric Reconstruction from Single Images Ruisheng Wang Frank P. Ferrie Centre for Intelligent Machines, McGill University.
1 Unconstrained Optimization Objective: Find minimum of F(X) where X is a vector of design variables We may know lower and upper bounds for optimum No.
Efficient Integration of Large Stiff Systems of ODEs Using Exponential Integrators M. Tokman, M. Tokman, University of California, Merced 2 hrs 1.5 hrs.
Stochastic Subgradient Approach for Solving Linear Support Vector Machines Jan Rupnik Jozef Stefan Institute.
CS Statistical Machine learning Lecture 10 Yuan (Alan) Qi Purdue CS Sept
AFNI User Group Meeting Anisotropic Smoothing Daniel Glen Robert Cox SSCC / NIMH / NIH / DHHS.
Frank Edward Curtis Northwestern University Joint work with Richard Byrd and Jorge Nocedal January 31, 2007 Inexact Methods for PDE-Constrained Optimization.
1 Multiple Regression A single numerical response variable, Y. Multiple numerical explanatory variables, X 1, X 2,…, X k.
Orthogonalization via Deflation By Achiya Dax Hydrological Service Jerusalem, Israel
1 Incorporating Iterative Refinement with Sparse Cholesky April 2007 Doron Pearl.
Luke Bloy1, Ragini Verma2 The Section of Biomedical Image Analysis
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION ASEN 5070 LECTURE 11 9/16,18/09.
Fiber Demixing with the Tensor Distribution Function avoids errors in Fractional Anisotropy maps Liang Zhan 1,Alex D. Leow 2,3, Neda Jahanshad 1, Arthur.
CSE 245: Computer Aided Circuit Simulation and Verification Matrix Computations: Iterative Methods I Chung-Kuan Cheng.
*Man-Cheol Kim, Hyung-Jo Jung and In-Won Lee *Man-Cheol Kim, Hyung-Jo Jung and In-Won Lee Structural Dynamics & Vibration Control Lab. Structural Dynamics.
Mathematical Analysis of MaxEnt for Mixed Pixel Decomposition
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
Data assimilation for weather forecasting G.W. Inverarity 06/05/15.
MultiModality Registration Using Hilbert-Schmidt Estimators By: Srinivas Peddi Computer Integrated Surgery II April 6 th, 2001.
Affine Registration in R m 5. The matching function allows to define tentative correspondences and a RANSAC-like algorithm can be used to estimate the.
Numerical Analysis – Data Fitting Hanyang University Jong-Il Park.
Extending linear models by transformation (section 3.4 in text) (lectures 3&4 on amlbook.com)
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems
Estimating standard error using bootstrap
Bounded Nonlinear Optimization to Fit a Model of Acoustic Foams
Zeyu You, Raviv Raich, Yonghong Huang (presenter)
Roberto Battiti, Mauro Brunato
Human Brain Mapping Conference 2003 # 653
CSE 245: Computer Aided Circuit Simulation and Verification
CSE 245: Computer Aided Circuit Simulation and Verification
Anisotropy Induced by Macroscopic Boundaries: Surface-Normal Mapping using Diffusion-Weighted Imaging  Evren Özarslan, Uri Nevo, Peter J. Basser  Biophysical.
Performance Optimization
Calibration and homographies
Presentation transcript:

Efficient, Robust, Nonlinear, and Guaranteed Positive Definite Diffusion Tensor Estimation Robert W Cox & D aniel R Glen SSCC / NIMH / NIH / DHHS / USA / EARTH ISMRM 2006 – Seattle – 09 May 2006

Nonlinear ? Nonlinear relationship between image data I (q) and D = what we want to know Ignore noise, transform to linear system for D and solve via OLS? Oops! Oops! Noise level depends nonlinearly on unknowns. In WM, varies strongly with directionality of matrix dot product

Positive Definite ? Weighted LSq error functional E Given D, linear solve for base image J Gradient descent on D to minimize E Oops! Oops! Minimizer D still may not be PD

2D Cartoon Example x y Best feasible point Best feasible point on gradient descent path Forbidden minimizer

Guaranteed PD ? Descent direction that keeps PD-ness Find M that gives fastest descent rate

Efficient ? Padé approx e  2x  (1  x) / (1+x) for e  FD : Guarantees D remains PD for any  And is O(  2 ) accurate method for ODE Choose  to ensure E decreases quickly If E(s+  ) < E(s), also try step 2  If E(s+2  ) < E(s+  ), keep for next step

Robust ? Iterate D(s) to convergence using weights w q =1 (most voxels go pretty fast) Compute residuals (mismatch from data) And standard deviation of residuals Reduce weight w q if data point q has “too large” residual (relative to std.deviation) If had to re-weight, start over Using final D(s) from first round as starting point for this second round

Some Results ! Colorized Fractional Anistropy of D Voxels with negative eigenvalues are colored black Problem is worst where D is most anisotropic Linearized MethodCurrent Method

More Results ! Angular deviation between principal eigenvector of D computed with linearized and current method Angles only displayed where FA > 0.2 (i.e., in WM) Fractional AnisotropyAngular Deviation FA=0.0  =1 o FA=0.6  =6 o

Miscellany AFNI C software included in AFNI package:  256  54  33   3 min vs 20 s (iMac Intel) NIfTI-1 format for file interchange (someday?) Potential improvements:  {Isotropic D }  {Spheroidal D }  {General D } Replace weighted LSq with a sub- quadratic robust error metric  (residual) Simultaneously estimate image registration parameters along with D # Params: 1 < 4 < 6

Conclusions You may as well use a nonlinear & guaranteed PD solver, since the CPU time penalty is small And the software is free free free Significant impact in 1-2% of WM voxels Importance for applications yet to be evaluated by us NOTNON Have NOT implemented a nonlinear NON- guaranteed PD solver for comparison Have NOT looked at local minima issue

Finally … Thanks MM Klosek. JS Hyde. A Jesmanowicz. BD Ward. EC Wong. KM Donahue. PA Bandettini. T Ross. RM Birn. J Ratke. ZS Saad. G Chen. RC Reynolds. PP Christidis. K Bove-Bettis. LR Frank. DS Cohen. DA Jacobson. Former students from MCW. Et alii …