Fast and Simple Calculus on Tensors in the Log-Euclidean Framework Vincent Arsigny, Pierre Fillard, Xavier Pennec, Nicholas Ayache. Research Project/Team.

Slides:



Advertisements
Similar presentations
Sarang Joshi #1 Computational Anatomy: Simple Statistics on Interesting Spaces Sarang Joshi, Tom Fletcher Scientific Computing and Imaging Institute Department.
Advertisements

Nonlinear Shape Modelling John Ashburner. Wellcome Trust Centre for Neuroimaging, UCL Institute of Neurology, London, UK.
SHAPE THEORY USING GEOMETRY OF QUOTIENT SPACES: STORY STORY SHAPE THEORY USING GEOMETRY OF QUOTIENT SPACES: STORY STORY ANUJ SRIVASTAVA Dept of Statistics.
Level set based Image Segmentation Hang Xiao Jan12, 2013.
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.
Active Contours, Level Sets, and Image Segmentation
FIRST (FP7/Marie-Curie) Fronts and Interfaces in Science & Technlogy Adaptive and directional local processing in image processing Arpan Ghosh Supervisor:
Implementation of PROPELLER MRI method for Diffusion Tensor Reconstruction A. Cheryauka 1, J. Lee 1, A. Samsonov 2, M. Defrise 3, and G. Gullberg 4 1 –
Princeton University Using the computer to select the right variables Rationale: Lake Carnegie, Princeton, NJ Straight Line Distance Actual transition.
Inspired by the structure tensor which computes the second-order moment of image gradients for representing local image properties, and the Diffusion Tensor.
NAMIC: UNC – PNL collaboration- 1 - October 7, 2005 Fiber tract-oriented quantitative analysis of Diffusion Tensor MRI data Postdoctoral fellow, Dept of.
Optimization & Learning for Registration of Moving Dynamic Textures Junzhou Huang 1, Xiaolei Huang 2, Dimitris Metaxas 1 Rutgers University 1, Lehigh University.
Corp. Research Princeton, NJ Computing geodesics and minimal surfaces via graph cuts Yuri Boykov, Siemens Research, Princeton, NJ joint work with Vladimir.
Geometric Flows over Lie Groups Yaniv Gur and Nir Sochen Department of Applied Mathematics Tel-Aviv University, Israel HASSIP, September 2006, Munich.
WAGOS Conformal Changes of Divergence and Information Geometry Shun-ichi Amari RIKEN Brain Science Institute.
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.
Structure from motion. Multiple-view geometry questions Scene geometry (structure): Given 2D point matches in two or more images, where are the corresponding.
3D reconstruction of cameras and structure x i = PX i x’ i = P’X i.
Lecture # 32 (Last) Dr. SOHAIL IQBAL
CSci 6971: Image Registration Lecture 5: Feature-Base Regisration January 27, 2004 Prof. Chuck Stewart, RPI Dr. Luis Ibanez, Kitware Prof. Chuck Stewart,
Structure Computation. How to compute the position of a point in 3- space given its image in two views and the camera matrices of those two views Use.
Rician Noise Removal in Diffusion Tensor MRI
Online Learning Algorithms
Automatic Camera Calibration
Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University
NA-MIC National Alliance for Medical Image Computing DTI atlas building for population analysis: Application to PNL SZ study Casey Goodlett,
Evolving Curves/Surfaces for Geometric Reconstruction and Image Segmentation Huaiping Yang (Joint work with Bert Juettler) Johannes Kepler University of.
Diffusion Tensor Processing and Visualization Ross Whitaker University of Utah National Alliance for Medical Image Computing.
Integrable hierarchies of
Elementary Linear Algebra Anton & Rorres, 9th Edition
Benoit Scherrer, ISBI 2010, Rotterdam Why multiple b-values are required for multi-tensor models. Evaluation with a constrained log- Euclidean model. Benoit.
Visualizing Fiber Tracts in the Brain Using Diffusion Tensor Data Masters Project Presentation Yoshihito Yagi Thursday, July 28 th, 10:00 a.m. 499 Dirac.
A 3D Vector-Additive Iterative Solver for the Anisotropic Inhomogeneous Poisson Equation in the Forward EEG problem V. Volkov 1, A. Zherdetsky 1, S. Turovets.
CMIC Journal Club R. Woods (2003) Neuroimage Characterising Volume and Surface Deformations in an Atlas Framework Ged Ridgway.
Medical Image Analysis Image Registration Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
September 18, 2006Mathematics and Image Analysis Statistical Computing on Riemannian manifolds From Riemannian Geometry to Computational Anatomy.
Single View Geometry Course web page: vision.cis.udel.edu/cv April 9, 2003  Lecture 20.
Orthogonalization via Deflation By Achiya Dax Hydrological Service Jerusalem, Israel
§ Linear Operators Christopher Crawford PHY
Generalized Tensor-Based Morphometry (TBM) for the analysis of brain MRI and DTI Natasha Leporé, Laboratory of Neuro Imaging at UCLA.
Non-Euclidean Example: The Unit Sphere. Differential Geometry Formal mathematical theory Work with small ‘patches’ –the ‘patches’ look Euclidean Do calculus.
Parameter estimation. 2D homography Given a set of (x i,x i ’), compute H (x i ’=Hx i ) 3D to 2D camera projection Given a set of (X i,x i ), compute.
1 ON THE EXTENSION OF THE PRODUCT MODEL IN POLSAR PROCESSING FOR UNSUPERVISED CLASSIFICATION USING INFORMATION GEOMETRY OF COVARIANCE MATRICES P. Formont.
A New Method of Probability Density Estimation for Mutual Information Based Image Registration Ajit Rajwade, Arunava Banerjee, Anand Rangarajan. Dept.
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.
Diffusion Tensor Processing with Log-Euclidean Metrics
Texas A&M University, Department of Aerospace Engineering AN EMBEDDED FUNCTION TOOL FOR MODELING AND SIMULATING ESTIMATION PROBLEMS IN AEROSPACE ENGINEERING.
NA-MIC National Alliance for Medical Image Computing Mathematical and physical foundations of DTI Anastasia Yendiki, Ph.D. Massachusetts.
Vision-based SLAM Enhanced by Particle Swarm Optimization on the Euclidean Group Vision seminar : Dec Young Ki BAIK Computer Vision Lab.
NA-MIC National Alliance for Medical Image Computing NAMIC UNC Site Update Site PI: Martin Styner UNC Site NAMIC folks: C Vachet, G Roger,
Head Segmentation using a finite element approach J.Piovano, T. Papadopoulo Odyssée Laboratory (ENPC, ENS, INRIA), INRIA, Sophia-Antipolis, France I. Introduction.
National Alliance for Medical Image Computing Utah DTI Research Differential Geometry for DTI analysis Descriptive statistics of DTI.
MAT 4725 Numerical Analysis Section 7.1 Part I Norms of Vectors and Matrices
IGP NCRR Image and Geometry Processing Highlights of ongoing work Geometry processing Shape analysis Visualization/segmentation.
Parameter estimation class 5 Multiple View Geometry CPSC 689 Slides modified from Marc Pollefeys’ Comp
Introduction to Symmetry Analysis Brian Cantwell Department of Aeronautics and Astronautics Stanford University Chapter 1 - Introduction to Symmetry.
Lec 26: Fundamental Matrix CS4670 / 5670: Computer Vision Kavita Bala.
- 1 Parallel Transport with the Pole Ladder: Application to Deformations of time Series of Images Marco Lorenzi, Xavier Pennec Asclepios research group.
1 Bilinear Classifiers for Visual Recognition Computational Vision Lab. University of California Irvine To be presented in NIPS 2009 Hamed Pirsiavash Deva.
Statistics on Diffeomorphisms in a Log-Euclidean Framework Vincent Arsigny ¹,Olivier Commowick ¹ ², Xavier Pennec ¹, Nicholas Ayache ¹. ¹ Research Team.
Microstructure Imaging Sequence Simulation Toolbox
Unsupervised Riemannian Clustering of Probability Density Functions
Parameter estimation class 5
Why is the state bombarding the curriculum with so many matrices??
Non-Euclidean Example: The Unit Sphere
Human Brain Mapping Conference 2003 # 653
2D transformations (a.k.a. warping)
Anisotropic Diffusion for Speckle Reduction of SAR Image
Presentation transcript:

