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

In order to release the limitations on the computational complexity and the detail missing of the traditional interpolation algorithm, this paper proposes a double channel hybrid interpolation algorithm for superresolution reconstruction that can not only reduce the complexity effectively but also keep the details of the image sufficiently. The improved algorithm involves following methods: fir...

In this paper, an adaptive edge enhancement technique is proposed for two-dimensional (2-D) image scaling application. The anticipated image scaling algorithm consists of an edge detector, bilinear interpolation and sobel filter. The bilinear interpolation defines the intensity of the scaled pixel with the weighted average of the four nearest neighboring pixels, interpolated images become smoot...

Edge preserved smoothing techniques has gained importance for the purpose of image denoising. A good edge preserved filtering is given by nonlocal-means filter than any linear model based approaches.The contributions are in two fold. First, this paper explores a refined approach of nonlocal-means filter by using robust estimation function rather than the usual exponential function for its weigh...

We present linear-time algorithms for drawing phylogenetic trees in radial and circular representations. In radial drawings given edge lengths (representing evolutionary distances) are preserved, but labels (names of taxons represented in the leaves) need to be adjusted, whereas in circular drawings labels are perfectly spread out, but edge lengths adjusted. Our algorithms produce drawings that...

We present linear-time algorithms for drawing phylogenetic trees in radial and circular representations. In radial drawings given edge lengths (representing evolutionary distances) are preserved, but labels (names of taxons represented in the leaves) need to be adjusted, whereas in circular drawings labels are perfectly spread out, but edge lengths adjusted. Our algorithms produce drawings that...

Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...