Filters








17 Hits in 2.5 sec

PMBP: PatchMatch Belief Propagation for Correspondence Field Estimation

Frederic Besse, Carsten Rother, Andrew Fitzgibbon, Jan Kautz
2013 International Journal of Computer Vision  
We show how these ingredients are related to steps in a specific form of belief propagation in the continuous space, called Particle Belief Propagation (PBP).  ...  PatchMatch is a simple, yet very powerful and successful method for optimizing continuous labelling problems.  ...  Acknowledgements We thank Christoph Rhemann and Michael Bleyer for their help with the PatchMatch Stereo code and also for fruitful discussions.  ... 
doi:10.1007/s11263-013-0653-9 fatcat:elcnx27ocvbqdevox57k6wyd3m

PMBP: PatchMatch Belief Propagation for Correspondence Field Estimation

Frederic Besse, Carsten Rother, Andrew Fitzgibbon, Jan Kautz
2012 Procedings of the British Machine Vision Conference 2012  
We show how these ingredients are related to steps in a specific form of belief propagation in the continuous space, called Particle Belief Propagation (PBP).  ...  PatchMatch is a simple, yet very powerful and successful method for optimizing continuous labelling problems.  ...  Acknowledgements We thank Christoph Rhemann and Michael Bleyer for their help with the PatchMatch Stereo code and also for fruitful discussions.  ... 
doi:10.5244/c.26.132 dblp:conf/bmvc/BesseRFK12 fatcat:xsu7eerdxnesrdwwatgaekfxdq

SPM-BP: Sped-Up PatchMatch Belief Propagation for Continuous MRFs

Yu Li, Dongbo Min, Michael S. Brown, Minh N. Do, Jiangbo Lu
2015 2015 IEEE International Conference on Computer Vision (ICCV)  
Integrating key ideas from PatchMatch of effective particle propagation and resampling, PatchMatch belief propagation (PMBP) has been demonstrated to have good performance in addressing continuous labeling  ...  While computationally tractable discrete optimizers such as Graph Cuts and belief propagation (BP) exist for multi-label discrete problems, they still face prohibitively high computational challenges when  ...  Background We start by introducing the basic algorithmic steps of belief propagation (BP) and PatchMatch BP (PMBP).  ... 
doi:10.1109/iccv.2015.456 dblp:conf/iccv/LiMBDL15 fatcat:ojwhd5c7wzford5uvskljkk3yq

Guest Editorial: Tracking, Detection and Segmentation

R. Bowden, J. Collomosse, K. Mikolajczyk
2014 International Journal of Computer Vision  
Our first paper, "PMBP: PatchMatch Belief Propagation for Correspondence Field Estimation" presents a unified framework in which the Patch Match algorithm is first described as a variant of belief propagation  ...  , and then extended using features of the latter to yield results that are both more accurate than the original Patch Match formulation and orders of magnitude faster than previous belief propagation approaches  ...  Our first paper, "PMBP: PatchMatch Belief Propagation for Correspondence Field Estimation" presents a unified framework in which the Patch Match algorithm is first described as a variant of belief propagation  ... 
doi:10.1007/s11263-014-0753-1 fatcat:sukbtecc2vhfteprcfldlyptqi

Patch Match Filter: Efficient Edge-Aware Filtering Meets Randomized Search for Fast Correspondence Field Estimation

Jiangbo Lu, Hongsheng Yang, Dongbo Min, Minh N. Do
2013 2013 IEEE Conference on Computer Vision and Pattern Recognition  
Focusing on dense correspondence field estimation in this paper, we demonstrate PMF's applications in stereo and optical flow.  ...  This paper presents a generic and fast computational framework for general multi-labeling problems called PatchMatch Filter (PMF).  ...  They are also better than or close to the state-of-the-art PMBP [6] , while the latter uses belief propagation for global optimization.  ... 
doi:10.1109/cvpr.2013.242 dblp:conf/cvpr/LuYMD13 fatcat:al6bsahj2redfha76on5pcdngy

PM-Huber: PatchMatch with Huber Regularization for Stereo Matching

Philipp Heise, Sebastian Klose, Brian Jensen, Alois Knoll
2013 2013 IEEE International Conference on Computer Vision  
The recently proposed PatchMatch stereo algorithm [7] overcomes this limitation of previous algorithms by directly estimating planes.  ...  Most stereo correspondence algorithms match support windows at integer-valued disparities and assume a constant disparity value within the support window.  ...  To alleviate these problems an explicit smoothing model based on the combination of PatchMatch and Particle Belief Propagation resulting in the PMBP Algorithm [6] has been recently proposed, leading  ... 
doi:10.1109/iccv.2013.293 dblp:conf/iccv/HeiseKJK13 fatcat:utpto7s7wjhwlgsshmdnksdh6e

Graph Cut Based Continuous Stereo Matching Using Locally Shared Labels

Tatsunori Taniai, Yasuyuki Matsushita, Takeshi Naemura
2014 2014 IEEE Conference on Computer Vision and Pattern Recognition  
They give each pixel and region a set of candidate disparity labels, which are randomly initialized, spatially propagated, and refined for continuous disparity estimation.  ...  The joint use of graph cuts and locally shared labels has advantages over previous approaches based on fusion moves or belief propagation; it produces submodular moves deriving a subproblem optimality;  ...  We believe that our optimization method can be applied for more general corresponding field estimation such as optical flow, but we leave it for our future work.  ... 
doi:10.1109/cvpr.2014.209 dblp:conf/cvpr/TaniaiMN14 fatcat:e77tvux4pjendcxdpqacan7dee

