Toward a statistically optimal method for estimating geometric relations from noisy data: Cases of linear relations

Takayuki Okatani, Koichiro Deguchi

Research output: Contribution to journalConference article

8 Citations (Scopus)

Abstract

In many problems of computer vision we have to estimate parameters in the presence of nuisance parameters increasing with the amount of data. It is known that unlike in the cases without nuisance parameters, maximum likelihood estimation (MLE) is not optimal in the presence of nuisance parameters. By optimal we mean that the resulting estimate is unbiased and its variance attains the theoretical lower bound in an asymptotic sense. Thus, naive application of MLE to computer vision have a potential problem. This applies to a wide range of problems from conic fitting to bundle adjustment. For this nuisance parameter problem, studies have been conducted in statistics for a long time, whereas they have been little known in computer vision community. We cast light to the methods developed in statistics for obtaining optimal estimates and explores the possibility of applying them to computer vision problems. In this paper we focus on the cases where data and nuisance parameters are linearly connected. As examples, optical flow estimation and affine structure and motion problems are considered. Through experiments, we show that the estimation accuracy is improved in several cases.

Original languageEnglish
JournalProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Volume1
Publication statusPublished - 2003 Sep 1
Event2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Madison, WI, United States
Duration: 2003 Jun 182003 Jun 20

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition

Fingerprint Dive into the research topics of 'Toward a statistically optimal method for estimating geometric relations from noisy data: Cases of linear relations'. Together they form a unique fingerprint.

Cite this