نتایج جستجو برای: graph cuts
تعداد نتایج: 208622 فیلتر نتایج به سال:
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
This paper presents a novel graph-cuts algorithm that can take into account a multiple-shape constraint and reports a lung segmentation process from a three-dimensional computed tomography (CT) image, based on the graph-cuts algorithm. A major contribution of this paper is the proposal of a segmentation algorithm that can consider multiple shapes in a graph-cuts framework. Using experiments, we...
In this paper we address the task of finding convex cuts of a graph. In addition to the theoretical value of drawing a connection between geometric and combinatorial objects, cuts with this or related properties can be beneficial in various applications, e. g., routing in road networks and mesh partitioning. It is known that the decision problem whether a general graph is k-convex is NP-complet...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید