Sciweavers

283 search results - page 24 / 57
» Versatile spectral methods for point set matching
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
Convex Quadratic Programming for Object Localization
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
Hao Jiang, Mark S. Drew, Ze-Nian Li
CPC
2010
117views more  CPC 2010»
13 years 4 months ago
On the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
FGR
2008
IEEE
299views Biometrics» more  FGR 2008»
14 years 1 months ago
Face recognition with occlusions in the training and testing sets
Partial occlusions in face images pose a great problem for most face recognition algorithms. Several solutions to this problem have been proposed over the years – ranging from d...
Hongjun Jia, Aleix M. Martínez
DAGSTUHL
2006
13 years 8 months ago
Point-set algorithms for pattern discovery and pattern matching in music
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
David Meredith
SIAMSC
2010
136views more  SIAMSC 2010»
13 years 2 months ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels