Pith. sign in

REVIEW 1 cited by

Probabilistic Modeling of Disparity Uncertainty for Robust and Efficient Stereo Matching

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.18703 v2 pith:H64YANVX submitted 2024-12-24 cs.CV

classification cs.CV
keywords uncertaintystereomatchingmodeldatadisparityestimateefficiently
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Stereo matching plays a crucial role in various applications, where understanding uncertainty can enhance both safety and reliability. Despite this, the estimation and analysis of uncertainty in stereo matching have been largely overlooked. Previous works struggle to separate it into data (aleatoric) and model (epistemic) components and often provide limited interpretations of uncertainty. This interpretability is essential, as it allows for a clearer understanding of the underlying sources of error, enhancing both prediction confidence and decision-making processes. In this paper, we propose a new uncertainty-aware stereo matching framework. We adopt Bayes risk as the measurement of uncertainty and use it to separately estimate data and model uncertainty. We systematically analyze data uncertainty based on the probabilistic distribution of disparity and efficiently estimate model uncertainty without repeated model training. Experiments are conducted on four stereo benchmarks, and the results demonstrate that our method can estimate uncertainty accurately and efficiently, without sacrificing the disparity prediction accuracy.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. OscNet: Machine Learning on CMOS Oscillator Networks

    cs.CV 2025-02 conditional novelty 4.0 of 10

    CMOS oscillator networks with phase-encoded values and winner-take-all Hebbian learning can perform convolution, regression, and MNIST classification, per the paper's simulations.

Pith tools