Sciweavers

2570 search results - page 111 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
JMIV
2002
72views more  JMIV 2002»
15 years 6 months ago
Estimating Overcomplete Independent Component Bases for Image Windows
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
Aapo Hyvärinen, Mika Inki
ICPR
2010
IEEE
15 years 8 months ago
A Fast Extension for Sparse Representation on Robust Face Recognition
We extend a recent Sparse Representation-based Classification (SRC) algorithm for face recognition to work on 2D images directly, aiming to reduce the computational complexity whil...
Hui-Ning Qiu, Duc-Son Pham, Wanquan Liu, Svetha Ve...
RECOMB
2001
Springer
16 years 6 months ago
Fast recovery of evolutionary trees with thousands of nodes
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
Miklós Csürös
CVPR
2010
IEEE
15 years 12 months ago
Fast Sparse Representation with Prototypes
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
Jia-Bin Huang, Ming-Hsuan Yang
WACV
2005
IEEE
15 years 12 months ago
A Fast Multi-Modal Approach to Facial Feature Detection
As interest in 3D face recognition increases the importance of the initial alignment problem does as well. In this paper we present a method utilizing the registered 2D color and ...
Chris Boehnen, Trina Russ