Efficient matching of large-size histograms

Authors:
Fan-Di Jou;Kuo-Chin Fan;Yang-Lang Chang
Affiliations:
Institute of Computer Science and Information Engineering, National Central University, Chung-Li 32054, Taiwan, ROC;Institute of Computer Science and Information Engineering, National Central University, Chung-Li 32054, Taiwan, ROC;Institute of Computer Science and Information Engineering, National Central University, Chung-Li 32054, Taiwan, ROC
Venue:
Pattern Recognition Letters
Year:
2004

Citing 5
Cited 14

Color indexing

International Journal of Computer Vision
Comparing images using color coherence vectors

MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
Query by Image and Video Content: The QBIC System

Computer
Efficient Color Histogram Indexing for Quadratic Form Distance Functions

IEEE Transactions on Pattern Analysis and Machine Intelligence
Finding Waldo, or Focus of Attention Using Local Color Information

IEEE Transactions on Pattern Analysis and Machine Intelligence

Signatures versus histograms: Definitions, distances and algorithms

Pattern Recognition
Combining neighbourhood-based and histogram similarity measures for the design of image quality measures

Image and Vision Computing
Modeling human color categorization

Pattern Recognition Letters
A new similarity measure for histogram comparison and its application in time series analysis

Pattern Recognition Letters
Efficient multi-resolution histogram matching for fast image/video retrieval

Pattern Recognition Letters
A new algorithm to compute the distance between multi-dimensional histograms

CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
A statistical image retrieval method using color invariant

CIRA'09 Proceedings of the 8th IEEE international conference on Computational intelligence in robotics and automation
Histograms, wavelets and neural networks applied to image retrieval

MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
An efficient distance between multi-dimensional histograms for comparing images

SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
A fast distance between histograms

CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
Unsupervised and reliable image matting based on modified spectral matting

Journal of Visual Communication and Image Representation
Automatic image matting using component-hue-difference-based spectral matting

ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
Automatic spectral video matting

Pattern Recognition
Spin image revisited: fast candidate selection using outlier forest search

ACCV'12 Proceedings of the 11th international conference on Computer Vision - Volume 2

Quantified Score

Hi-index	0.10

Visualization

Abstract

As we know, histogram matching is a commonly-adopted technique in the applications of pattern recognition. The matching of two patterns can be accomplished by matching their corresponding histograms. In general, the number of features and the resolution of each feature will determine the size of histogram. The more the number of features and the higher the resolution of each feature, the stronger the discrimination capability of histogram will be. Unfortunately, the increase of histogram size will lead to the decrease of the efficiency of histogram matching because traditional algorithms in evaluating similarity are all relevant to the histogram size. In this paper, a novel histogram-matching algorithm is proposed whose efficiency is irrelevant to the histogram size. The proposed algorithm can be applied to commonly-adopted histogram similarity measurement functions, such as histogram intersection function, L1 norm, L2 norm, χ2 test and so on. By adopting our proposed algorithm, future researchers can focus more on the selection and combination of histogram features and freely adjust the resolution of each feature without worrying the decrease of retrieval efficiency.