Sciweavers

358 search results - page 49 / 72
» Sparse squares of polynomials
Sort
View
ICCV
2009
IEEE
1957views Computer Vision» more  ICCV 2009»
15 years 21 days ago
Robust Visual Tracking using L1 Minimization
In this paper we propose a robust visual tracking method by casting tracking as a sparse approximation problem in a particle filter framework. In this framework, occlusion, corru...
Xue Mei, Haibin Ling
ICML
2009
IEEE
14 years 8 months ago
Domain adaptation from multiple sources via auxiliary classifiers
We propose a multiple source domain adaptation method, referred to as Domain Adaptation Machine (DAM), to learn a robust decision function (referred to as target classifier) for l...
Lixin Duan, Ivor W. Tsang, Dong Xu, Tat-Seng Chua
ICASSP
2011
IEEE
12 years 11 months ago
Compressive power spectral density estimation
In this paper, we consider power spectral density estimation of bandlimited, wide-sense stationary signals from sub-Nyquist sampled data. This problem has recently received attent...
Michael A. Lexa, Mike E. Davies, John S. Thompson,...
ECCC
2006
107views more  ECCC 2006»
13 years 7 months ago
Energy Complexity and Entropy of Threshold Circuits
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...
Wolfgang Maass, Kei Uchizawa, Rodney J. Douglas
PAMI
2006
168views more  PAMI 2006»
13 years 7 months ago
Graphical Models and Point Pattern Matching
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
Tibério S. Caetano, Terry Caelli, Dale Schu...