Sciweavers

70 search results - page 12 / 14
» Bypassing the embedding: algorithms for low dimensional metr...
Sort
View
NIPS
2004
14 years 11 months ago
Neighbourhood Components Analysis
In this paper we propose a novel method for learning a Mahalanobis distance measure to be used in the KNN classification algorithm. The algorithm directly maximizes a stochastic v...
Jacob Goldberger, Sam T. Roweis, Geoffrey E. Hinto...
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
ICDM
2006
IEEE
110views Data Mining» more  ICDM 2006»
15 years 3 months ago
Manifold Clustering of Shapes
Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological ce...
Dragomir Yankov, Eamonn J. Keogh
85
Voted
ICIP
2006
IEEE
15 years 11 months ago
Lossy-To-Lossless Block-Based Compression of Hyperspectral Volumetric Data
An embedded, block-based, wavelet transform coding algorithm of low complexity is proposed. Three-Dimensional Set Partitioned Embedded bloCK(3D-SPECK) efficiently encodes hyperspe...
Xiaoli Tang, William A. Pearlman
ICIP
2010
IEEE
14 years 7 months ago
Texture classification via patch-based sparse texton learning
Texture classification is a classical yet still active topic in computer vision and pattern recognition. Recently, several new texture classification approaches by modeling textur...
Jin Xie, Lei Zhang, Jane You, David Zhang