Robot vision tasks often use stereo methods to obtain 3-d information on the environment. This paper shows how color information can be utilized to improve the results of dense stereo matching as well as the results of edge-based stereo matching. A hierarchical chromatic Block Matching technique to obtain dense stereo correspondence is presented. The results have been compared to the results of...

Let G be a simple, undirected graph. We say that two edges of G are within distance 2 of each other if either they are adjacent or there is some other edge that is adjacent to both of them. A distance-2-edge-coloring of G is an assignment of colors to edges so that any two edges within distance 2 of each other have distinct colors, or equivalently, a vertex-coloring of the square of the line gr...

A strong edge-coloring of a graph is a function that assigns to each edge a color such that two edges within distance two apart receive different colors. The strong chromatic index of a graph is the minimum number of colors used in a strong edge-coloring. This paper determines strong chromatic indices of cacti, which are graphs whose blocks are cycles or complete graphs of two vertices. The pro...

The edges of the Cartesian product of graphs G x Hare to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H is 4or 5-chromatic.

There are two widely held theories of color constancy based on very different mechanisms: Chromatic Adaptation and Spatial Comparisons. Chromatic Adaptation is based on the change of retinal sensitivity in response to changes in incident light. The Spatial Comparisons mechanism is insensitive to illumination changes because it uses ratios of radiance from different pixels in the image. A spatia...

let $g$ be a connected graph of order $3$ or more and $c:e(g)rightarrowmathbb{z}_k$‎ ‎($kge 2$) a $k$-edge coloring of $g$ where adjacent edges may be colored the same‎. ‎the color sum $s(v)$ of a vertex $v$ of $g$ is the sum in $mathbb{z}_k$ of the colors of the edges incident with $v.$ the $k$-edge coloring $c$ is a modular $k$-edge coloring of $g$ if $s(u)ne s(v)$ in $mathbb{z}_k$ for all pa...

This paper presents an information hiding method that can be used for proving copyright ownership of a digital object. In contrast with other methods, the identity of the owner of the object is proved by the owner’s ability to demonstrate knowledge of a certain property of the signature. The method utilizes Zero Knowledge Interactive Proof (ZKIP) protocols for computationally intractable, or NP...

We suggest a new color distance based on two observations. First, perceptual color differences were designed to be used to compare very similar colors. They do not capture human perception for medium and large color differences well. Thresholding was proposed to solve the problem for large color differences, i.e. two totally different colors are always the same distance apart. We show that thre...

A rainbow subgraph of an edge-colored graph is a subgraph whose edges have distinct colors. The color degree of a vertex v is the number of different colors on edges incident to v. Wang and Li conjectured that for k > 4, every edge-colored graph with minimum color degree at least k contains a rainbow matching of size at least ⌈k/2⌉. We prove the slightly weaker statement that a rainbow matching...