In computer vision, graph cuts are a way of segmenting an image into multiple areas. Graphs are built using one node for each pixel in the image combined with two extra nodes, known as the source and the sink. Each node is connected to several other nodes using edges, and each edge has a specific weight. Using different weighting schemes, different segmentations can be performed based on the pr...

In this study a new approach to rank exponential fuzzy numbers using  -cuts is established. The metric distance of the interval numbers is extended to exponential fuzzy numbers. By using the ranking of exponential fuzzy numbers and using  -cuts the critical path of a project network is solved and illustrated by numerical examples. Keywords: Exponential Fuzzy Numbers,  -cuts, Metric Dista...

A method for the calculation of the hyper–Wiener index (WW ) of a benzenoid system B is described, based on its elementary cuts. A pair of elementary cuts partitions the vertices of B into four fragments, possessing nrs , r, s = 1, 2 vertices. WW is equal to the sum of terms of the form n11 n22 + n12 n21 . The applicability of the method is illustrated by deducing a general expression for WW of...

In computer vision, segmentation is the process of partitioning digital image into multiple regions (sets of pixels), according to some homogeneity criterion. The problem of segmentation is a well-studied one in literature and there are a wide variety of approaches that are used. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems such as Image Segmenta...

We propose a systematic way to carry out the method introduced in hep-th/0410077 for computing certain unitarity cuts of one-loop N = 4 amplitudes of gluons. We observe that the class of cuts for which the method works involves all next-to-MHV ngluon one-loop amplitudes of any helicity configurations. As an application of our systematic procedure, we obtain the complete seven-gluon one-loop lea...

A scanning electron microscope is employed for the investigation of charging on different cuts of an a-SiO,. A method for the determination of trapped charges is proposed. Charging on different cuts is observed to decrease in the order of z cut, 30” cut, 45” cut, and 60“ cut of the a-Si02. This phenomenon is related to permittivity, defect density, and stress of the samples. Details of the expe...

Cutting planes are one of the main techniques currently used to solve large-scale MixedInteger Linear Programming (MIP) models. Many important cuts used in practice, such as Gomory Mixed-Integer (GMI) cuts, are obtained by solving the linear relaxation of the MIP, extracting a single row of the simplex tableau, then applying integrality arguments to it. A natural extension, which has received r...

Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a powerful combinatorial optimization tool which has been successfully applied into image segmentation and stereo matching. Under some specific constraints, graph-cuts method yields either a global minimum or a local min...