The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
TV-L1 Optical Flow Estimation
Open accessAbstract
This article describes an implementation of the optical flow estimation method introduced by Zach, Pock and Bischof in 2007. This method is based on the minimization of a functional containing a data term using the L1 norm and a regularization term using the total variation of the flow. The main feature of this formulation is that it allows discontinuities in the flow field, while being more robust to noise than the classical approach of Horn and Schunck. The algorithm is an efficient numerical scheme, which solves a relaxed version of the problem by alternate minimization.
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
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
chambolle (2004) · doi:10.1023/b:jmiv.0000011321.19549.88 · Cited by 3,227
BRST Cohomology of the Chapline-Manton Model
Barnich, G., Leclercq, S., & Spindel, P. (1997) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · doi:10.1023/b · Cited by 2,179
A Duality Based Approach for Realtime TV-L 1 Optical Flow
Zach, C., Pock, T., & Bischof, H. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74936-3_22 · Cited by 1,658 · cited 2×
“1 Introduction The method described in Zach, Pock and Bischof’s article [6] is based on the brightness constancy assumption.”
MethodAn Algorithm for Total Variation Minimization and Applications
Chambolle, A. (2004) · Journal of Mathematical Imaging and Vision · doi:10.1023/b:jmiv.0000011325.36760.1e · Cited by 832
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
“Determining optical flow”: a retrospective
Horn, B. K. P., & Schunck, B. G. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90173-9 · Cited by 171
Horn-Schunck Optical Flow with a Multi-Scale Strategy
Meinhardt-Llopis, E., Pérez, J. S., & Kondermann, D. (2013) · Image Processing On Line · doi:10.5201/ipol.2013.20 · Cited by 143
Self-citation
Cited by
Deep Video Deblurring for Hand-Held Cameras
Su, S., Delbracio, M., Wang, J., Sapiro, G., Heidrich, W., & Wang, O. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.33 · Cited by 577
Spatio-Temporal AutoEncoder for Video Anomaly Detection
Zhao, Y., Deng, B., Shen, C., Liu, Y., Lu, H., & Hua, X.-S. (2017) · Proceedings of the 25th ACM international conference on Multimedia · doi:10.1145/3123266.3123451 · Cited by 559
Real-Time Action Recognition with Enhanced Motion Vector CNNs
Zhang, B., Wang, L., Wang, Z., Qiao, Y., & Wang, H. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.297 · Cited by 433
Proceedings of the 19th Python in Science Conference
(2020) · Proceedings of the Python in Science Conference · doi:10.25080/majora-342d178e-02b · Cited by 284
Controllable Video Captioning With POS Sequence Guidance Based on Gated Fusion Network
Wang, B., Ma, L., Zhang, W., Jiang, W., Wang, J., & Liu, W. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00273 · Cited by 199
Metadata
- Authors
- Sánchez Pérez, J., Meinhardt-Llopis, E., & Facciolo, G.
- Venue
- Image Processing On Line
- Publisher
- Image Processing On Line
- Published
- 2013-07-19
- Volume
- 3
- Pages
- 137-150
- ISSN
- 2105-1232 (ISSN-L)
- OpenAlex
- W2096621047
- Cited by
- 416
- References
- 8
- FWCI
- 21.19
- Type
- journal article
- Language
- en
- Open access
- diamond
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.