Sciweavers

485 search results - page 19 / 97
» DTI Connectivity by Segmentation
Sort
View
CATA
2000
13 years 10 months ago
Fast connected component labeling algorithm using a divide and conquer technique
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
June-Me Park, Carl G. Looney, Hui-Chuan Chen
ICDAR
2005
IEEE
14 years 2 months ago
A Synthetic Database to Assess Segmentation Algorithms
In this paper we describe a synthetic database composed of 273,452 handwritten touching digits pairs to assess segmentation algorithms. It contains several different kinds of touc...
Luiz S. Oliveira, Alceu de Souza Britto Jr., Rober...
IBPRIA
2003
Springer
14 years 2 months ago
Segmentation of Curvilinear Objects Using a~Watershed-Based Curve Adjacency Graph
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
Thierry Géraud
MICCAI
2005
Springer
14 years 9 months ago
Automatic Vascular Tree Formation Using the Mahalanobis Distance
We present a novel technique for the automatic formation of vascular trees from segmented tubular structures. Our method combines a minimum spanning tree algorithm with a minimizat...
Julien Jomier, Vincent LeDigarcher, Stephen R. Ayl...
ICIP
2009
IEEE
14 years 10 months ago
Fast And Robust Dominant Points Detection On Digital Curves
A new and fast method for dominant point detection and polygonal representation of a discrete curve is proposed. Starting from results of discrete geometry [1, 2], the notion of m...