दो हिस्टोग्राम के बीच बहुत दूरी के उपाय हैं। आप इन उपायों का एक अच्छा वर्गीकरण पढ़ सकते हैं:
के। मेशगी, और एस। इशी, "ट्रैकिंग सटीकता में सुधार के लिए ग्रिडिंग के साथ रंगों का विस्तार हिस्टोग्राम," प्रोक में। एमवीए 15, टोक्यो, जापान, मई 2015।
आपकी सुविधा के लिए सबसे लोकप्रिय दूरी के कार्य यहां सूचीबद्ध हैं:
DL0=∑ih1(i)≠h2(i)
- L1 , मैनहट्टन, या सिटी ब्लॉक दूरी
DL1=∑i|h1(i)−h2(i)|
- L=2 या यूक्लिडियन दूरी
डीएल 2= ∑मैं( ज)1( i ) - एच2( i ) )2---------------√
डीएल ∞= एम ए एक्समैं| ज1( i ) - एच2( i ) |
- एल पी या आंशिक दूरी (मिंकोवस्की दूरी परिवार का हिस्सा)पी
डीएल पी= ( ∑मैं| ज1( i ) - एच2( i ) |पी)1 / पी और० < p < १
D∩=1−∑i(min(h1(i),h2(i))min(|h1(i)|,|h2(i)|)
DCO=1−∑ih1(i)h2(i)
DCB=∑i|h1(i)−h2(i)|min(|h1(i)|,|h2(i)|)
- पियर्सन के सहसंबंध गुणांक
DCR=∑i(h1(i)−1n)(h2(i)−1n)∑i(h1(i)−1n)2∑i(h2(i)−1n)2√
- कोलमोगोरोव-स्मिरनोव डायवर्स्टी
DKS=maxi|h1(i)−h2(i)|
DMA=∑i|h1(i)−h2(i)|
DCM=∑i(h1(i)−h2(i))2
Dχ2=∑i(h1(i)−h2(i))2h1(i)+h2(i)
DBH=1−∑ih1(i)h2(i)−−−−−−−−√−−−−−−−−−−−−−−−−√ और हेलिंगर
DSC=∑i(h1(i)−−−−√−h2(i)−−−−√)2
DKL=∑ih1(i)logh1(i)m(i)
DJD=∑i(h1(i)logh1(i)m(i)+h2(i)logh2(i)m(i))
DEM=minfij∑i,jfijAijsumi,jfij
∑jfij≤h1(i),∑jfij≤h2(j),∑i,jfij=min(∑ih1(i)∑jh2(j)) and fij represents the flow from
i to j
DQU=∑i,jAij(h1(i)−h2(j))2−−−−−−−−−−−−−−−−−−−√
DQC=∑i,jAij(h1(i)−h2(i)(∑cAci(h1(c)+h2(c)))m)(h1(j)−h2(j)(∑cAcj(h1(c)+h2(c)))m)−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−√ and 00≡0
A Matlab implementation of some of these distances is available from my GitHub repository:
https://github.com/meshgi/Histogram_of_Color_Advancements/tree/master/distance
Also you can search guys like Yossi Rubner, Ofir Pele, Marco Cuturi and Haibin Ling for more state-of-the-art distances.
Update: Alternative explaination for the distances appears here and there in the literature, so I list them here for sake of completeness.
- Canberra distance (another version)
DCB=∑i|h1(i)−h2(i)||h1(i)|+|h2(i)|
- Bray-Curtis Dissimilarity, Sorensen Distance (since the sum of histograms are equal to one, it equals to DL0)
DBC=1−2∑ih1(i)=h2(i)∑ih1(i)+∑ih2(i)
- Jaccard Distance (i.e. intersection over union, another version)
DIOU=1−∑imin(h1(i),h2(i))∑imax(h1(i),h2(i))