2064 search results - page 234 / 413 » Segmentation Problems |
MICCAI
2009
Springer
16 years 1 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...
116
click to vote
SMA
2009
ACM
15 years 7 months ago
2009
ACM
A key problem when interpolating a network of curves occurs at vertices: an algebraic condition called the vertex enclosure constraint must hold wherever an even number of curves ...
100
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
114
Voted
ICRA
2008
IEEE
15 years 7 months ago
2008
IEEE
— The problem of appearance-based mapping and navigation in outdoor environments is far from trivial. In this paper, an appearance-based topological map, covering a large, mixed ...
125
click to vote
GD
2003
Springer
15 years 6 months ago
2003
Springer
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...