Sciweavers

57 search results - page 1 / 12
» Redundancy in All Pairs Fast Marching Method
Sort
View
ICIP
2006
IEEE
14 years 6 months ago
Redundancy in All Pairs Fast Marching Method
In this paper, we analyze the redundancy in calculating all pairs of geodesic distances on a rectangular grid. Fast marching method is an efficient way to estimate the geodesic di...
Luca Bertelli, Baris Sumengen, B. S. Manjunath
CVPR
2006
IEEE
14 years 6 months ago
Control Theory and Fast Marching Techniques for Brain Connectivity Mapping
We propose a novel, fast and robust technique for the computation of anatomical connectivity in the brain. Our approach exploits the information provided by Diffusion Tensor Magne...
Emmanuel Prados, Stefano Soatto, Christophe Lengle...
MICCAI
2005
Springer
14 years 5 months ago
Topology Correction Using Fast Marching Methods and Its Application to Brain Segmentation
We present here a new method for correcting the topology of objects segmented from medical images. Whereas previous techniques alter a surface obtained from the hard segmentation o...
Pierre-Louis Bazin, Dzung L. Pham
JMLR
2010
111views more  JMLR 2010»
12 years 11 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
SIAMSC
2010
132views more  SIAMSC 2010»
12 years 11 months ago
Some Improvements for the Fast Sweeping Method
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
Stanley Bak, Joyce R. McLaughlin, Daniel Renzi