Stereo Matching can provide important information about the environment for many autonomous systems. Usually one of the demands for these systems is real-time or almost real-time running. This is why we studied how to adapt two stereo matching measures to this demand, by providing an implementation on a GPU . For stereo matching algorithm a simple local approach based on window aggregation was ...

Many fundamental computer vision problems, including optical flow estimation and stereo matching, involve the key step of computing dense color matching among pixels. In this paper, we show that by merely upsampling, we can improve sub-pixel correspondence estimation. In addition, we identify the regularization bias problem and explore its relationship to image resolution. We propose a general ...

Let G be an (edge-)colored graph. A heterochromatic matching of G is a matching in which no two edges have the same color. For a vertex v, let d(v) be the color degree of v. We show that if d(v) ≥ k for every vertex v of G, then G has a heterochromatic matching of size ⌈ 5k−3 12 ⌉ . For a colored bipartite graph with bipartition (X,Y ), we prove that if it satisfies a Hall-like condition, then ...

Color and color neighborhood statistics have been used extensively in image matching and retrieval. However, the effective incorporation of color layout information remains a challenging issue. In this paper we present a novel method for color layout based image matching called Spatial Color Component Matching (SCCM). First perceptually dominant colors are extracted from an image and are back-p...

We have examined how color appearance varies with spatial pattern. Subjects set color-matches between a uniform, 2 deg matching field and bars within squarewave patterns (1,2 and 4 c/deg) or the superposition of these squarewaves. The matches were set using squarewaves and squarewave mixtures with many different colors and contrasts. The color-matches satisfied the basic properties of a linear ...

The question whether alphanumerical category is involved in the control of attentional target selection during visual search remains a contentious issue. We tested whether category-based attentional mechanisms would guide the allocation of attention under conditions where targets were defined by a combination of alphanumerical category and a basic visual feature, and search displays could conta...

BACKGROUND/AIM Color matching in prosthodontic therapy is a very important task because it influences the esthetic value of dental restorations. Visual shade matching represents the most frequently applied method in clinical practice. Instrumental measurements provide objective and quantified data in color assessment of natural teeth and restorations. In instrumental shade analysis, the goal is...

We present a method to give single band intensified nightvision imagery a natural day-time color appearance. For input, the method requires a true color RGB source image and a grayscale nightvision target image. The source and target image are both transformed into a perceptually decorrelated color space. In this color space a best matching source pixel is determined for each pixel of the targe...

Image matching is the primary and important process which is mainly used in target tracking, space exploration, 3D reconstruction, modification identification. The existing system is utilizes the Scale Invariant Feature Transform (SIFT) is used to identifying corresponding points becomes difficult in the case of changing illumination or two surfaces with a similar intensity. Image retrieval ref...

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