| 研究生: |
潘柏豪 Pan, Bo-Hao |
|---|---|
| 論文名稱: |
未組織點雲資料的強化重新採樣 Consolidation Resampling of Unorganized Point Clouds |
| 指導教授: |
郭淑美
Guo, Shu-Mei |
| 共同指導教授: |
連震杰
Lien, Jenn-Jier |
| 學位類別: |
碩士 Master |
| 系所名稱: |
電機資訊學院 - 資訊工程學系 Department of Computer Science and Information Engineering |
| 論文出版年: | 2017 |
| 畢業學年度: | 105 |
| 語文別: | 中文 |
| 論文頁數: | 80 |
| 中文關鍵詞: | 加權區域最佳投影法 、K維樹 、雙邊投影 、重新取樣 |
| 外文關鍵詞: | weighted locally optimal projection, KD tree, bilateral projection, resampling |
| 相關次數: | 點閱:135 下載:4 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
本論文提出一套系統,主要應用在3D原始點雲的前處理上,將雜亂無章的點雲作重整,將雜訊點推移至想要的平面,並將點作均勻分布。本系統共分為兩個子系統:1) 應用加權區域最佳投影法於降低取樣 2) 應用雙邊投影重新取樣法於提升取樣。第一個子系統目的為降低點數量以及對點雲作重整,為了提升運算速度,我們將點雲建立為K維樹的資料結構形態,接下來運用加權區域最佳投影法去進行點的吸引與推開,移動雜訊點並使之均勻分布,並且運用k最近鄰近法去除孤立點,形成一組均勻分布無雜訊無孤立點的稀疏取樣點雲。在第二個子系統我們將點的數目新增到與原始點雲數目相當,並且不丟失取樣點雲的無雜訊無孤立點且均勻分布的特性,在第二子系統我們採用的是雙邊投影的演算法去作提升取樣,首先取其中一點與其周圍鄰近點並計算其投射基準點,再依據其基準點周圍父母點的法向量進行投射,投射至經過父母點的延伸面上,成為新增點,反覆迭代計算。因其演算法取用周圍父母點的法向量為參考,因此能妥善保留取樣點雲的特徵。最後本系統套用重新取樣的加權區域最佳投影法的架構與其重新取樣的方法去做整理系統的加速。
This thesis presents a system that mainly used in the 3D unorganized point cloud preprocessing. This system can consolidate raw point cloud data, attract noise points to the desired plane, and repulse points for the uniform distribution. The system is divided into two subsystems: 1) downsampling using WLOP (weighted locally optimal projection), 2) upsampling using bilateral projection resampling. In order to improve the speed of the process, we set the point cloud as the data structure of the K-dimensional tree, and then use the WLOP method to proceed attraction and repulsion. In order to get an organized point cloud, we move the noise points and make it evenly distributed, we also use k nearest neighbor method to remove the outlier points. In the second subsystem we add the number of points to the number of the original point cloud and not losing characteristics of no noise, no outlier and evenly distributed. In the second subsystem we are using bilateral projection method. First, we select one point and calculate the base point according to its k nearest neighbor points, and then project the base point to the extended plane of parent points according to normal vector of parent points. Finally, the projected point becomes the new point, then we iterate this process until we have enough points. Because of its algorithm taking the parent points of the normal vector as a reference, so we can properly keep the characteristics of the sample point cloud. At the end, this system applies the resampling WLOP and its resampling method to speed up the system.
[1] K. Michael and H. Hugues, "Screened poisson surface reconstruction.," ACM Transactions on Graphics (TOG) Volume 32 Issue 3 Article No. 29, pp. 1-13, June 2013.
[2] D. Lanman and G. Taubin, "Build your own 3D scanner: 3D photography for beginners," SIGGRAPH '09 ACM SIGGRAPH 2009 Courses Article No. 8, pp. 56-68, 03 August 2009.
[3] X. Wang, X. Liu and H. Qin, "Robust Surface Consolidation of Scanned Thick Point Clouds," Computer-Aided Design and Computer Graphics (CAD/Graphics), 2013 International Conference on, pp. 38-43, 16 November 2013.
[4] S. Fleishman, D. Cohen-Or and C. T. Silva, "Robust moving least-squares fitting with sharp features," ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH 2005, pp. 544-552, July 2005.
[5] P. Breitkopf, H. Naceur, A. Rassineux and P. Villon, "Moving least squares response surface approximation: Formulation and metal forming applications," Computers & Structures, Volume 83, Issues 17–18, pp. 1411-1428, June 2005.
[6] Y. Lipman, D. Cohen-Or, D. Levin and H. Tal-Ezer, "Parameterization-free projection for geometry reconstruction," ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH 2007, Volume 26 Issue 3, Article No. 22, pp. 1-6, July 2007.
[7] H. Huang, D. Li, H. Zhang, U. Ascher and D. Cohen-Or, "Consolidation of unorganized point clouds for surface reconstruction," ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2009, Volume 28 Issue 5, Article No. 176, pp. 1-7, 16 December 2009.
[8] S. Liu, K.-C. Chan and C. C. Wang, "Iterative consolidation of unorganized point clouds.," IEEE Computer Graphics and Applications, Volume: 32, Issue: 3, pp. 70-83, May 2012.
[9] H. Yang, K. Hao and Y. Ding, "Resampling to Speed Up Consolidation of Point Clouds," Mathematical Problems in Engineering, Volume 2015 (2015), Article ID 646410, pp. 1-12, 10 March 2015.
[10] X. Wu and W. Chen, "A scattered point set hole-filling method based on boundary extension and convergence," Intelligent Control and Automation (WCICA), 2014 11th World Congress on, pp. 5329-5334, 29 June 2014.
[11] G. Guennebaud and M. Gross, "Algebraic point set surfaces," ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH 2007, Volume 26 Issue 3, Article No. 23, pp. 1-10, July 2007.
[12] H. Huang, S. Wu, M. Gong, D. Cohen-Or, U. Ascher and H. R. Zhang, "Edge-aware point set resampling," ACM Transactions on Graphics (TOG), Volume 32 Issue 1, Article No. 9, January 2013.