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...

Full description

Saved in:
Bibliographic Details
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
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-180792
record_format dspace
spelling sg-ntu-dr.10356-1807922024-11-01T08:23:04Z Uncertainty guided ranking loss for enhanced domain generalizable stereo-matching Nallapati, Nikhil Lam Siew Kei College of Computing and Data Science ASSKLam@ntu.edu.sg Computer and Information Science 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 have addressed this issue primarily by mitigating the detrimental impact of shortcut features stemming from excessive dependence on local chromatic attributes such as color, illumination, and texture. In this thesis, we propose a novel approach to enhance the generalization capabilities of stereo-matching networks from a geometric standpoint. Specifically, we introduce a geometry regularization technique that encodes depth ordinal relationships through a stereo uncertainty-guided ranking loss mechanism. This regularization strategy aims to guide the network towards effectively navigating challenging areas during the learning process, ultimately facilitating a more accurate geometrical understanding of the scene. Our proposed regularization scheme complements existing research efforts to improve the generalization of stereo-matching networks at the chromaticity level. Furthermore, it seamlessly integrates with these frameworks, resulting in additional performance enhancements. Through extensive evaluations conducted on diverse datasets, we demonstrate the effectiveness of our method in achieving superior performance. To ascertain the practical viability of our methodology, a field trial was conducted leveraging the ZED 2i stereo camera in conjunction with a real-time model deployed on an Nvidia Jetson development kit. The efficacy of our approach was thoroughly demonstrated through these experimental trials. Comprehensive evaluations were conducted using real-world images captured within the NTU campus environment, thereby substantiating the effectiveness and applicability of the proposed methodology. Our thesis contributes to advancing the field of stereo-matching by proposing a novel geometry regularization approach that enhances the generalization capabilities of stereo-matching networks, leading to improved depth estimation accuracy across various scenarios and environments. Master's degree 2024-10-28T00:33:29Z 2024-10-28T00:33:29Z 2024 Thesis-Master by Research Nallapati, N. (2024). Uncertainty guided ranking loss for enhanced domain generalizable stereo-matching. Master's thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/180792 https://hdl.handle.net/10356/180792 10.32657/10356/180792 en This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). application/pdf Nanyang Technological University
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Computer and Information Science
spellingShingle Computer and Information Science
Nallapati, Nikhil
Uncertainty guided ranking loss for enhanced domain generalizable stereo-matching
description 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 have addressed this issue primarily by mitigating the detrimental impact of shortcut features stemming from excessive dependence on local chromatic attributes such as color, illumination, and texture. In this thesis, we propose a novel approach to enhance the generalization capabilities of stereo-matching networks from a geometric standpoint. Specifically, we introduce a geometry regularization technique that encodes depth ordinal relationships through a stereo uncertainty-guided ranking loss mechanism. This regularization strategy aims to guide the network towards effectively navigating challenging areas during the learning process, ultimately facilitating a more accurate geometrical understanding of the scene. Our proposed regularization scheme complements existing research efforts to improve the generalization of stereo-matching networks at the chromaticity level. Furthermore, it seamlessly integrates with these frameworks, resulting in additional performance enhancements. Through extensive evaluations conducted on diverse datasets, we demonstrate the effectiveness of our method in achieving superior performance. To ascertain the practical viability of our methodology, a field trial was conducted leveraging the ZED 2i stereo camera in conjunction with a real-time model deployed on an Nvidia Jetson development kit. The efficacy of our approach was thoroughly demonstrated through these experimental trials. Comprehensive evaluations were conducted using real-world images captured within the NTU campus environment, thereby substantiating the effectiveness and applicability of the proposed methodology. Our thesis contributes to advancing the field of stereo-matching by proposing a novel geometry regularization approach that enhances the generalization capabilities of stereo-matching networks, leading to improved depth estimation accuracy across various scenarios and environments.
author2 Lam Siew Kei
author_facet Lam Siew Kei
Nallapati, Nikhil
format Thesis-Master by Research
author Nallapati, Nikhil
author_sort Nallapati, Nikhil
title Uncertainty guided ranking loss for enhanced domain generalizable stereo-matching
title_short Uncertainty guided ranking loss for enhanced domain generalizable stereo-matching
title_full Uncertainty guided ranking loss for enhanced domain generalizable stereo-matching
title_fullStr Uncertainty guided ranking loss for enhanced domain generalizable stereo-matching
title_full_unstemmed Uncertainty guided ranking loss for enhanced domain generalizable stereo-matching
title_sort uncertainty guided ranking loss for enhanced domain generalizable stereo-matching
publisher Nanyang Technological University
publishDate 2024
url https://hdl.handle.net/10356/180792
_version_ 1814777727881838592