Full Matching on Low Resolution for Disparity Estimation
- URL: http://arxiv.org/abs/2012.05586v1
- Date: Thu, 10 Dec 2020 11:11:23 GMT
- Title: Full Matching on Low Resolution for Disparity Estimation
- Authors: Hong Zhang and Shenglun Chen and Zhihui Wang and Haojie Li and Wanli
Ouyang
- Abstract summary: A Multistage Full Matching disparity estimation scheme (MFM) is proposed in this work.
We demonstrate that decouple all similarity scores directly from the low-resolution 4D volume step by step instead of estimating low-resolution 3D cost volume.
Experiment results demonstrate that the proposed method achieves more accurate disparity estimation results and outperforms state-of-the-art methods on Scene Flow, KITTI 2012 and KITTI 2015 datasets.
- Score: 84.45201205560431
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A Multistage Full Matching disparity estimation scheme (MFM) is proposed in
this work. We demonstrate that decouple all similarity scores directly from the
low-resolution 4D volume step by step instead of estimating low-resolution 3D
cost volume through focusing on optimizing the low-resolution 4D volume
iteratively leads to more accurate disparity. To this end, we first propose to
decompose the full matching task into multiple stages of the cost aggregation
module. Specifically, we decompose the high-resolution predicted results into
multiple groups, and every stage of the newly designed cost aggregation module
learns only to estimate the results for a group of points. This alleviates the
problem of feature internal competitive when learning similarity scores of all
candidates from one low-resolution 4D volume output from one stage. Then, we
propose the strategy of \emph{Stages Mutual Aid}, which takes advantage of the
relationship of multiple stages to boost similarity scores estimation of each
stage, to solve the unbalanced prediction of multiple stages caused by serial
multistage framework. Experiment results demonstrate that the proposed method
achieves more accurate disparity estimation results and outperforms
state-of-the-art methods on Scene Flow, KITTI 2012 and KITTI 2015 datasets.
Related papers
- MAP: Low-compute Model Merging with Amortized Pareto Fronts via Quadratic Approximation [80.47072100963017]
Model merging is an effective approach to combine multiple single-task models, fine-tuned from the same pre-trained model, into a multitask model.
Existing model-merging methods focus on enhancing average task accuracy.
We introduce a novel low-compute algorithm, Model Merging with Amortized Pareto Front (MAP)
arXiv Detail & Related papers (2024-06-11T17:55:25Z) - 360 Layout Estimation via Orthogonal Planes Disentanglement and
Multi-view Geometric Consistency Perception [60.23832277827669]
Existing panoramic layout estimation solutions tend to recover room boundaries from a vertically compressed sequence.
We present an unsupervised adaptation technique tailored for horizon-depth and ratio representations.
We also introduce an optimization strategy for decision-level layout analysis and a 1D cost volume construction method for feature-level multi-view aggregation.
arXiv Detail & Related papers (2023-12-26T12:16:03Z) - Data Pruning via Moving-one-Sample-out [61.45441981346064]
We propose a novel data-pruning approach called moving-one-sample-out (MoSo)
MoSo aims to identify and remove the least informative samples from the training set.
Experimental results demonstrate that MoSo effectively mitigates severe performance degradation at high pruning ratios.
arXiv Detail & Related papers (2023-10-23T08:00:03Z) - A Finite-Horizon Approach to Active Level Set Estimation [0.7366405857677227]
We consider the problem of active learning in the context of spatial sampling for level set estimation (LSE)
We present a finite-horizon search procedure to perform LSE in one dimension while optimally balancing both the final estimation error and the distance traveled for a fixed number of samples.
We show that the resulting optimization problem can be solved in closed form and that the resulting policy generalizes existing approaches to this problem.
arXiv Detail & Related papers (2023-10-18T14:11:41Z) - AdaDiff: Accelerating Diffusion Models through Step-Wise Adaptive Computation [32.74923906921339]
Diffusion models achieve great success in generating diverse and high-fidelity images, yet their widespread application is hampered by their inherently slow generation speed.
We propose AdaDiff, an adaptive framework that dynamically allocates computation resources in each sampling step to improve the generation efficiency of diffusion models.
arXiv Detail & Related papers (2023-09-29T09:10:04Z) - A Unified Framework for Multi-distribution Density Ratio Estimation [101.67420298343512]
Binary density ratio estimation (DRE) provides the foundation for many state-of-the-art machine learning algorithms.
We develop a general framework from the perspective of Bregman minimization divergence.
We show that our framework leads to methods that strictly generalize their counterparts in binary DRE.
arXiv Detail & Related papers (2021-12-07T01:23:20Z) - D2C-SR: A Divergence to Convergence Approach for Image Super-Resolution [25.17545119739454]
We present D2C-SR, a novel framework for the task of image super-resolution(SR)
Inspired by recent works like SRFlow, we tackle this problem in a semi-probabilistic manner.
Our experiments demonstrate that D2C-SR can achieve state-of-the-art performance on PSNR and SSIM, with a significantly less computational cost.
arXiv Detail & Related papers (2021-03-26T10:20:28Z) - $\mathbb{X}$Resolution Correspondence Networks [15.214155342197474]
In this paper, we aim at establishing accurate dense correspondences between a pair of images with overlapping field of view under challenging illumination variation, viewpoint changes, and style differences.
arXiv Detail & Related papers (2020-12-17T18:57:58Z) - Learning by Minimizing the Sum of Ranked Range [58.24935359348289]
We introduce the sum of ranked range (SoRR) as a general approach to form learning objectives.
A ranked range is a consecutive sequence of sorted values of a set of real numbers.
We explore two applications in machine learning of the minimization of the SoRR framework, namely the AoRR aggregate loss for binary classification and the TKML individual loss for multi-label/multi-class classification.
arXiv Detail & Related papers (2020-10-05T01:58:32Z) - MSMD-Net: Deep Stereo Matching with Multi-scale and Multi-dimension Cost
Volume [33.07553434167063]
We propose MSMD-Net to construct multi-scale and multi-dimension cost volume.
Our method shows strong domain-across generalization and outperforms best prior work by a margin with three or even five times faster speed.
arXiv Detail & Related papers (2020-06-23T07:12:00Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.