to compute the optic flow along intensity change curves. The flow is computed locally at corners, determined as edge points of high curvature, by cross correlation over time. The (full) flow is then computed along edge contours by means of a combined wave/diffusion process. MCMAP has been implemented on a Transputer array using a mixed paradigm of a pipeline and a processor farm. A fast algorit...

One of the most fundamental features of digital image and the basic steps in image processing, analysis, pattern recognition and computer vision is the edge of an image where the preciseness and reliability of its results will affect directly on the comprehension machine system made objective world. Several edge detectors have been developed in the past decades, although no single edge detector...

this paper is dedicated to propose an algorithm in order to generate the certain isomers of some well-known fullerene bases. furthermore, we enlist the bipartite edge frustration correlated with some of symmetrically distinct innite families of fullerenes generated by the oered process.

Forest fragmentation results in a loss of forest interior and an increase in edge habitat. We studied how understorey bird community composition and habitat variables changed along an edge-to-interior gradient in a 1248-ha lowland rainforest patch in peninsular Malaysia. Birds and environmental variables such as vegetation structure and litter depth were detected within a 25-m radius of each of...

the vertex-edge wiener index of a simple connected graph g is defined as the sum of distances between vertices and edges of g. two possible distances d_1(u,e|g) and d_2(u,e|g) between a vertex u and an edge e of g were considered in the literature and according to them, the corresponding vertex-edge wiener indices w_{ve_1}(g) and w_{ve_2}(g) were introduced. in this paper, we present exact form...

Given an edge-weighted graph G = (V,E) and a subset R of V , a Steiner tree of G is a tree which spans all the vertices in R. A full Steiner tree is a Steiner tree which has all the vertices of R as its leaves. The full Steiner tree problem is to find a full Steiner tree of G with minimum weight. In this paper we present a 20-approximation algorithm for the full Steiner tree problem when G is a...

In order to upsurge the maneuverability of micro aerial vehicles, a tubercle leading edge inspired by whale flipper was applied as passive stall control method. Although this method could be useful phenomena, effect geometrical properties on flow physic should investigated reach root them. According preceding research, some parameters wing is hot topic among researchers. The aim research explor...

The edge detour index polynomials were recently introduced for computing the edge detour indices. In this paper we find relations among edge detour polynomials for the 2-dimensional graph of $TUC_4C_8(S)$ in a Euclidean plane and $TUC4C8(S)$ nanotorus.

In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...

The response of an argon proportional counter to X-rays with energy in the range of 1.5–8 keV was investigated. The response to full-energy absorption events was found to follow different trends for X-ray energies below and above the argon K-absorption edge presenting a discontinuity at this energy. An abrupt decrease of (2.270.3)% in the detector amplitude at the K-edge (3.203 keV) was measure...