4894 search results - page 635 / 979 » The Guarding Problem - Complexity and Approximation |
117
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
142
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Subspace segmentation is the task of segmenting data
lying on multiple linear subspaces. Its applications in
computer vision include motion segmentation in video,
structure-from...
148
click to vote
CVPR
2001
IEEE
16 years 6 months ago
2001
IEEE
Model Abstraction from Examples Yakov Keselman, Member, IEEE, and Sven Dickinson, Member, IEEE The recognition community has typically avoided bridging the representational gap bet...
133
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
When performing subspace modelling of data using Principal Component Analysis (PCA) it may be desirable to constrain certain directions to be more meaningful in the context of the...
160
Voted
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Automatic evaluation of visual tracking algorithms in the absence of ground truth is a very challenging and important problem. In the context of online appearance modeling, there ...