In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Hough voting methods efficiently handle the high complexity of multiscale,
category-level object detection in cluttered scenes. The primary weakness
of this approach is however t...
Pradeep Yarlagadda, Antonio Monroy and Bjorn Ommer
We present Storm, a storage system which unifies the desktop and the public network, making Web links between desktop documents more practical. Storm assigns each document a perm...
Benja Fallenstein, Tuomas J. Lukka, Hermanni Hyyti...
This paper investigates the design of a system for recognizing
objects in 3D point clouds of urban environments.
The system is decomposed into four steps: locating, segmenting,
...
Aleksey Golovinskiy, Vladimir G. Kim, Thomas Funkh...
We present a discriminative Hough transform based ob-
ject detector where each local part casts a weighted vote for
the possible locations of the object center. We show that the
...
Subhransu Maji (University of California, Berkeley...