{"title":"基于Lucas-Kanade算法的图像配准与比较参数曝光补偿联合优化","authors":"Dong Sik Kim, Su Yeon Lee, Kiryung Lee","doi":"10.1109/ICPR.2006.735","DOIUrl":null,"url":null,"abstract":"An iterative registration algorithm, the Lucas-Kanade algorithm, is combined with an exposure compensation algorithm to jointly optimize the spatial registration and the exposure compensation. The coordinate descent method is employed to minimize a mean squared error between image pairs. Based on a simple regression model, a non-parametric estimator, the empirical conditional mean and its polynomial fitting are used as histogram transformation functions for the exposure compensation. The proposed algorithm performs a good registration for real perspective and microscopic images, and can easily adopt other exposure compensation approaches and variations of the Lucas-Kanade algorithms due to its implicit flexibility","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Joint Optimization of Image Registration and Comparametric Exposure Compensation Based on the Lucas-Kanade Algorithm\",\"authors\":\"Dong Sik Kim, Su Yeon Lee, Kiryung Lee\",\"doi\":\"10.1109/ICPR.2006.735\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An iterative registration algorithm, the Lucas-Kanade algorithm, is combined with an exposure compensation algorithm to jointly optimize the spatial registration and the exposure compensation. The coordinate descent method is employed to minimize a mean squared error between image pairs. Based on a simple regression model, a non-parametric estimator, the empirical conditional mean and its polynomial fitting are used as histogram transformation functions for the exposure compensation. The proposed algorithm performs a good registration for real perspective and microscopic images, and can easily adopt other exposure compensation approaches and variations of the Lucas-Kanade algorithms due to its implicit flexibility\",\"PeriodicalId\":236033,\"journal\":{\"name\":\"18th International Conference on Pattern Recognition (ICPR'06)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"18th International Conference on Pattern Recognition (ICPR'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.2006.735\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th International Conference on Pattern Recognition (ICPR'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.2006.735","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Joint Optimization of Image Registration and Comparametric Exposure Compensation Based on the Lucas-Kanade Algorithm
An iterative registration algorithm, the Lucas-Kanade algorithm, is combined with an exposure compensation algorithm to jointly optimize the spatial registration and the exposure compensation. The coordinate descent method is employed to minimize a mean squared error between image pairs. Based on a simple regression model, a non-parametric estimator, the empirical conditional mean and its polynomial fitting are used as histogram transformation functions for the exposure compensation. The proposed algorithm performs a good registration for real perspective and microscopic images, and can easily adopt other exposure compensation approaches and variations of the Lucas-Kanade algorithms due to its implicit flexibility