Fast and Simple Calculus on Tensors in the Log-Euclidean Framework Vincent Arsigny, Pierre Fillard, Xavier Pennec, Nicholas Ayache. Research Project/Team EPIDAURE/ASCLEPIOS INRIA, Sophia-Antipolis, France. 8th International Conference on Medical Image Computing and Computer Assisted Intervention, Oct 26 to 30, 2005.

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 2 What are ‘tensors’? In general: all multilinear applications. In this talk: symmetric positive-definite matrices. –Typically : covariance matrices.

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 3 Diffusion Tensor MRI Diffusion-weighted MR images Diffusion Tensor: local covariance of diffusion [Basser, 94]. Generalization of vector processing tools (filtering, statistics, etc.) to tensors?

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 4 Outline 1.Presentation 2.Euclidean and Affine-Invariant Calculus 3.Log-Euclidean Framework 4.Experimental Results 5.Conclusions and Perspectives

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 5 Euclidean calculus DTs: 3x3 symmetric matrices, thus belong to a vector space. Simple, but: –unphysical negative eigenvalues appear –‘swelling effect’: more diffusion than originally.

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 6 Remedies in the literature First family: 1.process features from tensors 2.propagate processing to tensors. Example: regularization –dominant directions of diffusion [Coulon, IPMI’01] –orientations and eigenvalues separately [Tschumperlé, IJCV, 02, Chefd’hotel JMIV, 04]. Drawback: some information left behind.

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 7 Remedies in the literature Second family: specialized procedures –Affine-invariant means [Wang, TMI, 05] –Anisotropic interpolation [Castagno-Moraga, MICCAI’04] –Etc. Drawback: lack of general framework.

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 8 A general solution: Riemannian geometry Powerful framework for curved spaces. Statistics [Pennec, JMIV, 98], PDEs [Pennec, IJCV, 05]. Riemannian arithmetic mean: ‘Fréchet mean’. Basic tool: differentiable distance between tensors. /~ wupa4p0/

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 9 Choice of distance? Relevant/natural invariance properties. In 2004: affine-invariant metrics [Fletcher, CVAMIA’04, Lenglet, JMIV, 05, Moakher, SIMAX, 05, Pennec, IJCV, 05]. –invariance w.r.t. any affine change of coordinate system.

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 10 Affine-invariant metrics Excellent theoretical properties: no 'swelling effect' non-positive eigenvalues at infinity High computational cost: many algebraic operations d i s t ( S 1 ; S 2 ) = k l og ( S ¡ : S 2 : S ¡ ) k :

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 11 Outline 1.Presentation 2.Euclidean and Affine-Invariant Calculus 3.Log-Euclidean Framework 4.Experimental Results 5.Conclusions and Perspectives

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 12 Surprise: a vector space structure for tensors! Idea: one-to-one correspondence with symmetric matrices, via matrix logarithm. More details: [Arsigny, INRIA RR-5584, 2005]. French patent pending. A novel vector space structure

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 13 A novel vector space structure Tensors: Lie group with 'logarithmic multiplication': Tensors: vector space with 'logarithmic scalar multiplication': S 1 ¯ S 2 = exp ( l og ( S 1 ) + l og ( S 2 )) ¸ ~ S = exp ( ¸ : l og ( S 1 ))

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 14 Log-Euclidean Distances Log-Euclidean metrics: –Euclidean metrics for vector space structure –Bi-invariant Riemannian metrics for Lie group structure ¯¯ ; ~ d i s t ( S 1 ; S 2 ) = k l og ( S 1 ) ¡ l og ( S 2 ) k :

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 15 Similarity-invariance, for example with (Frobenius): No Euclidean defect, exactly as in the affine-invariant case. Theoretical properties d i s t ( S 1 ; S 2 ) 2 = T race ³ ( l og ( S 1 ) ¡ l og ( S 2 )) 2 ´ :

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 16 Log-Euclidean framework in practice Existing Euclidean algorithms readily recycled! Conversion Tensor/Vector with Matrix Logarithm 1 Euclidean Processing on logarithms (filtering, statistics…) 2 Conversion Vector/Tensor with Matrix Exponential 3

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 17 Example: computing the mean Closed form for Log-Euclidean Fréchet mean: Affine-invariant case: implicit equation and iterative solving (20 times slower). E LE ( S i ; w i ) = exp à N X i = 1 w i l og ( S i ) ! :

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 18 Outline 1.Presentation 2.Euclidean and Affine-Invariant Calculus 3.Log-Euclidean Framework 4.Experimental Results 5.Conclusions and Perspectives

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 19 Interpolation Typical example of bilinear interpolation on synthetic data: 11\ Euclidean Log-Euclidean Affine-invariant

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 20 Interpolation on real DT-MRI Reconstruction by bilinear interpolation of slice in mid-sagital plane: Original slice Euclidean case Log-Euclidean case

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 21 Regularization of tensors Data: clinical DT image 128x128x30 –[a] Raw data –[b] Euclidean reg. –[c] Log-Eucl. reg. –[d] Log-Eucl. vs. affine-inv. (x100!) [a] [b] [c] [d]

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 22 Outline 1.Presentation 2.Euclidean and Affine-Invariant Calculus 3.Log-Euclidean Framework 4.Experimental Results 5.Conclusions and Perspectives

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 23 Conclusions Log-Euclidean Riemannian framework: –Riemannian excellent properties. –Euclidean speed and simplicity –Existing vector algorithms readily recycled. More applications: –Joint estimation and smoothing for DTI: [Fillard, INRIA RR-5607, 2005]. –Statistical priors in non-linear registration [Pennec, MICCAI’05, Post. II-943], [Commowick, Post. II-927].

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 24 Evaluation/validation (phantoms...). Which metric for which application? –Diffusion tensors (statistics, interpolation, estimation, registration…) –Variability tensors [Fillard, IPMI’05] (models of anatomical varibility) –Structure tensors [Fillard, DSSCV’05] (classical image processing) –Metric tensors [Allauzet, INRIA RR-4759, 2003] (anisotropic mesh adaptation for PDE solving) Extension of Log-Euclidean framework to: –Generalized diffusion tensors [Özarslan, MRM, 2003] –Q-balls [Tuch, MRM, 2004]. Perspectives

