296 search results - page 12 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
TSMC
2008
14 years 11 months ago
2008
A novel thresholding algorithm is presented in this paper to improve image segmentation performance at a low computational cost. The proposed algorithm uses a normalized graphcut m...
109
click to vote
KDD
2005
ACM
16 years 7 days ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
118
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a new shape prior segmentation method using graph cuts capable of segmenting multiple objects. The shape prior energy is based on a shape distance popular with level se...
108
click to vote
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
14 years 12 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
DAC
2009
ACM
16 years 25 days ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...