Stereo Correspondence Algorithms
Stereo Correspondence Algorithms is a computational method that identifies corresponding image points between left and right stereo views by minimizing disparity-induced mismatches, distinguishing itself from other image matching techniques through its explicit reliance on geometric epipolar constraints and photometric similarity within rectified stereo pairs.
450
Publications
38.4K
Citations
1.2K
Authors
417
Institutions
Publications per year
2017–2026
79
Parents
450
Cooperative Computation of Stereo Disparity
David Marr, Tomaso Poggio · Science · 1976 · 1.4K citations
Robust Wide Baseline Stereo from Maximally Stable Extremal Regions
Jiřı́ Matas, Ondřej Chum, M. Urban et al. · 2002 · 1.4K citations
1–5 of 450
1.2K
Technical University of Malaysia Malacca, Malaysia
11 publications · 582 citations
10
h-index
9
h-index
6
h-index
6
h-index
Institut National des Sciences Appliquées Rouen Normandie, France
5 publications · 115 citations
5
h-index
1–5 of 1.2K
417
University of Tsukuba
Tsukuba, Japan
8 h-index
15 publications
1.2K citations
Wuhan University
Wuhan, China
8 h-index
28 publications
668 citations
Tsinghua University
Beijing, China
8 h-index
25 publications
1.1K citations
Carnegie Mellon University
Pittsburgh, United States
8 h-index
11 publications
3.5K citations

Technical University of Malaysia Malacca
Malacca, Malaysia
8 h-index
22 publications
1.2K citations
Austrian Institute of Technology
Vienna, Austria
7 h-index
26 publications
1.7K citations
The University of Texas at Austin
Austin, United States
7 h-index
12 publications
2K citations
University of Maryland, College Park
College Park, United States
7 h-index
12 publications
556 citations
1–8 of 417
TPAMI · 23 publications · 4.8K citations
20
h-index
10 publications · 367 citations
10
h-index
10 publications · 179 citations
10
h-index
10 publications · 397 citations
10
h-index
9 publications · 431 citations
9
h-index
1–5