This paper proposes a way of removing noises and reducing the number of colors contained in a JPEG image. Main purpose of this project is to convert color images to monochrome images for the color-blind. We treat the crispy color images like the Tokyo subway map. Each color in the image has an important information. But for the color blinds, similar colors cannot be distinguished. If we can con...

the machine made carpet industry is one of the main and most famous industries in iran and especially in the city of yazd. however there is little information about customer preferences for different attributes of this product. in this article we tried to estimate the relative importance of the main attributes affecting customer desire for purchasing machine made carpet and the utility values f...

in this study, a relationship between scanner response (rgb) and cie tristimulus values (xyz) is established by regression technique with different polynomials for colored polyester fabrics. the results showed that the transformation process is material dependent and higher order polynomials will fit the experimental data better than lower polynomials. the results also showed that the way the c...

background: adverse effect of sun rays mainly uv ray on the human eye documented and protection of eyes is necessary using different methods such as, sun glasses. sunglasses are designed in different colors. the aim of this study was evaluation of the effect of different colors of sunglasses on the visual acuity, contrast sensitivity, stereopsis and color vision. methods: 81 normal subjects wer...

– one of the important applications of robots is in material handling and transport of various shaped objects. in cases where an object cannot be directly grasped by the robot gripper, and must be carried by a hook, it may be subject to undesirable swings during transport. this paper presents an analytical method for minimizing the oscillation of a suspended object during transport. this method...

An edge coloring φ of a graph G is called an Mi-edge coloring if |φ(v)| ≤ i for every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let Ki(G) denote the maximum number of colors used in an Mi-edge coloring of G. In this paper we establish some bounds of K2(G), present some graphs achieving the bounds and determine exact values of K2(G) for dense graphs.

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.