Difference between revisions of "Projects:ProstateRegistration"

From NAMIC Wiki
Jump to: navigation, search
Line 3: Line 3:
 
= Particle Filter Registration of Medical Imagery =
 
= Particle Filter Registration of Medical Imagery =
  
 +
== Prostate registration ==
 
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 Figures below:
 
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 Figures below:
  
Line 15: Line 16:
 
[[Image:ProstateRegSupineToProneInParaview.png|500px|]]
 
[[Image:ProstateRegSupineToProneInParaview.png|500px|]]
  
 +
== DWI registration  ==
 
When applying the method to register two point sets generated from DWI images, the local minima of the registration energy is successfully avoided and the figure below shows:
 
When applying the method to register two point sets generated from DWI images, the local minima of the registration energy is successfully avoided and the figure below shows:
 
  
 
= Key Investigators =
 
= Key Investigators =

Revision as of 20:00, 12 April 2009

Home < Projects:ProstateRegistration

Back to Georgia Tech Algorithms

Particle Filter Registration of Medical Imagery

Prostate registration

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 Figures below:

One the right side:

   Blue: prostate in prone position;
   Yellow: prostate in supine position.

One the left:

   Blue: The same prostate in prone position;
   Pink: Result of registering the Yellow (supine) towards the Blue (prone).

ProstateRegSupineToProneInParaview.png

DWI registration

When applying the method to register two point sets generated from DWI images, the local minima of the registration energy is successfully avoided and the figure below shows:

Key Investigators

  • Georgia Tech Algorithms: Yi Gao, Allen Tannenbaum

Publications