A modified ant-based edge detector is presented. It is based on the distribution of ants on an image. Ants try to find possible edges by using a heuristic function based on 3x3 ideal edge structures. Visual comparisons show that the modified algorithm gives finer details and thinner edges at lesser computational times when compared to earlier ant-based approaches. When compared to standard edge...

The Canny edge detector is widely used in computer vision to locate sharp intensity changes and to nd object boundaries in an image The Canny edge detector classi es a pixel as an edge if the gradient magnitude of the pixel is larger than those of pixels at both its sides in the direction of maximum intensity change In this paper we will show that de ning edges in this manner causes some obviou...

In this paper, the performance of a Gabor odd filterbased edge detector is investigated using the measures proposed b y Canny. Based on this performance analysis a design criterion for 1-D Gabor filter-based edge detector is derived. It is shown that this design criterion holds good for a 2-0 Gabor filter-based edge detector as well. Experimental results are presented to demonstrate the signifi...

The REVgraph is built up from our stereo processing system, TINA!. This system runs a Canny edge detector over both images, finds disparity values for the edge points using the PMF stereo correspondence algorithrn'' groups up the points into edge segments, and produces a geometric description of these edge segments in terms of straight linesand circular arcs'. The REVgraph contains representati...

Methods have been used for identification of human by recognizing lip prints. Human lips have a number of elevation and depressions features called lip prints and examination of lip prints is referred to as cheiloscopy. Lip prints of each human being are unique in nature like many others features of human. In this paper lip print is first smoothened using a Gaussian Filter. Next Sobel Edge Dete...

Let G(V,E) be a graph, and let f be an integer function on V with 1 ≤ f(v) ≤ d(v) to each vertex v ∈ V . An f -edge cover coloring is an edge coloring C such that each color appears at each vertex v at least f(v) times. The f -edge cover chromatic index of G, denoted by χ ′ fc(G), is the maximum number of colors needed to f -edge cover color G. It is well known that min v∈V {bd(v)− μ(v) f(v) c ...

It is not possible to have a fair evaluation of edge detectors as edges are usually presented with simple synthetic images or real images that entail lots of semantic objects. We propose to elaborate a human expertise of edge detection by looking at zooms of small areas and to let humans build reference maps manually. Then it is possible to evaluate edge detectors and to undertake a classiicati...

We study the method of Sun et al. for edge detection based on the Law of Universal Gravity. We analyze the effect of the substitution of the product operation by other triangular norms in the calculation of the gravitational forces. We treat edges as fuzzy sets for which membership degrees are extracted from the resulting gravitational force on each pixel. We consider several prototypical trian...

A wind tunnel investigation was performed to study the flow field over a 70° swept sharped edge delta wing model at high angles of attack. The experiments were conducted in the subsonic wind tunnel at the Department of Mechanical Engineering, Sharif University of Technology. Velocity profiles have been measured using a special pitot tube and hot wire anemometer at angles of attacks of 10 to 35 ...

In this paper, a new algorithm for edge detection based on fuzzyconcept is suggested. The proposed approach defines dynamic membershipfunctions for different groups of pixels in a 3 by 3 neighborhood of the centralpixel. Then, fuzzy distance and -cut theory are applied to detect the edgemap by following a simple heuristic thresholding rule to produce a thin edgeimage. A large number of experime...