The quadratic-chi histogram distance family

作者: Ofir Pele , Michael Werman

DOI: 10.1007/978-3-642-15552-9_54

关键词:

摘要: We present a new histogram distance family, the Quadratic-Chi (QC). QC members are Quadratic-Form distances with cross-bin χ2-like normalization. The normalization reduces effect of large bins having undo influence. Normalization was shown to be helpful in many cases, where χ2 outperformed L2 norm. However, is sensitive quantization effects, such as caused by light changes, shape deformations etc. part takes care relationships (e.g. red and orange), alleviating problem. two crossbin properties: Similarity-Matrix-Quantization-Invariance Sparseness-Invariance show that have these properties.We also experimentally they boost performance. computation time complexity linear number non-zero entries bin-similarity matrix histograms it can easily parallelized.We results for image retrieval using Scale Invariant Feature Transform (SIFT) color descriptors. In addition, we classification Shape Context (SC) Inner Distance (IDSC). outperform state art tasks, while short running time. experimental both property important.

参考文章(41)
Marc Wichterich, Ira Assent, Thomas Seidl, Adaptable Distance Functions for Similarity-based Multimedia Retrieval. Datenbank-spektrum. ,vol. 19, pp. 23- 31 ,(2006)
Marcello D’Agostino, Valentino Dardanoni, What’s so special about Euclidean distance? Social Choice and Welfare. ,vol. 33, pp. 211- 233 ,(2009) , 10.1007/S00355-008-0353-5
Ofir Pele, Michael Werman, A Linear Time Histogram Metric for Improved SIFT Matching Lecture Notes in Computer Science. pp. 495- 508 ,(2008) , 10.1007/978-3-540-88690-7_37
Yossi Rubner, Carlo Tomasi, The Earth Mover’s Distance Springer, Boston, MA. pp. 13- 28 ,(2001) , 10.1007/978-1-4757-3343-3_2
S. Kullback, R. A. Leibler, On Information and Sufficiency Annals of Mathematical Statistics. ,vol. 22, pp. 79- 86 ,(1951) , 10.1214/AOMS/1177729694
G. M. Guisewite, P. M. Pardalos, Minimum concave-cost network flow problems: Applications, complexity, and algorithms Annals of Operations Research. ,vol. 25, pp. 75- 99 ,(1990) , 10.1007/BF02283688
A Amiri, H Pirkul, New formulation and relaxation to solve a concave-cost network flow problem Journal of the Operational Research Society. ,vol. 48, pp. 278- 287 ,(1997) , 10.1057/PALGRAVE.JORS.2600363
Gaurav Sharma, Wencheng Wu, Edul N. Dalal, The CIEDE2000 color-difference formula: Implementation notes, supplementary test data, and mathematical observations Color Research and Application. ,vol. 30, pp. 21- 30 ,(2005) , 10.1002/COL.20070
Yossi Rubner, Jan Puzicha, Carlo Tomasi, Joachim M Buhmann, Empirical Evaluation of Dissimilarity Measures for Color and Texture Computer Vision and Image Understanding. ,vol. 84, pp. 25- 43 ,(2001) , 10.1006/CVIU.2001.0934
Ming R. Luo, CIE 2000 color difference formula: CIEDE2000 9th Congress of the International Colour Association. ,vol. 4421, pp. 554- 559 ,(2002) , 10.1117/12.464549