Sciweavers

688 search results - page 84 / 138
» Computing with subspaces
Sort
View
PCM
2007
Springer
132views Multimedia» more  PCM 2007»
15 years 3 months ago
FADA: An Efficient Dimension Reduction Scheme for Image Classification
This paper develops a novel and efficient dimension reduction scheme--Fast Adaptive Discriminant Analysis (FADA). FADA can find a good projection with adaptation to different sampl...
Yijuan Lu, Jingsheng Ma, Qi Tian
MOC
1998
64views more  MOC 1998»
14 years 9 months ago
Analysis of non-overlapping domain decomposition algorithms with inexact solves
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
James H. Bramble, Joseph E. Pasciak, Apostol T. Va...
ICCV
2009
IEEE
16 years 2 months ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs
CVPR
2000
IEEE
15 years 11 months ago
A Robust and Efficient Motion Segmentation Based on Orthogonal Projection Matrix of Shape Space
A novel algorithm for motion segmentation is proposed. The algorithm uses the fact that shape of an object with homogeneous motion is represented as 4 dimensional linear space. Th...
Naoyuki Ichimura
CVPR
2004
IEEE
15 years 11 months ago
Dual-Space Linear Discriminant Analysis for Face Recognition
Linear Discriminant Analysis (LDA) is popular feature extraction technique for face recognition. However, it often suffers from the small sample size problem when dealing with the...
Xiaogang Wang, Xiaoou Tang