Classification of high-dimension PDFs using the hungarian algorithm

Authors:
James S. Cope;Paolo Remagnino
Affiliations:
Digital Imaging Research Centre, Kingston University, London, UK;Digital Imaging Research Centre, Kingston University, London, UK
Venue:
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Year:
2012

Citing 6
Cited 0

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Representing and Recognizing the Visual Appearance of Materials using Three-dimensional Textons

International Journal of Computer Vision
Video Google: A Text Retrieval Approach to Object Matching in Videos

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Spatial Weighting for Bag-of-Visual-Words and Its Application in Content-Based Image Retrieval

PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
A Statistical Approach to Material Classification Using Image Patch Exemplars

IEEE Transactions on Pattern Analysis and Machine Intelligence
Review: Plant species identification using digital morphometrics: A review

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Hungarian algorithm can be used to calculate the earth mover's distance, as a measure of the difference between two probability density functions, when the pdfs are described by sets of n points sampled from their distributions. However, information generated by the algorithm about precisely how the pdfs are different is not utilized. In this paper, a method is presented that incorporates this information into a 'bag-of-words' type method, in order to increase the robustness of a classification. This method is applied to an image classification problem, and is found to outperform several existing methods.