Monitoring ephemeral gullies facilitates water planning and soil conservation. Artificial interpretation based on high spatial resolution images is the main method for monitoring ephemeral gullies in large areas; however, this method is time consuming. In this study, a semiautomatic method for extracting ephemeral gullies in loess hilly areas based on directional edge detection is proposed. Fir...

There are a large number of application fields where measurements deriving from digital images can assume a great relevance. Nevertheless, to make a profitable use of such measurements, it is indispensable to achieve a complete and quantitative control on uncertainties that real systems introduce along the chain of steps going from real-world objects to the results of the measurement process. T...

In this paper we present a method based on the fuzzy Hough transform to locate the iliac crests in posteroanterior radiographs. Firstly, a Canny edge detector is applied to the X-ray images in order to obtain an edge map. Then, the fuzzy Hough transform is used in combination with several constraints extracted from our domain knowledge. At the bottom of the radiograph we search for two circular...

Let G = (V,E) be a k-edge-connected graph with edge costs {c(e) : e ∈ E} and let 1 ≤ l ≤ k − 1. We show by a simple and short proof, that G contains an l-edge cover I such that: c(I) ≤ l k c(E) if G is bipartite, or if l|V | is even, or if |E| ≥ k|V | 2 + k 2l ; otherwise, c(I) ≤ (

In this paper, we present a technique for grouping line segments into convex sets, where the line segments are obtained by linking edges obtained from the Canny edge detector. The novelty of the approach is twofold: first we define an efficient approach for testing the global convexity criterion, and second, we develop an optimal search based on dynamic programming for grouping the line segment...

Edge identification is one of the key issues of computerized picture, in this paper, we might examine different systems for edge location and should expand and think about every one of them. There will be some scientific morphology technique and a few traditional edge recognition administrators are checked on. This paper gives strategies, for example, Canny administrator and scientific morpholo...

For a connected graph G = (V , E), an edge set S ⊂ E is a k-restricted edge cut if G − S is disconnected and every component of G − S contains at least k vertices. The k-restricted edge connectivity of G, denoted by λk(G), is defined as the cardinality of a minimum krestricted edge cut. For U1,U2 ⊂ V (G), denote the set of edges of Gwith one end in U1 and the other in U2 by [U1,U2]. Define ξk(G...

We study the class of simple graphs G for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in G and prove that every G ∈ G satisfies the list-edge-coloring conjecture. When ∆(G) ≥ 4, we in fact prove a stronger result about kernel-perfect orientations in L(G) which implies that G is (m∆(G) : m)edge-choosable and ∆(G)-edge...