.png){kind=icon}
Return
An Improved Adaptive Window Stereo Matching Algorithm
.png){kind=icon}
OA
AI
DOI：10.1088/1742-6596/1634/1/012066.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Abstract
In order to solve the problem that the existing adaptive window stereo matching algorithms have insufficient feature extraction in low-texture regions, resulting in low matching accuracy. An adaptive window stereo matching algorithm based on the gradient is proposed. Firstly, the Sobel operator is used to extract the gradient value of each pixel in the image. Then, each pixel is divided into high, medium and low texture regions according to the gradient value. Next, different arm length thresholds are assigned to different region pixels, and matching windows are generated dynamically according to arm length and color threshold. Finally, the pixels closer to the center of the window are given higher weights by generating windows several times. It solves the problem that the stereo matching algorithm can not select a matching window dynamically. Experimental results on Middlebury dataset show that the proposed method improves the matching accuracy by 5.5% compared with the latest adaptive window stereo matching algorithm.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available