{"title":"基于三维轮廓特征的多次激光扫描配准","authors":"Shaoxing Hu, H. Zha, Aiwu Zhang","doi":"10.1109/IV.2006.91","DOIUrl":null,"url":null,"abstract":"When 3D laser scanner captures range data of real scenes, one of most important problems is how to align all range data into a common coordinate system. In this paper, we propose an algorithm of registration of multiple range data from real scenes using 3D contour features. Firstly, 3D contour features are extracted using self-adaptive curve fitting, and a searching structure of octree is built from the 3D contour features. Secondly, using Mahalanobis distance, the leaf nodes are matched between two scans to compute original transform matrix, and then transform matrix is refined step by step through ICP until a best transform matrix is obtained. Lastly, a new global registration strategy is given based on the nearby principle. The experiments of multiple range data registration from indoor scenes, outdoor scenes and ancient buildings are done, and the results show the proposed algorithm is robust","PeriodicalId":222118,"journal":{"name":"Tenth International Conference on Information Visualisation (IV'06)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Registration of Multiple Laser Scans Based on 3D Contour Features\",\"authors\":\"Shaoxing Hu, H. Zha, Aiwu Zhang\",\"doi\":\"10.1109/IV.2006.91\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When 3D laser scanner captures range data of real scenes, one of most important problems is how to align all range data into a common coordinate system. In this paper, we propose an algorithm of registration of multiple range data from real scenes using 3D contour features. Firstly, 3D contour features are extracted using self-adaptive curve fitting, and a searching structure of octree is built from the 3D contour features. Secondly, using Mahalanobis distance, the leaf nodes are matched between two scans to compute original transform matrix, and then transform matrix is refined step by step through ICP until a best transform matrix is obtained. Lastly, a new global registration strategy is given based on the nearby principle. The experiments of multiple range data registration from indoor scenes, outdoor scenes and ancient buildings are done, and the results show the proposed algorithm is robust\",\"PeriodicalId\":222118,\"journal\":{\"name\":\"Tenth International Conference on Information Visualisation (IV'06)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tenth International Conference on Information Visualisation (IV'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IV.2006.91\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tenth International Conference on Information Visualisation (IV'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IV.2006.91","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Registration of Multiple Laser Scans Based on 3D Contour Features
When 3D laser scanner captures range data of real scenes, one of most important problems is how to align all range data into a common coordinate system. In this paper, we propose an algorithm of registration of multiple range data from real scenes using 3D contour features. Firstly, 3D contour features are extracted using self-adaptive curve fitting, and a searching structure of octree is built from the 3D contour features. Secondly, using Mahalanobis distance, the leaf nodes are matched between two scans to compute original transform matrix, and then transform matrix is refined step by step through ICP until a best transform matrix is obtained. Lastly, a new global registration strategy is given based on the nearby principle. The experiments of multiple range data registration from indoor scenes, outdoor scenes and ancient buildings are done, and the results show the proposed algorithm is robust