9888 search results - page 1705 / 1978 » compute 2009 |
170
Voted
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
194
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
The matching and retrieval of 2D shapes is an important
challenge in computer vision. A large number of shape
similarity approaches have been developed, with the main
focus bein...
197
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Edge-based color constancy makes use of image derivatives
to estimate the illuminant. However, different edge
types exist in real-world images such as shadow, geometry,
material...
235
Voted
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Manually labeled landmark sets are often required as in-
puts for landmark-based image registration. Identifying an
optimal subset of landmarks from a training dataset may be
us...
235
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Several spatiotemporal feature point detectors have been recently used in video analysis for action recognition. Feature points are detected using a number of measures, namely sali...