Hierarchical Discrete Distribution Decomposition for Match Density Estimation

Zhichao Yin, Trevor Darrell, Fisher Yu
CVPR 2019

Hierarchical Discrete Distribution Decomposition for Match Density Estimation

Abstract

Explicit representations of the global match distributions of pixel-wise correspondences between pairs of images are desirable for uncertainty estimation and downstream applications. However, the computation of the match density for each pixel may be prohibitively expensive due to the large number of candidates. In this paper, we propose Hierarchical Discrete Distribution Decomposition (HD^3), a framework suitable for learning probabilistic pixel correspondences in both optical flow and stereo matching. We decompose the full match density into multiple scales hierarchically, and estimate the local matching distributions at each scale conditioned on the matching and warping at coarser scales. The local distributions can then be composed together to form the global match density. Despite its simplicity, our probabilistic method achieves state-of-the-art results for both optical flow and stereo matching on established benchmarks. We also find the estimated uncertainty is a good indication of the reliability of the predicted correspondences.

Paper

Code

paper
github.com/ucbdrive/hd3

Citation

@inproceedings{yin2019hd3,
    title = {Hierarchical Discrete Distribution Decomposition for Match Density Estimation},
    author = {Yin, Zhichao and Darrell, Trevor and Yu, Fisher},
    booktitle = {CVPR},
    year = {2019}
}

Related


Probabilistic Warp Consistency for Weakly-Supervised Semantic Correspondences

Probabilistic Warp Consistency for Weakly-Supervised Semantic Correspondences

CVPR 2022 We propose Probabilistic Warp Consistency, a weakly-supervised learning objective for semantic matching.


Warp Consistency for Unsupervised Learning of Dense Correspondences

Warp Consistency for Unsupervised Learning of Dense Correspondences

ICCV 2021 Oral We propose Warp Consistency, an unsupervised learning objective for dense correspondence regression.


Disentangling Propagation and Generation for Video Prediction

Disentangling Propagation and Generation for Video Prediction

ICCV 2019 We describe a computational model for high-fidelity video prediction which disentangles motion-specific propagation from motion-agnostic generation.