TY - GEN
T1 - ITree
T2 - 2011 8th IEEE International Symposium on Biomedical Imaging: From Nano to Macro, ISBI'11
AU - Jia, Hongjun
AU - Wu, Guorong
AU - Wang, Qian
AU - Kim, Minjeong
AU - Shen, Dinggang
PY - 2011
Y1 - 2011
N2 - In this paper, a novel tree-based registration framework is proposed for achieving fast and accurate registration by providing a more appropriate initial deformation field for the image under registration. Specifically, in the training stage, all training real images and a selected portion of simulated images are organized into a combinative tree with the template as the root, and then each training image is registered to the template with the guidance from the intermediate images on its path to the template. In the testing stage, for a given new image, we first attach it as a child node of its most similar image on the tree, and then use the respective deformation field of this image to initialize the registration. In this way, the residual deformation of the new image to the template can be fast and robustly estimated. In the other case, to register a set of new images, we attach them to the tree one by one by allowing similar test images to help each other during the registration. Importantly, after registration of all new images, a new tree is built which is more capable of representing population distribution and thus allowing for better and faster registration for new future images. This method has been evaluated on the real brain MR image datasets, showing that it can achieve better accuracy within less time than both the statistical model based registration method and the tree-based registration method.
AB - In this paper, a novel tree-based registration framework is proposed for achieving fast and accurate registration by providing a more appropriate initial deformation field for the image under registration. Specifically, in the training stage, all training real images and a selected portion of simulated images are organized into a combinative tree with the template as the root, and then each training image is registered to the template with the guidance from the intermediate images on its path to the template. In the testing stage, for a given new image, we first attach it as a child node of its most similar image on the tree, and then use the respective deformation field of this image to initialize the registration. In this way, the residual deformation of the new image to the template can be fast and robustly estimated. In the other case, to register a set of new images, we attach them to the tree one by one by allowing similar test images to help each other during the registration. Importantly, after registration of all new images, a new tree is built which is more capable of representing population distribution and thus allowing for better and faster registration for new future images. This method has been evaluated on the real brain MR image datasets, showing that it can achieve better accuracy within less time than both the statistical model based registration method and the tree-based registration method.
KW - Image registration
KW - combinative tree
KW - incremental tree
KW - intermediate template
KW - statistical model
UR - http://www.scopus.com/inward/record.url?scp=80055062729&partnerID=8YFLogxK
U2 - 10.1109/ISBI.2011.5872627
DO - 10.1109/ISBI.2011.5872627
M3 - Conference contribution
AN - SCOPUS:80055062729
SN - 9781424441280
T3 - Proceedings - International Symposium on Biomedical Imaging
SP - 1243
EP - 1246
BT - 2011 8th IEEE International Symposium on Biomedical Imaging
Y2 - 30 March 2011 through 2 April 2011
ER -