Sciweavers

588 search results - page 53 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
CVPR
2010
IEEE
14 years 6 months ago
Efficient Histogram-Based Sliding Window
Many computer vision problems rely on computing histogram-based objective functions with a sliding window. A main limiting factor is the high computational cost. Existing computat...
Yichen Wei, Litian Tao
IRAL
2003
ACM
14 years 3 months ago
Very low-dimensional latent semantic indexing for local query regions
In this paper, we focus on performing LSI on very low SVD dimensions. The results show that there is a nearly linear surface in the local query region. Using low-dimensional LSI o...
Yinghui Xu, Kyoji Umemura
MLDM
2005
Springer
14 years 3 months ago
Linear Manifold Clustering
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
Robert M. Haralick, Rave Harpaz
IROS
2009
IEEE
163views Robotics» more  IROS 2009»
14 years 4 months ago
On the performance of random linear projections for sampling-based motion planning
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
Ioan Alexandru Sucan, Lydia E. Kavraki
ICPR
2006
IEEE
14 years 11 months ago
Performance driven facial animation using illumination independent appearance-based tracking
We introduce a procedure to estimate human face high level animation parameters from a marker-less image sequence in presence of strong illumination changes. We use an efficient a...
Enrique Muñoz, José Miguel Buenaposa...