Thank you for your attention! Any questions?

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 26 Regularization of tensors Effect of anisotropic regularization on Fractional Anisotropy (FA) and gradient: FA Gradient

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 27 Regularization of tensors Anisotropic regularization on synthetic data: Orginal data Data+noiseEuclidean resultLog-Euclidean res.

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 28 Very little differences On DT images, Log-Euclidean advantages are: simplicity: Euclidean computations on logarithms! faster computations: computations at least 4 times faster in all situations. Log-Euclidean vs. affine-invariant

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 29 Small difference: larger anisotropy in Log-Euclidean results. (Theoretical) reason: inequality between the 'traces' of the Log-Euclidean and affine-invariant means: T race ( E AI ( S )) < T race ( E LE ( S )) w h enever E AI ( S ) 6 = E LE ( S ) Log-Euclidean vs. affine-invariant

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 30 Geodesics Log-Euclidean case: Affine-invariant case: S : exp ³ t : l og ( S ¡ : S 2 : S ¡ ) ´ : S exp (( 1 ¡ t ) : l og ( S 1 ) + t : l og ( S 2 ))

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 31 Metrics on Tensors Tensor Space Log-Euclidean metrics Homogenous Manifold Structure Vector Space Structure Algebraic structures Affine-invariant metrics Invariant metricEuclidean metric

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 32 with DT images, very similar results. Identical sometimes. Reason: associated means are two different generalizations of the geometric mean. In both cases determinants are interpolated geometrically. Log-Euclidean vs. affine-invariant

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 33 Invariance properties: –Lie group bi-invariance –Similarity-invariance, for example with (Frobenius): –Invariance of the mean w.r.t. S 7! S ¸ Log-Euclidean metrics d i s t ( S 1 ; S 2 ) 2 = T race ³ ( l og ( S 1 ) ¡ l og ( S 2 )) 2 ´

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 34 Variability tensors [Fillard, IPMI'05] Anatomical variability: local covariance matrix of displacement w.r.t. an average anatomy. Variability along sulci on the cortex and their extrapolation.

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 35 Use of Tensors Generation of adapted meshes in numerical analysis for faster PDE solving (SMASH project): [Alauzet, RR-4981], GAMMA project. Application to fluid mechanics.

October 27th, 2005Vincent Arsigny et al., Log- Euclidean Framework, MICCAI'05 36 Defects of Euclidean Calculus Typical 'swelling effect' in interpolation: In DT-MRI: physically unacceptable ! Interpolated tensors Interpolated volumes