An improved graph cut algorithm in stereo matching
Author(s): Lu, BL (Lu, Baoli); Sun, L (Sun, Liang); Yu, LN (Yu, Lina); Dong, XL (Dong, Xiaoli)
Source: DISPLAYS Volume: 69 Article Number: 102052 DOI: 10.1016/j.displa.2021.102052 Published: SEP 2021
Abstract: In stereo matching tasks, the matching effect is often very poor when the texture of the region is weak or repeated. To solve this problem, an improved Graph Cut stereo matching algorithm based on Census transform is proposed. The Hamming distance of the corresponding pixels in the left and right images after Census transform is introduced as the similarity measure in the data term of the energy function. In this way, the dependence on the pixel value is reduced. The stereo matching experiments are implemented on the standard images of Middlebury stereo benchmark and the real scene images, and it demonstrates that our algorithm is robust and can obtain better performance in weak texture or repeated texture region.
Accession Number: WOS:000696933500009
ISSN: 0141-9382
eISSN: 1872-7387
Full Text: https://www.sciencedirect.com/science/article/pii/S0141938221000627?via%3Dihub