本文關(guān)鍵詞：基于雙目視覺的大場景三維重建研究與實現(xiàn)　出處：《吉林大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 三維重建 雙目視覺 大場景 立體匹配 Open CV

【摘要】：隨著人們的認知水平和物質(zhì)文化追求的提高,越來越多的3D技術(shù)相關(guān)的產(chǎn)品開始在人群中普及,為了獲得更好的產(chǎn)品體驗,虛擬現(xiàn)實三維重建技術(shù)開始重新回到人們的視野之中,也越發(fā)受到人們的重視。本文研究并實現(xiàn)了一個完整的大場景三維重建系統(tǒng),包括立體標定,立體校正,立體匹配和場景表面三維點云重建等過程。在立體匹配階段,針對原NLCA算法考慮因素過于單一,無法適應(yīng)大場景圖形規(guī)模大,多尺度,場景物體豐富,深度變化頻繁等特點,本文對原算法進行了進一步的改進。首先,我們對初始代價函數(shù)進行優(yōu)化,使用ADCensus代價計算方法融合像素點的梯度信息,強化像素點的邊緣特征。另外,在代價聚合階段,在構(gòu)建最小生成樹時,本文定義了一種同時包含了邊緣和顏色權(quán)值分量的新的權(quán)值函數(shù)為相鄰點對之間的邊賦值。另外根據(jù)圖像邊緣成因,我們在使用sobel算子對圖像進行邊緣檢測的同時,使用SLIC超像素分割塊對邊緣權(quán)值分量進行二次約束,極大地減少了由于除深度變化外的其他原因產(chǎn)生的邊緣像素點在最小生成樹構(gòu)建過程中產(chǎn)生的影響。此外,在視差求精階段,本文提出了一種基于超像素塊的視差優(yōu)化算法,利用同一超像素塊中的像素點具有較高的相似度的特點,對視差數(shù)據(jù)進行修復(fù),有效提高穩(wěn)定點的比重,在此基礎(chǔ)上,結(jié)合原算法中使用的基于最小生成樹代價聚合的優(yōu)化方案,有效提高了優(yōu)化質(zhì)量。在算法的最后階段,為了提高三維重建的完整性,本文加入了一系列視差優(yōu)化過程,包括前文所述的基于超像素塊的視差優(yōu)化過程,并對該算法無法優(yōu)化的區(qū)域進行再次填充并使用改進了的中值濾波算法對不穩(wěn)定像素點區(qū)域進行優(yōu)化,有效減少了視差圖像上的不連續(xù)塊和空洞,有效解決了視差圖像與參考圖像所反映的場景的實際信息不一致的問題,提高三維重建過程的準確性和完整性。實驗數(shù)據(jù)表明,本文較原算法而言具有明顯的優(yōu)勢,不僅在低分率圖像上取得較好的效果,對于本文所使用的高分辨率大場景圖像素材同樣適用,證明了本研究構(gòu)建的大場景三維重建系統(tǒng)可靠性、準確性以及穩(wěn)定性。
[Abstract]:With the improvement of people's cognitive level and material and cultural pursuit, more and more 3D technology-related products began to be popularized in the crowd, in order to obtain a better product experience. Virtual reality 3D reconstruction technology has begun to return to people's vision, and has been paid more and more attention. This paper studies and implements a complete 3D reconstruction system of large scene, including stereo calibration and stereo correction. Stereo matching and 3D point cloud reconstruction on the scene surface. In the stereo matching stage, the original NLCA algorithm is too single to adapt to large scale, multi-scale and rich scene objects. Because of the frequent change of depth, the original algorithm is further improved. First, we optimize the initial cost function and use the ADCensus cost calculation method to fuse the gradient information of pixels. Enhance the edge feature of the pixel. In addition, in the cost aggregation phase, when building the minimum spanning tree. In this paper, we define a new weight function which includes both edge and color weight components to assign the edges between adjacent points. We use the sobel operator to detect the edge of the image, and we use the SLIC hyperpixel segmentation block to perform the quadratic constraint on the edge weight component. The effect of edge pixels due to other reasons other than depth changes in the construction of the minimum spanning tree is greatly reduced.; in addition, in the parallax refinement stage. In this paper, a parallax optimization algorithm based on super-pixel block is proposed. The parallax data is repaired by using the feature of high similarity of pixels in the same super-pixel block, and the proportion of stable points is improved effectively. On this basis, the optimization scheme based on minimum spanning tree cost aggregation used in the original algorithm is used to improve the optimization quality effectively. In the last stage of the algorithm, in order to improve the integrity of 3D reconstruction. In this paper, a series of parallax optimization processes are added, including the parallax optimization process based on super-pixel blocks mentioned above. The region which can not be optimized by this algorithm is filled again and the unstable pixel area is optimized by using the improved median filter algorithm, which can effectively reduce the discontinuous blocks and holes in parallax images. It effectively solves the problem that the actual information of the scene reflected by the parallax image and the reference image is inconsistent, and improves the accuracy and integrity of the 3D reconstruction process. Compared with the original algorithm, this paper has obvious advantages, not only in the low score image achieved better results, for the use of high-resolution large scene image material is also applicable. The reliability, accuracy and stability of the system are proved.
【學(xué)位授予單位】：吉林大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP391.41

【參考文獻】

相關(guān)期刊論文 前5條

1 周瑜;李戈;張學(xué)賀;趙杰;;基于雙目視覺的地形三維重建[J];機械與電子;2016年07期

2 麥春艷;鄭立華;李民贊;;基于點云配準的果樹快速三維重建（英文）[J];農(nóng)業(yè)工程學(xué)報;2015年S2期

3 劉怡光;易守林;吳鵬飛;崔鵬;;一種新的大場景3維重建算法[J];四川大學(xué)學(xué)報(工程科學(xué)版);2015年06期

4 姜翰青;趙長飛;章國鋒;王慧燕;鮑虎軍;;基于多視圖深度采樣的自然場景三維重建[J];計算機輔助設(shè)計與圖形學(xué)學(xué)報;2015年10期

5 朱遵尚;苑云;李由;尚洋;于起峰;;嫦娥一號月面成像的高精度匹配及月貌三維重建[J];光學(xué)學(xué)報;2014年02期

相關(guān)博士學(xué)位論文 前1條

1 田豐;煤礦探測機器人導(dǎo)航關(guān)鍵技術(shù)研究[D];中國礦業(yè)大學(xué);2014年

相關(guān)碩士學(xué)位論文 前2條

1 白鵬;基于卷級神經(jīng)網(wǎng)絡(luò)的雙目立體視覺研究[D];浙江大學(xué);2016年

2 陳海波;高分辨率雙目視覺三維重建技術(shù)研究[D];浙江大學(xué);2013年

，

本文編號：1383707