방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 스테레오 정합× | 템플릿 매칭× | |
|---|---|---|
| 분야 | 컴퓨터 비전 | 컴퓨터 비전 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1990s | 1980s |
| 창시자≠ | David Scharstein and Richard Szeliski | Computer vision community |
| 유형≠ | Depth estimation and 3D vision | Pattern matching and detection |
| 원전≠ | Scharstein, D., & Szeliski, R. (2002). A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision, 47(1), 7–42. DOI ↗ | Lewis, J. P. (2004). Fast normalized cross-correlation. Vision Interface, 120–123. link ↗ |
| 별칭 | Stereo correspondence, Disparity estimation | Correlation-based matching, Similarity matching |
| 관련 | 5 | 5 |
| 요약≠ | Stereo matching is a computer vision technique for recovering depth information by finding corresponding points between a pair of stereo images (taken from slightly different viewpoints). By locating the same scene feature in both images and measuring the disparity (horizontal shift), stereo matching reconstructs 3D structure using the principles of triangulation. | Template matching is a straightforward technique for locating a known pattern (template) within a larger image. By sliding a template image across the target image and computing a similarity measure at each position, template matching identifies locations where the template appears. It is effective for simple object detection when templates are well-defined and appearance variation is limited. |
| ScholarGate데이터셋 ↗ |
|
|