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...
Ben Glocker, Nikos Komodakis, Nikos Paragios, Geor...
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 ...
Anthony Schmieder, Howard Cheng, Barry Gergel, Xia...
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...
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...
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...