Color histogram is used widely for retrieving images , and the processing mostly concerns the choice and quantization of color space , the definition of color histogram and the distance of two points in color histogram space 基于顏色直方圖的檢索方法是使用最為普遍的方法,該過(guò)程主要涉及圖像顏色空間的選擇、顏色空間的量化、顏色直方圖定義以及直方圖空間中距離的定義等。
In 1998 , zhou , xiong and zhu improved sh algorithm by reducing this complexity to 2n - lg n . in this paper , we make further improvement . the overall complexity of computing distances is reduced to 3n - lg n 2 , which is only half that of sh algorithm 但是距離的計(jì)算量相對(duì)于其他基本代數(shù)或者邏輯操作來(lái)說(shuō)開銷比較大,所以如何降低整個(gè)算法過(guò)程中距離的計(jì)算次數(shù)成為我們考慮的重點(diǎn),我們改進(jìn)的目標(biāo)就是使得計(jì)算距離的復(fù)雜度盡可能的小。