نتایج جستجو برای: contour of a graph
تعداد نتایج: 23285458 فیلتر نتایج به سال:
abstract abstract of thesis (includes summary, goals, execution methods, and results) story “al-obnosat al-bayza” is one of the short stories from “hanna mineh” collection. this story is a selection of lives of some humans during a voyage together, each of them is a symbol of human nature (love, mind, kindness) and examine social, cultural, and political aspects of governing system, and it...
in this paper we introduce mixed unitary cayley graph $m_{n}$ $(n>1)$ and compute its eigenvalues. we also compute the energy of $m_{n}$ for some $n$.
In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation. GCBAC approach is a combination of the iterative deformation idea of active contours and the optimization tool of graph cuts. It differs from traditional active contours in that it uses graph cuts to iteratively deform the contour and its cost function is defined as the summation of edge weights...
Active contour formulations predominate current minimization of the Mumford-Shah functional (MSF) for image segmentation and filtering. Unfortunately, these formulations necessitate optimization of the contour by evolving via gradient descent, which is known for its sensitivity to initialization and the tendency to produce undesirable local minima. In order to reduce these problems, we reformul...
C-V model can self-adapt to the changes of curve topology but requires more iterations and needs more computing time. Graph cuts algorithm is good at getting the global optimum in a short time but not suitable for concave object extraction. To overcome the flaws of these two algorithms, an optimized iteration algorithm has been proposed. First the initial contour is deformed with an improved C-...
chapter one is devotod to collect some notion and background informations, which are needed in the next chapters. it also contains some important statements which will be proved in a more general context later in this thesis. in chapter two, we show that if the marginal factor-group is of order np1...pk,n>1, then we obtain a bound for the order of the verbal subgroup. also a bound for the bear-...
the effect of the presence of perforations on he stresses of a plate is a problem which is of great interest in structural design and in the mathemattical theory of elasticity. among the many hole patterns that are likely to require consideration is the ring of equally spaced circular holes. the present worke investigates stress & strain analysis of a thin isotropic circular plate containing a ...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
this thesis basically deals with the well-known notion of the bear-invariant of groups, which is the generalization of the schur multiplier of groups. in chapter two, section 2.1, we present an explicit formula for the bear-invariant of a direct product of cyclic groups with respect to nc, c>1. also in section 2.2, we caculate the baer-invatiant of a nilpotent product of cyclic groups wuth resp...
Given a manifold X and a function f : X → IR, the level set of X containing the point q is the set {x ∈ X : f(x) = f(q)}. Each connected component of the level set is called a contour. Recall from last lecture that the Reeb graph Rf (X) of X on f is defined to be the continuous contraction of each contour to a point. Recall furthermore that if the manifold is simply-connected (i.e., all loops a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید