262 search results - page 28 / 53 » Image Registration with Minimum Spanning Tree Algorithm |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
IPMI
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we propose an original and efficient tree matching algorithm for intra-patient hepatic vascular system registration. Vascular systems are segmented from CT...
ADHOCNETS
2010
Springer
14 years 7 months ago
2010
Springer
In this paper, we consider the use of multiple mobile software agents to perform different tasks in wireless sensor networks (WSNs). To this regard, determining the number of mobil...
ICIP
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper presents a new method for segmentation of images into large regions that reflect the real world objects present in a scene. It explores the feasibility of utilizing sp...
SODA
1994
ACM
14 years 11 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...