732 search results - page 63 / 147 » What Is It Like to Be a Rat |
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in computer vision. It has been applied to a wide range of segmentation tasks with great success. A...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
In this paper, we investigate what can be inferred from several silhouette probability maps, in multi-camera environments. To this aim, we propose a new framework for multi-view s...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
We introduce an algorithm for a non-negative 3D tensor factorization for the purpose of establishing a local parts feature decomposition from an object class of images. In the pas...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
While navigating in an environment, a vision system has to be able to recognize where it is and what the main objects in the scene are. In this paper we present a contextbased vis...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...