Image Retrieval based on HSV Feature and Regional Shannon Entropy

Image Retrieval based on HSV Feature and Regional Shannon Entropy

Liang Lei, Jun Peng, Bo Yang
Copyright: © 2012 |Pages: 17
DOI: 10.4018/jssci.2012040104
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

How to quickly retrieve the image is a very action research topic in the research of image retrieval based on Web. This paper focuses on dimensionality reduction and similarity measure of Web image. First, the paper presents the current commercial search engines how to look for Web images. Then, it describes commonly used methods of the dimension reduction for Web images, followed by proposing the conversion from RGB to HSV and dominant color extraction algorithm based on HSV features, where the HSV color histogram intersection was used as the function of similarity judgments. And the similarity measure based on regional Shannon entropy is discussed. Finally, some improvements are made on computing the regional Shannon mutual information. The experiments and results, which based on FERET database, MIT face database and Corel database, showed that this method has greatly improved the image retrieval in time and precision rates.
Article Preview
Top

2. Image Dimension Reduction Based On Hsv Feature

The basic principle of Web Image Dimensional Reduction is mapped to a low-dimensional space from the input space via a linear or nonlinear mode, and thus to obtain a compact low-dimensional expression on the original data sets.

Complete Article List

Search this Journal:
Reset
Volume 16: 1 Issue (2024)
Volume 15: 1 Issue (2023)
Volume 14: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 13: 4 Issues (2021)
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing