Dense optical flow by iterative local window registration
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We study dense optical flow estimation using iterative registration of local window, also known as iterative Lucas-Kanade (LK) [B. Lucas et al, 1981]. We show that the usual iterative-warping scheme encounters divergence problems and propose a modified scheme with better behavior. It yields good results with a much lower cost than the exact dense LK algorithm, on simulated and real sequences.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Horn, B. K. P., & Schunck, B. G. (1981) · Artificial Intelligence · doi:10.1016/0004-3702(81)90024-2 · Cited by 10,312
Performance 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
Research works printed but not linked: 8
- simoncelli, 1999, Bayesian multi-scale differential optical flow, Handbook of Computer Vision and Applications
- bergen, 1992, Hierarchical model-based motion estimation, ECCV 92, 10.1007/3-540-55426-2_27 · DOI · Paper page
- irani, 1999, All about direct methods, ICC'99
- lucas, 1981, An iterative image registration technique with an application to stereo vision, IJCAI'81, 674
- brox, 2004, High accuracy optical flow estimation based on a theory for warping, ECCV'04, 4, 25
- 10.1109/83.668027 · DOI · Paper page
- 10.1109/79.799930 · DOI · Paper page
- 10.1023/B:VISI.0000011205.11775.fd · DOI · Paper page
Cited by
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
“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.”
MethodA 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
Image super-resolution: the techniques, applications, and future
Yue, L., Shen, H., Li, J., Yuan, Q., Zhang, H., & Zhang, L. (2016) · Signal Processing · doi:10.1016/j.sigpro.2016.05.002 · Cited by 554
“However, the optical flow based methods are computationally expensive [141] and are sensitive to noise, large displacements, and illumination variation [142].”
Metadata
- Authors
- Le Besnerais, G., & Champagnat, F.
- Venue
- IEEE International Conference on Image Processing 2005
- Publisher
- IEEE
- Published
- 2005
- Pages
- I-137
- ISSN
- 1522-4880 (ISSN-L)
- OpenAlex
- W2016995526
- Cited by
- 90
- References
- 2
- FWCI
- 1.04
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dense optical flow by iterative local window registration. https://app.cochat.ai/papers/10.1109/icip.2005.1529706
- The paper
- Le Besnerais, G., & Champagnat, F. (2005). Dense optical flow by iterative local window registration. IEEE International Conference on Image Processing 2005. https://doi.org/10.1109/icip.2005.1529706
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.