347 search results - page 2 / 70 » Using Spanning Graphs for Efficient Image Registration |
IPMI
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
117
click to vote
IPCV
2008
14 years 11 months ago
2008
Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...
79
Voted
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
74
Voted
ICPR
2000
IEEE
15 years 2 months ago
2000
IEEE
We describe a graph-based global registration method for creating 2D mosaic images. When multi-frames overlap in space, global registration is necessary to minimize the accumulate...
MICCAI
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we present a left atrium registration system which utilizes a 3D intra-cardiac ultrasound catheter for faster (more than 700 times) and higher quality surface regist...