期刊文献+

LiDAR三维重建中基于CSG方法的扩展研究 被引量:2

Expanding research on CSG in 3D reconstruction from LiDAR
下载PDF
导出
摘要 针对机载激光雷达(airborne light detection and ranging,Li DAR)数据三维重建中运用构造表示法(constructive solid geometry,CSG)无法对复杂模型自动地进行基元分解、基元模型识别以及模型集成等问题,提出了一种基于CSG扩展的三维重建方法。该方法利用建筑物等高线的分族特性,通过等高线分族实现了CSG方法中复杂建筑物模型的层次划分和基元分解,在此基础上,结合建筑物分层等高线族特征和分层轮廓线的重建结果来辨别基元类型,实现了CSG方法中基元的自动识别,并依据其识别结果采用相应的重建方法完成模型基元的分部重建,最后依据一套有效的模型集成规则实现了复杂建筑物整体模型的自动建模。通过大范围的Li DAR数据进行试验,验证了基于CSG扩展方法对复杂建筑物三维建模的有效性。 To tackling such problems as primitive decomposition, primitive recognition, model integration in 3D model reconstruction with LiDAR data by using the CSG method, this paper proposes an expanding method for CSG. In this method, the clustering property of building contours is used for layers partition and primitives decomposition, then the styles of the primitives is recognized by combining the features of contours clusters and the contour reconstruction results. In this way, the process of primitives automatic recognition in CSG method is achieved. According to the primitive recognition result, the corresponding reconstruction method for the segmentation is selected, and the whole 3D model for complex building is automatically reconstructed by integrating the segmentation models based on a set of effective model integration rules at last. Experiment results of a wide range LiDAR data show that the proposed expanding CSG method is effective in the 3D reconstruction of complex buildings with LiDAR data.
出处 《国土资源遥感》 CSCD 北大核心 2016年第4期35-42,共8页 Remote Sensing for Land & Resources
基金 国家自然科学基金项目"山地城市环境下等高线辅助的机载LiDAR点云复杂建筑物三维模型重建方法研究"(编号:41401497) 湖南省科技计划项目"云计算环境下基于机载LiDAR数据快速获取高精度DEM的应用研究"(编号:2015GK3027)共同资助
关键词 LIDAR 三维重建 CSG 基元分解 基元识别 等高线族 轮廓重建 LiDAR 3D reconstruction CSG primitive decomposition primitive recognition contour cluster contour reconstruction
  • 相关文献

参考文献4

二级参考文献47

  • 1Ramer U, An Iterative Procedure for the Polygonal Approximation of Plane Curves [J]. Computer Graphics and Image Processing, 1972(1) : 244-256.
  • 2Douglas D H, Peucker T K. Algorithms for the Re duction of the Number of Points Requireo to Represent a Digitized Line or Its Caricature[J]. Cartographica: the International Journal for Geographic Information and Geovisualization,1973(10) :112-122.
  • 3Masood A, Haq S A. A Novel Approach to Polygonal Approximation of Digital Curves[J]. Journal of Visual Communication and Image Representation, 2007,18:264-274.
  • 4Horng J H. Improving Fitting Quality of Polygonal Approximation by Using the Dynamic Programming Technique[J]. Pattern Recognition Letters, 2002, 23 : 1 657-1 673.
  • 5Huang S C, Sun Y N. Polygonal Approximation Using Genetic Algorithms [J]. Pattern Recognition, 1999,32:1 409-1 420.
  • 6Yin P Y. Ant Colony Search Algorithms for Optimal Polygonal Approximation of Plane Curves[J]. Pattern Recognition, 2003,36:1 783-1 797.
  • 7Attneave F. Some Informational Aspects of Visual Perception[J]. Psychol Rev, 1954,61: 183-193.
  • 8Teh C H, Chin R T. On the Detection of Dominant Points on Digital Curves[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1989 (11):859-872.
  • 9Pei S C, Horng J H. Corner Point Detection Using Nest Moving Average [J]. Pattern Recognition, 1994,27:1 533-1 537.
  • 10Wu W Y. Dominant Point Detection Using Adaptive Bending Value [J]. Image and Vision Computing,2003,21:517-525.

共引文献196

同被引文献24

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部