Sciweavers

315 search results - page 14 / 63
» An Optimal Algorithm for the Maximum-Density Segment Problem
Sort
View
ICCV
2009
IEEE
15 years 11 days ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
15 years 11 days ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh
CVPR
2010
IEEE
14 years 1 months ago
Variational Segmentation of Elongated Volumetric Structures
We present an interactive approach for segmenting thin volumetric structures. The proposed segmentation model is based on an anisotropic weighted Total Variation energy with a glo...
Christian Reinbacher, Thomas Pock, Christian Bauer...
TSMC
2002
137views more  TSMC 2002»
13 years 7 months ago
An evolutionary tabu search for cell image segmentation
Many problems in practically all fields of science, engineering and technology involve global optimization. It becomes more and more important to develop the efficient global opti...
Tianzi Jiang, Faguo Yang
ICIP
2006
IEEE
14 years 9 months ago
Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
Mala L. Radhakrishnan, Sara L. Su