Sciweavers

2570 search results - page 111 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
JMIV
2002
72views more  JMIV 2002»
14 years 9 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
72
Voted
ICPR
2010
IEEE
15 years 4 days 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
15 years 10 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 3 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
97
Voted
WACV
2005
IEEE
15 years 3 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