Difference between revisions of "Projects:ProstateRegistration"
m (→Description) |
|||
| Line 1: | Line 1: | ||
Back to [[Algorithm:GATech|Georgia Tech Algorithms]] | Back to [[Algorithm:GATech|Georgia Tech Algorithms]] | ||
__NOTOC__ | __NOTOC__ | ||
| − | = | + | = 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 Figures below: | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
One the right side: | One the right side: | ||
| Line 19: | Line 14: | ||
[[Image:ProstateRegSupineToProneInParaview.png|500px|]] | [[Image:ProstateRegSupineToProneInParaview.png|500px|]] | ||
| + | |||
| + | 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 19:59, 12 April 2009
Home < Projects:ProstateRegistrationBack to Georgia Tech Algorithms
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 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).
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
