Traditional image change detection based on a non-subsampled contourlet transform always ignores the neighborhood information's relationship to the non-subsampled contourlet coefficients, and the detection results are susceptible to noise interference. To address these disadvantages, we propose a denoising method based on the non-subsampled contourlet transform domain that uses the Hidden Marko...

Traditionally, the goal of image segmentation has been to produce a single partition of an image. This partition is compared to some ‘ground truth’, or human approved partition, to evaluate the performance of the algorithm. This paper utilizes a framework for considering a range of possible partitions of the image to compute a probability distribution on the space of possible partitions of the ...

In this paper we propose a Markov random field with asymmetric Markov parameters to model the spatial and topological relationships between objects in structured scenes. The field is formulated in terms of conditional probabilities learnt from a set of training images. A locally consistent labelling of new scenes is achieved by relaxing the Markov random field directly using these conditional p...

In this work we present Cutting Plane Inference (CPI) for MAP inference in Markov Logic. CPI incrementally solves partial Ground Markov Networks, adding formulae only if they are violated in the current solution. We show dramatic improvements in terms of e ciency, and discuss scenarios where CPI is likely to be fast.

A new approach to multi−resolution modeling of images is introduced and applied to the task of semi−unsupervised texture segmentation using Gaussian Markov random fields (GMRFs). It is shown that traditional GMRF modeling of multi−resolution coefficients is incapable of accounting for the non−Gaussian statistics which often characterize the multi−resolution coefficients. On the other hand, the ...

We consider the problem of learning the structure of Ising models (pairwise binary Markov random fields) from i.i.d. samples. While several methods have been proposed to accomplish this task, their relative merits and limitations remain somewhat obscure. By analyzing a number of concrete examples, we show that low-complexity algorithms often fail when the Markov random field develops long-range...

This article presents a novel method for estimating the dense three-dimensional motion of a scene from multiple cameras. Our method employs an interconnected patch model of the scene surfaces. The interconnected nature of the model means that we can incorporate prior knowledge about neighbouring scene motions through the use of a Markov Random Field, whilst the patchbased nature of the model al...

This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. A second model then attempts to improve upon this initial ranking, using additional features of the tree as evidence. We describe and compare two appr...

Multiply sectioned Bayesian networks (MSBNs) were originally proposed as a modular representation of uncertain knowledge by sectioning a large Bayesian network (BN) into smaller units. More recently, hierarchical Markov networks (HMNs) were developed in part as an hierarchical representation of the flat BN. In this paper, we compare the MSBN and HMN representations. The MSBN representation does...

Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extreme computational costs, and thus are unable to represent complex regularities in data. To address this problem, we present LSM, the first MLN structure learner capable of efficiently and accurately learning long clause...