Global refinement of building boundary with line feature constraints for stereo dense image matching

被引:0
作者
Gong D. [1 ,2 ]
Han Y. [3 ]
Huang X. [4 ]
机构
[1] Xi'an Institute of Surveying and Mapping, Xi'an
[2] State Key Laboratory of Geo-information Engineering, Xi'an
[3] School of Remote Sensing and Information Engineering, Wuhan University, Wuhan
[4] Wuhan Engineering Science & Technology Institute, Wuhan
来源
Cehui Xuebao/Acta Geodaetica et Cartographica Sinica | 2021年 / 50卷 / 06期
基金
中国国家自然科学基金;
关键词
Building boundary refinement; Dense stereo image matching; Graph cuts optimization; Guided image filtering; Line segment detector;
D O I
10.11947/j.AGCS.2021.20200305
中图分类号
学科分类号
摘要
Dense stereo image matching is a key technique to find correspondences through fixed matching windows and then compute 3D points through the triangulation measure. Its advantages of low cost, high point density and large measure area have fueled several smart 3D applications. However, due to occlusions in building boundaries, the fixed matching window often fattens the boundaries to a certain extend, which greatly reduces the matching accuracy in building boundaries. To achieve higher-accuracy matching result in building boundaries, this paper proposes a global building boundary refinement method based on line features, which firstly extracts line features in disparity/elevation jumps as building boundaries and then globally refines these boundaries under the basic assumption that pixels with similar intensities should have the similar disparities. The main contribution of the algorithm is to formulate the building boundary refinement problem as the optimization of a new global energy function, which is able to sharpen boundaries as well as keep details around boundaries. Compared with some state-of-the-art boundary refinement algorithms (e. g. local sharpen operators and the plane based boundary refinement), the proposed method is capable of addressing the issues they met, i. e. the incapacity to correct large errors or the over smoothness around boundaries. Experiments on aerial datasets and satellite datasets show that the proposed method is superior to two other popular boundary sharper operators and a state-of-the-art plane based boundary refinement method, and can efficiently reduce the errors in boundaries. Therefore, our method can be applied in several 3D applications, e. g. virtual reality, smart city, and building extraction. © 2021, Surveying and Mapping Press. All right reserved.
引用
收藏
页码:833 / 846
页数:13
相关论文
共 35 条
[31]  
SCHARSTEIN D, SZELISKI R., A taxonomy and evaluation of dense two-frame stereo correspondence algorithms, International Journal of Computer Vision, 47, 1-3, pp. 7-42, (2002)
[32]  
XIA Yuanxin, TIAN Jiaojiao, D'ANGELO P, Et al., Dense matching comparison between census and a convolutional neural network algorithm for plant reconstruction, ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, IV-2, pp. 303-309, (2018)
[33]  
PARIS S, KORNPROBST P, TUMBLIN J, Et al., Bilateral filtering: theory and applications, pp. 1-73, (2009)
[34]  
BOYKOV Y, VEKSLER O, ZABIH R., Fast approximate energy minimization via graph cuts, IEEE Transactions on Pattern Analysis and Machine Intelligence, 23, 11, pp. 1222-1239, (2001)
[35]  
MOZEROV M G, VAN DE WEIJER J., Accurate stereo matching by two-step energy minimization, IEEE Transactions on Image Processing, 24, 3, pp. 1153-1163, (2015)