Sciweavers

605 search results - page 74 / 121
» Constrained Graph Layout
Sort
View
CVPR
2003
IEEE
14 years 12 months ago
Object-Specific Figure-Ground Segregation
We consider the problem of segmenting an image into foreground and background, with foreground containing solely objects of interest known a priori. We propose an integration mode...
Stella X. Yu, Jianbo Shi
CCCG
2003
13 years 11 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
MICCAI
2010
Springer
13 years 8 months ago
Segmentation Subject to Stitching Constraints: Finding Many Small Structures in a Large Image
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
Elena Bernardis, Stella X. Yu
CVPR
2011
IEEE
13 years 6 months ago
Biased Normalized Cuts
We present a modification of “Normalized Cuts” to incorporate priors which can be used for constrained image segmentation. Compared to previous generalizations of “Normaliz...
Subhransu Maji, Nisheeth Vishnoi, Jitendra Malik
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 10 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis