A comparison of the peak location in nuclear and initial prenuclear accents was carried out for two closely related dialects of Connaught Irish: Cois Fharraige and Inis Oirr. This was done across conditions where the number of unstressed syllables following the nuclear and preceding the initial prenuclear accents was varied from 2-0. Clear differences in peak timing emerged between the two dial...

the license plate edge detection is the most important step of the process of plate identification. plate recognition system is an automated system that captures vehicle location, vehicle license plate accurately on various vehicles at different times of day and night sets. in this paper the issue of searching the exact location of the license plate from the input images using sobel operator fo...

‎In this paper‎, ‎we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay‎. ‎It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$‎, ‎then such a cover is unique‎.

In view of the limited anti-noise of traditional traffic lane edge detection algorithm, the paper put forward to a new traffic lane edge detection algorithm based on traditional mathematical morphology. For solving the problem of uneven road surface caused by illumination and rainy, this paper combine two method of morphological filter and Otsu to segment image and take the improved algorithm t...

This paper presents a new edge detection algorithm based on calculating the difference value of two clusters. An edge is defined as a boundary that separates two adjacent regions that are relatively homogenous. For each image pixel, a window is first defined by placing the pixel at the center, and this window is partitioned into two sub-regions respectively in four different directions. An appr...

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

Edge detection is a process of identifying and detecting sharp discontinuities in an image. The discontinuities are abrupt changes in pixel intensity gray level value. The traditional method of edge detection involves convolving the image with an operator (2D filter) which is constructed to be sensitive to noise. Edge detector is a collection of very important local image processing method to l...

This paper presents a binarization method for camera based natural scene (NS) images based on edge analysis and morphological dilation. Image is converted to grey scale image and edge detection is carried out using canny edge detection. The edge image is dilated using morphological dilation and analyzed to remove edges corresponding to non-text regions. The image is binarized using mean and sta...