Sciweavers

3641 search results - page 16 / 729
» On Computability of Pattern Recognition Problems
Sort
View
TASLP
2002
84views more  TASLP 2002»
15 years 1 days ago
Maximum likelihood multiple subspace projections for hidden Markov models
The first stage in many pattern recognition tasks is to generate a good set of features from the observed data. Usually, only a single feature space is used. However, in some compl...
Mark J. F. Gales
CVPR
2008
IEEE
16 years 2 months ago
A NURBS-based spectral reflectance descriptor with applications in computer vision and pattern recognition
In this paper, we present a surface reflectance descriptor based on the control points resulting from the interpolation of Non-Uniform Rational B-Spline (NURBS) curves to multispe...
Cong Phuoc Huynh, Antonio Robles-Kelly
63
Voted
ICIP
2007
IEEE
15 years 6 months ago
Effective Component Tree Computation with Application to Pattern Recognition in Astronomical Imaging
Christophe Berger, Thierry Géraud, Roland L...
ICPR
2004
IEEE
16 years 1 months ago
Using Multiple Graphics Cards as a General Purpose Parallel Computer : Applications to Computer Vision
Pattern recognition and computer vision tasks are computationally intensive, repetitive, and often exceed the capabilities of the CPU, leaving little time for higher level tasks. ...
James Fung, Steve Mann
111
Voted
ICIP
2009
IEEE
14 years 10 months ago
Learning weighted similarity measurements for unconstrained face recognition
Unconstrained face recognition is the problem of deciding if an image pair is showing the same individual or not, without having class specific training material or knowing anythi...
Andre Störmer, Gerhard Rigoll