The Gabor filter is applied using discrete wavelet transform for edge detection and contour tracing on true color images, whose wavelet functions provide the high resolution in both spatial and frequency domains. The number of wavelets also affects the quality of edge detection. To generate more accurate outcomes, integration of adaptive contrast stretching and Gabor wavelet transform is proper...

In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements of networks for being robust against homogeneous faults within certain thresholds. In particular, necessary and sufficient conditions for most interesting cases are obtained. For example, we will study the following ...

This paper explores the application of a new algebraic method of color exchanges to the edge coloring of simple graphs. Vizing’s theorem states that the edge coloring of a simple graph G requires either ∆ or ∆ + 1 colors, where ∆ is the maximum vertex degree of G. Holyer proved that it is NP-complete to decide whether G is ∆-edge-colorable even for cubic graphs. By introducing the concept of co...

Relational Over the last two decades, the advances in computer vision and pattern recognition power have opened the door to new opportunity of automatic facial expression recognition system[1]. This paper use Canny edge detection method for facial expression recognition. Image color space transformation in the first place and then to identify and locate human face .Next pick up the edge of eyes...

A graph G is called a complete k-partite (k ≥ 2) graph if its vertices can be partitioned into k independent sets V1, . . . , Vk such that each vertex in Vi is adjacent to all the other vertices in Vj for 1 ≤ i < j ≤ k. A complete k-partite graph G is a complete balanced kpartite graph if |V1| = |V2| = · · · = |Vk|. An edge-coloring of a graph G with colors 1, . . . , t is an interval t-colorin...

An edge coloring of a graph G with colors 1, 2, . . . , t is called an interval t-coloring if for each i ∈ {1, 2, . . . , t} there is at least one edge of G colored by i, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. A graph G is interval colorable, if there is an integer t ≥ 1 for which G has an interval t-coloring. Let N be the set of all i...

An edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. The problem of deciding whether a bipartite graph is interval colorable is NP-complete. The smalle...

In this paper, we propose a technique for embedding handwritten signature image data into color images and extracting embedded image data from color images. For the sake of security, two watermarked images will be transmitted in different times from the sender’s end to the receiver’s end, in due course, from two transmitted images, at the receiver’s end, original handwritten signature image dat...