Histogram Matching Schemes for Image Thresholding
Salah Ameer1 Show affiliations
- Humber College, Canada
American Journal of Engineering and Applied Sciences, Volume 12, Issue 3, pp. 413–419 · doi.org/10.3844/ajeassp.2019.413.419
Abstract
This paper proposes several novel schemes for image thresholding. The idea is simply to compare the original image histogram to that of the thresholded image. Element by element comparison (sum of absolute difference between the two histograms) is found to be of better performance than a single feature (area or size) comparison. The optimum threshold is the one producing the best comparison. Cumulative histogram is introduced as a generalization to the area under the curve and found to be of better performance. In addition, a new performance measure is suggested based on percentage of correct assignments in both foreground and background. Comparative results with Otsu shows the effectiveness of the proposed schemes.
Licence and reuse
Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.
How to reuse this articleResponses (0)
About this article
Ameer, S. (2019). Histogram Matching Schemes for Image Thresholding. American Journal of Engineering and Applied Sciences, 12(3), 413–419. https://doi.org/10.3844/ajeassp.2019.413.419
- Licence
- CC BY 3.0
- Issue
- Volume 12, Issue 3
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
