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
- Zhixin Liu (ORCID: https://orcid.org/0009-0001-5420-3394)
- Y. Y. Zhai (ORCID: https://orcid.org/0000-0001-8356-0940)
- Yuyuan Du
- Kexin Chen (ORCID: https://orcid.org/0000-0001-5360-8114)
- Zhaoyu Wang (ORCID: https://orcid.org/0009-0004-6917-9173)
- Yang Ji
Institutions
- Northeastern University (CN)
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