Sciweavers

986 search results - page 165 / 198
» Zero-data Learning of New Tasks
Sort
View
ICIP
2005
IEEE
16 years 1 months ago
Nonlinear dimensionality reduction for classification using kernel weighted subspace method
We study the use of kernel subspace methods that learn low-dimensional subspace representations for classification tasks. In particular, we propose a new method called kernel weigh...
Guang Dai, Dit-Yan Yeung
ICIAP
2009
ACM
16 years 14 days ago
Multi-class Binary Symbol Classification with Circular Blurred Shape Models
Multi-class binary symbol classification requires the use of rich descriptors and robust classifiers. Shape representation is a difficult task because of several symbol distortions...
Sergio Escalera, Alicia Fornés, Oriol Pujol...
CHI
2002
ACM
16 years 7 days ago
Automated message prioritization: making voicemail retrieval more efficient
Navigating through new voicemail messages to find messages of interest is a time-consuming task, particularly for high-volume users. When checking messages under a time constraint...
Meridith Ringel, Julia Hirschberg
ICDAR
2009
IEEE
15 years 6 months ago
Isolated Handwritten Farsi Numerals Recognition Using Sparse and Over-Complete Representations
A new isolated handwritten Farsi numeral recognition algorithm is proposed in this paper, which exploits the sparse and over-complete structure from the handwritten Farsi numeral ...
Wumo Pan, Tien D. Bui, Ching Y. Suen
ICMCS
2007
IEEE
194views Multimedia» more  ICMCS 2007»
15 years 6 months ago
Automatically Tuning Background Subtraction Parameters using Particle Swarm Optimization
A common trait of background subtraction algorithms is that they have learning rates, thresholds, and initial values that are hand-tuned for a scenario in order to produce the des...
Brandyn White, Mubarak Shah