Stochastic annealing for nearest-neighbour point processes with application to object recognition

M.N.M. Lieshout, van

    Research output: Contribution to journalArticleAcademicpeer-review

    1 Downloads (Pure)

    Abstract

    We study convergence in total variation of non-stationary Markov chains in continuous time and apply the results to the image analysis problem of object recognition. The input is a grey-scale or binary image and the desired output is a graphical pattern in continuous space, such as a list of geometric objects or a line drawing. The natural prior models are Markov point processes found in stochastic geometry. We construct well-defined spatial birth-and-death processes that converge weakly to the posterior distribution. A simulated annealing algorithm involving a sequence of spatial birth-and-death processes is developed and shown to converge in total variation to a uniform distribution on the set of posterior mode solutions. The method is demonstrated on a tame example.
    Original languageEnglish
    Pages (from-to)281-300
    Number of pages20
    JournalAdvances in Applied Probability
    Volume26
    Issue number2
    Publication statusPublished - 1994

    Fingerprint Dive into the research topics of 'Stochastic annealing for nearest-neighbour point processes with application to object recognition'. Together they form a unique fingerprint.

    Cite this