Sciweavers

188 search results - page 21 / 38
» Estimation error bounds for denoising by sparse approximatio...
Sort
View
CORR
2010
Springer
99views Education» more  CORR 2010»
14 years 9 months ago
An Automated Algorithm for Approximation of Temporal Video Data Using Linear B'EZIER Fitting
This paper presents an efficient method for approximation of temporal video data using linear Bezier fitting. For a given sequence of frames, the proposed method estimates the int...
Murtaza Ali Khan
TNN
2010
216views Management» more  TNN 2010»
14 years 4 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
CISS
2008
IEEE
15 years 4 months ago
Compressed channel sensing
—Reliable wireless communications often requires accurate knowledge of the underlying multipath channel. This typically involves probing of the channel with a known training wave...
Waheed Uz Zaman Bajwa, Jarvis Haupt, Gil M. Raz, R...
CVPR
2012
IEEE
13 years 4 days ago
Online continuous stereo extrinsic parameter estimation
Stereo visual odometry and dense scene reconstruction depend critically on accurate calibration of the extrinsic (relative) stereo camera poses. We present an algorithm for contin...
Peter Hansen, Hatem Alismail, Peter Rander, Brett ...
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
15 years 4 months ago
Kernel Polytope Faces Pursuit
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
Tom Diethe, Zakria Hussain