.png){kind=icon}
Return
Fast and automatic stereo vision matching algorithm based on dynamic programming method
.png){kind=icon}
PRE
AI
DOI：10.1016/0167-8655(96)00004-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider that the matching problem in a stereo vision process can be treated as the problem of finding an optimal path on a two-dimensional (2D) search plane. To obtain this path, we consider a non-linear gain function which varies as a function of threshold values calculated during the preliminary statistical analysis of the right and left images.
Keywords:
automatic stereo image matching
dynamic programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
8.0K
Citations:
1.6W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave