In this paper, a new and efficient edge-preserving algorithm is presented for color contrast enhancement in CIE Luv0 color space. The proposed algorithm not only can enhance the color contrast as the previous algorithm does, but also has an edge-preservation effect. In addition, the spurious edge points occurred due to the color contrast enhancement can be well reduced using the proposed algori...

We have studied the finite-size effect on the dynamic behavior of graphene resonators and their applications in atomic mass detection using a continuum elastic model such as modified plate theory. In particular, we developed a model based on von Karman plate theory with including the edge stress, which arises from the imbalance between the coordination numbers of bulk atoms and edge atoms of gr...

let g be a (p,q) graph. an injective map f : e(g) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: v (g) → z - {0} defined by f*(v) = σp∈ev f (e) is one-one where ev denotes the set of edges in g that are incident with a vertex v and f*(v (g)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} u {±k(p+1)/2} according a...

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

We discuss a quasi-particle formulation of effective edge theories for the fractional quantum Hall effect. Fundamental quasi-particles for the Laughlin state with filling fraction ν = 1 3 are edge electrons of charge −e and edge quasi-holes of charge + e 3. These quasi-particles satisfy exclusion statistics in the sense of Haldane. We exploit algebraic properties of edge electrons to derive a k...

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

Time-reversal invariance places strong constraints on the properties of the quantum spin Hall edge. One such restriction is the inevitability of dissipation in a Josephson junction between two superconductors formed on such an edge without the presence of interaction. Interactions and spinconservation breaking are key ingredients for the realization of dissipationless ac Josephson effect on suc...

Intensity-based edge detectors cannot distinguish whether an edge is caused by material changes, shadows, surface orientation changes or by highlights. Therefore, our aim is to classify the physical cause of an edge using hyperspectra obtained by a spectrograph. Methods are presented to detect edges in hyperspectral images. In theory, the effect of varying imaging conditions is analyzed for ”ra...