This paper proposes a method for detecting instances of shape classes that exhibit variable structure. The term "variable structure" is used to characterize shape classes...
Vassilis Athitsos, Jingbin Wang, Stan Sclaroff, Ma...
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
The literature currently provides two ways to establish
point correspondences between images with moving objects.
On one side, there are energy minimization methods
that yield v...
Thomas Brox (University of California, Berkeley), ...
In this paper we propose an algorithm to estimate missing
values in tensors of visual data. The values can be missing
due to problems in the acquisition process, or because
the ...
Ji Liu, Przemyslaw Musialski, Peter Wonka, Jieping...
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...