347 search results - page 4 / 70 » Using Spanning Graphs for Efficient Image Registration |
ICCV
2009
IEEE
14 years 12 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
We present a new information metric for multimodality image registration. The metric is technically a pseudometric since it satisfies the properties, i) nonnegativity, ii) symmetr...
ICIP
2004
IEEE
14 years 8 months ago
2004
IEEE
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...
MIR
2006
ACM
14 years 29 days ago
2006
ACM
Automatic keyword annotation is a promising solution to enable more effective image search by using keywords. In this paper, we propose a novel automatic image annotation method b...
ASPDAC
2001
ACM
13 years 10 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...