{"title":"基于层次b样条的地标和强度图像弹性配准","authors":"Tiantian Bian, Zheng Qin, Yu Liu","doi":"10.1109/ICSSSM.2007.4280182","DOIUrl":null,"url":null,"abstract":"We present an elastic registration algorithm for the alignment of biological images. Our method combines and extends some of best techniques available in the context of medical imaging. We express the deformation field as a hierarchical B-splines model basing on the information of landmarks. The hierarchical B-splines model allows us to deal with a rich variety of deformations and match two images at increasing levels of detail. We solve the registration problem by minimizing the mutual information between the reference image and the test image. Results using MRI brain data are presented that the degree of matching is higher and the cost of time is less, compared with the algorithm which has not used the concept of hierarchical B-splines.","PeriodicalId":153603,"journal":{"name":"2007 International Conference on Service Systems and Service Management","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Landmark and Intensity-Based Images Elastic Registration Using Hierarchical B-Splines\",\"authors\":\"Tiantian Bian, Zheng Qin, Yu Liu\",\"doi\":\"10.1109/ICSSSM.2007.4280182\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an elastic registration algorithm for the alignment of biological images. Our method combines and extends some of best techniques available in the context of medical imaging. We express the deformation field as a hierarchical B-splines model basing on the information of landmarks. The hierarchical B-splines model allows us to deal with a rich variety of deformations and match two images at increasing levels of detail. We solve the registration problem by minimizing the mutual information between the reference image and the test image. Results using MRI brain data are presented that the degree of matching is higher and the cost of time is less, compared with the algorithm which has not used the concept of hierarchical B-splines.\",\"PeriodicalId\":153603,\"journal\":{\"name\":\"2007 International Conference on Service Systems and Service Management\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Service Systems and Service Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSSSM.2007.4280182\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Service Systems and Service Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSSM.2007.4280182","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Landmark and Intensity-Based Images Elastic Registration Using Hierarchical B-Splines
We present an elastic registration algorithm for the alignment of biological images. Our method combines and extends some of best techniques available in the context of medical imaging. We express the deformation field as a hierarchical B-splines model basing on the information of landmarks. The hierarchical B-splines model allows us to deal with a rich variety of deformations and match two images at increasing levels of detail. We solve the registration problem by minimizing the mutual information between the reference image and the test image. Results using MRI brain data are presented that the degree of matching is higher and the cost of time is less, compared with the algorithm which has not used the concept of hierarchical B-splines.