An assessment of information criteria for motion model selection
Published 22 November 2002
Philip H. S. Torr
Citations111
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Several model selection methods are compared with a particular emphasis on providing a method that will workfully automatically on real imagery and which will fit to the data without affecting structure, matching or segmentation.
Abstract
Rigid motion imposes constraints on the motion of image points between the two images. The matched points must conform to one of several possible constraints, such as that given by the fundamental matrix or image-image homography, and it is essential to know which model to fit to the data before recovery of structure, matching or segmentation can be performed successfully This paper compares several model selection methods with a particular emphasis on providing a method that will workfully automatically on real imagery.
Keywords
Computer ScienceEngineering
IEEE Transactions on Automatic ControlA new look at the statistical model identification
50,732 Citations1974Hirotugu Akaike
Communications of the ACMRandom sample consensus
25,463 Citations1981Martin A. Fischler, Robert C. Bolles
New results are derived on the minimum number of landmarks needed to obtain a solution, and algorithms are presented for computing these minimum-landmark solutions in closed form that provide the basis for an automatic system that can solve the Location Determination Problem under difficult viewing.
AutomaticaModeling by shortest data description
5,944 Citations1978J. Rissanen
The number of digits it takes to write down an observed sequence x1,...,xN of a time series depends on the model with its parameters that one assumes to have generated the observed data.
PsychometrikaModel Selection and Akaike's Information Criterion (AIC): The General Theory and its Analytical Extensions
4,522 Citations1987Hamparsum Bozdogan
Information and ControlA formal theory of inductive inference. Part II
1,786 Citations1964Ray J. Solomonoff
Four ostensibly different theoretical models of induction are presented, in which the problem dealt with is the extrapolation of a very long sequence of symbols—presumably containing all of the information to be used in the induction.
Information and ControlA formal theory of inductive inference. Part I
1,149 Citations1964Ray J. Solomonoff
MIT Press eBooksGeometric invariance in computer vision
1,022 Citations1992Joseph L. Mundy, Andrew Zisserman
Part 1 foundations: algebraic invariants - invariant theory and enumerative combinatorics of young tableaux, and applications: transformation invariant indexing and invariant linear methods in photogrammetry and model-matching.
Lecture notes in computer scienceWhat can be seen in three dimensions with an uncalibrated stereo rig?
833 Citations1992Olivier Faugeras
This paper addresses the problem of determining the kind of three- dimensional reconstructions that can be obtained from a binocular stereo rig for which no three-dimensional metric calibration data is available, and shows that even in this case some very rich non-metric reconstructions of the environment can nonetheless be obtained.
International Journal of Computer VisionThe Development and Comparison of Robust Methods for Estimating the Fundamental Matrix
747 Citations1997Philip H. S. Torr, David W. Murray
A variety of robust methods for the computation of the Fundamental Matrix, the calibration-free representation of camera motion, are developed from the principal categories of robust estimators, viz. case deletion diagnostics, M-estimators and random sampling, and the theory required to apply them to non-linear orthogonal regression problems is developed.
Lecture notes in computer scienceEstimation of relative camera positions for uncalibrated cameras
539 Citations1992Richard Hartley
A non-iterative algorithm is given for determining the focal lengths of the two cameras, as well as their relative placement, assuming all other internal camera parameters to be known.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Estimation and Inference by Compact Coding
537 Citations1987Christopher S. Wallace, P. R. Freeman
The systematic variation within a set of data, as represented by a usual statistical model, may be used to encode the data in a more compact form than would be possible if they were considered to be purely random.
IEEE Transactions on Pattern Analysis and Machine IntelligenceOptimal Choice of AR and MA Parts in Autoregressive Moving Average Models
330 Citations1982Rangasami L. Kashyap
The Bayesian method of choosing the best model for a given one-dimensional series among a finite number of candidates belonging to autoregressive, moving average, AR, ARMA, and other families is dealt with.
Robust Parameterization and Computation of the Trifocal Tensor
181 Citations1996Philip H. S. Torr, Andrew Zisserman
Lecture notes in computer scienceStructure-from-motion under orthographic projection
25 Citations1990Chris Harris
Image and Vision ComputingStructure-from-motion under orthographic projection
9 Citations1991Chris Harris
Structure-from-motion algorithms based on matched point-like features under orthographic projection are explored, for use in analysing image motion from small rigid moving objects and closed-from n-point algorithms are devised that minimise image-plane positional errors.