Non-rigid registration finds a dense correspondence between a pair of images, so that analogous structures in the two images are aligned. While this is sufficient for atlas comparisons, in order for registration to be an aid to diagnosis, registrations need to be performed on a set of images. In this paper we describe an objective function that can be used for this groupwise registration. We vi...

The appliance of the minimum description length (MDL) principle to the field of theory mining enables a precise description of main characteristics of a dataset in comparison to the numerous and hardly understandable output of the popular frequent pattern mining algorithms. The loss function that determines the quality of a pattern selection with respect to the MDL principle is however difficul...

When calibration model express camera status well, calibration result will be accurate. How to select optimal calibration model for different camera by program is significant to calibrate automatically. A method of selecting optimal calibration model was proposed in this paper. First, the models including enough possible status were selected from physical models and Chebyshev models. These mode...

This paper describes novel methods for estimating piecewise homogeneous Poisson elds based on minimum description length (MDL) criteria. By adopting a coding-theoretic approach, our methods are able to adapt to the the observed eld in an unsupervised manner. We present a parsing scheme based on xed multiscale trees (binary, for 1D, quad, for 2D) and an adaptive recursive partioning algorithm, b...

The existing studies are mostly focused on the multiple graphs scenario. With some modifications, the mining methodology can be extended to the single graph scenario [30]. Washio and Motoda [56] conducted a survey on graph-based data mining. Holder et al. [21] proposed SUBDUE to do subgraph pattern discovery based on minimum description length and background knowledge. The most popular graph pa...

The problem of sequential probability assignment for individual sequences is investigated. We compare the probabilities assigned by any sequential scheme to the performance of the best “batch” scheme (model) in some class. For the class of finite-state schemes and other related families, we derive a deterministic performance bound, analogous to the classical (probabilistic) Minimum Description ...

Suppose we are given a set of databases, such as sales records over different branches. How can we characterise the differences and the norm between these datasets? That is, what are the patterns that characterise the general distribution, and what are those that are important to describe the individual datasets? We study how to discover these pattern sets simultaneously and without redundancy ...

In this work, we describe a subword unit approach for information retrieval of items by voice. An algorithm based on the minimum description length (MDL) principle converts an index written in terms of words into an index written in terms of phonetic subword units. A speech recognition engine that uses a language model and pronounciation dictionary built from such an inventory of subword units ...

An applied problem is discussed in which two nested psychological mod-els of retention are compared using minimum description length (MDL).The standard Fisher information approximation to the normalized maximum likelihood is calculated for these two models, with the result that the full model is assigned a smaller complexity, even for moderately large samples. A geometric interpretation for thi...

Genetic algorithms (GAs) that solve hard problems quickly, reliably and accurately are called competent GAs. When the fitness landscape of a problem changes overtime, the problem is called non–stationary, dynamic or time–variant problem. This paper investigates the use of competent GAs for optimizing non–stationary optimization problems. More specifically, we use an information theoretic approa...