In the context of computer vision, stereo matching can be done using correlation measures. Few papers deal with color correlationbased matching so the underlying problem of this paper is about how it can be adapted to color images. The goals of this work are to help choosing a color space and to generalize the correlation measures to color. Nine color spaces and three different methods have bee...

This paper presents a color matching technique using weighted subspace on medicine package recognition. The proposed method is more compact and lowercomplex than scalable color descriptor and dominant color descriptor, which are employed by MPEG-7. Our method is based on subspace matching: A color object is treated as a subspace derived from its color distribution. Unlike mutual subspace method...

Template matching is a technique widely used for finding patterns in digital images. An efficient template matching algorithm should be able to detect template instances that have undergone geometric transformations. Similarly, a color template matching should be able to deal with color constancy problem. Recently we have proposed a new grayscale template matching algorithm named Ciratefi, inva...

Color based image retrieval is an important research area in digital image processing and Color is the useful property of the image. The challenging task is to find an efficient and accurate color images similar value and some limitations between two different types of image are matching such as compressed color image and RGB color image, RGB image and HSV color image, color image and 90 degree...

Given a set of n points P in the plane, each colored with one of the t given colors, a color-spanning set S ⊂ P is a subset of t points with distinct colors. The minimum diameter color-spanning set (MDCS) is a color-spanning set whose diameter is minimum (among all color-spanning sets of P ). Somehow symmetrically, the largest closest pair color-spanning set (LCPCS) is a color-spanning set whos...