Maximum likelihood estimation by random sample and local optimization

Wen Tian; Hongyuan Wang; Fan Xu; Qiao Cai

doi:10.1117/12.834458

30 October 2009 Maximum likelihood estimation by random sample and local optimization

Wen Tian, Hongyuan Wang, Fan Xu, Qiao Cai

Proceedings Volume 7496, MIPPR 2009: Pattern Recognition and Computer Vision; 74961F (2009) https://doi.org/10.1117/12.834458
Event: Sixth International Symposium on Multispectral Image Processing and Pattern Recognition, 2009, Yichang, China

Abstract

MLESAC is one of the most widely used robust estimators in the field of computer vision. A shortcoming of this method is its low efficiency. An enhancement of MLESAC, the locally optimized MLESAC (LO-MLESAC) is proposed. LO-MLESAC adopts the same sample strategy and likelihood theory as the previous approach and an additional generalized model optimization step is applied to the models with the best quality. Results are given for several image sequences. It is demonstrated that this method gives results superior to original MLESAC.

Citation Download Citation

Wen Tian, Hongyuan Wang, Fan Xu, and Qiao Cai "Maximum likelihood estimation by random sample and local optimization", Proc. SPIE 7496, MIPPR 2009: Pattern Recognition and Computer Vision, 74961F (30 October 2009); https://doi.org/10.1117/12.834458

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available