A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
We present a new method for segmenting actions into primitives and classifying them into a hierarchy of action classes. Our scheme learns action classes in an unsupervised manner ...
A novel statistical scheme for the automatic detection and tracking in time of relapsing-remitting multiple sclerosis (MS) lesions in image sequences is described. Coherent space-...
In this paper, we systematically study the effect of poorly registered faces on the training and inferring stages of traditional face recognition algorithms. We then propose a nov...
In this paper, we address the problem of robustly recovering several instances of a curve model from a single noisy data set with outliers. Using M-estimators revisited in a Lagran...
Jean-Philippe Tarel, Pierre Charbonnier, Sio-Song ...