347 search results - page 33 / 70 » Using Spanning Graphs for Efficient Image Registration |
ICPR
2000
IEEE
14 years 9 months ago
2000
IEEE
This paper presents a cooperative strategy between volumetric registration and segmentation. The segmentation method is based on the level set formalism. Starting from an initial ...
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
In this paper, we present a local graph matching based method for tracking cells and cell divisions in noisy images. We work with plant cells, where the cells are tightly clustere...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel form...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
We present a new method for summarizing images for the purposes of matching and registration. We take the point of view that large, coherent regions in the image provide a concise...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...