Sciweavers

270 search results - page 28 / 54
» Graph Cuts and Efficient N-D Image Segmentation
Sort
View
EVOW
2005
Springer
14 years 2 months ago
Region Merging for Severe Oversegmented Images Using a Hierarchical Social Metaheuristic
This paper proposes a new evolutionary region merging method to improve segmentation quality result on oversegmented images. The initial segmented image is described by a modified ...
Abraham Duarte, Ángel Sánchez, Felip...
SMI
2006
IEEE
108views Image Analysis» more  SMI 2006»
14 years 2 months ago
Segmenting Point Sets
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
Ichitaro Yamazaki, Vijay Natarajan, Zhaojun Bai, B...
CVPR
2007
IEEE
14 years 10 months ago
Optimizing Binary MRFs via Extended Roof Duality
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
Carsten Rother, Vladimir Kolmogorov, Victor S. Lem...
CAIP
2009
Springer
236views Image Analysis» more  CAIP 2009»
14 years 3 months ago
An Efficient Parallel Algorithm for Graph-Based Image Segmentation
Jan Wassenberg, Wolfgang Middelmann, Peter Sanders
CVPR
2012
IEEE
11 years 11 months ago
Multi view registration for novelty/background separation
We propose a system for the automatic segmentation of novelties from the background in scenarios where multiple images of the same environment are available e.g. obtained by weara...
Omid Aghazadeh, Josephine Sullivan, Stefan Carlsso...