A Database and Evaluation Methodology for Optical Flow
Abstract
The quantitative evaluation of optical flow algorithms by Barron et al. led to significant advances in the performance of optical flow methods. The challenges for optical flow today go beyond the datasets and evaluation methods proposed in that paper and center on problems associated with nonrigid motion, real sensor noise, complex natural scenes, and motion discontinuities. Our goal is to establish a new set of benchmarks and evaluation methods for the next generation of optical flow algorithms. To that end, we contribute four types of data to test different aspects of optical flow algorithms: sequences with nonrigid motion where the ground-truth flow is determined by tracking hidden fluorescent texture; realistic synthetic sequences; high frame-rate video used to study interpolation error; and modified stereo sequences of static scenes. In addition to the average angular error used in Barron et al., we compute the absolute flow endpoint error, measures for frame interpolation error, improved statistics, and flow accuracy at motion boundaries and in textureless regions. We evaluate the performance of several well-known methods on this data to establish the current state of the art. Our database is freely available on the web together with scripts for scoring and publication of the results at http://vision.middlebury.edu/flow/.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Prior to our evaluation (Baker et al. 2007), there were three major attempts to quantitatively evaluate optical flow algorithms, each proposing sequences with ground truth.
“Prior to our evaluation (Baker et al. 2007), there were three major attempts to quantitatively evaluate optical flow algorithms, each proposing sequences with ground truth.”
From A Database and Evaluation Methodology for Optical Flow (2011) · cites this paper as Baker et al. 2007
The best-performing algorithm in the preliminary study (Baker et al. 2007) was 2D-CLG (Bruhn et al. 2005), both in terms of average endpoint error and average angular error.
“The best-performing algorithm (both in terms of average endpoint error and average angular error) in our preliminary study (Baker et al. 2007) was 2D-CLG (Bruhn et al. 2005).”
From A Database and Evaluation Methodology for Optical Flow (2011) · cites this paper as Baker et al. 2007
The best results are a huge improvement over the algorithms in Baker et al. (2007) (Table 2).
“The best results are a huge improvement over the algorithms in Baker et al. (2007) (Table 2).”
From A Database and Evaluation Methodology for Optical Flow (2011) · cites this paper as Baker et al. 2007
Since the publication of the preliminary paper (Baker et al. 2007), a large number of authors have uploaded results to the online evaluation.
“Since the publication of our preliminary paper (Baker et al. 2007), a large number of authors have uploaded results to our online evaluation.”
From A Database and Evaluation Methodology for Optical Flow (2011) · cites this paper as Baker et al. 2007
Cites
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988 · see citing works
A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms
Seitz, S. M., Curless, B., Diebel, J., Scharstein, D., & Szeliski, R. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.19 · Cited by 2,457 · see citing works
Self-citationHigh-accuracy stereo depth maps using structured light
Scharstein, D., & Szeliski, R. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211354 · Cited by 1,542 · see citing works
Self-citationGross, R., Matthews, I., Cohn, J., Kanade, T., & Baker, S. (2008) · 2008 8th IEEE International Conference on Automatic Face & Gesture Recognition · doi:10.1109/afgr.2008.4813399 · Cited by 373 · see citing works
Self-citationOptical flow estimation: Advances and comparisons
Otte, M., & Nagel, H. H. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-57956-7_5 · Cited by 201 · see citing works
Optical flow estimation with uncertainties through dynamic MRFs
Glocker, B., Paragios, N., Komodakis, N., Tziritas, G., & Navab, N. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587562 · Cited by 69 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Online Object Tracking: A Benchmark
Wu, Y., Lim, J., & Yang, M.-H. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.312 · Cited by 4,138 · see citing works
Wu, Y., Lim, J., & Yang, M.-H. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2388226 · Cited by 3,371 · see citing works
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 · see citing works
Self-citationLarge 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 · see citing works
Vision-based Navigation in Image-Guided Interventions
Mirota, D. J., Ishii, M., & Hager, G. D. (2011) · Annual Review of Biomedical Engineering · doi:10.1146/annurev-bioeng-071910-124757 · Cited by 137 · see citing works
Light field video stabilization
Smith, B. M., Zhang, L., Jin, H., & Agarwala, A. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459270 · Cited by 107 · see citing works
Optical flow estimation with uncertainties through dynamic MRFs
Glocker, B., Paragios, N., Komodakis, N., Tziritas, G., & Navab, N. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587562 · Cited by 69 · see citing works
- Authors
- Baker, S., Roth, S., Scharstein, D., Black, M. J., Lewis, J. P., & Szeliski, R.
- Affiliations
- Microsoft (United States) (US)
- Middlebury College (US)
- Brown University (US)
- Venue
- 2007 IEEE 11th International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2007
- Pages
- 1-8
- OpenAlex
- W2034869517
- Cited by
- 618
- References
- 6
- Citations by year
- 2026: 6 · 2025: 19 · 2024: 23 · 2023: 24 · 2022: 27 · 2021: 25 · 2020: 22 · 2019: 17 · 2018: 15 · 2017: 16 · 2016: 15 · 2015: 30 · 2014: 30 · 2013: 42 · 2012: 49
- FWCI
- 46.73
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE/CVF International Conference on Computer Vision (ICCV) (publishedVersion)
- Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) (submittedVersion)
- Fraunhofer-Publica (Fraunhofer-Gesellschaft) (submittedVersion)
- MPG.PuRe (Max Planck Society) (submittedVersion)
- Funders
- National Science Foundation
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Vision and Imaging
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Video Surveillance and Tracking Methods
- Physical Sciences › Computer Science › Signal Processing › Video Coding and Compression Technologies
- Keywords
- optical flow, benchmark dataset, evaluation methodology, non-rigid motion, motion discontinuities, high frame rate video, textureless regions, motion boundaries
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