Sciweavers

1068 search results - page 67 / 214
» Fast and robust bootstrap
Sort
View
CVPR
2012
IEEE
13 years 2 months ago
Real time robust L1 tracker using accelerated proximal gradient approach
Recently sparse representation has been applied to visual tracker by modeling the target appearance using a sparse approximation over a template set, which leads to the so-called ...
Chenglong Bao, Yi Wu, Haibin Ling, Hui Ji
CVPR
2010
IEEE
15 years 8 months ago
Unified Real-Time Tracking and Recognition with Rotation-Invariant Fast Features
We present a method that unifies tracking and video content recognition with applications to Mobile Augmented Reality (MAR). We introduce the Radial Gradient Transform (RGT) and ...
Gabriel Takacs, Vijay Chandrasekhar, Sam Tsai, Dav...
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 3 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
CORR
2008
Springer
86views Education» more  CORR 2008»
14 years 12 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
NA
2010
117views more  NA 2010»
14 years 10 months ago
A fast solver for linear systems with displacement structure
We describe a fast solver for linear systems with reconstructible Cauchylike structure, which requires O(rn2 ) floating point operations and O(rn) memory locations, where n is th...
Antonio Arico, Giuseppe Rodriguez