A CONTEXT-BASED APPROACH FOR COLOR IMAGE RETRIEVAL

2002 ◽  
Vol 16 (02) ◽  
pp. 239-255 ◽  
Author(s):  
JAU-LING SHIH ◽  
LING-HWEI CHEN
Keyword(s):  
Image Retrieval ◽  
Similarity Measure ◽  
Relevance Feedback ◽  
Color Image ◽  
Experimental Results ◽  
Retrieval Method ◽  
Feature Vectors ◽  
The Mean ◽  
Feedback Algorithm

In this paper, a color image retrieval method based on the primitives of images will be proposed. First, the context of each pixel in an image will be defined. Then, the contexts in the image are clustered into several classes based on the algorithm of fast noniterative clustering. The mean of the context in the same class is considered as a primitive of the image. The primitives are used as feature vectors. Since the numbers of primitives between images are different, a specially designed similarity measure is then proposed to do color image retrieval. To better adapt to the preferences of users, a relevance feedback algorithm is provided to automatically determine the weight of each primitive according to the user's response. To demonstrate the effectiveness of the proposed system, several test databases from Corel are used to compare the performances of the proposed system with other methods. The experimental results show that the proposed system is superior to others.

A COLOR IMAGE RETRIEVAL METHOD BASED ON COLOR MOMENT AND COLOR VARIANCE OF ADJACENT PIXELS

2002 ◽  
Vol 16 (01) ◽  
pp. 113-125 ◽  
Author(s):  
YUNG-KUAN CHAN ◽  
CHIN-CHEN CHANG
Keyword(s):  
Image Retrieval ◽  
Similarity Measure ◽  
Spatial Information ◽  
Color Image ◽  
Image Features ◽  
Experimental Results ◽  
Retrieval Method ◽  
Color Moment

This paper first introduces three simple and effective image features — the color moment (CM), the color variance of adjacent pixels (CVAP) and CM–CVAP. The CM feature delineates the color-spatial information of images, and the CVAP feature describes the color variance of pixels in an image. However, these two features can only characterize the content of images in different ways. This paper hence provides another feature CM–CVAP, which combines both, to raise the quality of similarity measure. The experimental results show that the image retrieval method based on the CM–CVAP feature gives quite an impressive performance.

Multi-Instance Learning for Image Retrieval with Relevance Feedback

2013 ◽  
Vol 427-429 ◽  
pp. 1606-1609 ◽  
Author(s):  
Tao Chen ◽  
Hui Fang Deng
Keyword(s):  
Image Retrieval ◽  
Objective Function ◽  
Relevance Feedback ◽  
Image Data ◽  
Experimental Results ◽  
Data Sets ◽  
Digital Repository ◽  
Novel Method

In this paper, we propose a novel method for image retrieval based on multi-instance learning with relevance feedback. The process of this method mainly includes the following three steps: First, it segments each image into a number of regions, treats images and regions as bags and instances respectively. Second, it constructs an objective function of multi-instance learning with the query images, which is used to rank the images from a large digital repository according to the distance values between the nearest region vector of each image and the maximum of the objective function. Third, based on the users relevance feedback, several rounds may be needed to refine the output images and their ranks. Finally, a satisfying set of images will be returned to users. Experimental results on COREL image data sets have demonstrated the effectiveness of the proposed approach.

Similarity Measure for Image Retrieval Based on Hausdorff Distance

2014 ◽  
Vol 635-637 ◽  
pp. 1039-1044 ◽  
Author(s):  
He Qun Qiang ◽  
Chun Hua Qian ◽  
Sheng Rong Gong
Keyword(s):  
Image Retrieval ◽  
Pattern Matching ◽  
Similarity Measure ◽  
Hausdorff Measure ◽  
Hausdorff Distance ◽  
Experimental Result ◽  
Feature Vectors ◽  
Image Query ◽  
Feature Values ◽  
Object Similarity

In general, it is difficult to segment accurately image regions or boundary contours and represent them by feature vectors for shape-based image query. Therefore, the object similarity is often computed by their boundaries. Hausdorff distance is nonlinear for computing distance, it can be used to measure the similarity between two patterns of points of edge images. Classical Hausdorff measure need to express image as a feature matrix firstly, then calculate feature values or feature vectors, so it is time-consuming. Otherwise, it is difficult for part pattern matching when shadow and noise existed. In this paper, an algorithm that use Hausdorff distance on the image boundaries to measure similarity is proposed. Experimental result has showed that the proposed algorithm is robust.

Sign in / Sign up

Export Citation Format

Share Document