Abstract | ||
---|---|---|
We present a new algorithm for solving the stereo vision matching problem by using dynamic programming. Edge pixels extracted from two images are matched and a dense disparity map is obtained by filling in the spaces between two consecutive edge pixels. |
Year | DOI | Venue |
---|---|---|
1997 | 10.1016/S0167-8655(97)00022-6 | Pattern Recognition Letters |
Keywords | Field | DocType |
stereo image,distance between strings,dense disparity map,regularization,stereo vision,string matching,dynamic programming | String searching algorithm,Dynamic programming,Computer vision,Pattern recognition,Stereopsis,Filling-in,Regularization (mathematics),Artificial intelligence,Pixel,Mathematics,Computer stereo vision | Journal |
Volume | Issue | ISSN |
18 | 4 | Pattern Recognition Letters |
Citations | PageRank | References |
7 | 0.96 | 5 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Angela Rojas | 1 | 7 | 0.96 |
Antonio Calvo | 2 | 7 | 0.96 |
José Muñoz | 3 | 28 | 4.32 |