3641 search results - page 569 / 729 » On Computability of Pattern Recognition Problems |
107
click to vote
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
Invariant feature descriptors such as SIFT and GLOH have been demonstrated to be very robust for image matching and visual recognition. However, such descriptors are generally par...
135
click to vote
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
139
Voted
ECCV
2006
Springer
16 years 4 months ago
2006
Springer
Many linear discriminant analysis (LDA) and kernel Fisher discriminant analysis (KFD) methods are based on the restrictive assumption that the data are homoscedastic. In this paper...
138
Voted
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In many vision problems, instead of having fully annotated training data, it is easier to obtain just a subset of data with annotations, because it is less restrictive for the use...
127
click to vote
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
Speaker independent feature extraction is a critical problem in speech recognition. Oriented principal component analysis (OPCA) is a potential solution that can find a subspace r...