Sciweavers

1591 search results - page 191 / 319
» Random lifts of graphs
Sort
View
IPMI
2005
Springer
16 years 7 months ago
Simultaneous Segmentation of Multiple Closed Surfaces Using Optimal Graph Searching
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
Kang Li, Steven Millington, Xiaodong Wu, Danny Z. ...
IBPRIA
2007
Springer
16 years 18 days ago
Bayesian Oil Spill Segmentation of SAR Images Via Graph Cuts
Abstract. This paper extends and generalizes the Bayesian semisupervised segmentation algorithm [1] for oil spill detection using SAR images. In the base algorithm on which we buil...
Sónia Pelizzari, José M. Bioucas-Dia...
INFOCOM
2006
IEEE
16 years 14 days ago
Sampling Techniques for Large, Dynamic Graphs
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
MICCAI
2010
Springer
15 years 4 months ago
3D Knowledge-Based Segmentation Using Pose-Invariant Higher-Order Graphs
Segmentation is a fundamental problem in medical image analysis. The use of prior knowledge is often considered to address the ill-posedness of the process. Such a process consists...
Chaohui Wang, Olivier Teboul, Fabrice Michel, Salm...
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 12 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...