Sciweavers

14 search results - page 1 / 3
» Linear manifold clustering in high dimensional spaces by sto...
Sort
View
PR
2007
100views more  PR 2007»
13 years 4 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
ICMLA
2007
13 years 6 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio
ECCV
2006
Springer
14 years 7 months ago
A General Framework for Motion Segmentation: Independent, Articulated, Rigid, Non-rigid, Degenerate and Non-degenerate
Abstract. We cast the problem of motion segmentation of feature trajectories as linear manifold finding problems and propose a general framework for motion segmentation under affin...
Jingyu Yan, Marc Pollefeys
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
14 years 6 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
ICIP
2006
IEEE
14 years 6 months ago
Two-Stage Optimal Component Analysis
Linear techniques are widely used to reduce the dimension of image representation spaces in applications such as image indexing and object recognition. Optimal Component Analysis ...
Yiming Wu, Xiuwen Liu, Washington Mio, Kyle A. Gal...