Non-rigid Registration of 2-D/3-D Dynamic Data with Feature Alignment
In this work, we are computing the matching between 2D manifolds and 3D manifolds with temporal constraints, that is we are computing the matching among a time sequence of 2D/3D manifolds. It is solved by mapping all the manifolds to a common domain, then build their matching by composing the forwar...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | en |
Published: |
LSU
2012
|
Subjects: | |
Online Access: | http://etd.lsu.edu/docs/available/etd-11092012-120635/ |
id |
ndltd-LSU-oai-etd.lsu.edu-etd-11092012-120635 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-LSU-oai-etd.lsu.edu-etd-11092012-1206352013-01-07T22:54:19Z Non-rigid Registration of 2-D/3-D Dynamic Data with Feature Alignment Xu, Huanhuan Electrical & Computer Engineering In this work, we are computing the matching between 2D manifolds and 3D manifolds with temporal constraints, that is we are computing the matching among a time sequence of 2D/3D manifolds. It is solved by mapping all the manifolds to a common domain, then build their matching by composing the forward mapping and the inverse mapping. At first, we solve the matching problem between 2D manifolds with temporal constraints by using mesh-based registration method. We propose a surface parameterization method to compute the mapping between the 2D manifold and the common 2D planar domain. We can compute the matching among the time sequence of deforming geometry data through this common domain. Compared with previous work, our method is independent of the quality of mesh elements and more efficient for the time sequence data. Then we develop a global intensity-based registration method to solve the matching problem between 3D manifolds with temporal constraints. Our method is based on a 4D(3D+T) free-from B-spline deformation model which has both spatial and temporal smoothness. Compared with previous 4D image registration techniques, our method avoids some local minimum. Thus it can be solved faster and achieve better accuracy of landmark point predication. We demonstrate the efficiency of these works on the real applications. The first one is applied to the dynamic face registering and texture mapping. The second one is applied to lung tumor motion tracking in the medical image analysis. In our future work, we are developing more efficient mesh-based 4D registration method. It can be applied to tumor motion estimation and tracking, which can be used to calculate the read dose delivered to the lung and surrounding tissues. Thus this can support the online treatment of lung cancer radiotherapy. Peng, Lu Zhang, Hongchao Li, Xin LSU 2012-11-16 text application/pdf http://etd.lsu.edu/docs/available/etd-11092012-120635/ http://etd.lsu.edu/docs/available/etd-11092012-120635/ en unrestricted I hereby certify that, if appropriate, I have obtained and attached herein a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to LSU or its agents the non-exclusive license to archive and make accessible, under the conditions specified below and in appropriate University policies, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. |
collection |
NDLTD |
language |
en |
format |
Others
|
sources |
NDLTD |
topic |
Electrical & Computer Engineering |
spellingShingle |
Electrical & Computer Engineering Xu, Huanhuan Non-rigid Registration of 2-D/3-D Dynamic Data with Feature Alignment |
description |
In this work, we are computing the matching between 2D manifolds and 3D manifolds with temporal constraints, that is we are computing the matching among a time sequence of 2D/3D manifolds. It is solved by mapping all the manifolds to a common domain, then build their matching by composing the forward mapping and the inverse mapping.
At first, we solve the matching problem between 2D manifolds with temporal constraints by using mesh-based registration method. We propose a surface parameterization method to compute the mapping between the 2D manifold and the common 2D planar domain. We can compute the matching among the time sequence of deforming geometry data through this common domain. Compared with previous work, our method is independent of the quality of mesh elements and more efficient for the time sequence data.
Then we develop a global intensity-based registration method to solve the matching problem between 3D manifolds with temporal constraints. Our method is based on a 4D(3D+T) free-from B-spline deformation model which has both spatial and temporal smoothness. Compared with previous 4D image registration techniques, our method avoids some local minimum. Thus it can be solved faster and achieve better accuracy of landmark point predication.
We demonstrate the efficiency of these works on the real applications. The first one is applied to the dynamic face registering and texture mapping. The second one is applied to lung tumor motion tracking in the medical image analysis.
In our future work, we are developing more efficient mesh-based 4D registration method. It can be applied to tumor motion estimation and tracking, which can be used to calculate the read dose delivered to the lung and surrounding tissues. Thus this can support the online treatment of lung cancer radiotherapy. |
author2 |
Peng, Lu |
author_facet |
Peng, Lu Xu, Huanhuan |
author |
Xu, Huanhuan |
author_sort |
Xu, Huanhuan |
title |
Non-rigid Registration of 2-D/3-D Dynamic Data with Feature Alignment |
title_short |
Non-rigid Registration of 2-D/3-D Dynamic Data with Feature Alignment |
title_full |
Non-rigid Registration of 2-D/3-D Dynamic Data with Feature Alignment |
title_fullStr |
Non-rigid Registration of 2-D/3-D Dynamic Data with Feature Alignment |
title_full_unstemmed |
Non-rigid Registration of 2-D/3-D Dynamic Data with Feature Alignment |
title_sort |
non-rigid registration of 2-d/3-d dynamic data with feature alignment |
publisher |
LSU |
publishDate |
2012 |
url |
http://etd.lsu.edu/docs/available/etd-11092012-120635/ |
work_keys_str_mv |
AT xuhuanhuan nonrigidregistrationof2d3ddynamicdatawithfeaturealignment |
_version_ |
1716478281658662912 |