Sciweavers

3135 search results - page 449 / 627
» Localization Algorithms: Performance Evaluation and Reliabil...
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 4 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
SGP
2007
15 years 6 months ago
Dynamic geometry registration
We propose an algorithm that performs registration of large sets of unstructured point clouds of moving and deforming objects without computing correspondences. Given as input a s...
Niloy J. Mitra, Simon Flöry, Maks Ovsjanikov,...
ICCV
2009
IEEE
15 years 1 months ago
On optimizing subspaces for face recognition
We propose a subspace learning algorithm for face recognition by directly optimizing recognition performance scores. Our approach is motivated by the following observations: 1) Di...
Jilin Tu, Xiaoming Liu, Peter Henry Tu
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
16 years 4 months ago
Entity categorization over large document collections
Extracting entities (such as people, movies) from documents and identifying the categories (such as painter, writer) they belong to enable structured querying and data analysis ov...
Arnd Christian König, Rares Vernica, Venkates...
ICIAR
2009
Springer
15 years 10 months ago
Interactive Image Segmentation Based on Hierarchical Graph-Cut Optimization with Generic Shape Prior
Abstract. A new algorithm for interactive image segmentation is proposed. Besides the traditional appearance and gradient information, a new Generic Shape Prior (GSP) knowledge whi...
Chen Liu, Fengxia Li, Yan Zhang, Haiyang Gu