Difference between revisions of "Algorithm:GATech"

From NAMIC Wiki
Jump to: navigation, search
Line 35: Line 35:
 
| |
 
| |
  
== [[Projects:ProstateRegistration|Prostate Registration]] ==
+
== [[Projects:pfImgReg|Particle Filter Registration of Medical Imagery]] ==
 +
 
 +
We transform the general problem of image registration to a sparse task of aligning point clouds. This is accomplished by considering the image as a probability density function, from which a point cloud is formed by randomly drawing samples. This allows us to apply a particle filtering technique for the registration. While point set registration and image registration are  generally studied separately, this approach attempts to bridge the two. Thus, our contribution is threefold. Firstly, our method can handle affine transformations. Secondly, registration of partial images is more natural. Lastly, the point cloud representation is much sparser than the usual image representation as a discrete function. This allows us to drastically reduce the computational cost associated with 2D and 3D registration task. Experimental results demonstrate the fast and robust convergence of the proposed algorithm. See
  
 
3D volumetric prostate registration is performed. The method is able to handle long distance between as well as registration between Supine and Prone pose prostate. [[Projects:ProstateRegistration|More...]]
 
3D volumetric prostate registration is performed. The method is able to handle long distance between as well as registration between Supine and Prone pose prostate. [[Projects:ProstateRegistration|More...]]

Revision as of 18:49, 12 April 2009

Home < Algorithm:GATech

Back to NA-MIC Algorithms

Overview of Georgia Tech Algorithms (PI: Allen Tannenbaum)

At Georgia Tech, we are broadly interested in a range of mathematical image analysis algorithms for segmentation, registration, diffusion-weighted MRI analysis, and statistical analysis. For many applications, we cast the problem in an energy minimization framework wherein we define a partial differential equation whose numeric solution corresponds to the desired algorithmic outcome. The following are many examples of PDE techniques applied to medical image analysis.

Georgia Tech Projects

Results brain sag.JPG

Optimal Mass Transport Registration

The goal of this project is to implement a computationaly efficient Elastic/Non-rigid Registration algorithm based on the Monge-Kantorovich theory of optimal mass transport for 3D Medical Imagery. Our technique is based on Multigrid and Multiresolution techniques. This method is particularly useful because it is parameter free and utilizes all of the grayscale data in the image pairs in a symmetric fashion and no landmarks need to be specified for correspondence. More...

New: Tauseef ur Rehman, A. Tannenbaum. Multigrid Optimal Mass Transport for Image Registration and Morphing. SPIE Conference on Computational Imaging V, Jan 2007.

ShapeBasePstSegSlicer.png

Prostate Segmentation

The 3D prostate MRI images are collected by collaborators at Queen’s University. With a little manual initialization, the algorithm provided the results give to the left. The method mainly uses Random Walk algorithm. More...

New: Segmentation tool put into Slicer3.


ProstateRegSupineToProneInParaview.png

Particle Filter Registration of Medical Imagery

We transform the general problem of image registration to a sparse task of aligning point clouds. This is accomplished by considering the image as a probability density function, from which a point cloud is formed by randomly drawing samples. This allows us to apply a particle filtering technique for the registration. While point set registration and image registration are  generally studied separately, this approach attempts to bridge the two. Thus, our contribution is threefold. Firstly, our method can handle affine transformations. Secondly, registration of partial images is more natural. Lastly, the point cloud representation is much sparser than the usual image representation as a discrete function. This allows us to drastically reduce the computational cost associated with 2D and 3D registration task. Experimental results demonstrate the fast and robust convergence of the proposed algorithm. See 

3D volumetric prostate registration is performed. The method is able to handle long distance between as well as registration between Supine and Prone pose prostate. More...

New: Will be put into Slicer3.


Gatech caudateBands.PNG

Multiscale Shape Segmentation Techniques

To represent multiscale variations in a shape population in order to drive the segmentation of deep brain structures, such as the caudate nucleus or the hippocampus. More...

New: Delphine Nain won the best student paper at MICCAI 2006 in the category "Segmentation and Registration" for her paper entitled "Shape-driven surface segmentation using spherical wavelets" by D. Nain, S. Haker, A. Bobick, A. Tannenbaum.

ZoomedResultWithModel.png

Geodesic Tractography Segmentation

In this work, we provide an energy minimization framework which allows one to find fiber tracts and volumetric fiber bundles in brain diffusion-weighted MRI (DW-MRI). More...

New: J. Melonakos, E. Pichon, S. Angenet, and A. Tannenbaum. Finsler Active Contours. IEEE Transactions on Pattern Analysis and Machine Intelligence, March 2008, Vol 30, Num 3.

Caudate Nucleus Denoising.JPG

Wavelet Shrinkage for Shape Analysis

Shape analysis has become a topic of interest in medical imaging since local variations of a shape could carry relevant information about a disease that may affect only a portion of an organ. We developed a novel wavelet-based denoising and compression statistical model for 3D shapes. More...

New: Bayesian Spherical Wavelet Shrinkage:Applications to shape analysis, X. Le Faucheur, B. Vidakovic, A. Tannenbaum, Proc. of SPIE Optics East, 2007.

P1 small.png

Label Space: A Coupled Multi-Shape Representation

