Improved AD-Census stereo matching algorithm based on fusion gradient information

In view of the drawback that the stereo matching algorithm cannot simultaneously improve the accuracy and speed, an improved stereo matching algorithm based on AD-Census fusion of gradient information is proposed. The Census transformation based on parameters is improved to the Census transformation of the eight domains within the central pixel point window, and combined with the Absolute Difference AD algorithm for local matching. This greatly shortens the time consumption of the cost calculation stage. To simultaneously improve the matching accuracy, the gradient information of pixels is integrated into the cost matching process. Experimental results show that the cost calculation time of the algorithm on images with simple pixels is stable within 0.4 seconds, and the mismatch rate on the Middlebury2.0 test platform is reduced by about 5% compared with the unoptimized algorithm.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1109/aemcse65292.2025.11042400
Primary Topic
Advanced Vision and Imaging
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improved AD-Census stereo matching algorithm based on fusion gradient information

Junhua Wu, Zihong Chen
Advanced Vision and Imaging
article

Improved AD-Census stereo matching algorithm based on fusion gradient information

Junhua Wu, Zihong Chen
article en

Abstract

In view of the drawback that the stereo matching algorithm cannot simultaneously improve the accuracy and speed, an improved stereo matching algorithm based on AD-Census fusion of gradient information is proposed. The Census transformation based on parameters is improved to the Census transformation of the eight domains within the central pixel point window, and combined with the Absolute Difference AD algorithm for local matching. This greatly shortens the time consumption of the cost calculation stage. To simultaneously improve the matching accuracy, the gradient information of pixels is integrated into the cost matching process. Experimental results show that the cost calculation time of the algorithm on images with simple pixels is stable within 0.4 seconds, and the mismatch rate on the Middlebury2.0 test platform is reduced by about 5% compared with the unoptimized algorithm.

Anhui Sanlian University (CN)
Openalex Percentile: Top 87%
Advanced Vision and Imaging
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.