The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...

A Feature Correction Two Stage Vector Quantization (FC2VQ) algorithm was previously developed to compress gray-scale photo ID pictures. This algorithm is extended to color images in this paper. Three options are compared, which apply the FC2VQ algorithm in R-G-B, YCbCr, and Karhunen-Loeve transform (KLT) color spaces, respectively. The RGB-FC2VQ algorithm is found to yield better image quality ...

We examine the relationship between environment and the luminosities, surface brightnesses, colors, and profile shapes of luminous galaxies in the Sloan Digital Sky Survey (SDSS). For the SDSS sample, galaxy color is the galaxy property most predictive of the local environment. Galaxy color and luminosity jointly comprise the most predictive pair of properties. At fixed luminosity and color, de...

The parties involved in trading feed grains and other feed materials are normally aware of the relationships of the difference of their external appearance with their nutrient composition and usefulness. Several reports are available on nutrient composition of DDGS and its nutritional evaluation in different animal species. Some manufacturers and the University of Minnesota have published data ...

This paper describes a system to extract salient regions from an outdoor image and match them against a database of previously acquired landmarks. Region saliency is based mainly on color contrast, although intensity and texture orientation are also taken into account. Remarkably, color constancy is embedded in the saliency detection process through a novel colorratio algorithm that makes the s...