Color edge detection is approached in this paper using vector order statistics. Based on the R-ordering method, a class of color edge detectors is defined. These detectors function as vector operators as opposed to component-wise operators. Specific edge detectors can be obtained as special cases of this class. Various such detectors are defined and analyzed. Experimental results show the noise...

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. In this note we prove that K1,m,n is interval colorable if and only if gcd(m+ 1, n+ 1) = 1, where ...

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

Reconfiguration problems arise when we wish to find a step-by-step transformation between two feasible solutions of a problem such that all intermediate results are also feasible. Recently, Ito et al. [5] proposed a framework of reconfiguration problems, and gave complexity and approximability results for reconfiguration problems derived from several well-known problems, such as independent set...

HIS color space is based on the visual features of our eyes, and uses tone, brightness, saturation to manifest the color. While conducting edge detection on color images, in order to get better effects and consistent with human visual perception, a novel HIS-like color space is defined and it is obtained in the process of the improving HIS color model. Edge detection has been made on image whic...

We aim at using color information to classify the physical nature of a color edge: that is whether the transition is due to shadows, abrupt surface orientation changes, illumination, highlights or material changes. To achieve physics-based edge classification, we propose a taxonomy of color invariant edges. The taxonomy is based upon the sensitivity of the various color edges with respect to di...

Color histogram is widely used in image retrieval due to its simplicity and fast operation speed. Since color histogram describes only global color distribution in an image, it is not robust to large changes in appearance and shape caused by viewing position, camera zoom, etc. To overcome this problem, we propose the method using the color edge information. Although changes in appearance and sh...

Alon, Krech, and Szabó [SIAM J. Discrete Math., 21 (2007), pp. 66–72] called an edge-coloring of a hypercube with p colors such that every subcube of dimension d contains every color a d-polychromatic p-coloring. Denote by pd the maximum number of colors with which it is possible to d-polychromatically color any hypercube. We find the exact value of pd for all values of d.

in this paper, the performance of 11 different distances for image retrieval and classification, based on color, shape and texture, is evaluated. the precision-recall measure and the correct classification rate of the k-nn classifier are used to evaluate retrieval and classification performances, respectively. the experimental results for a database of 1000 images from 10 different semantic gro...