We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
3?D shape recovery of non-rigid surfaces from 3?D to 2?D correspondences is an under-constrained problem that requires prior knowledge of the possible deformations. State-of-the-a...
A quadratic programming formulation for multiclass image segmentation is investigated. It is proved that, in the convex case, the non-negativity constraint on the recent reported ...
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...