IHBM: Integrated Histogram Bin Matching For Similarity Measures of Color Image Retrieval

نویسندگان

  • V. Vijaya Kumar
  • N. Gnaneswara Rao
چکیده

The selection of “proper similarity measure” of color histograms is an essential consideration for the success of many methods. The Histogram Quadratic Distance Measure (HQDM) is a metric distance. Till today, this method is supposed to be the better choice, But it holds a disadvantage that it can compute the cross similarity between all elements of histograms. Therefore, computationally it is more expensive. This paper proposes a method that is known as Integrated Histogram Bin Matching (IHBM) which is also a metric method, and overcomes the disadvantages of the HQDM. The proposed IHBM first matches the closest Histogram Bin Pair according to the distance matrix determined from color histograms, which satisfies the Monge condition. After matching histogram bins, the similarity measure is computed as a weighed sum of the similarity between histogram bin pairs, with weights determined by the matching scheme. The proposed IHBM is experimented on 1000 color images and results are compared with the existing methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image Retrieval Using Dynamic Weighting of Compressed High Level Features Framework with LER Matrix

In this article, a fabulous method for database retrieval is proposed.  The multi-resolution modified wavelet transform for each of image is computed and the standard deviation and average are utilized as the textural features. Then, the proposed modified bit-based color histogram and edge detectors were utilized to define the high level features. A feedback-based dynamic weighting of shap...

متن کامل

Color scene transform between images using Rosenfeld-Kak histogram matching method

In digital color imaging, it is of interest to transform the color scene of an image to the other. Some attempts have been done in this case using, for example, lαβ color space, principal component analysis and recently histogram rescaling method. In this research, a novel method is proposed based on the Resenfeld and Kak histogram matching algorithm. It is suggested that to transform the color...

متن کامل

Content-based Image Retrieval using Image Partitioning with Color Histogram and Wavelet-based Color Histogram of the Image

This paper presents two content-based image retrieval algorithms that are based on image partitioning. The retrieval in the first algorithm is based only on the image color feature represented by the color histogram, while the retrieval in the second one is based on the image color and texture features represented by the color histogram and Haar wavelet transform, respectively. In these algorit...

متن کامل

Color invariant object recognition using entropic graphs

We present an object recognition approach using higher order color invariant features with an entropy based similarity measure. Two methods to compare images are: 1) histogram matching and 2) assuming a fixed probability density function. Histogram bin size is usually set in an ad-hoc manner, where the best bin size for a specific application is experimentally determined. Another solution to im...

متن کامل

Fuzzy color histogram and its use in color image retrieval

A conventional color histogram (CCH) considers neither the color similarity across different bins nor the color dissimilarity in the same bin. Therefore, it is sensitive to noisy interference such as illumination changes and quantization errors. Furthermore, CCHs large dimension or histogram bins requires large computation on histogram comparison. To address these concerns, this paper presents ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009