Forest’s ecosystem is one of the most important carbon sink of the terrestrial ecosystem. Remote sensing technology provides robust techniques to estimate biomass and solve challenges in forest resource assessment. The present study explored the potential of Sentinel-2 bands to estimate biomass and comparatively analyzed of red-edge band based and broadband derived vegetation indices. Broadband...

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...

Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...

Edge detection and edge enhancement techniques play an essential role in interpreting potential field data. This paper describes the application of various edge detection techniques to gravity data in order to delineate the edges of subsurface structures. The edge detection methods comprise analytic signal, total horizontal derivative (THDR), theta angle, tilt angle, hyperbolic of tilt angle (H...

The datum σ yields a measure dσ on the boundary ∂P—on each edge E we take dσ to be a constant multiple of the standard Lebesgue measure with the constant normalised so that the mass of the edge is σ(E). Equally, the datum σ specifies an affine-linear defining function λE for each edge E, i.e. the edge lies in the hyperplane λ E (0). We choose an inward-pointing normal vector v at a point of E w...

Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...

one of the generalizations of the wiener number to weighted graphs is to assign probabilities to edges, meaning that in nonstatic conditions the edge is present only with some probability. the reliability wiener number is defined as the sum of reliabilities among pairs of vertices, where the reliability of a pair is the reliability of the most reliable path. closed expressions are derived for t...

OBJECTIVES The purpose of this study was to investigate the ability of quantitative ultrasound (US) using edge detection analysis to assess patients with Duchenne muscular dystrophy (DMD). METHODS After Institutional Review Board approval, US examinations with fixed technical parameters were performed unilaterally in 6 muscles (biceps, deltoid, wrist flexors, quadriceps, medial gastrocnemius,...