Measuring Classification Complexity of Image Databases: A Novel Approach

Authors:
A. F. R. Rahman;M. C. Fairhurst
Affiliations:
-;-
Venue:
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Year:
1999

Citing 0
Cited 3

Multiresolution Estimates of Classification Complexity

IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiresolution estimates of classification complexity and multiple subspace classifiers for understanding and solving complex recognition tasks

SPPRA'06 Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applications
Intelligence and computation: a view from physiology

IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel approach for estimating classification complexities of various image databases holding similar types of data is proposed. A new measure indicating the relative complexity of classification for an image database has been defined in terms of the statistical similarities existing between various samples belonging to various classes in the database. The proposed measure has been applied to five widely available databases containing samples of handwritten and machine printed characters and has been found to be very accurate in predicting the relative classification complexity of these databases. The proposed complexity measure is completely generalized and is applicable to the assessment of the relative classification complexity of any image database relative to any other databases containing similar types of images.