This thesis is concerned with fundamental algorithms for estimating parameters of geometric models that are particularly relevant to computer vision. A general framework is considered which accommodates several important problems involving estimation in a maximum likelihood setting. By considering a special form of a commonly used cost function, a new, iterative, estimation method is evolved. This method is subsequently expanded to enable incorporation of a so-called ancillary constraint. An important feature of these methods is that they can serve as a basis for conducting theoretical comparison of various estimation approaches. Two specific applications are considered: conic fitting, and estimation of the fundamental matrix (a matrix arising in stereo vision). In the case of conic fitting, unconstrained methods are first treated. The problem of producing ellipse-specific estimates is subsequently tackled. For the problem of estimating the fundamental matrix, the new constrained method is applied to generate an estimate which satisfies the necessary rank-two constraint. Other constrained and unconstrained methods are compared within this context. For both of these example problems, the unconstrained and constrained methods are shown to perform with high accuracy and efficiency. The value of incorporating covariance information characterising the uncertainty of measured image point locations within the estimation process is also explored. Covariance matrices associated with data points are modelled, then an empirical study is made of the conditions under which covariance information enables generation of improved parameter estimates. Under the assumption that covariance information is, in itself, subject to estimation error, tests are undertaken to determine the effect of imprecise information upon the quality of parameter estimates. Finally, these results are carried over to experiments to assess the value of covariance information in estimating the fundamental matrix from real images. The use of such information is shown to be of potential benefit when the measurement process of image features is considered. / Thesis (Ph.D.)--School of Computer Science, 2004.

Thesis (Ph. D.)--University of Washington, 2001. / Vita. Includes bibliographical references (p. 131-143).

Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Includes vita. Includes bibliographical references.

Thesis (Ph.D) -- McMaster University, 1997. / Includes bibliographical references (leaves 99-104). Also available via World Wide Web.

Thesis (M. Phil.)--University of Hong Kong, 2008. / Also available in print.

Thesis (Ph.D.) -- University of Adelaide, Dept. of Computer Science, 2000. / Bibliography: leaves 100-110.

Thesis (Ph.D.)--University of Adelaide, School of Computer Science and Cooperative Research Centre for Sensor Signal and Information Processing, 2004. / "September 2004" Includes bibliographical references (leaves 119-126).

Thesis (Ph.D.)--University of Adelaide, School of Computer Science and Cooperative Research Centre for Sensor Signal and Information Processing, 2004. / "September 2004" Includes bibliographical references (leaves 119-126). Also available in a print format.

Thesis (Ph. D.)--University of Hong Kong, 2007. / Title proper from title frame. Also available in printed format.

Thesis (M. Phil.)--University of Hong Kong, 1994. / Includes bibliographical references (leaves 82-85).