By Topic

Robust color-based image retrieval using bipartite graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. A. Nascimento ; Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada ; Shengiiu Wang

The global color histogram is a well-known as a simple and often effective way to perform color-based image retrieval. However, it lacks information about the location of the image colors. While on the one hand the use of a grid of cells superimposed on the images and the use of local color histograms for each such cell improves retrieval, in the sense that some notion of color location is taken into account, on the other hand retrieval now becomes sensitive to image rotation and translation. In this short paper we present a new way to model image similarity, also using colors and a superimposing grid, via bipartite graphs. As a result the technique is able to take advantage of color location but is no longer sensitive to rotation and translation.

Published in:

Multimedia and Expo, 2002. ICME '02. Proceedings. 2002 IEEE International Conference on  (Volume:2 )

Date of Conference:

2002