このエントリーをはてなブックマークに追加
ID 14155
JaLCDOI
Sort Key
10
FullText URL
Author
Abstract
Geometric fitting is one of the most fundamental problems of computer vision. In [8], the author derived a theoretical accuracy bound (KCR lower bound) for geometric fitting in general and proved that maximum likelihood (ML) estimation is statistically optimal. Recently, Chernov and Lesort [3] proved a similar result, using a weaker assumption. In this paper, we compare their formulation with the author’s and describe the background of the problem. We also review recent topics including semiparametric models and discuss remaining issues.
Publication Title
Memoirs of the Faculty of Engineering, Okayama University
Published Date
2005-01
Volume
volume39
Issue
issue1
Publisher
Faculty of Engineering, Okayama University
Publisher Alternative
岡山大学工学部
Start Page
63
End Page
70
ISSN
0475-0071
NCID
AA10699856
Content Type
Departmental Bulletin Paper
OAI-PMH Set
岡山大学
language
英語
File Version
publisher
NAID
Eprints Journal Name
mfe