Sciweavers

485 search results - page 47 / 97
» DTI Connectivity by Segmentation
Sort
View
ICCSA
2007
Springer
14 years 3 months ago
Shortest Path Queries Between Geometric Objects on Surfaces
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
Hua Guo, Anil Maheshwari, Doron Nussbaum, Jör...
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 3 months ago
Lower bounds on the obstacle number of graphs
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
Padmini Mukkamala, János Pach, Döm&oum...
JOLLI
2011
90views more  JOLLI 2011»
13 years 3 months ago
The Displacement Calculus
We define and study a calculus of discontinuity, a version of displacement calculus, which is a logic of segmented strings in exactly the same sense that the Lambek calculus is a ...
Glyn Morrill, Oriol Valentín, Mario Fadda
IWANN
1997
Springer
14 years 1 months ago
Gray-Level Object Segmentation with a Network of FitzHugh-Nagumo Oscillators
Abstract. In this paper we adopt a temporal coding approach to neuronal modeling of the visual cortex, using oscillations. We propose a hierarchy of three processing modules corres...
Abderrahim Labbi, Ruggero Milanese, Holger Bosch
CVPR
2011
IEEE
13 years 5 months ago
Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
Zhiding Yu, Oscar Au, Ketan Tang