2004 search results - page 201 / 401 » Sampling from large graphs |
119
click to vote
CVPR
2000
IEEE
15 years 8 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
116
Voted
ICDAR
2007
IEEE
15 years 9 months ago
2007
IEEE
The effectiveness of kernel fisher discrimination analysis (KFDA) has been demonstrated by many pattern recognition applications. However, due to the large size of Gram matrix to ...
105
Voted
SIGIR
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of evaluating retrieval systems using a limited number of relevance judgments. Recent work has demonstrated that one can accurately estimate average precis...
114
Voted
BMVC
1998
15 years 4 months ago
1998
When using a gradient-basedmethod to determine the optical flow field for an image sequence, it is generally appreciated that some spatial pre-filtering of the images is usually n...
165
Voted
ICMCS
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper presents a robust and accurate method for joint head pose and facial actions tracking, even under challenging conditions such as varying lighting, large head movements,...