Sciweavers

400 search results - page 14 / 80
» Subspace evasive sets
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
ICCV
2009
IEEE
15 years 18 days ago
Subspace matching: Unique solutions to point matching with geometric constraints
Finding correspondences between feature points is one of the most relevant problems in the whole set of visual tasks. In this paper we address the problem of matching a feature ...
Manuel Marques, Marko Stosic and Joao Costeira
ECCV
2010
Springer
14 years 29 days ago
Visibility Subspaces: Uncalibrated Photometric Stereo with Shadows
Photometric stereo relies on inverting the image formation process, and doing this accurately requires reasoning about the visibility of light sources with respect to each image po...
IEICET
2007
114views more  IEICET 2007»
13 years 7 months ago
Analytic Optimization of Adaptive Ridge Parameters Based on Regularized Subspace Information Criterion
In order to obtain better learning results in supervised learning, it is important to choose model parameters appropriately. Model selection is usually carried out by preparing a ...
Shun Gokita, Masashi Sugiyama, Keisuke Sakurai
CVPR
2005
IEEE
14 years 9 months ago
A Weighted Nearest Mean Classifier for Sparse Subspaces
In this paper we focus on high dimensional data sets for which the number of dimensions is an order of magnitude higher than the number of objects. From a classifier design standp...
Cor J. Veenman, David M. J. Tax