Sciweavers

83 search results - page 2 / 17
» Improved Cut Sequences for Partitioning Based Placement
Sort
View
3DPVT
2006
IEEE
203views Visualization» more  3DPVT 2006»
13 years 11 months ago
Graph Cut Based Multiple View Segmentation for 3D Reconstruction
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...
Mario Sormann, Christopher Zach, Konrad F. Karner
ICTAI
2007
IEEE
13 years 11 months ago
Hypergraph Partitioning for Exploiting Localities in Nonlinear Constrained Optimization
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
Benjamin W. Wah, Soomin Lee
ICCAD
2003
IEEE
148views Hardware» more  ICCAD 2003»
14 years 2 months ago
Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization
In this paper we present a family of multi-objective hypergraph partitioning algorithms based on the multilevel paradigm, which are capable of producing solutions in which both th...
Navaratnasothie Selvakkumaran, George Karypis
CVPR
2004
IEEE
14 years 7 months ago
Multigrid and Multi-Level Swendsen-Wang Cuts for Hierarchic Graph Partition
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
Adrian Barbu, Song Chun Zhu
ICVGIP
2004
13 years 6 months ago
Improved Cut-Based Foreground Identification
Automatic content based schemes, as opposed to those with human endeavor, have become important as users attempt to organize massive data presented in the form of multimedia data ...
Sharat Chandran, Satwik Hebbar, Vishal Mamania, Ab...