7930 search results - page 1366 / 1586 » Greedy in Approximation Algorithms |
121
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...
145
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Skeletonization algorithms typically decompose an object’s
silhouette into a set of symmetric parts, offering a
powerful representation for shape categorization. However,
havi...
132
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Local experts have been used to great effect for fitting deformable
models to images. Typically, the best location in
an image for the deformable model’s landmarks are found
t...
118
click to vote
CVPR
2000
IEEE
16 years 6 months ago
2000
IEEE
An algorithm is given for computing projective structure from a set of six points seen in a sequence of many images. The method is based on the notion of duality between cameras a...
137
click to vote
CVPR
2000
IEEE
16 years 6 months ago
2000
IEEE
The human figure exhibits complex and rich dynamic behavior that is both nonlinear and time-varying. However, most work on tracking and analysis of figure motion has employed eith...