Sciweavers

376 search results - page 14 / 76
» Completely connected clustered graphs
Sort
View
MICCAI
2009
Springer
14 years 8 months ago
Tractography-Based Parcellation of the Cortex Using a Spatially-Informed Dimension Reduction of the Connectivity Matrix
Determining cortical functional areas is an important goal for neurosciences and clinical neurosurgery. This paper presents a method for connectivity-based parcellation of the enti...
Cyril Poupon, Denis Rivière, Jean-Francois ...
CVPR
2009
IEEE
15 years 2 months ago
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
This paper studies a framework for matching an unknown number of corresponding structures in two images (shapes), motivated by detecting objects in cluttered background and lear...
Kun Zeng, Liang Lin, Song Chun Zhu, Xiaobai Liu
IPMI
2009
Springer
14 years 7 days ago
Dense Registration with Deformation Priors
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
Ben Glocker, Nikos Komodakis, Nassir Navab, Georgi...
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
13 years 6 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...
LATIN
2010
Springer
14 years 2 months ago
Kernelization through Tidying
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
René van Bevern, Hannes Moser, Rolf Niederm...