Continuous 3D Label Stereo Matching using Local Expansion Moves

Tatsunori Taniai, Yasuyuki Matsushita, Yoichi Sato, Takeshi Naemura
2017 IEEE Transactions on Pattern Analysis and Machine Intelligence  
By spatial propagation, we design our local alpha-expansions to propagate currently assigned labels for nearby regions.  ...  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  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers including those of our conference paper for their helpful comments needed to improve this paper.  ... 
doi:10.1109/tpami.2017.2766072 pmid:29989964 fatcat:cwepd6ke3zerbputvud7hm3h6e

PatchMatch-Based Automatic Lattice Detection for Near-Regular Textures

Siying Liu, Tian-Tsong Ng, Kalyan Sunkavalli, Minh N. Do, Eli Shechtman, Nathan Carr
2015 2015 IEEE International Conference on Computer Vision (ICCV)  
We show that we can discretize the space of good solutions for the MRF using the kNNs, allowing us to efficiently and accurately optimize the MRF energy function using the Particle Belief Propagation algorithm  ...  Our technique leverages the Patch-Match algorithm for finding k-nearest-neighbor (kNN) correspondences in an image.  ...  Relation to PatchMatch Belief Propagation. Conceptually, our proposed method is closely related to PatchMatch Belief Propagation (PMBP) [4] .  ... 
doi:10.1109/iccv.2015.29 dblp:conf/iccv/LiuNSDSC15 fatcat:dhzbhs3r2jfy3m2za74whyklfq

Highly Overparameterized Optical Flow Using PatchMatch Belief Propagation [chapter]

Michael Hornáček, Frederic Besse, Jan Kautz, Andrew Fitzgibbon, Carsten Rother
2014 Lecture Notes in Computer Science  
We show that optimization over this high-dimensional, continuous state space can be carried out using an adaptation of the recently introduced PatchMatch Belief Propagation (PMBP) energy minimization algorithm  ...  , and that the resulting flow fields compare favorably to the state of the art on a number of smalland large-displacement datasets.  ...  The recently introduced PatchMatch Belief Propagation (PMBP) algorithm of Besse et al.  ... 
doi:10.1007/978-3-319-10578-9_15 fatcat:hfu7h2wnejdunhmujraupgr5mi

Dense Wide-Baseline Scene Flow from Two Handheld Video Cameras

Christian Richardt, Hyeongwoo Kim, Levi Valgaerts, Christian Theobalt
2016 2016 Fourth International Conference on 3D Vision (3DV)  
We finally refine the computed correspondence fields in a variational scene flow formulation.  ...  We then detect and replace occluded pixels in the correspondence fields using a novel edge-preserving Laplacian correspondence completion technique.  ...  Smoothness of the correspondence field is encouraged using the PatchMatch belief propagation (PMBP) technique by Besse et al.  ... 
doi:10.1109/3dv.2016.36 dblp:conf/3dim/RichardtKVT16 fatcat:tbnfe27g45ervochzivraxjpem

Fast and Accurate Depth Estimation from Sparse Light Fields [article]

Aleksandra Chuchvara, Attila Barsi, Atanas Gotchev
2018 arXiv   pre-print
We present a fast and accurate method for dense depth reconstruction from sparsely sampled light fields obtained using a synchronized camera array.  ...  Initial depth maps, which are obtained by plane sweeping, are iteratively refined by propagating good correspondences within an image.  ...  Consequently, the combination of PatchMatch stereo and belief propagation framework was designed in [41] .  ... 
arXiv:1812.06856v1 fatcat:6xsilx2asvhehjne5cygzlhv3m

Dense Wide-Baseline Scene Flow From Two Handheld Video Cameras [article]

Christian Richardt, Hyeongwoo Kim, Levi Valgaerts, Christian Theobalt
2016 arXiv   pre-print
We finally refine the computed correspondence fields in a variational scene flow formulation.  ...  We then detect and replace occluded pixels in the correspondence fields using a novel edge-preserving Laplacian correspondence completion technique.  ...  Smoothness of the correspondence field is encouraged using the PatchMatch belief propagation (PMBP) technique by Besse et al.  ... 
arXiv:1609.05115v1 fatcat:pll2sifdqrftljxsx3gsrsl65m

Joint Optical Flow and Temporally Consistent Semantic Segmentation [article]

Junhwa Hur, Stefan Roth
2016 arXiv   pre-print
In this paper, we propose a method for jointly estimating optical flow and temporally consistent semantic segmentation, which closely connects these two problem domains and leverages each other.  ...  Consequently, there has been a large amount of research dedicated to semantic segmentation and dense motion estimation.  ...  We address this using PatchMatch Belief Propagation (PMBP) [2] ; see below for details.  ... 
arXiv:1607.07716v1 fatcat:izh4twpanrgebposq7eznqrq4i

Semi-global Stereo Matching with Surface Orientation Priors

Daniel Scharstein, Tatsunori Taniai, Sudipta N. Sinha
2017 2017 International Conference on 3D Vision (3DV)  
It works well for textured scenes, but fails on untextured slanted surfaces due to its fronto-parallel smoothness assumption.  ...  In this paper we evaluate plane orientation priors derived from stereo matching at a coarser resolution and show that such priors can yield significant performance gains for difficult weakly-textured scenes  ...  It has been shown that SGM is a special case of message-passing algorithms such as belief propagation and TRW-T [12] .  ... 
doi:10.1109/3dv.2017.00033 dblp:conf/3dim/ScharsteinTS17 fatcat:uikfg25osjb6zgbqjoxcjambji
« Previous Showing results 1 — 15 out of 17 results