Computer and Modernization ›› 2009, Vol. 1 ›› Issue (11): 139-142.doi:

• 图像处理 • Previous Articles     Next Articles

Image Retrieval of Sub-image Color Histogram Based on Binary Tree Quantification

WU Yuan-ren1,2   

  1. 1.College of Computer Science and Technology, Huaqiao University, Quanzhou 362021, China;2.Dongfang Middle School of Quanzhou An’xi, Quanzhou 362411, China
  • Received:2009-08-03 Revised:1900-01-01 Online:2009-11-30 Published:2009-11-30

Abstract: In order to solve that the existing color histogram retrieval technology exists less robust, feature dimension is too high and so on, a binary tree at all levels based on image pixel sub-image color histogram of image retrieval methods is proposed. First of all, the method combines the characteristics of noise attack, extracts important image pixels of the binary tree at all levels to quantify sub-image color histogram and the right to determine their visual value; then constructs an important tree image pixel color sub-image histogram; finally, important sub-binary tree image pixel color histogram for the characteristics of images to calculate the similarity between images and content retrieval. Simulation results show that this method is not only able to accurately retrieve the user desired image, but also for light, sharpening, fuzzy and other attacks has a better noise robustness.

Key words: image retrieval, pixel tree, quantification subgraph, color histogram, noise