We present a system for interactive shadow editing from single images which includes the manipulations of shape, distribution, sharpness and darkness of shadows according to the features of existing shadows. We first obtain a shadow-free image, shadow boundary and its registered sparse shadow scales using an existing shadow removal method. The modifiable features of the shadow are synthesised f...

In remote sensing images, shadows created by big tower, bridges, tree. It may destroy the information of an image. Missing information has a direct effect on common analysis and processing of image, this leads to inefficient classification. To separate shadow and non shadow regions, morphological feature is consider for segmentation. Relevance Vector Machine (RVM) classifier can also classify b...

let $g$ be a graph and let $m_{ij}(g)$, $i,jge 1$, be the number of edges $uv$ of $g$ such that ${d_v(g), d_u(g)} = {i,j}$. the {em $m$-polynomial} of $g$ is introduced with $displaystyle{m(g;x,y) = sum_{ile j} m_{ij}(g)x^iy^j}$. it is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...

let $g$ be a connected graph of order $3$ or more and $c:e(g)rightarrowmathbb{z}_k$‎ ‎($kge 2$) a $k$-edge coloring of $g$ where adjacent edges may be colored the same‎. ‎the color sum $s(v)$ of a vertex $v$ of $g$ is the sum in $mathbb{z}_k$ of the colors of the edges incident with $v.$ the $k$-edge coloring $c$ is a modular $k$-edge coloring of $g$ if $s(u)ne s(v)$ in $mathbb{z}_k$ for all pa...

Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued function f: E(G) → Z is called a flow. Tutte was introduced the flow polynomial F(G, λ) as a polynomial in an indeterminate λ with integer coefficients by F(G,λ) In this paper the Flow polynomial of some dendrimers are computed.

Accurately building height estimation from remote sensing imagery is an important and challenging task. However, the existing shadow-based methods have large errors due to complex environment in imagery. In this paper, we propose a multi-scene method based on shadow high resolution First, of classified described by analyzing features Second, variety models established different scenes. addition...

We discuss a general pairing that occurs in compactifications of M–theory on AdS4×X backgrounds between massless ultra short multiplets and their massive shadows, namely certain universal long multiplets with fixed protected dimensions. In particular we consider the shadow of the short graviton multiplet in N = 3 compactifications. It turns out to be a massive spin 32 multiplet with scale dimen...