Research on Adaptive Stereoscopic Matching Algorithm Based on SGM

SGM (Semi-Global Matching) algorithm is a binocular stereoscopic matching algorithm that uses the traditional Census transform for cost calculation. The traditional Census transform uses a fixed window size and relies on the center pixel of the window, which is susceptible to noise interference, resulting in reduced matching accuracy in areas with weak textures and discontinuous parallax. Therefore, this paper introduces dynamic adaptive matching windows based on the traditional Census algorithm, and uses different window sizes for different gradient intervals to solve the problem of using a single window in the traditional algorithm, and introduces comparison pixels instead of window center pixels to solve the problem of dependence on window center pixels. Experimental results show that in the test of the Middlebury dataset, the evaluation error rate of the proposed algorithm is $\mathbf{3. 9 3 \%}$ and the global error match rate is $5.34 \%$, which is $4.09 \%$ and $4.37 \%$ lower than that of the traditional algorithm, respectively, and has high accuracy.

Authors

Institutions

Publication Details

Published
2025-08-15
DOI
https://doi.org/10.1109/cvaa66438.2025.11193232
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Adaptive Stereoscopic Matching Algorithm Based on SGM

Zhixin Liu, Y. Y. Zhai, Yuyuan Du, Kexin Chen et al.
Advanced Algorithms and Applications
article

Research on Adaptive Stereoscopic Matching Algorithm Based on SGM

Zhixin Liu, Y. Y. Zhai, Yuyuan Du, Kexin Chen, Zhaoyu Wang, Yang Ji
article en

Abstract

SGM (Semi-Global Matching) algorithm is a binocular stereoscopic matching algorithm that uses the traditional Census transform for cost calculation. The traditional Census transform uses a fixed window size and relies on the center pixel of the window, which is susceptible to noise interference, resulting in reduced matching accuracy in areas with weak textures and discontinuous parallax. Therefore, this paper introduces dynamic adaptive matching windows based on the traditional Census algorithm, and uses different window sizes for different gradient intervals to solve the problem of using a single window in the traditional algorithm, and introduces comparison pixels instead of window center pixels to solve the problem of dependence on window center pixels. Experimental results show that in the test of the Middlebury dataset, the evaluation error rate of the proposed algorithm is $\mathbf{3. 9 3 \%}$ and the global error match rate is $5.34 \%$, which is $4.09 \%$ and $4.37 \%$ lower than that of the traditional algorithm, respectively, and has high accuracy.

Northeastern University (CN)
Openalex Percentile: Top 63%
Advanced Algorithms and Applications
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.