Hierarchical spline-based image registration
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
The problem of image registration subsumes a number of topics in multiframe image analysis, including the computation of optic flow (general pixel-based motion), stereo correspondence, structure from motion, and feature tracking. We present a new registration algorithm based on a spline representation of the displacement field which can be specialized to solve all of the above mentioned problems. In particular, we show how to compute local flow, global (parametric) flow, rigid flow resulting from camera egomotion, and multiframe versions of the above problems. Using a spline-based description of the flow removes the need for overlapping correlation windows, and produces an explicit measure of the correlation between adjacent flow estimates. We demonstrate our algorithm on multiframe image registration and the recovery of 3D projective scene geometry. We also provide results on a number of standard motion 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
The Laplacian pyramid as a compact image code
Burt, P., & Adelson, E. (1983) · IEEE Transactions on Communications · doi:10.1109/tcom.1983.1095851 · Cited by 6,077 · cited 1×
“A Gaussian image pyramid is first computed [6].”
MethodPerformance 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 4×
“In these tables, the top two rows are copied from [4].”
BackgroundMethodInfluentialSpatiotemporal energy models for the perception of motion
Adelson, E. H., & Bergen, J. R. (1985) · Journal of the Optical Society of America A · doi:10.1364/josaa.2.000284 · Cited by 3,442
Computation 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
A 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 by
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
“, for integer disparities (exceptions include continuous optimization techniques such as optic flow [7] or splines [70]).”
BackgroundMethodTwo-Frame Motion Estimation Based on Polynomial Expansion
Farnebäck, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-45103-x_50 · Cited by 2,971
Image matching as a diffusion process: an analogy with maxwell’s demons
Thirion, J.-P. (1998) · Medical Image Analysis · doi:10.1016/s1361-8415(98)80022-4 · Cited by 2,445
Image Alignment and Stitching: A Tutorial
Szeliski, R. (2007) · Foundations and Trends in Computer Graphics and Vision · doi:10.1561/0600000009 · Cited by 1,593
Lucas/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
Lucas/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
Video mosaics for virtual environments
Szeliski, R. (1996) · IEEE Computer Graphics and Applications · doi:10.1109/38.486677 · Cited by 727
Object matching using deformable templates
Jain, A. K., Zhong, Y., & Lakshmanan, S. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.485555 · Cited by 520
Highly Accurate Optic Flow Computation with Theoretically Justified Warping
Papenberg, N., Bruhn, A., Brox, T., Didas, S., & Weickert, J. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-005-3960-y · Cited by 409
Image mosaicing for tele-reality applications
Szeliski, R. (2002) · Proceedings of 1994 IEEE Workshop on Applications of Computer Vision · doi:10.1109/acv.1994.341287 · Cited by 369
Handling occlusions in dense multi-view stereo
Kang, S. B., Szeliski, R., & Chai, J. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990462 · Cited by 353
Diffeomorphisms Groups and Pattern Matching in Image Analysis
Trouvé, A. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008001603737 · Cited by 325
Irani, M., & Anandan, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44480-7_18 · Cited by 250
“Other 2D models which have been used by direct methods include the Quadratic motion model [1,14], which describes the motion of a planar surface under small camera rotation, and the 2D projective transformation (a homography) [19], which describes the exact image motion of an arbitrary planar surface between two discr…”
Metadata
- Authors
- Szeliski, & Coughlan
- Venue
- Proceedings of IEEE Conference on Computer Vision and Pattern Recognition CVPR-94
- Publisher
- IEEE Comput. Soc. Press
- Published
- 1994
- Pages
- 194-201
- OpenAlex
- W2120507918
- Cited by
- 137
- References
- 6
- FWCI
- 7.03
- 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
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.