光学学报, 2018, 38 (1): 0115002, 网络出版: 2018-08-31   

基于水平树结构的可变权重代价聚合立体匹配算法 下载: 976次

Variable Weight Cost Aggregation Algorithm for Stereo Matching Based on Horizontal Tree Structure
作者单位
江南大学轻工过程先进控制教育部重点实验室, 江苏 无锡 214122
图 & 表

图 1. 基于水平树结构的权值传播

Fig. 1. Weight propagation based on horizontal tree structure

下载图片 查看原文

图 2. 权值支持区域图(红色方框为中心像素,邻域像素亮度值表示对中心像素的支持权重)。(a)图像局部块;(b)未采用代价再聚合的支持权重图;(c)采用代价再聚合的支持权重图

Fig. 2. Support weights for selected regions (the brightness value of neighborhood pixel represents the support weight for central pixel which is marked with red box). (a) Image partial block; (b) support weight map without iterative cost aggregation; (c) support weight map after iterative cost aggregation

下载图片 查看原文

图 3. 采用代价再聚合前后的视差变化图。(a) Reindeer左图像;(b) Reindeer右图像;(c)未采用代价再聚合得到的左视差图;(d)采用代价再聚合得到的左视差图

Fig. 3. Disparity variation maps computed before and after iterative cost aggregation. (a) Reindeer left image; (b) Reindeer right image; (c) left disparity map computed before iterative cost aggregation; (d) left disparity map computed after iterative cost aggregation

下载图片 查看原文

图 4. 视差后处理的机理。(a) Dolls左图像;(b) Dolls右图像;(c)左右一致性检测;(d)未进行视差后处理的初始左视差图

Fig. 4. Principle of disparity refinement. (a) Dolls left image; (b) Dolls right image; (c) left-right consistence test; (d) initial left disparity map without disparity refinement

下载图片 查看原文

图 5. 采用不同视差后处理方法得到的视差图。(a)文献[ 11]的视差后处理方法;(b)改进的视差后处理方法

Fig. 5. Disparity maps with different disparity refinement methods. (a) Disparity refinement method in Ref. [11]; (b) improved disparity refinement method

下载图片 查看原文

图 6. 不同代价聚合算法得到的视差图(红色区域为误匹配像素点)。(a)真实视差图;(b)最小生成树;(c)跨尺度最小生成树;(d)引导滤波;(e)跨尺度分割树;(f)文献[ 11]代价聚合算法;(g)改进的代价聚合算法

Fig. 6. Disparity maps obtained by different cost aggregation algorithms (mismatched pixels are marked in red area). (a) Real disparity map; (b) by minimum spanning tree; (c) by cross-scale minimum spanning tree; (d) by guided filtering; (e) by cross-scale segment tree; (f) by cost aggregation algorithm in Ref. [11]; (g) by improved cost aggregation algorithm

下载图片 查看原文

图 7. Middlebury 标准图像实验结果。(a)左参考图像;(b)右参考图像;(c)左真实视差图;(d)文献[ 11]的视差后处理方法;(e)改进的视差后处理方法

Fig. 7. Experimental results of the Middlebury benchmark images. (a) Left reference images; (b) right reference images; (c) left real disparity maps; (d) by disparity refinement method in Ref. [11]; (e) by improved disparity refinement method

下载图片 查看原文

表 1本文立体匹配算法参数

Table1. Parameters of the proposed stereo matching algorithm

ParameterαTcTgσpsmoothkk1
Value0.1172255×0.0820.50.1

查看原文

表 2不同立体匹配算法在未进行视差后处理的非遮挡区域中的匹配误差(单位:%)

Table2. Error of different stereo matching methods in non-occluded areas without disparity refinement (unit: %)

Stereo pairMSTCS-MSTGFCS-STLSECVRProposed
Tsukuba2.1241.5712.5161.7422.2951.773
Venus0.8431.3842.0361.4550.5620.341
Teddy7.6155.5338.4866.0744.9124.251
Cones4.1044.1553.6134.4263.4423.361
Aloe4.1434.6345.5364.7152.8822.671
Art9.79410.7969.03310.5056.7226.461
Baby17.3758.3964.6944.5332.8822.591
Baby211.95413.3756.08315.1162.6121.601
Baby35.6437.2565.7946.2353.6823.661
Books9.56310.26610.22410.2456.7125.631
Bowling116.81420.89514.52321.7268.8226.591
Bowling29.31410.1557.08311.1864.8823.401
Cloth10.5130.6141.0860.6650.2720.151
Cloth22.8534.1363.4644.0451.4321.071
Cloth31.7732.6652.1542.7261.4121.061
Cloth41.3031.8761.6241.7551.1321.101
Dolls5.0035.9565.0445.5253.1122.901
Flowerpots16.67519.41612.79315.22412.66211.431
Lampshade110.43311.99611.57510.6149.0028.221
Lampshade220.88518.20421.13612.0837.4225.781
Laundry13.69412.94316.40614.51511.07210.701
Midd132.32527.85340.11626.95127.62229.524
Midd234.50532.09435.85624.56125.51325.092
Moebius7.6718.6959.2568.5548.1128.163
Monopoly22.51124.21227.99625.50326.37427.145
Plastic42.53447.03639.29242.72540.71334.871
Reindeer9.1559.8767.2338.3345.0823.671
Rocks12.2332.8362.7052.6441.1420.911
Rocks21.5732.0861.6141.9050.8120.781
Wood18.68511.0664.8335.9640.2410.252
Wood20.9935.6152.3446.4260.6320.621
Average rank3.6534.8764.4554.4242.1921.421
Average error10.5611.2110.5210.287.556.96

查看原文

表 3不同立体匹配算法视差后处理在全图像区域的匹配误差(单位:%)

Table3. Matching error of different stereo matching methods in image areas with disparity refinement (unit: %)

Stereo pairLSECVRProposedStereo pairLSECVRProposed
Tsukuba3.6314.012Dolls17.81212.811
Venus2.4813.232Flowerpots20.83122.262
Teddy16.08211.831Lampshade123.84222.291
Cones14.11211.261Lampshade228.79221.031
Aloe11.37111.862Laundry26.56223.261
Art25.41221.371Midd138.73234.271
Baby18.8028.451Midd233.14228.711
Baby29.7925.781Moebius18.66119.082
Baby314.48115.612Monopoly34.03233.651
Books18.93218.011Plastic41.28141.672
Bowling126.19223.441Reindeer15.93213.921
Bowling219.14218.901Rocks113.13210.061
Cloth114.55210.341Rocks214.55210.351
Cloth217.03212.461Wood19.1619.222
Cloth311.62211.411Wood28.8018.822
Cloth418.17217.731Average rank1.7121.291
Average error18.6116.68

查看原文

彭建建, 白瑞林. 基于水平树结构的可变权重代价聚合立体匹配算法[J]. 光学学报, 2018, 38(1): 0115002. Jianjian Peng, Ruilin Bai. Variable Weight Cost Aggregation Algorithm for Stereo Matching Based on Horizontal Tree Structure[J]. Acta Optica Sinica, 2018, 38(1): 0115002.

本文已被 2 篇论文引用
被引统计数据来源于中国光学期刊网
引用该论文: TXT   |   EndNote

相关论文

加载中...

关于本站 Cookie 的使用提示

中国光学期刊网使用基于 cookie 的技术来更好地为您提供各项服务,点击此处了解我们的隐私策略。 如您需继续使用本网站,请您授权我们使用本地 cookie 来保存部分信息。
全站搜索
您最值得信赖的光电行业旗舰网络服务平台!