A. Polette, E. Auvinet, J. Mari, I. Brunette, J. Meunier
{"title":"角膜变异性研究中平均曲面的构造","authors":"A. Polette, E. Auvinet, J. Mari, I. Brunette, J. Meunier","doi":"10.1109/CRV.2014.51","DOIUrl":null,"url":null,"abstract":"In this study, we present an algorithm to build a mean surface, applied to the human cornea, for the study of variability within a population. Due to the smoothness of the corneal surface, there is no anatomical anchor. The main challenge is to match several surfaces from different subjects to build the mean cornea. The key idea is to use a registration step based on a global factor: the volume minimization between two surfaces. We then compute the surface disparity after registration. An iterative algorithm minimizes this disparity to determine the best possible matching. The algorithm re-samples the registered surfaces on a common grid to compute the mean surface. Finally, we compute a disparity map and a mean disparity value after registration to estimate the registration accuracy and to compare our method to the existing one.","PeriodicalId":385422,"journal":{"name":"2014 Canadian Conference on Computer and Robot Vision","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Construction of a Mean Surface for the Variability Study of the Cornea\",\"authors\":\"A. Polette, E. Auvinet, J. Mari, I. Brunette, J. Meunier\",\"doi\":\"10.1109/CRV.2014.51\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this study, we present an algorithm to build a mean surface, applied to the human cornea, for the study of variability within a population. Due to the smoothness of the corneal surface, there is no anatomical anchor. The main challenge is to match several surfaces from different subjects to build the mean cornea. The key idea is to use a registration step based on a global factor: the volume minimization between two surfaces. We then compute the surface disparity after registration. An iterative algorithm minimizes this disparity to determine the best possible matching. The algorithm re-samples the registered surfaces on a common grid to compute the mean surface. Finally, we compute a disparity map and a mean disparity value after registration to estimate the registration accuracy and to compare our method to the existing one.\",\"PeriodicalId\":385422,\"journal\":{\"name\":\"2014 Canadian Conference on Computer and Robot Vision\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Canadian Conference on Computer and Robot Vision\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CRV.2014.51\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Canadian Conference on Computer and Robot Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CRV.2014.51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Construction of a Mean Surface for the Variability Study of the Cornea
In this study, we present an algorithm to build a mean surface, applied to the human cornea, for the study of variability within a population. Due to the smoothness of the corneal surface, there is no anatomical anchor. The main challenge is to match several surfaces from different subjects to build the mean cornea. The key idea is to use a registration step based on a global factor: the volume minimization between two surfaces. We then compute the surface disparity after registration. An iterative algorithm minimizes this disparity to determine the best possible matching. The algorithm re-samples the registered surfaces on a common grid to compute the mean surface. Finally, we compute a disparity map and a mean disparity value after registration to estimate the registration accuracy and to compare our method to the existing one.