A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
This paper addresses the problem of automatic temporal
annotation of realistic human actions in video using mini-
mal manual supervision. To this end we consider two asso-
ciate...
Olivier Duchenne, Ivan Laptev, Josef Sivic, Franci...
Median-shift is a mode seeking algorithm that relies on
computing the median of local neighborhoods, instead of
the mean. We further combine median-shift with Locality
Sensitive...
Subspace segmentation is the task of segmenting data
lying on multiple linear subspaces. Its applications in
computer vision include motion segmentation in video,
structure-from...