We propose and evaluate in this work a novel optimization strategy for intensity-based non-rigid image registration of contrastenhanced images with a volume-preservation constraint. Since patient motion correction and volume preservation are to some extent mutually exclusive goals, one is usually faced with a trade-off between volume preservation of contrast-enhancing structures and artifact re...

Constraint query languages with Boolean algebra linear cardinality constraints were introduced recently and shown to be evaluable using a quantifier elimination method in [22]. However, the expressive power of constraint query languages with linear cardinality constraints is still poorly understood in comparison with other cases of constraint query languages. This paper makes several contributi...

In the constraint database model, spatial and spatio-temporal data are stored by boolean combinations of polynomial equalities and inequalities over the real numbers. The relational calculus augmented with polynomial constraints is the standard first-order query language for constraint databases. Although the expressive power of this query language has been studied extensively, the difficulty o...

We propose a method for proving rst order properties of constraint logic programs which manipulate nite lists of real numbers. Constraints are linear equations and inequations over reals. Our method consists in converting any given rst order formula into a strati ed constraint logic program and then applying a suitable unfold/fold transformation strategy that preserves the perfect model. Our st...

Strategies for design reuse play a fundamental role in the development of products that change and evolve over time. Design changes often involve modifications geometry parts assemblies, which are driven by digital representation product, i.e. procedural parametric CAD model. Consequently, constraint redundancies two-dimensional profiles build model can significantly hinder alterability reusabi...

We study the complexity of quantiier elimination and decision in rst-order theories of temporal constraints. With the exception of Ladkin, AI researchers have largely ignored this problem. We consider the rst-order theories of point and interval constraints over two time structures: the integers and the ra-tionals. We show that in all cases quantiier-elimination can be done in PSPACE. We also s...

Many interesting tractable problems are identified under the model of Constraint Satisfaction Problems. These problems are usually solved by forcing a certain level of local consistency. In this paper, for the class of connected row convex constraints, we propose a novel algorithm which is based on the ideas of variable elimination and efficient composition of row convex and connected constrain...

We study hard constraint satisfaction problems with a decimation approach based on message passing algorithms. Decimation induces a renormalization flow in the space of problems, and we exploit the fact that this flow transforms some of the constraints into linear constraints over GF(2). In particular, when the flow hits the subspace of linear problems, one can stop decimation and use Gaussian ...

Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated within the bucket elimination framework. This emphasizes the principles common to many of the algorithms appearing in the probabilistic inference literature and clariies the relationship of such algorithms to nonseria...