81 search results - page 5 / 17 » Efficient Shape Matching Via Graph Cuts |
CVPR
2003
IEEE
14 years 8 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
IJCV
2006
13 years 6 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
DAGM
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
COCOON
2007
Springer
14 years 26 days ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
Publication
Tracking heart motion plays an essential role in the diagnosis of cardiovascular diseases. As such, accurate characterization of dynamic behavior of the left ventricle (LV) is esse...