Sciweavers

356 search results - page 2 / 72
» Further results on the subspace distance
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
A kernelized maximal-figure-of-merit learning approach based on subspace distance minimization
We propose a kernelized maximal-figure-of-merit (MFoM) learning approach to efficiently training a nonlinear model using subspace distance minimization. In particular, a fixed,...
Byungki Byun, Chin-Hui Lee
GI
2010
Springer
13 years 3 months ago
Estimating the Relevance of Search Results in the Culture-Web: A Study of Semantic Distance Measures
Abstract: More and more cultural heritage institutions publish their collections, vocabularies and metadata on the Web. The resulting Web of linked cultural data opens up exciting ...
Laura Hollink, Mark van Assem
PAMI
2011
13 years 8 days ago
Product Quantization for Nearest Neighbor Search
— This paper introduces a product quantization based approach for approximate nearest neighbor search. The idea is to decomposes the space into a Cartesian product of low dimensi...
Hervé Jégou, Matthijs Douze, Cordeli...
CVPR
2004
IEEE
14 years 7 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma
INTERSPEECH
2010
13 years 4 days ago
Reduction of broadband noise in speech signals by multilinear subspace analysis
A new noise reduction method for speech signals is proposed in this paper. The method is based upon the N-mode singular value decomposition algorithm, which exploits the multiline...
Yusuke Sato, Tetsuya Hoya, Hovagim Bakardjian, And...