231 search results - page 23 / 47 » Computational experience with exterior point algorithms for ... |
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
WAIM
2009
Springer
13 years 11 months ago
2009
Springer
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
JMLR
2012
11 years 9 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
CVPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Multibody grouping is a representative of applying subspace constraints in computer vision tasks. Under linear projection models, feature points of multibody reside in multiple su...
CVPR
2003
IEEE
14 years 8 months ago
2003
IEEE
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...