This paper proposes a new approach for color transfer between two images. Our method is unique in its consideration of the scene illumination and the constraint that the mapped image must be within the color gamut of the target image. Specifically, our approach first performs a white-balance step on both images to remove color casts caused by different illuminations in the source and target ima...

A dominant color histogram matching method for fruits classification was presented in this paper. In classification of fruits based on machine vision, image was acquired with a color CCD camera that outputted color information in three channels, red, green, and blue. Because traditional RGB color space couldn’t meet subjective color sensation of human being, so color image needed to be transfor...

In this work we study approximation algorithms for the Bounded Color Matching problem (a.k.a. Restricted Matching problem) which is defined as follows: given a graph in which each edge e has a color ce and a profit pe ∈ Q, we want to compute a maximum (cardinality or profit) matching in which no more than wj ∈ Z edges of color cj are present. This kind of problems, beside the theoretical intere...

An efficient hierarchical technique is presented for obtaining dense stereo correspondence using a color image pyramid. We show that matching results of high quality are obtained when using the hierarchical chromatic Block Matching algorithm. Furthermore, we present some results for parallel implementations of the algorithm. Most stereo matching algorithms can not compute correct dense depth ma...

In this paper we present a comparison study between different aggregation functions for the combination of RGB color channels in stereo matching problem. We introduce color information from images to the stereo matching algorithm by aggregating the similarities of the RGB channels which are calculated independently. We compare the accuracy of different stereo matching algorithms and aggregation...

A 2-assignment on a graph G = (V; E) is a collection of pairs L(v) of allowed colors speciied for all vertices v 2 V. The graph G (with at least one edge) is said to have oriented choice number 2 if it admits an orientation which satisses the following property : For every 2-assignment there exists a choice c(v) 2 L(v) for all v 2 V such that (i) if c(v) = c(w), then vw = 2 E, and (ii) for ever...

Let (G,C) be an (edge-)colored bipartite graph with bipartition (X, Y ) and |X| = |Y | = n. A heterochromatic matching of G is such a matching in which no two edges have the same color. Let N c(S) denote a maximum color neighborhood of S ⊆ V (G). In a previous paper, we showed that if N c(S) ≥ |S| for all S ⊆ X or S ⊆ Y , then G has a heterochromatic matching with cardinality at least d3n−1 8 e...

Let (G,C) be an edge-colored bipartite graph with bipartition (X,Y ). A heterochromatic matching of G is such a matching in which no two edges have the same color. Let N c(S) denote a maximum color neighborhood of S ⊆ V (G). We show that if |N c(S)| ≥ |S| for all S ⊆ X, then G has a heterochromatic matching with cardinality at least d |X| 3 e. We also obtain that if |X| = |Y | = n and |N c(S)| ...

Stereo is a well-known technique for obtaining depth information from digital images. Nevertheless, this technique still suffers from a lack in accuracy and/or long computation time needed to match stereo images. A new hierarchical algorithm using an image pyramid for obtaining dense depth maps from color stereo images is presented. We show that matching results of high quality are obtained whe...