Novel approaches to extract curvilinear structures, i.e., lines and edges, from 2D images are proposed. For lines, explicit geometric models for line profiles are used to analyze their behavior in scale-space. From this analysis, algorithms to extract lines and their widths with subpixel resolution are derived, and it is shown that the line positions and widths are necessarily biased by the smo...

‎let $g=(v(g),e(g))$ be a simple connected graph with vertex set $v(g)$ and edge‎ ‎set $e(g)$‎. ‎the (first) edge-hyper wiener index of the graph $g$ is defined as‎: ‎$$ww_{e}(g)=sum_{{f,g}subseteq e(g)}(d_{e}(f,g|g)+d_{e}^{2}(f,g|g))=frac{1}{2}sum_{fin e(g)}(d_{e}(f|g)+d^{2}_{e}(f|g)),$$‎ ‎where $d_{e}(f,g|g)$ denotes the distance between the edges $f=xy$ and $g=uv$ in $e(g)$ and $d_{e}(f|g)=s...

Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...

A laser driven electron x-ray source (LEXS) emitting tungsten Lα lines has been built based on a high repetition rate, terawatt laser system. The Lα characteristic lines overlap with the absorption edge of Ni near 8333 eV. Using this x-ray source, the x-ray absorption spectra near the absorption edge of different Ni compounds have been measured. We term this new method “ultrafast selected energ...

in order to apply suitable methods for sugar beet seed sowing and determine the relation between yield and growth parameters in saline soils, two salt tolerant progeny lines were sown by five methods for two years (1995 and 1996) using a split plot design. growth parameters such as leaf area index, crop growth rate, total dry weight and relative growth rat were analysed. ph and ec of the soil a...

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

let g=(v,e) be a simple graph. an edge labeling f:e to {0,1} induces a vertex labeling f^+:v to z_2 defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where z_2={0,1} is the additive group of order 2. for $iin{0,1}$, let e_f(i)=|f^{-1}(i)| and v_f(i)=|(f^+)^{-1}(i)|. a labeling f is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. i_f(g)=v_f(1)-v_f(0) is called the edge-f...

Edges produced by existing edge detection algorithms often contain discontinuities. Edge linking as a post-processing step is an important step for computer vision and pattern recognition. We present a real-time algorithm and its VLSI implementation for linking broken edges. First, all broken edge points inside a 12 12 moving window are identiied. The 12 12 window scans the input gray level edg...