Constrained Delaunay triangulations
SCG '87 Proceedings of the third annual symposium on Computational geometry
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
"GrabCut": interactive foreground extraction using iterated graph cuts
ACM SIGGRAPH 2004 Papers
Motion Competition: A Variational Approach to Piecewise Parametric Motion Segmentation
International Journal of Computer Vision
Motion Segmentation by Spatiotemporal Smoothness Using 5D Tensor Voting
CVPRW '06 Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop
Minimizing Nonsubmodular Functions with Graph Cuts-A Review
IEEE Transactions on Pattern Analysis and Machine Intelligence
Over-Parameterized Variational Optical Flow
International Journal of Computer Vision
Learning Layered Motion Segmentations of Video
International Journal of Computer Vision
Nonrigid Image Registration Using Dynamic Higher-Order MRF Model
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I
Robust Higher Order Potentials for Enforcing Label Consistency
International Journal of Computer Vision
Evaluation of Stereo Matching Costs on Images with Radiometric Differences
IEEE Transactions on Pattern Analysis and Machine Intelligence
An iterative image registration technique with an application to stereo vision
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Fusion Moves for Markov Random Field Optimization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast variable window for stereo correspondence using integral images
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
SimpleFlow: A Non-iterative, Sublinear Optical Flow Algorithm
Computer Graphics Forum
Computer Vision and Image Understanding
Hi-index | 0.00 |
We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine motions both modeled in terms of higher-order potential functions. Reasoning jointly over a large set of unknown variables provides more reliable motion estimates and a robust matching criterion. One of the main contributions is that unlike previous region-based methods, we omit the assumption of constant flow. Instead, we consider local affine warps whose likelihood energy can be computed exactly without approximations. This results in a tractable, so-called, higher-order likelihood function. We realize this idea by employing triangulation meshes which immensely reduce the complexity of the problem. Optimization is performed by hierarchical fusion moves and an adaptive mesh refinement strategy. Experiments show that we achieve high-quality motion fields on several data sets including the Middlebury optical flow database.