Tree-based iterated local search for Markov random fields with applications in image analysis
MetadataShow full item record
The maximum a posteriori assignment for general structure Markov random fields is computationally intractable. In this paper, we exploit tree-based methods to efficiently address this problem. Our novel method, named Tree-based Iterated Local Search (T-ILS), takes advantage of the tractability of tree-structures embedded within MRFs to derive strong local search in an ILS framework. The method efficiently explores exponentially large neighborhoods using a limited memory without any requirement on the cost functions. We evaluate the T-ILS on a simulated Ising model and two real-world vision problems: stereo matching and image denoising. Experimental results demonstrate that our methods are competitive against state-of-the-art rivals with significant computational gain.
Showing items related by title, author, creator and subject.
Chow, Chi Ngok (2010)The largest wool exporter in the world is Australia, where wool being a major export is worth over AUD $2 billion per year and constitutes about 17 per cent of all agricultural exports. Most Australian wool is sold by ...
Lam, Bee K. (1999)A network is a system that involves movement or flow of some commodities such as goods and services. In fact any structure that is in the form of a system of components some of which interact can be considered as a network. ...
Oil mallee plantings and arthropod biodiversity in the Western Australian wheatbelt : effects of host species, nutrition, and leaf chemistryLyons, Anita Marie (2008)Since European settlement, around 93% of the Western Australian wheatbelt has been cleared for agriculture, leading to a range of environmental problems, including erosion, salinity, and loss of biodiversity. Recently, ...