6005 search results - page 418 / 1201 » Graph-Theoretical Methods in Computer Vision |
196
Voted
CVPR
2004
IEEE
16 years 9 months ago
2004
IEEE
Subspace representations have been a popular way to model appearance in computer vision. In Jepson and Black's influential paper on EigenTracking, they were successfully appl...
202
Voted
ICCV
2007
IEEE
16 years 9 months ago
2007
IEEE
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in computer vision. It has been applied to a wide range of segmentation tasks with great success. A...
193
Voted
EMMCVPR
2009
Springer
16 years 2 months ago
2009
Springer
7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Bonn, Germany, August 24-27, 2009 Medical image segmentation appears to be ...
217
click to vote
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
It has been of great interest to find sparse and/or nonnegative representations in computer vision literature. In this paper we propose a novel method to such a purpose and refer...
196
click to vote
CVPR
2008
IEEE
15 years 7 months ago
2008
IEEE
We propose a joint representation and classification framework that achieves the dual goal of finding the most discriminative sparse overcomplete encoding and optimal classifier p...