Sciweavers

356 search results - page 7 / 72
» Further results on the subspace distance
Sort
View
CVPR
1998
IEEE
14 years 11 months ago
A New Complex Basis for Implicit Polynomial Curves and its Simple Exploitation for Pose Estimation and Invariant Recognition
New representations are developed for 2D IP (implicit polynomial) curves ofarbitrary degree. These representations permit shape recognition and pose estimation with essentially sin...
David B. Cooper, Jean-Philippe Tarel
JMLR
2010
154views more  JMLR 2010»
13 years 4 months ago
Infinite Predictor Subspace Models for Multitask Learning
Given several related learning tasks, we propose a nonparametric Bayesian model that captures task relatedness by assuming that the task parameters (i.e., predictors) share a late...
Piyush Rai, Hal Daumé III
ICMCS
2007
IEEE
138views Multimedia» more  ICMCS 2007»
14 years 4 months ago
Probabilistic Visual Tracking via Robust Template Matching and Incremental Subspace Update
In this paper, we present a probabilistic algorithm for visual tracking that incorporates robust template matching and incremental subspace update. There are two template matching...
Xue Mei, Shaohua Kevin Zhou, Fatih Porikli
TSMC
2010
13 years 4 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
CPHYSICS
2011
232views Education» more  CPHYSICS 2011»
13 years 5 months ago
A nested Krylov subspace method to compute the sign function of large complex matrices
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
Jacques Bloch, Simon Heybrock