Sciweavers

728 search results - page 26 / 146
» Online Parallel Boosting
Sort
View
TIP
2010
188views more  TIP 2010»
13 years 6 months ago
On-line Learning of Mutually Orthogonal Subspaces for Face Recognition by Image Sets
—We address the problem of face recognition by matching image sets. Each set of face images is represented by a subspace (or linear manifold) and recognition is carried out by su...
Tae-Kyun Kim, Josef Kittler, Roberto Cipolla
WACV
2012
IEEE
12 years 3 months ago
Online discriminative object tracking with local sparse representation
We propose an online algorithm based on local sparse representation for robust object tracking. Local image patches of a target object are represented by their sparse codes with a...
Qing Wang, Feng Chen, Wenli Xu, Ming-Hsuan Yang
CVPR
2010
IEEE
14 years 1 months ago
Multi-Target Tracking by On-Line Learned Discriminative Appearance Models
We present an approach for online learning of discriminative appearance models for robust multi-target tracking in a crowded scene from a single camera. Although much progress has...
Cheng-Hao Kuo, Chang Huang, Ram Nevatia
ICPR
2002
IEEE
14 years 8 months ago
QuickStroke: An Incremental On-Line Chinese Handwriting Recognition System
This paper presents QuickStroke: a system for the incremental recognition of handwritten Chinese characters. Only a few strokes of an ideogram need to be entered in order for a ch...
Nada P. Matic, John C. Platt, Tony Wang
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
13 years 12 months ago
Better Bounds for Online Scheduling
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
Susanne Albers