The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
EpicFlow: Edge-preserving interpolation of correspondences for optical flow
Open accessAbstract
We propose a novel approach for optical flow estimation, targeted at large displacements with significant occlusions. It consists of two steps: i) dense matching by edge-preserving interpolation from a sparse set of matches; ii) variational energy minimization initialized with the dense matches. The sparse-to-dense interpolation relies on an appropriate choice of the distance, namely an edge-aware geodesic distance. This distance is tailored to handle occlusions and motion boundaries - two common and difficult issues for optical flow computation. We also propose an approximation scheme for the geodesic distance to allow fast computation without loss of performance. Subsequent to the dense interpolation step, standard one-level variational energy minimization is carried out on the dense matches to obtain the final flow estimation. The proposed approach, called Edge-Preserving Interpolation of Correspondences (EpicFlow) is fast and robust to large displacements. It significantly outperforms the state of the art on MPI-Sintel and performs on par on Kitti and Middlebury.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Computational Approach to Edge Detection
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767851 · Cited by 30,004
Multiple View Geometry in Computer Vision
Hartley, R., & Zisserman, A. (2004) · doi:10.1017/cbo9780511811685 · Cited by 21,070
Horn, B. K. P., & Schunck, B. G. (1981) · Artificial Intelligence · doi:10.1016/0004-3702(81)90024-2 · Cited by 10,312
Vision meets robotics: The KITTI dataset
Geiger, A., Lenz, P., Stiller, C., & Urtasun, R. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913491297 · Cited by 9,913
SLIC Superpixels Compared to State-of-the-Art Superpixel Methods
Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., & Süsstrunk, S. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.120 · Cited by 9,201
Horn, B. K., & Schunck, B. G. (1981) · SPIE Proceedings · doi:10.1117/12.965761 · Cited by 7,394
Contour Detection and Hierarchical Image Segmentation
Arbeláez, P., Maire, M., Fowlkes, C., & Malik, J. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.161 · Cited by 5,454
Multiple view geometry in computer vision
Opower, H. (2002) · Optics and Lasers in Engineering · doi:10.1016/s0143-8166(01)00145-2 · Cited by 3,007
High Accuracy Optical Flow Estimation Based on a Theory for Warping
Brox, T., Bruhn, A., Papenberg, N., & Weickert, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24673-2_3 · Cited by 2,570
A Database and Evaluation Methodology for Optical Flow
Baker, S., Scharstein, D., Lewis, J. P., Roth, S., Black, M. J., & Szeliski, R. (2011) · International Journal of Computer Vision · doi:10.1007/s11263-010-0390-2 · Cited by 2,205 · cited 11×
“On the Middlebury test set, we obtain an AEE below 0 .”
BackgroundMethodInfluentialA Naturalistic Open Source Movie for Optical Flow Evaluation
Butler, D. J., Wulff, J., Stanley, G. B., & Black, M. J. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33783-3_44 · Cited by 1,842
Iterative Solution of Large Linear Systems
(1971) · Elsevier eBooks · doi:10.1016/c2013-0-11733-3 · Cited by 1,734
Large Displacement Optical Flow: Descriptor Matching in Variational Motion Estimation
Brox, T., & Malik, J. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.143 · Cited by 1,295
All of Statistics: A Concise Course in Statistical Inference
Wasserman, L. (2004) · Springer Texts in Statistics · doi:10.1007/978-0-387-21736-9 · Cited by 1,090
DeepFlow: Large Displacement Optical Flow with Deep Matching
Weinzaepfel, P., Revaud, J., Harchaoui, Z., & Schmid, C. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.175 · Cited by 997
Self-citationStructured Forests for Fast Edge Detection
Dollar, P., & Zitnick, C. L. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.231 · Cited by 899
Sun, D., Roth, S., & Black, M. J. (2014) · International Journal of Computer Vision · doi:10.1007/s11263-013-0644-x · Cited by 614
The Generalized PatchMatch Correspondence Algorithm
Barnes, C., Shechtman, E., Goldman, D. B., & Finkelstein, A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15558-1_3 · Cited by 530
Motion Detail Preserving Optical Flow Estimation
Xu, L., Jia, J., & Matsushita, Y. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.236 · Cited by 493
Highly Accurate Optic Flow Computation with Theoretically Justified Warping
Papenberg, N., Bruhn, A., Brox, T., Didas, S., & Weickert, J. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-005-3960-y · Cited by 409
Anisotropic Huber-L1 Optical Flow
Werlberger, M., Trobin, W., Pock, T., Wedel, A., Cremers, D., & Bischof, H. (2009) · Procedings of the British Machine Vision Conference 2009 · doi:10.5244/c.23.108 · Cited by 354
Krähenbühl, P., & Koltun, V. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10602-1_47 · Cited by 336
Reliable Estimation of Dense Optical Flow Fields with Large Displacements
Alvarez, L., Weickert, J., & Sánchez, J. (2000) · International Journal of Computer Vision · doi:10.1023/a:1008170101536 · Cited by 299
All of Statistics: A Concise Course in Statistical Inference
Barber, S. (2005) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2004.00347_18.x · Cited by 294
Zimmer, H., Bruhn, A., & Weickert, J. (2011) · International Journal of Computer Vision · doi:10.1007/s11263-011-0422-6 · Cited by 215
Structure- and motion-adaptive regularization for high accuracy optic flow
Wedel, A., Cremers, D., Pock, T., & Bischof, H. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459375 · Cited by 177
Large Displacement Optical Flow from Nearest Neighbor Fields
Chen, Z., Jin, H., Lin, Z., Cohen, S. D., & Wu, Y. N. (2013) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2013.316 · Cited by 176
Geodesic image and video editing
Criminisi, A., Sharp, T., Rother, C., & P'erez, P. (2010) · ACM Transactions on Graphics · doi:10.1145/1857907.1857910 · Cited by 175
Lu, J.-B., Yang, H., Min, D., & Do, M. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.242 · Cited by 175
Parallel algorithms for approximation of distance maps on parametric surfaces
Weber, O., Devir, Y. S., Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2008) · ACM Transactions on Graphics · doi:10.1145/1409625.1409626 · Cited by 148
Non-local Total Generalized Variation for Optical Flow Estimation
Ranftl, R., Bredies, K., & Pock, T. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10590-1_29 · Cited by 146
Large displacement optical flow computation withoutwarping
Steinbrücker, F., Pock, T., & Cremers, D. (2009) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2009.5459364 · Cited by 137
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
He, K., & Sun, J. (2012) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2012.6247665 · Cited by 125
Fast Edge-Preserving PatchMatch for Large Displacement Optical Flow
Bao, L., Yang, Q., & Jin, H. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2359374 · Cited by 116
Layered image motion with explicit occlusions, temporal consistency, and depth ordering
Sun, D., Sudderth, E. B., & Black, M. J. (2010) · Cited by 116
An Evaluation of Data Costs for Optical Flow
Vogel, C., Roth, S., & Konrad Schindler, B. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40602-7_37 · Cited by 89
Wills, J., Agarwal, S., & Belongie, S. (2003) · Cited by 86
Locally Affine Sparse-to-Dense Matching for Motion and Occlusion Estimation
Leordeanu, M., Zanfir, A., & Sminchisescu, C. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.216 · Cited by 80
Optical Flow with Geometric Occlusion Estimation and Fusion of Multiple Frames
Kennedy, R., & Taylor, C. J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-14612-6_27 · Cited by 72
Local grouping for optical flow
Ren, X. (2008) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2008.4587536 · Cited by 51
A General Dense Image Matching Framework Combining Direct and Feature-Based Costs
Braux-Zin, J., Dupont, R., & Bartoli, A. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.30 · Cited by 51
A Feature-based Approach for Dense Segmentation and Estimation of Large Disparity Motion
Wills, J., Agarwal, S., & Belongie, S. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-6660-3 · Cited by 40
Demetz, O., Stoll, M., Volz, S., Weickert, J., & Bruhn, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10590-1_30 · Cited by 26
Cited by
Flownet: Learning optical flow with convolutional networks
Dosovitskiy, A., Fischer, P., Ilg, E., Hausser, P., Hazirbas, C., Golkov, V., Smagt, P. V. D., Cremers, D., & Brox, T. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.316 · Cited by 4,313
“The successive work of [30] termed EpicFlow has put even more emphasis on the quality of sparse matching as the matches from [35] are merely interpolated to dense flow fields while respecting image boundaries.”
BackgroundMethodFlowNet 2.0: Evolution of Optical Flow Estimation with Deep Networks
Ilg, E., Mayer, N., Saikia, T., Keuper, M., Dosovitskiy, A., & Brox, T. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.179 · Cited by 3,152
PWC-Net: CNNs for Optical Flow Using Pyramid, Warping, and Cost Volume
Sun, D., Yang, X., Liu, M.-Y., & Kautz, J. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00931 · Cited by 2,648
Video Enhancement with Task-Oriented Flow
Xue, T., Chen, B., Wu, J., Wei, D., & Freeman, W. T. (2019) · International Journal of Computer Vision · doi:10.1007/s11263-018-01144-2 · Cited by 1,393
Optical Flow Estimation Using a Spatial Pyramid Network
Ranjan, A., & Black, M. J. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.291 · Cited by 1,344
Metadata
- Authors
- Revaud, J., Weinzaepfel, P., Harchaoui, Z., & Schmid, C.
- Venue
- 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
- Publisher
- IEEE
- Published
- 2015-06
- Pages
- 1164-1172
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W1951289974
- Cited by
- 697
- References
- 43
- FWCI
- 40.60
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.