Results 301 to 310 of about 92,928 (333)
Some of the next articles are maybe not open access.
2000
One of the fundamental tasks in image processing is edge detection. High level image processing, such as object recognition, segmentation, image coding, and robot vision, depend on the accuracy of edge detection. Edges contain essential information about an image. Most edge detection techniques are based on finding maxima in the first derivative of the
Konstantinos N. Plataniotis +1 more
openaire +1 more source
One of the fundamental tasks in image processing is edge detection. High level image processing, such as object recognition, segmentation, image coding, and robot vision, depend on the accuracy of edge detection. Edges contain essential information about an image. Most edge detection techniques are based on finding maxima in the first derivative of the
Konstantinos N. Plataniotis +1 more
openaire +1 more source
2007
We consider the following channel assignment problem arising in wireless networks. We are given a graph G= (V, E), and the number of wireless cards C v for all v, which limit the number of colors that edges incident to vcan use. We also have the total number of channels C G available in the network.
Chadi Kari +4 more
openaire +1 more source
We consider the following channel assignment problem arising in wireless networks. We are given a graph G= (V, E), and the number of wireless cards C v for all v, which limit the number of colors that edges incident to vcan use. We also have the total number of channels C G available in the network.
Chadi Kari +4 more
openaire +1 more source
1995
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in various scheduling problems like the file transfer problem on computer networks. In this paper, we survey recent advances and results on the classical edge-coloring problem as well as the generalized edge-coloring problems, called the f-coloring and Φ ...
Shin-ichi Nakano +2 more
openaire +1 more source
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in various scheduling problems like the file transfer problem on computer networks. In this paper, we survey recent advances and results on the classical edge-coloring problem as well as the generalized edge-coloring problems, called the f-coloring and Φ ...
Shin-ichi Nakano +2 more
openaire +1 more source
Graph Edge Coloring and Extensions of Edge Colorings
This dissertation explores two main questions which may be framed in terms of graph edge-coloring. First, an assignment of $k$ colors to the edges of the complete bipartite graph $K_{n,n}$ corresponds to an assignment of $k$ symbols to the cells of an $n\times n$ array.openaire +1 more source
Optical Engineering, 1977
The choice of the color coordinates for extraction of visually significant edges and boundaries in a color image is discussed. The compass gradient edge detection method developed by the author for monochrome images is extended to color edge detection and a quantitative measure is discussed in choosing the color coordinates for edge extraction.
openaire +1 more source
The choice of the color coordinates for extraction of visually significant edges and boundaries in a color image is discussed. The compass gradient edge detection method developed by the author for monochrome images is extended to color edge detection and a quantitative measure is discussed in choosing the color coordinates for edge extraction.
openaire +1 more source
2016
In [76], a number of edge colorings were described that gave rise to various vertex colorings of interest. In one instance, the color of a vertex was defined as the set of colors of the edges incident with the vertex, with the goal to minimize the number of colors so that the resulting coloring is vertex-distinguishing.
openaire +1 more source
In [76], a number of edge colorings were described that gave rise to various vertex colorings of interest. In one instance, the color of a vertex was defined as the set of colors of the edges incident with the vertex, with the goal to minimize the number of colors so that the resulting coloring is vertex-distinguishing.
openaire +1 more source
2016
In this chapter, we consider an edge coloring problem in graphs that can be used to model certain situations, one of which we now describe. Suppose that a hard-line network of n computers is to be constructed. Each of these computers requires k different types of connections.
openaire +1 more source
In this chapter, we consider an edge coloring problem in graphs that can be used to model certain situations, one of which we now describe. Suppose that a hard-line network of n computers is to be constructed. Each of these computers requires k different types of connections.
openaire +1 more source
Video Caching, Analytics, and Delivery at the Wireless Edge: A Survey and Future Directions
IEEE Communications Surveys and Tutorials, 2021Behrouz Jedari +2 more
exaly