Sciweavers

6365 search results - page 197 / 1273
» Fast Local Computation Algorithms
Sort
View
ICPR
2008
IEEE
16 years 21 days ago
Iris localization based on multi-resolution analysis
Iris localization is an especially important step in the whole iris recognition system, for it determines the accuracy of matching partially. To improve its accuracy and efficienc...
Lili Pan, Mei Xie, Zheng Ma
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...
152
Voted
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
163
Voted
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
CVPR
2006
IEEE
16 years 10 days ago
Fast Variational Segmentation using Partial Extremal Initialization
In this paper we consider region-based variational segmentation of two- and three-dimensional images by the minimization of functionals whose fidelity term is the quotient of two...
Jan Erik Solem, Niels Chr. Overgaard, Markus Perss...