Many techniques for multi-shape representation may often develop inaccuracies stemming from either approximations or inherent variation. Label space is an implicit representation that offers unbiased algebraic manipulation and natural expression of label uncertainty. We demonstrate smoothing and registration on multi-label brain MRI. More...

New: J. Malcolm, Y. Rathi, A. Tannenbaum. "Label Space\: A Multi-Object Shape Representation." In Combinatorial Image Analysis, 2008.

BasePair3DModel.JPG

Non Parametric Clustering for Biomolecular Structural Analysis

High accuracy imaging and image processing techniques allow for collecting structural information of biomolecules with atomistic accuracy. Direct interpretation of the dynamics and the functionality of these structures with physical models, is yet to be developed. Clustering of molecular conformations into classes seems to be the first stage in recovering the formation and the functionality of these molecules. More...

New: E. Hershkovits, A. Tannenbaum, and R. Tannenbaum. Adsorption of Block Copolymers from Selective Solvents on Curved Surfaces. To be published in Macromolecules. 2008.

Basis membership.png

Multiscale Shape Analysis

We present a novel method of statistical surface-based morphometry based on the use of non-parametric permutation tests and a spherical wavelet (SWC) shape representation. More...

New: D. Nain, M. Styner, M. Niethammer, J. J. Levitt, M E Shenton, G Gerig, A. Bobick, A. Tannenbaum. Statistical Shape Analysis of Brain Structures using Spherical Wavelets. Accepted in The Fourth IEEE International Symposium on Biomedical Imaging (ISBI ’07) that will be held April 12-15, 2007 in Metro Washington DC, USA.

TruckInitialization.png

Point Set Rigid Registration

In this work, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Experimental results are provided that demonstrate the robustness of the algorithm to initialization, noise, missing structures or differing point densities in each sets, on challenging 2D and 3D registration tasks. More...

New: R. Sandhu, S. Dambreville, A. Tannenbaum. Particle Filtering for Registration of 2D and 3D Point Sets with Stochastic Dynamics. In CVPR, 2008.

Dlpfc1.jpg

Rule-Based DLPFC Segmentation

In this work, we provide software to semi-automate the implementation of segmentation procedures based on expert neuroanatomist rules for the dorsolateral prefrontal cortex. More...

New: Al-Hakim, et al. A Dorsolateral Prefrontal Cortex Semi-Automatic Segmenter. SPIE MI 2006.

Striatum1.png

Rule-Based Striatum Segmentation

In this work, we provide software to semi-automate the implementation of segmentation procedures based on expert neuroanatomist rules for the striatum. More...

New: Al-Hakim, et al. Parcellation of the Striatum. SPIE MI 2007.

Brain-flat.PNG

Conformal Flattening

The goal of this project is for better visualizing and computation of neural activity from fMRI brain imagery. Also, with this technique, shapes can be mapped to shperes for shape analysis, registration or other purposes. Our technique is based on conformal mappings which map genus-zero surface: in fmri case cortical or other surfaces, onto a sphere in an angle preserving manner. More...

New: Y. Gao, J. Melonakos, and A. Tannenbaum. Conformal Flattening ITK Filter. ISC/NA-MIC Workshop on Open Science at MICCAI 2006.

Circle seg.PNG

Kernel PCA for Segmentation

Segmentation performances using active contours can be drastically improved if the possible shapes of the object of interest are learnt. The goal of this work is to use Kernel PCA to learn shape priors. Kernel PCA allows for learning non linear dependencies in data sets, leading to more robust shape priors. More...

New: S. Dambreville, Y. Rathi, and A. Tannenbaum. A Framework for Image Segmentation using Image Shape Models and Kernel PCA Shape Priors. PAMI. Submitted to PAMI.

Fig1yan.PNG

Blood Vessel Segmentation

The goal of this work is to develop blood vessel segmentation techniques for 3D MRI and CT data. The methods have been applied to coronary arteries and portal veins, with promising results. More...

New: Y. Yang, S. George, D. Martin, A. Tannenbaum, and D. Giddens. 3D Modeling of Patient-Specific Geometries of Portal Veins Using MR Images. In Proceedings IEEE EMBS, 2006

Fig67.png

Knowledge-Based Bayesian Segmentation

This ITK filter is a segmentation algorithm that utilizes Bayes's Rule along with an affine-invariant anisotropic smoothing filter. More...

New: J. Melonakos, Y. Gao, and A. Tannenbaum. Tissue Tracking: Applications for Brain MRI Classification. SPIE Medical Imaging, 2007.

Stochastic-snake.png

Stochastic Methods for Segmentation

New stochastic methods for implementing curvature driven flows for various medical tasks such as segmentation. More...

New: Currently under investigation.

Table1.png

KPCA, LLE, KLLE Shape Analysis

The goal of this work is to study and compare shape learning techniques. The techniques considered are Linear Principal Components Analysis (PCA), Kernel PCA, Locally Linear Embedding (LLE) and Kernel LLE. More...

New: Y. Rathi, S. Dambreville, and A. Tannenbaum. "Comparative Analysis of Kernel Methods for Statistical Shape Learning", In CVAMIA held in conjunction with ECCV, 2006.

Gatech SlicerModel2.jpg

Statistical/PDE Methods using Fast Marching for Segmentation

This Fast Marching based flow was added to Slicer 2. More...