{"title":"Large Scale Scenes Reconstruction from Multiple Views","authors":"Shi Limin, Zhang Feng, Zhenhui Xu, Zhanyi Hu","doi":"10.1109/ISCSCT.2008.323","DOIUrl":null,"url":null,"abstract":"In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by matching key points across images. Then it builds a tetrahedral decomposition of space by computing the 3D Delaunay triangulation of the 3D point set. Finally, a triangular mesh of the scene is extracted by labeling Delaunay tetrahedra as inside or outside. A globally optimal label assignment is efficiently found as a minimum cut solution in a graph. Experimental results demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Computer Science and Computational Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCSCT.2008.323","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by matching key points across images. Then it builds a tetrahedral decomposition of space by computing the 3D Delaunay triangulation of the 3D point set. Finally, a triangular mesh of the scene is extracted by labeling Delaunay tetrahedra as inside or outside. A globally optimal label assignment is efficiently found as a minimum cut solution in a graph. Experimental results demonstrate the effectiveness of the proposed algorithm.