منابع مشابه
Graph Cut Segmentation of Range Images into Planar Regions
We present a method for segmenting range images into separate planar surfaces, through a novel use of graph cuts. Our method attempts to assign an element from a discrete set of normal vectors to every pixel in the image, in an optimal way that considers the observed data as well as a smoothness prior. We show results from executing our method on a standard range image dataset and evaluate perf...
متن کاملHow to Cut a Graph into Many Pieces
In this paper we consider the problem of finding a graph separator of a given size that decomposes the graph into the maximum number of connected components. We present the picture of the computational complexity and the approximability of this problem for several natural classes of graphs. We first provide an overview of the hardness of approximation of this problem, which stems mainly from it...
متن کاملMaximum Cut Problem, MAX-CUT
The MAXIMUM CUT problem (MAX-CUT) is one of the simplest graph partitioning problems to conceptualize, and yet it is one of the most difficult combinatorial optimization problems to solve. The objective of MAX-CUT is to partition the set of vertices of a graph into two subsets, such that the sum of the weights of the edges having one endpoint in each of the subsets is maximum. This problem is k...
متن کامل????? ????? ????? ???? ????????????? ?? ?????? ?? ???? ?? ??????? ????? ????? Cut down
This article has no abstract.
متن کاملMin Cut , Fast Cut , Polynomial Identities
Throughout this section, G = (V,E) is a multi-graph. A cut of G is a bipartition (S, S̄) of the vertex set of G. The capacity of a cut is the number of edges having one endpoint on both sides of the cut. A min-cut is a cut of minimum capacity. A minimum cut can be computed with the help of maxflow computations. For some vertex s and every other vertex t, one computes the minimum cut separating s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kaleidoscope History
سال: 2014
ISSN: 2062-2597
DOI: 10.17107/kh.2014.9.272-278