3607 search results - page 515 / 722 » Learning with structured sparsity |
148
click to vote
ICCV
2003
IEEE
16 years 7 months ago
2003
IEEE
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
182
click to vote
ICIP
2007
IEEE
16 years 6 months ago
2007
IEEE
Tracking 3D people from monocular video is often poorly constrained. To mitigate this problem, prior knowledge should be exploited. In this paper, the Gaussian process spatio-temp...
129
click to vote
MICCAI
2008
Springer
16 years 6 months ago
2008
Springer
We study the problem of classifying an autistic group from controls using structural image data alone, a task that requires a clinical interview with a psychologist. Because of the...
130
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
141
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
We address feature selection problems for classification of small samples and high dimensionality. A practical example is microarray-based cancer classification problems, where sa...