Abstract
We introduce a class of polygonal Markov fields driven by local activity functions. Whereas the local rather than global nature of the field specification ensures substantial additional flexibility for statistical applications in comparison to classical polygonal fields, we show that a number of simulation algorithms and graphical constructions, as developed in our previous joint work with M.N.M. van Lieshout and R. Kluszczynski, carry over to this more general framework. Moreover, we provide explicit formulae for the partition function of the model, which directly implies the availability of closed form expressions for the corresponding likelihood functions. Within the framework of this theory we develop an image segmentation algorithm based on Markovian optimization dynamics combining the simulated annealing ideas with those of Chen-style stochastic optimization, in which successive segmentation updates are carried out simultaneously with adaptive optimization of the local activity functions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.