3328 search results - page 587 / 666 » Image space gathering |
ICCV
2003
IEEE
14 years 12 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
ICCV
2001
IEEE
14 years 12 months ago
2001
IEEE
Visual trackan,g cou,ld be treeted as a param,eter estim.ation. problem, of target representastionbased on observations in im,age sequ.ences. A rich,er target represen,tation, wou...
ICCV
1999
IEEE
14 years 12 months ago
1999
IEEE
In this paper we consider the problem of recovering the 3D motion and shape of an arbitrarily-moving, arbitrarilyshaped curve from multiple synchronized video streams acquired fro...
ECCV
2008
Springer
14 years 12 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
ECCV
2004
Springer
14 years 12 months ago
2004
Springer
We introduce a technique for measuring local scale, based on a special property of the so-called total variational (TV) flow. For TV flow, pixels change their value with a speed th...