DocumentCode
2202032
Title
Learning in Gibbsian fields: how accurate and how fast can it be?
Author
Zhu, Song-Chun ; Liu, Xiuwen
Author_Institution
Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA
Volume
2
fYear
2000
fDate
2000
Firstpage
2
Abstract
In this article, we present a unified framework for learning Gibbs models from training images. We identify two key factors that determine the accuracy and speed of learning Gibbs models: (1). Fisher information, and (2). The accuracy of Monte Carlo estimate for partition functions. We propose three new learning algorithms under the unified framework. (I). The maximum partial likelihood estimator. (II). The maximum patch likelihood estimator, and (III). The maximum satellite likelihood estimator. The first two algorithms can speed up the minimax entropy algorithm by about 2D times without losing much accuracy. The third one makes use of a set of known Gibbs models as references-dubbed “satellites” and can approximately estimate the minimax entropy model in the speed of 10 seconds
Keywords
image processing; learning (artificial intelligence); maximum likelihood estimation; Fisher information; Gibbsian fields; Monte Carlo estimate; learning Gibbs models; learning algorithms; maximum partial likelihood estimator; maximum patch likelihood estimator; maximum satellite likelihood estimator; minimax entropy; training images; Character generation;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision and Pattern Recognition, 2000. Proceedings. IEEE Conference on
Conference_Location
Hilton Head Island, SC
ISSN
1063-6919
Print_ISBN
0-7695-0662-3
Type
conf
DOI
10.1109/CVPR.2000.854723
Filename
854723
Link To Document