Sciweavers

2064 search results - page 306 / 413
» Segmentation Problems
Sort
View
MICCAI
2001
Springer
14 years 1 months ago
Multisubject Non-rigid Registration of Brain MRI Using Intensity and Geometric Features
In this article we merge point feature and intensity-based registration in a single algorithm to tackle the problem of multiple brain registration. Because of the high variability ...
Pascal Cachier, Jean-Francois Mangin, Xavier Penne...
CVPR
2004
IEEE
14 years 11 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma
GD
2004
Springer
14 years 2 months ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 9 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
CVPR
2008
IEEE
14 years 11 months ago
Graph-shifts: Natural image labeling by dynamic hierarchical computing
In this paper, we present a new approach for image labeling based on the recently introduced graph-shifts algorithm. Graph-shifts is an energy minimization algorithm that does lab...
Jason J. Corso, Alan L. Yuille, Zhuowen Tu