Sciweavers

289 search results - page 51 / 58
» Classification of unlabeled point sets using ANSIG
Sort
View
ICCV
2007
IEEE
14 years 10 months ago
Non-metric affinity propagation for unsupervised image categorization
Unsupervised categorization of images or image parts is often needed for image and video summarization or as a preprocessing step in supervised methods for classification, trackin...
Delbert Dueck, Brendan J. Frey
CVPR
2007
IEEE
14 years 10 months ago
Fast Keypoint Recognition in Ten Lines of Code
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Pascal Fua, Vincent Lepetit
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
13 years 10 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
TIP
2010
145views more  TIP 2010»
13 years 3 months ago
Joint Manifolds for Data Fusion
The emergence of low-cost sensing architectures for diverse modalities has made it possible to deploy sensor networks that capture a single event from a large number of vantage po...
Mark A. Davenport, Chinmay Hegde, Marco F. Duarte,...
COCOA
2008
Springer
13 years 10 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth