2019
DOI: 10.1007/s42835-018-00050-4
|View full text |Cite
|
Sign up to set email alerts
|

Stereo Matching with Confidence-Region Decomposition and Processing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…In contrast, global optimization commonly produces higher accuracy of disparity maps compare local methods at computational cost disadvantage. [33]- [36] introduced a global approach on of WTA optimization with dynamic programming and [15] Least Square optimization to find the final disparity value. This global approach produces less errors caused by textureless, occlusion, and discontinuity regions.…”
Section: Figure 1: Traditional Stereo Matching Taxonomy By Scharstein and Szeliskimentioning
confidence: 99%
“…In contrast, global optimization commonly produces higher accuracy of disparity maps compare local methods at computational cost disadvantage. [33]- [36] introduced a global approach on of WTA optimization with dynamic programming and [15] Least Square optimization to find the final disparity value. This global approach produces less errors caused by textureless, occlusion, and discontinuity regions.…”
Section: Figure 1: Traditional Stereo Matching Taxonomy By Scharstein and Szeliskimentioning
confidence: 99%