485 search results - page 13 / 97 » DTI Connectivity by Segmentation |
COCOON
2009
Springer
14 years 3 months ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
MICCAI
2009
Springer
14 years 10 months ago
2009
Springer
We develop an algorithm for brain connectivity assessment using geodesics in HARDI (high angular resolution diusion imaging). We propose to recast the problem of nding bers bundles...
GD
2008
Springer
13 years 10 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
ICASSP
2009
IEEE
14 years 20 days ago
2009
IEEE
We investigate a method using support vector machines (SVMs) with walk-based graph kernels for high-level feature extraction from images. In this method, each image is first segme...
TRECVID
2008
13 years 10 months ago
2008
We studied a method using support vector machines (SVMs) with walk-based graph kernels for the high-level feature extraction (HLF) task. In this method, each image is first segmen...