Uncertainty guided ranking loss for enhanced domain generalizable stereo-matching
Stereo-matching is a fundamental technique for accurately estimating scene depth in numerous computer vision applications. However, prevailing deep learning-based stereo-matching networks frequently encounter challenges regarding generalization across different domains. Recent research endeavors hav...
Main Author: | Nallapati, Nikhil |
---|---|
Other Authors: | Lam Siew Kei |
Format: | Thesis-Master by Research |
Language: | English |
Published: |
Nanyang Technological University
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/180792 |
Similar Items
-
MVSGaussian: fast generalizable Gaussian splatting reconstruction from multi-view stereo
by: Liu, Tianqi, et al.
Published: (2025) -
Towards generalizable neural program understanding and synthesis
by: Li, Zhiming
Published: (2024) -
BrainOOD: out-of-distribution generalizable brain network analysis
by: Xu, Jiaxing, et al.
Published: (2025) -
Experimental implementations of stereo matching algorithms in Halide
by: Zhang, Min, M. Eng. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (2016)
Published: (2018) -
Scalable, generalizable, and offline methods for imperfect-information extensive-form games
by: Li, Shuxin
Published: (2025)