180 search results - page 29 / 36 » Study of Dempster-Shafer theory for image segmentation appli... |
EMMCVPR
2001
Springer
15 years 1 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
105
click to vote
NIPS
2004
14 years 10 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
TMI
2010
14 years 7 months ago
2010
—We present the Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large class of regular...
NIPS
2008
14 years 11 months ago
2008
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...