{"title":"没有特征提取的摄像机校准","authors":"L. Robert","doi":"10.1109/ICPR.1994.576411","DOIUrl":null,"url":null,"abstract":"We present an original approach to the problem of camera calibration. Contrary to classical techniques, which first extract the image features and then compute the camera parameters, we directly search for the camera parameters that best map three-dimensional points onto the image edges, characterized as maxims of the intensity gradient or zero-crossings of the Laplacian. Expressed as a one-stage optimization problem over the parameters of the camera, the whole calibration process is solved by classical iterative optimization. We describe experiments on synthetic and real data.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"102","resultStr":"{\"title\":\"Camera calibration without feature extraction\",\"authors\":\"L. Robert\",\"doi\":\"10.1109/ICPR.1994.576411\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an original approach to the problem of camera calibration. Contrary to classical techniques, which first extract the image features and then compute the camera parameters, we directly search for the camera parameters that best map three-dimensional points onto the image edges, characterized as maxims of the intensity gradient or zero-crossings of the Laplacian. Expressed as a one-stage optimization problem over the parameters of the camera, the whole calibration process is solved by classical iterative optimization. We describe experiments on synthetic and real data.\",\"PeriodicalId\":312019,\"journal\":{\"name\":\"Proceedings of 12th International Conference on Pattern Recognition\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"102\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 12th International Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.1994.576411\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 12th International Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.1994.576411","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We present an original approach to the problem of camera calibration. Contrary to classical techniques, which first extract the image features and then compute the camera parameters, we directly search for the camera parameters that best map three-dimensional points onto the image edges, characterized as maxims of the intensity gradient or zero-crossings of the Laplacian. Expressed as a one-stage optimization problem over the parameters of the camera, the whole calibration process is solved by classical iterative optimization. We describe experiments on synthetic and real data.