Cited by 58Advanced Vision and ImagingVideo Surveillance and Tracking MethodsImage and Video Stabilization

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Duality 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

Abstract

Variational techniques yield the most accurate results for dense optical flow fields between two images. They have the nice property of inherent smoothness to cope with untextured image regions: the filling-in of such regions is driven by neighbouring pixels. Such filling-in is not always the best choice. If the scene is mostly stationary and the camera is moving, the direction of the optical flow vectors can be restricted using the fundamental matrix. In this paper we propose an exact solution of the variational optical flow, using the fundamental matrix geometry as an additional weak prior. Our novel approach currently performs best on the Middlebury flow evaluation which includes images from stationary and dynamic scenes.

Overview

Integrity signals

Registry

Crossref · 10.1109/ivcnz.2008.4762119

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • F-TV-L1 uses a rigidity prior.

    “F-TV-L1 uses a rigidity prior”

    From A Database and Evaluation Methodology for Optical Flow (2011) · cites this paper as Wedel et al. 2008

  • One algorithm that uses rigidity (F-TV-L1-Wedel et al. 2008) does poorly on the non-rigid scenes.

    “one algorithm that uses rigidity (F-TV-L1-Wedel et al. 2008) does poorly on the non-rigid scenes”

    From A Database and Evaluation Methodology for Optical Flow (2011) · cites this paper as Wedel et al. 2008

  • F-TV-L1 (Wedel et al. 2008) does poorly on the non-rigid sequences (Army, Mequon, Schefflera, and Wooden).

    “but poorly on the non-rigid sequences ( Army , Mequon , Schefflera , and Wooden ).”

    From A Database and Evaluation Methodology for Optical Flow (2011) · cites this paper as Wedel et al. 2008

  • F-TV-L1 (Wedel et al. 2008) does well on the largely rigid sequences (Grove, Urban, Yosemite, and Teddy).

    “F-TV-L1 (Wedel et al. 2008) does well on the largely rigid sequences ( Grove , Urban , Yosemite , and Teddy )”

    From A Database and Evaluation Methodology for Optical Flow (2011) · cites this paper as Wedel et al. 2008

  • The rigidity prior component of F-TV-L1 seems to be used too aggressively.

    “so it seems that this component is being used too aggressively.”

    From A Database and Evaluation Methodology for Optical Flow (2011) · cites this paper as Wedel et al. 2008

Citations

Cites

  • 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 6×

    “The main contribution of [5] is the reformulation of the original variational energy functional into a convex dual form, allowing splitting between the data term and the smoothness term in an iterative solving process.”
    BackgroundMethodInfluentialSelf-citation

Flagged first, then by citations

Research works printed but not linked: 13

  1. 10.1007/s11263-006-4331-z · DOI
  2. 10.1016/0167-2789(92)90242-F · DOI
  3. chambolle, 2005, total variation minimization and a class of binary mrf models, Energy Minimization Methods in Computer Vision and Pattern Recognition, 136, 10.1007/11585978_10 · DOI
  4. 10.1109/TIP.2005.846018 · DOI
  5. horn, 1980, Determining optical flow
  6. stein, 2004, efficient computation of optical flow using the census transform, Lecture Notes in Computer Science, 79, 10.1007/978-3-540-28649-3_10 · DOI
  7. lucas, 1981, an iterative image registration technique with an application to stereo vision, Proceedings International Joint Conference on Artificial Intelligence, 674
  8. baker, 2007, a database and evaluation methodology for optical flow, Int Conf Computer Vision, 1
  9. 10.1007/978-3-540-69321-5_21 · DOI
  10. 10.1007/3-540-30292-1_7 · DOI
  11. brox, 2004, high accuracy optical flow estimation based on a theory for warping, European Conference on Computer Vision (ECCV), 3024, 25
  12. valgaerts, 2008, a variational approach for the joint recovery of the optical flow and the fundamental matrix, Pattern Recognition (Proc DAGM), 10.1007/978-3-540-69321-5_32 · DOI
  13. slesareva, 2005, optic flow goes stereo: a variational method for estimating discontinuity-preserving dense disparity maps, Pattern Recognition (Proc DAGM), 33, 10.1007/11550518_5 · DOI

Cited by

Sorted by citations

Metadata

Authors
Wedel, A., Pock, T., Braun, J., Franke, U., & Cremers, D.
Affiliations
  • University of Bonn (DE)
  • Daimler (Germany) (DE)
Venue
2008 23rd International Conference Image and Vision Computing New Zealand
Publisher
IEEE
Published
2008-11
Pages
1-6
OpenAlex
W2109432061
Cited by
58
References
1
Citations by year
2025: 1 · 2022: 2 · 2021: 3 · 2020: 4 · 2019: 2 · 2018: 2 · 2016: 3 · 2015: 5 · 2014: 9 · 2013: 5 · 2012: 3
FWCI
4.81
Type
conference paper
Language
en
Open access
closed
Locations
International Conference on Image and Vision Computing New Zealand (IVCNZ) (publishedVersion)
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 › Computer Vision and Pattern Recognition › Image and Video Stabilization
Keywords
dense optical flow, variational optical flow, fundamental matrix, camera movement

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