Efficient Computation of Closed Contours using Modified Baum-Welch Updating
Author(s) -
Leigh. A. Johnston,
James. H. Elder
Publication year - 2004
Publication title -
proceedings of the 2004 ieee computer society conference on computer vision and pattern recognition, 2004. cvpr 2004.
Language(s) - English
Resource type - Book series
ISBN - 0-7695-2158-4
DOI - 10.1109/cvpr.2004.56
We address the problem of computing closed contours delineating the boundaries of objects of interest from image tangent maps. The Bayesian formulation of this problem incorporates the notion of foreground and background models in inferring the optimal image organization. Due to vital non-local constraints, the optimal MAP solution is intractable. We present a novel efficient search algorithm for the construction of highly probable closed contours, based on the Baum-Welch algorithm for updating hidden Markov model parameters.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom