Continuous 3D Label Stereo Matching using Local Expansion Moves

03/28/2016
by   Tatsunori Taniai, et al.
0

We present an accurate stereo matching method using local expansion moves based on graph cuts. This new move-making scheme is used to efficiently infer per-pixel 3D plane labels on a pairwise Markov random field (MRF) that effectively combines recently proposed slanted patch matching and curvature regularization terms. The local expansion moves are presented as many alpha-expansions defined for small grid regions. The local expansion moves extend traditional expansion moves by two ways: localization and spatial propagation. By localization, we use different candidate alpha-labels according to the locations of local alpha-expansions. By spatial propagation, we design our local alpha-expansions to propagate currently assigned labels for nearby regions. With this localization and spatial propagation, our method can efficiently infer MRF models with a continuous label space using randomized search. Our method has several advantages over previous approaches that are based on fusion moves or belief propagation; it produces submodular moves deriving a subproblem optimality; it helps find good, smooth, piecewise linear disparity maps; it is suitable for parallelization; it can use cost-volume filtering techniques for accelerating the matching cost computations. Even using a simple pairwise MRF, our method is shown to have best performance in the Middlebury stereo benchmark V2 and V3.

READ FULL TEXT

page 2

page 5

page 7

page 10

page 11

page 13

research
08/29/2011

Generalized Fast Approximate Energy Minimization via Graph Cuts: Alpha-Expansion Beta-Shrink Moves

We present alpha-expansion beta-shrink moves, a simple generalization of...
research
09/20/2016

Markov Random Field Model-Based Salt and Pepper Noise Removal

Problem of impulse noise reduction is a very well studied problem in ima...
research
01/28/2021

Fusion Moves for Graph Matching

We contribute to approximate algorithms for the quadratic assignment pro...
research
11/22/2018

Generalized Range Moves

We consider move-making algorithms for energy minimization of multi-labe...
research
10/28/2022

Comparison of Stereo Matching Algorithms for the Development of Disparity Map

Stereo Matching is one of the classical problems in computer vision for ...
research
12/02/2021

Generalized Closed-form Formulae for Feature-based Subpixel Alignment in Patch-based Matching

Cost-based image patch matching is at the core of various techniques in ...
research
12/02/2021

Local Similarity Pattern and Cost Self-Reassembling for Deep Stereo Matching Networks

Although convolution neural network based stereo matching architectures ...

Please sign up or login with your details

Forgot password? Click here to reset