Amir B. Geva, Barak Pinkovich, E. Rivlin, H. Rotstein
{"title":"结合束调整与数字地形图:软硬约束","authors":"Amir B. Geva, Barak Pinkovich, E. Rivlin, H. Rotstein","doi":"10.1109/EURONAV.2017.7954218","DOIUrl":null,"url":null,"abstract":"This paper presents an algorithm for computing a pose solution based on constraining the Bundle Adjustment algorithm with a Digital Terrain Map. The approach is motivated by the difficulties observed when using previous schemes for solving realistic problems. Some specific implementation aspects are reviewed, and in particular an algorithm for approximating the sampled DTM with a smooth surface is discussed. The paper contains a thorough simulation study and the results of an actual flight test. The implementation of the algorithm is shown to have good convergence properties, even under relatively hard scenarios, and a consistent behavior when the parameters characterizing the problem are varied.","PeriodicalId":145124,"journal":{"name":"2017 European Navigation Conference (ENC)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Combining Bundle Adjustment with a Digital Terrain Map: Soft and hard constraints\",\"authors\":\"Amir B. Geva, Barak Pinkovich, E. Rivlin, H. Rotstein\",\"doi\":\"10.1109/EURONAV.2017.7954218\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an algorithm for computing a pose solution based on constraining the Bundle Adjustment algorithm with a Digital Terrain Map. The approach is motivated by the difficulties observed when using previous schemes for solving realistic problems. Some specific implementation aspects are reviewed, and in particular an algorithm for approximating the sampled DTM with a smooth surface is discussed. The paper contains a thorough simulation study and the results of an actual flight test. The implementation of the algorithm is shown to have good convergence properties, even under relatively hard scenarios, and a consistent behavior when the parameters characterizing the problem are varied.\",\"PeriodicalId\":145124,\"journal\":{\"name\":\"2017 European Navigation Conference (ENC)\",\"volume\":\"123 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 European Navigation Conference (ENC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EURONAV.2017.7954218\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 European Navigation Conference (ENC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURONAV.2017.7954218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Combining Bundle Adjustment with a Digital Terrain Map: Soft and hard constraints
This paper presents an algorithm for computing a pose solution based on constraining the Bundle Adjustment algorithm with a Digital Terrain Map. The approach is motivated by the difficulties observed when using previous schemes for solving realistic problems. Some specific implementation aspects are reviewed, and in particular an algorithm for approximating the sampled DTM with a smooth surface is discussed. The paper contains a thorough simulation study and the results of an actual flight test. The implementation of the algorithm is shown to have good convergence properties, even under relatively hard scenarios, and a consistent behavior when the parameters characterizing the problem are varied.