Sciweavers

688 search results - page 23 / 138
» Computing with subspaces
Sort
View
ICML
2010
IEEE
13 years 11 months ago
Robust Subspace Segmentation by Low-Rank Representation
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowestrank represe...
Guangcan Liu, Zhouchen Lin, Yong Yu
CVPR
2006
IEEE
14 years 11 months ago
When Fisher meets Fukunaga-Koontz: A New Look at Linear Discriminants
The Fisher Linear Discriminant (FLD) is commonly used in pattern recognition. It finds a linear subspace that maximally separates class patterns according to Fisher's Criteri...
Sheng Zhang, Terence Sim
ICCV
2009
IEEE
1119views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Spectral clustering of linear subspaces for motion segmentation
This paper studies automatic segmentation of multiple motions from tracked feature points through spectral embedding and clustering of linear subspaces. We show that the dimensi...
Fabien Lauer, Christoph Schn¨orr
ICML
2008
IEEE
14 years 10 months ago
ICA and ISA using Schweizer-Wolff measure of dependence
We propose a new algorithm for independent component and independent subspace analysis problems. This algorithm uses a contrast based on the Schweizer-Wolff measure of pairwise de...
Barnabás Póczos, Sergey Kirshner
PAMI
2011
13 years 4 months 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...