1830 search results - page 146 / 366 » Workshop on Graph Computation Models |
162
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...
130
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
234
click to vote
ECCV
2008
Springer
15 years 6 months ago
2008
Springer
Pedestrian detection in still image should handle the large appearance and stance variations arising from the articulated structure, various clothing of human as well as viewpoints...
152
click to vote
ICPR
2002
IEEE
16 years 6 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
119
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...