A Database and Evaluation Methodology for Optical Flow
Open accessThe DOI matches its Crossref record; 110 of the 112 references it cites were found in a registry or an index; 2 of the 68 sources its claims cite were checked for support.
Abstract
The quantitative evaluation of optical flow algorithms by Barron et al. (1994) led to significant advances in performance. The challenges for optical flow algorithms today go beyond the datasets and evaluation methods proposed in that paper. Instead, they center on problems associated with complex natural scenes, including nonrigid motion, real sensor noise, and motion discontinuities. We propose 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: (1) sequences with nonrigid motion where the ground-truth flow is determined by tracking hidden fluorescent texture, (2) realistic synthetic sequences, (3) high frame-rate video used to study interpolation error, and (4) modified stereo sequences of static scenes. In addition to the average angular error used by Barron et al., we compute the absolute flow endpoint error, measures for frame interpolation error, improved statistics, and results at motion discontinuities and in textureless regions.
Overview
CoChat Summary
TL;DR
The paper introduces a new optical flow benchmark of four data types (hidden fluorescent texture, realistic synthetic, high-speed interpolation, and modified stereo) plus an extended evaluation methodology with endpoint error, interpolation error, robustness/accuracy statistics, and region masks. It reports that performance improved substantially over the preliminary 2007 study, but motion discontinuities and diverse datasets remain difficult, and top flow methods still lag top stereo methods on the modified Teddy stereo data.
Key findings
- The benchmark contains 12 training and 12 test sequences; test ground truth is withheld except for Yosemite. As of December 2009 the online evaluation contained results for 24 published methods, all using only 2 input frames and 10 using color.
- Best average endpoint error (Avg. EE) improved dramatically over 2D-CLG (Bruhn et al. 2005): Army 0.28→0.09, Mequon 0.67→0.18, Schefflera 1.12→0.24, Wooden 1.07→0.18, Grove 1.23→0.74, Urban 1.54→0.39, Yosemite 0.10→0.08, Teddy 1.38→0.50. Best Avg. EE was below 0.2 pixels on four datasets (Yosemite, Army, Mequon, Wooden).
- Endpoint error (EE) and angular error (AE) rankings were highly correlated (r = 0.989), but the paper argues EE should be preferred: Complementary OF on Urban had Avg. AE 4.64° (rank 6) but Avg. EE 1.78 pixels (rank 20), because AE downweights large motions.
- Motion discontinuity (Disc) regions were the hardest; textureless (Untext) regions were typically easiest. Dataset results were less correlated, with Yosemite poorly or negatively correlated with others. Flow and interpolation errors were only moderately correlated (Avg4 EE vs Avg4 IE r = 0.763). On Teddy, top stereo methods outperformed top flow methods: median lowest-five R1.0 was 9.9 for flow vs 6.5 for stereo in All regions (34% reduction), and 27.6 vs 10.0 in Disc regions (64% reduction).
Methods
- Four data types were collected: (1) real nonrigid scenes with dense ground truth from hidden fluorescent texture, captured with a Canon EOS 20D at 3504×2336, downsampled every 40th visible-light frame by factor 6 to 584×388, with SSD tracking (15×15 windows), forward/backward crosschecking, and Lucas-Kanade subpixel refinement; (2) realistic synthetic scenes rendered with 3Delight at 640×480, with ground truth from a custom shader and dominant-cluster flow selection; (3) high-speed video for frame interpolation captured with a PointGrey Dragonfly Express at 60 fps, providing every other frame and retaining intermediate frames as ground truth; and (4) modified stereo data (Teddy) from structured light, cropped to make the disparity range roughly symmetric.
- Evaluation metrics include average angular error (AE), absolute flow endpoint error (EE), interpolation error (IE), and gradient-normalized interpolation error (NE). Statistics include averages, robustness measures R_X, and percentile accuracy measures A_X, computed over All, Disc, and Untext region masks.
- Analysis used the online evaluation at http://vision.middlebury.edu/flow/, comparing 24 published methods across metrics, statistics, masks, and datasets, with Pearson correlations between rankings and comparisons to state-of-the-art stereo methods on Teddy.
Limitations
- The paper states that the hidden fluorescent texture scenes are laboratory scenes, not real-world scenes, and have no motion blur due to stop-motion capture; ground truth is unavailable where cross-checking failed, especially occluded regions, and the measured ground truth is not perfect, though significant errors are limited to a small fraction of pixels. Synthetic sequences were generated without motion blur. The modified stereo ground truth is only accurate to 0.25 pixels, and algorithms may exploit the knowledge that motions are horizontal; overfitting to rigid data should be visible across the 12 evaluation images. Interpolation ground truth is an intermediate image, not a flow field, so the flow definition is apparent motion.
- The paper also states that no single method yet achieves strong performance across a wide variety of datatypes, that any dataset has a limited lifespan, and that future studies should include more challenging realistic synthetic data, longer sequences, and more difficult materials, illumination changes, atmospheric effects, and transparency.
- Evident from the text: the online tables do not provide an overall ranking among methods; runtimes are not normalized for programming environment, CPU speed, cores, or hardware acceleration; algorithms are required to produce dense flow and cannot submit confidence maps or sparse/incomplete fields; all 24 published methods used only 2 frames despite 8-frame sequences being available; and the paper cannot definitively answer whether temporal smoothing is less suited to the more challenging sequences.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
2 Valid · 16 Not valid · 58 Not checked · 185 Own results and interpretations
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Rather than collecting a single type of data (with its inherent limitations) we instead collected four different types of data, each satisfying a different subset of desirable properties.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Using the combination of fluorescent paint, downsampling high-resolution images, and sequential tracking of small motions, we are able to obtain dense, subpixel accurate ground truth for a nonrigid scene.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“To allow for measures that predict performance on such tasks, we collected a variety of data suitable for frame interpolation.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We have developed a technique for capturing imagery of nonrigid scenes with ground-truth optical flow.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“To go beyond previous synthetic ground truth (e.g., the Yosemite sequence), we generated two types of fairly complex synthetic outdoor scenes.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
96 more claims
Create a free account to see all 261 claims and every source verdict.
- Probably not a substantial claim. 114
- It may state two separate claims as one. 76
- The quote only partly states this claim. 6
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Notable works include the Middlebury dataset (Baker et al, 2011) and the KITTI datasets (Geiger et al, 2012; Menze and Geiger, 2015), but due to the difficulty of computing accurate ground truth, these have been restricted to 8 and 2 · 200 pairs of frames, respectively (the latter are also limited by the special driving setting).”
From What Makes Good Synthetic Training Data for Learning Disparity and Optical Flow Estimation? (2018) · cites this paper as Baker et al, 2011
Experimental — accuracy not yet measured
Citations
Cites
The pascal visual object classes (VOC) challenge
Everingham, M., Van Gool, L., Williams, C. K. I., Winn, J., & Zisserman, A. (2010) · International Journal of Computer Vision · doi:10.1007/s11263-009-0275-4 · Cited by 19,599
Proceedings of IEEE Conference on Computer Vision and Pattern Recognition
(1993) · doi:10.1109/cvpr.1993 · Cited by 17,667
Proceedings of IEEE International Conference on Computer Vision
(1995) · Proceedings of IEEE International Conference on Computer Vision · doi:10.1109/iccv.1995.466933 · Cited by 12,860
(1981) · Cited by 11,963
Horn, B. K. P., & Schunck, B. G. (1981) · Artificial Intelligence · doi:10.1016/0004-3702(81)90024-2 · Cited by 10,312
Horn, B. K., & Schunck, B. G. (1981) · SPIE Proceedings · doi:10.1117/12.965761 · Cited by 7,394 · cited 2×
“A baseline approach is to use an L2 norm as in the Horn and Schunck algorithm (Horn and Schunck 1981):”
BackgroundMethodFast 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
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
Scharstein, D., & Szeliski, R. (2002) · International Journal of Computer Vision · doi:10.1023/a:1014573219977 · Cited by 6,740 · cited 10×
“Many areas of computer vision, such as stereo [63], face recognition [28, 55, 68], and object recognition [23, 24], have challenging datasets to track the progress made by leading algorithms and to stimulate new ideas.”
BackgroundMethodResultInfluentialSelf-citationProceedings European Conference on Computer Vision 2002
Heyden, A., Sparr, G., Nielsen, M., & Johansen, P. (2002) · Lund University Publications (Lund University) · Cited by 5,153
From few to many: illumination cone models for face recognition under variable lighting and pose
Georghiades, A. S., Belhumeur, P. N., & Kriegman, D. J. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927464 · Cited by 4,912 · cited 1×
“Many areas of computer vision, such as stereo (Scharstein and Szeliski 2002), face recognition (Philips et al. 2005; Sim et al. 2003; Gross et al. 2008; Georghiades et al. 2001), and object recognition (Fei-Fei et al.”
BackgroundPerformance of optical flow techniques
Barron, J. L., Fleet, D. J., & Beauchemin, S. S. (1994) · International Journal of Computer Vision · doi:10.1007/bf01420984 · Cited by 4,305 · cited 7×
“We refine and extend the evaluation methodology of [7] in terms of: (1) the performance measures used, (2) the statistics computed, and (3) the sub-regions of the images considered.”
BackgroundMethodInfluential(1986) · Cited by 3,616
Lucas-Kanade 20 Years On: A Unifying Framework
Baker, S., & Matthews, I. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000011205.11775.fd · Cited by 3,155 · cited 2×
“The simplest gradient descent algorithm is steepest descent [5], which takes steps in the direction of the negative gradient −Global ∂f .”
BackgroundMethodSelf-citationOne-shot learning of object categories
Fei-Fei, L., Fergus, R., & Perona, P. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.79 · Cited by 3,029 · cited 1×
“Many areas of computer vision, such as stereo [63], face recognition [28, 55, 68], and object recognition [23, 24], have challenging datasets to track the progress made by leading algorithms and to stimulate new ideas.”
BackgroundProceedings of the International Joint Conference on Artificial Intelligence 2007
Bundy, A. (2007) · International Joint Conference on Artificial Intelligence · Cited by 2,761
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 · cited 5×
“The two constraints are therefore essentially equivalent in practical algorithms ( Brox et al. 2004 ).”
BackgroundInfluentialA 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 · cited 3×
“• Statistics: In addition to computing averages and standard deviations as in Barron et al. (1994), we also compute robustness measures (Scharstein and Szeliski 2002) and percentile-based accuracy measures ( Seitz et al. 2006 ).”
BackgroundMethodInfluentialSelf-citationDisplay of surfaces from volume data
Levoy, M. (1988) · IEEE Computer Graphics and Applications · doi:10.1109/38.511 · Cited by 2,446
Overview of the Face Recognition Grand Challenge
Phillips, P. J., Flynn, P. J., Scruggs, T., Bowyer, K. W., Chang, J., Hoffman, K., Marques, J., Min, J., & Worek, W. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.268 · Cited by 2,438 · cited 1×
“Many areas of computer vision, such as stereo [63], face recognition [28, 55, 68], and object recognition [23, 24], have challenging datasets to track the progress made by leading algorithms and to stimulate new ideas.”
BackgroundBlake, A., & Zisserman, A. (1987) · The MIT Press eBooks · doi:10.7551/mitpress/7132.001.0001 · Cited by 2,105
The CMU pose, illumination, and expression database
Sim, T., Baker, S., & Bsat, M. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1251154 · Cited by 1,783 · cited 1×
“Many areas of computer vision, such as stereo [63], face recognition [28, 55, 68], and object recognition [23, 24], have challenging datasets to track the progress made by leading algorithms and to stimulate new ideas.”
BackgroundSelf-citationThe Robust Estimation of Multiple Motions: Parametric and Piecewise-Smooth Flow Fields
Black, M. J., & Anandan, P. (1996) · Computer Vision and Image Understanding · doi:10.1006/cviu.1996.0006 · Cited by 1,570 · cited 8×
“The algorithm by Black and Anandan (1996 ) a lso uses afi rstorder prior, but can use an arbitrary robust penalty function on the prior term rather than the L2 norm in (9).”
BackgroundMethodInfluentialSelf-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 · cited 6×
“Similarly, for the stereo sequences, pixels where cross-checking failed are excluded [64].”
BackgroundMethodInfluentialSelf-citationThe CMU Pose, Illumination, and Expression (PIE) database
Sim, T., Baker, S., & Bsat, M. (2003) · Proceedings of Fifth IEEE International Conference on Automatic Face Gesture Recognition · doi:10.1109/afgr.2002.1004130 · Cited by 1,419
Self-citationSecrets of optical flow estimation and their principles
Sun, D., Roth, S., & Black, M. J. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539939 · Cited by 1,389
Self-citationHigh-quality video view interpolation using a layered representation
Zitnick, C. L., Kang, S. B., Uyttendaele, M., Winder, S., & Szeliski, R. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015766 · Cited by 1,385
Self-citationStereo matching using belief propagation
Sun, J., Zheng, N.-N., & Shum, H.-Y. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1206509 · Cited by 1,271 · cited 1×
“A number of recent approaches use discrete optimization algorithms, similar to those employed in stereo matching, such as graph cuts [14] and belief propagation [71].”
MethodLucas/Kanade Meets Horn/Schunck: Combining Local and Global Optic Flow Methods
Bruhn, A., Weickert, J., & Schnörr, C. (2005) · International Journal of Computer Vision · doi:10.1023/b:visi.0000045324.43199.43 · Cited by 1,160
Hierarchical model-based motion estimation
Bergen, J. R., Anandan, P., Hanna, K. J., & Hingorani, R. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55426-2_27 · Cited by 1,154 · cited 5×
“Another set of examples are parametric motion algorithms [9], which also just solve for a small number of unknowns.”
BackgroundInfluentialShade, J., Gortler, S., He, L.-W., & Szeliski, R. (1998) · Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 · doi:10.1145/280814.280882 · Cited by 1,115 · cited 1×
“Our algorithm is closely related to previous algorithms for depth-based frame interpolation [67,85]:”
MethodSelf-citationComputation of component image velocity from local phase information
Fleet, D. J., & Jepson, A. D. (1990) · International Journal of Computer Vision · doi:10.1007/bf00056772 · Cited by 1,085 · cited 1×
“[7], although the measure itself dates to prior work by Fleet and Jepson [25].”
ResultA taxonomy and evaluation of dense two-frame stereo correspondence algorithms
Scharstein, D., Szeliski, R., & Zabih, R. (2002) · Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001) · doi:10.1109/smbv.2001.988771 · Cited by 1,084
Self-citationA computational framework and an algorithm for the measurement of visual motion
Anandan, P. (1989) · International Journal of Computer Vision · doi:10.1007/bf00158167 · Cited by 1,073 · cited 2×
“In fact, some of the earliest optical flow algorithms used filtered images to reduce the effects of shadows [3,18].”
BackgroundLucas/Kanade meets Horn/Schunck : combining local and global optic flow methods
Weickert, J., Bruhn, A., & Schnörr, C. (2003) · doi:10.22028/d291-26234 · Cited by 963
Feature-based image metamorphosis
Beier, T., & Neely, S. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134003 · Cited by 914 · cited 1×
“If both pixels are visible, i.e., O0(x0) = 0 and O1(x1) = 0, blend the two images [ 8 ]:”
BackgroundAdiv, G. (1985) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1985.4767678 · Cited by 800 · cited 2×
“These constraints have both been strictly enforced [1, 29,52] and added as a soft prior [78,79].”
BackgroundMethodNagel, H.-H., & Enkelmann, W. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767833 · Cited by 786 · cited 1×
“For example, Nagel and Enkelmann [50] and Werlberger et al.”
MethodPerformance of optical flow techniques
Barron, J. L., Fleet, D. J., Beauchemin, S. S., & Burkitt, T. A. (2003) · Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1992.223269 · Cited by 743
On the computation of motion from sequences of images-A review
Aggarwal, J. K., & Nandhakumar, N. (1988) · Proceedings of the IEEE · doi:10.1109/5.5965 · Cited by 644 · cited 1×
“Interested readers are referred to previous surveys by Aggarwal and Nandhakumar [1], Barron et al. [2], Otte and Nagel [16], Mitiche and Bouthemy [14], and Stiller and Konrad [23].”
BackgroundA Database and Evaluation Methodology for Optical Flow
Baker, S., Roth, S., Scharstein, D., Black, M. J., Lewis, J. P., & Szeliski, R. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408903 · Cited by 618
Self-citationSIFT Flow: Dense Correspondence across Different Scenes
Liu, C., Yuen, J., Torralba, A., Sivic, J., & Freeman, W. T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_3 · Cited by 540 · cited 2×
“For example a Field-of-Experts formulation was used in [70] and SIFT features were used in [43].”
MethodFast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.791245 · Cited by 470
An Improved Algorithm for TV-L 1 Optical Flow
Wedel, A., Pock, T., Zach, C., Bischof, H., & Cremers, D. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03061-1_2 · Cited by 423 · cited 7×
“Huber-L1 [82] 2 DPOF [39] 261 TV-L1-improved [80] 2.”
BackgroundMethodInfluentialFeature-based image metamorphosis
Beier, T., & Neely, S. (1992) · ACM SIGGRAPH Computer Graphics · doi:10.1145/142920.134003 · Cited by 400
Gross, 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
Self-citationHigh-quality video view interpolation using a layered representation
Zitnick, C. L., Kang, S. B., Uyttendaele, M., Winder, S., & Szeliski, R. (2004) · ACM SIGGRAPH 2004 Papers · doi:10.1145/1186562.1015766 · Cited by 367 · cited 1×
“Our algorithm is closely related to previous algorithms for depth-based frame interpolation (Shade et al. 1998; Zitnick et al. 2004):”
MethodSelf-citationAnisotropic 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 · cited 2×
“For example, Nagel and Enkelmann (1986) and Werlberger et al. (2009) weight the direction along the image gradient less than the direction orthogonal to it, and Sun et al. (2008) learn a Steerable Random Field to define the weighting.”
MethodEstimating motion in image sequences
Stiller, C., & Konrad, J. (1999) · IEEE Signal Processing Magazine · doi:10.1109/79.774934 · Cited by 349
Proceedings International Conference On Image Processing
(1997) · Proceedings of International Conference on Image Processing · doi:10.1109/icip.1997.638657 · Cited by 337
Correlation Techniques of Image Registration
Pratt, W. (1974) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.1974.307828 · Cited by 316 · cited 1×
“An alternative to the assumption of “constancy” is that the signals (images) at times t and t+ 1 are highly correlated [17,57].”
BackgroundScene Segmentation from Visual Motion Using Global Optimization
Murray, D. W., & Buxton, B. F. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767896 · Cited by 300 · cited 1×
“Given more than two frames in the video, it is also possible to add temporal smoothness terms ∂u ∂t and ∂v ∂t to Equation (9) [10, 49, 54].”
BackgroundVedula, S., Rander, P., Collins, R., & Kanade, T. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.63 · Cited by 281
Large displacement optical flow
Brox, T., Bregler, C., & Malik, J. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206697 · Cited by 277 · cited 1×
“Such sparse matching method can be combined with the continuous energy minimization approaches in a variety of ways ( Brox et al. 2009; Liu et al. 2008 ;R en2008; Xu et al. 2008).”
MethodLayered representation for motion analysis
Wang, J. Y. A., & Adelson, E. H. (2002) · Proceedings of IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1993.341105 · Cited by 273 · cited 1×
“Most methods have focused on the use of parametric models that estimate motion in layers [34,77].”
MethodFrom few to many: generative models for recognition under variable pose and illumination
Georghiades, A. S., Belhumeur, P. N., & Kriegman, D. J. (2002) · Proceedings Fourth IEEE International Conference on Automatic Face and Gesture Recognition (Cat. No. PR00580) · doi:10.1109/afgr.2000.840647 · Cited by 259
Computation and analysis of image motion: A synopsis of current problems and methods
Mitiche, A., & Bouthemy, P. (1996) · International Journal of Computer Vision · doi:10.1007/bf00131147 · Cited by 253 · cited 1×
“[7], Otte and Nagel [53], Mitiche and Bouthemy [47], and Stiller and Konrad [69].”
BackgroundMcCane, B., Novins, K., Crannitch, D., & Galvin, B. (2001) · Computer Vision and Image Understanding · doi:10.1006/cviu.2001.0930 · Cited by 250 · cited 1×
“Most recently McCane et al. [12] provided more ground truth for real polyhedral scenes as well as graphics scenes of varying realism.”
BackgroundNegahdaripour, S. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.713362 · Cited by 245
Robust dynamic motion estimation over time
Black, M. J., & Anandan, P. (2002) · Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1991.139705 · Cited by 241 · cited 2×
“Given more than two frames in the video, it is also possible to add temporal smoothness terms ∂u ∂t and ∂v ∂t to Equation (9) [10, 49, 54].”
BackgroundMethodSelf-citationSun, D., Roth, S., Lewis, J. P., & Black, M. J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_7 · Cited by 230 · cited 8×
“The training set includes the ground truth and is meant to be used for debugging, parameter estimation, and possibly even learning [41, 70].”
BackgroundMethodInfluentialSelf-citationMixture models for optical flow computation
Jepson, A., & Black, M. J. (2002) · Proceedings of IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1993.341161 · Cited by 222
Self-citationInvestigations of multigrid algorithms for the estimation of optical flow fields in image sequences
Enkelmann, W. (1988) · Computer Vision, Graphics, and Image Processing · doi:10.1016/0734-189x(88)90059-x · Cited by 217 · cited 1×
“The most common approach is to build image pyramids by repeated blurring and downsampling [3, 11, 18, 22, 26, 44].”
BackgroundSmoothness in layers: Motion segmentation using nonparametric mixture estimation
Weiss, Y. (2002) · Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1997.609375 · Cited by 208 · cited 1×
“The regularization of transparent motion in the framework of global energy minimization, however, has received little attention with the exception of [36, 81].”
BackgroundOptical 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
Black, M. J., & Jepson, A. D. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.541407 · Cited by 191 · cited 3×
“Several methods first segment the scene using non-motion cues and then estimate the flow in these regions [12,83].”
MethodInfluentialSelf-citationProduction-Ready Global Illumination
Landis, H. (2004) · Cited by 187
Human-assisted motion annotation
Liu, C., Freeman, W. T., Adelson, E. H., & Weiss, Y. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587845 · Cited by 186 · cited 5×
“Of the various possible techniques—synthetic data (Barron et al. 1994; McCane et al. 2001), some form of hidden markers (Mova LLC 2004; Tappen et al. 2006; Ramnath et al. 2008), human annotation ( Liu et al. 2008 ), interpolation data (Szeliski 1999), and modified stereo data (Scharstein and Szeliski 2003)—the authors…”
BackgroundMethodInfluentialStructure- 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
Moving gradients: a path-based method for plausible image interpolation
Mahajan, D., Huang, F.-C., Matusik, W., Ramamoorthi, R., & Belhumeur, P. (2009) · ACM Transactions on Graphics · doi:10.1145/1531326.1531348 · Cited by 172
Bruhn, A., Weickert, J., Kohlberger, T., & Schnörr, C. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-6616-7 · Cited by 171
On the Spatial Statistics of Optical Flow
Roth, S., & Black, M. J. (2007) · International Journal of Computer Vision · doi:10.1007/s11263-006-0016-x · Cited by 168 · cited 2×
“Rather than manually making these decision and tuning parameters, learning algorithms have been used to choose the data and prior terms and optimize their parameters by maximizing performance on a set of training data (Roth and Black 2007; Sun et al. 2008; Li and Huttenlocher 2008).”
BackgroundMethodSelf-citationFusionFlow: Discrete-continuous optimization for optical flow estimation
Lempitsky, V., Roth, S., & Rother, C. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587751 · Cited by 145 · cited 5×
“Fusion Flow ( Lempitsky et al. 2008 )u ses as equence of binary graph-cut optimizations to refine the current flow estimate by selectively replacing portions with one of the candidate solutions.”
BackgroundMethodInfluentialSelf-citationLearning Gaussian Conditional Random Fields for Low-Level Vision
Tappen, M. F., Liu, C., Adelson, E. H., & Freeman, W. T. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.382979 · Cited by 138
Surface stereo with soft segmentation
Ble, M., Rother, C., & Kohli, P. (2010) · 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.2010.5539783 · Cited by 136
Skin and bones: multi-layer, locally affine, optical flow and regularization with transparency
Ju, S. X., Black, M. J., & Jepson, A. D. (1996) · Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1996.517090 · Cited by 132 · cited 3×
“The regularization of transparent motion in the framework of global energy minimization, however, has received little attention with the exception of [36, 81].”
BackgroundMethodSelf-citationPrediction error as a quality metric for motion and stereo
Szeliski, R. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790301 · Cited by 118
Self-citationOver-Parameterized Variational Optical Flow
Nir, T., Bruckstein, A. M., & Kimmel, R. (2007) · International Journal of Computer Vision · doi:10.1007/s11263-007-0051-2 · Cited by 118 · cited 4×
“These constraints have both been strictly enforced (Adiv 1985; Hanna 1991; Nir et al. 2008) and added as a soft prior (Wedel et al.”
BackgroundMethodInfluentialComputing optical flow across multiple scales: An adaptive coarse-to-fine strategy
Battiti, R., Amaldi, E., & Koch, C. (1991) · International Journal of Computer Vision · doi:10.1007/bf00128153 · Cited by 108 · cited 1×
“The most common approach is to build image pyramids by repeated blurring and downsampling (Lucas and Kanade 1981; Glazer et al. 1983 ;B urt et al.1983; Enkelman 1986; Anandan 1989; Black and Anandan 1996; Battiti et al. 1991; Bruhn et al. 2005).”
BackgroundZimmer, H., Bruhn, A., Weickert, J., Valgaerts, L., Salgado, A., Rosenhahn, B., & Seidel, H.-P. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03641-5_16 · Cited by 107 · cited 3×
“Adaptive (Wedel et al. 2009) 9.2 Seg OF ( Xu et al. 2008 )6 0”
MethodInfluentialEstimating Intrinsic Component Images using Non-Linear Regression
Tappen, M. F., Adelson, E. H., & Freeman, W. T. (2006) · 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.2006.114 · Cited by 106 · cited 2×
“[73] recently used certain wavelengths to hide ground truth in intrinsic images.”
BackgroundGolland, P., & Bruckstein, A. M. (1997) · Computer Vision and Image Understanding · doi:10.1006/cviu.1997.0553 · Cited by 99 · cited 1×
“Another issue, addressed by a number of authors (Ohta 1989; Markandey and Flinchbaugh 1990; Golland and Bruckstein 1997), is how to modify the data term for color or multi-band images.”
BackgroundInternational Conference on Image Processing
(2009) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2009.2034430 · Cited by 96
Dense optical flow by iterative local window registration
Le Besnerais, G., & Champagnat, F. (2005) · IEEE International Conference on Image Processing 2005 · doi:10.1109/icip.2005.1529706 · Cited by 90 · cited 2×
“These algorithms are applicable to problems with fewer parameters such as the Lucas-Kanade algorithm [44] and variants [38], which solve for a single flow vector (2 unknowns) independently for each block of pixels.”
MethodDirect multi-resolution estimation of ego-motion and structure from motion
Hanna, K. J. (2002) · Proceedings of the IEEE Workshop on Visual Motion · doi:10.1109/wvm.1991.212812 · Cited by 83 · cited 1×
“These constraints have both been strictly enforced [1, 29,52] and added as a soft prior [78,79].”
BackgroundA Segmentation Based Variational Model for Accurate Optical Flow Estimation
Xu, L., Chen, J., & Jia, J. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88682-2_51 · Cited by 79 · cited 1×
“Several methods rst segment the scene using non-motion cues and then estimate the ow in these regions [12, 83 ].,Such sparse matching method can be combined with the continuous energy minimization approaches in a variety of ways [15,43,60, 83 ].,Explicit occlusion estimation, for example through cross-checking ows com…”
MethodInfluentialShizawa, M., & Maze, K. (2002) · 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.1991.139704 · Cited by 74
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 · cited 5×
“12 F-TV-L1 [79] 8 Second-order prior [75] 14 Fusion [40] 2,666 Dynamic MRF [27] 366 Algorithm Runtime”
BackgroundInfluentialOptical flow estimation on coarse-to-fine region-trees using discrete optimization
Lei, C., & Yang, Y.-H. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459253 · Cited by 67 · cited 12×
“DPOF ( Lei and Yang 2009 ), which involves segmentation and performs best on Grove, does particular poorly on Yosemite presumably because segmenting the grayscale Yosemite sequence is difficult.”
BackgroundMethodInfluentialSeitz, S. M., & Baker, S. (2009) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2009.5459155 · Cited by 67 · cited 1×
“The scenes contain a random number of procedurally generated " rocks " (up to 40) and " trees " (up to 25) with randomly chosen ground texture and surface displacement.”
BackgroundSelf-citationDuality TV-L1 flow with fundamental matrix prior
Wedel, A., Pock, T., Braun, J., Franke, U., & Cremers, D. (2008) · 2008 23rd International Conference Image and Vision Computing New Zealand · doi:10.1109/ivcnz.2008.4762119 · Cited by 58
An Unbiased Second-Order Prior for High-Accuracy Motion Estimation
Trobin, W., Pock, T., Cremers, D., & Bischof, H. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69321-5_40 · Cited by 54 · cited 1×
“@ 2v @x@y ) to be small [4, 75 ]. A related approach is to use an ane prior [35, 36, 52, 65].”
MethodLocal 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 · cited 1×
“The most common approach is to build image pyramids by repeated blurring and downsampling [3, 11, 18, 22 , 26, 44].,Such sparse matching method can be combined with the continuous energy minimization approaches in a variety of ways [15,43, 60 ,83].,Seg OF [83] 60 Learning Flow [70] 825 Filter Flow [65] 34,000 Graph Cu…”
MethodInfluentialMoving gradients: a path-based method for plausible image interpolation
Mahajan, D. K., Huang, F., Matusik, W., Ramamoorthi, R., & Belhumeur, P. N. (2009) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/1576246.1531348 · Cited by 51 · cited 1×
“We hope that our database will be used both by researchers working on optical flow and on frame interpolation ( Mahajan et al. 2009; Herbst et al. 2009).”
MethodLarge displacement optical flow
Brox, T., Bregler, C., & Malik, J. (2009) · 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/cvprw.2009.5206697 · Cited by 51
A Variational Model for the Joint Recovery of the Fundamental Matrix and the Optical Flow
Valgaerts, L., Bruhn, A., & Weickert, J. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69321-5_32 · Cited by 47 · cited 1×
“These constraints have both been strictly enforced (Adiv 1985; Hanna 1991; Nir et al. 2008) and added as a soft prior (Wedel et al. 2008; Wedel et al. 2009; Valgaerts et al. 2008 ).”
BackgroundOcclusion Reasoning for Temporal Interpolation using Optical Flow
Herbst, E. V., Seitz, S. M., & Baker, S. (2009) · Cited by 46
Self-citationLearning for Optical Flow Using Stochastic Optimization
Li, Y., & Huttenlocher, D. P. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88688-4_28 · Cited by 42 · cited 4×
“Rather than manually making these decision and tuning parameters, learning algorithms have been used to choose the data and prior terms and optimize their parameters by maximizing performance on a set of training data [41,61,70].”
BackgroundMethodInfluentialMultispectral constraints for optical flow computation
Markandey, V., & Flinchbaugh, B. E. (2002) · doi:10.1109/iccv.1990.139488 · Cited by 38 · cited 1×
“Another issue, addressed by a number of authors (Ohta 1989; Markandey and Flinchbaugh 1990; Golland and Bruckstein 1997), is how to modify the data term for color or multi-band images.”
BackgroundRegion-based optical flow estimation
Fuh, C., & Maragos, P. (2003) · doi:10.1109/cvpr.1989.37840 · Cited by 36 · cited 1×
“Several methods first segment the scene using nonmotion cues and then estimate the flow in these regions (Black and Jepson 1996 ;X u et al.2008; Fuh and Maragos 1989 ).”
MethodContinuous Energy Minimization Via Repeated Binary Fusion
Trobin, W., Pock, T., Cremers, D., & Bischof, H. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88693-8_50 · Cited by 30 · cited 11×
“Second-order prior ( Trobin et al. 2008 ) 14 TI-DOFE (Cassisa et al. 2009) 260”
BackgroundMethodInfluentialComputing optical flow with physical models of brightness variation
Haussecker, H. W., & Fleet, D. J. (2002) · 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.2000.854951 · Cited by 29 · cited 1×
“Explicit illumination modeling can be generalized in several ways, for example to model the changes physically over a longer time interval [30] or to model blur [65].”
BackgroundAlgorithmic Differentiation: Application to Variational Problems in Computer Vision
Pock, T., Pock, M., & Bischof, H. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1044 · Cited by 21 · cited 1×
“One disadvantage of variational algorithms is that the discretization of the Euler-Lagrange equations is not always exact with respect to the original energy [56].”
Two Applications of Graph-Cuts to Image Processing
Cooke, T. (2008) · 2008 Digital Image Computing: Techniques and Applications · doi:10.1109/dicta.2008.32 · Cited by 15
Increasing the density of Active Appearance Models
Ramnath, K., Baker, S., Matthews, I., & Ramanan, D. (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.4587517 · Cited by 14 · cited 2×
“Another form of hidden markers was also used in [58] to provide a sparse ground-truth alignment (or flow) of face images.”
BackgroundSelf-citationToward Global Minimum through Combined Local Minima
Jung, H. Y., Lee, K. M., & Lee, S. U. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88693-8_22 · Cited by 14 · cited 1×
“Algorithms such as [37, 40, 74] assume that a number of candidate flow fields have been generated by running standard algorithms such as Lucas-Kanade [44] and Horn-Schunck [33], possibly multiple times with a number of different parameters.”
MethodTwo-Frame Optical Flow Formulation in an Unwarping Multiresolution Scheme
Cassisa, C., Simoëns, S., & Prinet, V. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10268-4_93 · Cited by 7 · cited 1×
“Seg OF [83] 60 Learning Flow [70] 825 Filter Flow [65] 34,000 Graph Cuts [20] 1,200 Black & Anandan [11] 328 SPSA-learn [41] 200 Group Flow [60] 600 2D-CLG [16] 844 Horn & Schunck [33] 49 TI-DOFE [19] 260 FOLKI [38] 1.”
Computation of Normal Velocity from Local Phase Information
Fleet, D. J., & Jepson, A. D. (1989) · Image Understanding and Machine Vision · doi:10.1364/iumv.1989.tua3 · Cited by 4
Estimating Image Motion in Layers: The Skin and Bones Model
Ju, X. (1998) · Cited by 1
On the Computation of Motion from Sequences of Images - A Review
Aggarwal, J. K., & Nandhakumar, N. (1988) · doi:10.21236/ada211479
Display of surfaces from volume data
Levoy, M. (1988) · Computer-Aided Design · doi:10.1016/0010-4485(88)90247-3
Research works printed but not linked: 3
- Anandan, P., & Weiss, R. (1985). Introducing smoothness constraint in a matching approach for the computation of displacement fields. In Proceedings of the DARPA image understanding workshop (pp. 186–196).
- Bleyer, M., & Chambon, S. (2010). Does color really help in dense stereo matching? In Proceedings of the international symposium 3D data processing, visualization and transmission.
- Rannacher, J. (2009). Realtime 3D motion estimation on graphics hardware. Undergraduate thesis, Heidelberg University.
Cited by
Microsoft COCO: Common Objects in Context
Lin, T.-Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollár, P., & Zitnick, C. L. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10602-1_48 · Cited by 45,460
“Some notable datasets include the Middlebury datasets for stereo vision [20], multi-view stereo [36] and optical flow [21].”
BackgroundAre we ready for autonomous driving? The KITTI vision benchmark suite
Geiger, A., Lenz, P., & Urtasun, R. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6248074 · Cited by 14,897
“Perhaps not surprisingly, many algorithms that do well on established datasets such as Middlebury [41, 2] struggle on our benchmark.”
InfluentialThe Unreasonable Effectiveness of Deep Features as a Perceptual Metric
Zhang, R., Isola, P., Efros, A. A., Shechtman, E., & Wang, O. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00068 · Cited by 14,623
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 Middlebury dataset [2] contains only 8 image pairs for training, with ground truth flows generated using four different techniques.”
MethodA benchmark for the evaluation of RGB-D SLAM systems
Sturm, J., Engelhard, N., Endres, F., Burgard, W., & Cremers, D. (2012) · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2012.6385773 · Cited by 3,976
“All sequences and movies are available on our website [1].”
Background
Metadata
- Authors
- Baker, S., Scharstein, D., Lewis, J. P., Roth, S., Black, M. J., & Szeliski, R.
- Affiliations
- Microsoft (United States) (US)
- Middlebury College (US)
- Technische Universität Darmstadt (DE)
- Brown University (US)
- Corresponding author
- Scharstein, Daniel
- Venue
- International Journal of Computer Vision
- Published
- 2010-11-30
- Volume
- 92
- Issue
- 1
- Pages
- 1-31
- ISSN
- 0920-5691 (ISSN-L)
- 1573-1405
- OpenAlex
- W2147253850
- Semantic Scholar
- 804836b8ad86ef8042e3dcbd45442a52f031ee03
- Cited by
- 2,205
- References
- 112
- Citations by year
- 2026: 49 · 2025: 81 · 2024: 82 · 2023: 117 · 2022: 129 · 2021: 152 · 2020: 174 · 2019: 163 · 2018: 144 · 2017: 156 · 2016: 187 · 2015: 180 · 2014: 154 · 2013: 129 · 2012: 118
- FWCI
- 146.62
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by-nc
- Locations
- International Journal of Computer Vision (publishedVersion, cc-by-nc)
- Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) (publishedVersion)
- Max Planck Institute for Plasma Physics (submittedVersion)
- Fraunhofer-Publica (Fraunhofer-Gesellschaft) (submittedVersion)
- Funders
- National Science Foundation (0534858, 0535075, 0413169)
- Intel Corporation
- 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, textureless regions, sensor noise
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-01, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-01 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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.