An Improved Minimum Spanning Tree Stereo Matching Algorithm

被引：0
作者：
Liu, Zhigang [1 ]
Li, Keyu [1 ]
Zhang, Xiaoxue [1 ]
机构：
[1] Northeastern Univ, Sch Informat Sci & Engn, Shenyang 110819, Peoples R China
来源：
2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC) | 2015年
关键词：
Binocular Vision; Stereo Matching; Minimum Spanning Tree;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The minimum spanning tree stereo matching algorithm only takes one channel of R, G, B channels into account, ignoring the effect of the other two channels on the final edge weight in color image. This paper proposes an improved minimum spanning tree stereo matching algorithm, which calculates the weighted euclidean distance using a three-channel approach, and combines three-channel edge weight. This algorithm has been tested on Tsukuba, Venus, Teddy, Cones image. Simulation results show that the improved algorithm enhances the robustness of edge weight function and the connectivity of minimum spanning tree. It not only improves stereo matching accuracy, but also increases computational speed.
引用
收藏
页码：1866 / 1869
页数：4
相关论文
共 50 条
[41]   An Improved Method for Segmentation of Point Cloud using Minimum Spanning Tree [J].
Geetha, M. ;
Rakendu, R. .
2014 INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND SIGNAL PROCESSING (ICCSP), 2014,
[42]   Improved Minimum Spanning Tree based Image Segmentation with Guided Matting [J].
Wang, Weixing ;
Tu, Angyan ;
Bergholm, Fredrik .
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2022, 16 (01) :211-230
[43]   Minimum Generation Cube Matching Algorithm Based on Improved Matching Cost and Mean Segmentation [J].
Wang Daolei ;
Han Yang .
LASER & OPTOELECTRONICS PROGRESS, 2023, 60 (04)
[44]   An Improved Genetic Algorithm for Degree Constrained Minimum Spanning Trees [J].
Shi, Kai ;
Song, Qingfeng ;
Lin, Sheng ;
Xu, Guangping ;
Cao, Zhanxu .
PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC), 2016, :4603-4607
[45]   A Neighborhood Density Estimation Clustering Algorithm Based on Minimum Spanning Tree [J].
Luo, Ting ;
Zhong, Caiming .
ROUGH SET AND KNOWLEDGE TECHNOLOGY (RSKT), 2010, 6401 :557-565
[46]   CHSMST: a clustering algorithm based on hyper surface and minimum spanning tree [J].
He, Qing ;
Zhao, Weizhong ;
Shi, Zhongzhi .
SOFT COMPUTING, 2011, 15 (06) :1097-1103
[47]   Minimum Spanning Tree Algorithm on MapReduce One-Chip Architecture [J].
Maican, Voichita .
ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 2015, 18 (02) :126-143
[48]   A PGAS-Based Implementation for the Parallel Minimum Spanning Tree Algorithm [J].
Bejanyan, Vahag ;
Astsatryan, Hrachya .
LARGE-SCALE SCIENTIFIC COMPUTING (LSSC 2021), 2022, 13127 :431-438
[49]   Interferometric SAR phase unwrapping algorithm based on minimum spanning tree [J].
Liu, W ;
Zhao, YJ .
ICEMI 2005: CONFERENCE PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON ELECTRONIC MEASUREMENT & INSTRUMENTS, VOL 6, 2005, :454-457
[50]   A fast minimum spanning tree algorithm based on K-means [J].
Zhong, Caiming ;
Malinen, Mikko ;
Miao, Duoqian ;
Franti, Pasi .
INFORMATION SCIENCES, 2015, 295 :1-17
12345