Pattern Recognition, International Conference on (2000)
Sept. 3, 2000 to Sept. 8, 2000
Simon Moss , University of York
Edwin R. Hancock , University of York
This paper describes a Markov Chain Monte Carlo method for token matching. We commence by constructing a graphical model in which the roles of token correspondence and token alignment are made explicit. According to this model, the Markov Chain represents the conditional dependencies between the alignment parameters and the correspondence assignments. Through a process of Monte-Carlo sampling, we recover both alignment parameters and correspondence assignments to maximize the joint data likelihood. An important feature of our method is the way in which the alignment parameter distribution is sampled. We do this by selecting k-tuples of tokens. The size of the k-tuples is sufficient to determine the alignment parameters when token correspondence is known. In this way, we generate the alignment parameter distribution, which can be sampled by MCMC.
E. R. Hancock and S. Moss, "Alignment and Correspondence Using Markov Chain Monte Carlo," Pattern Recognition, International Conference on(ICPR), Barcelona, Spain, 2000, pp. 1928.