Multilevel image thresholding is a complex task in image processing as it requires determining more than one thresholds, mostly using meta-heuristics. In popular entropy-based multilevel image thresholding techniques, the major challenges include computing the appropriate value of the entropic parameter automatically from image data and evaluating the performance of an algorithm in the absence of ground-truth images. The paper presents a new algorithm utilizing normalized sum of absolute differences metric. By selecting four different optimization methods and four entropy measures, sixteen variants of the proposed algorithm are developed. A large-scale performance analysis is conducted using 753 images from diverse domains consisting of a total of 48192 experiments. It is observed that SAD metric based new variants provide better performance in the absence of ground-truth images at the cost of slightly higher computation time.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Performance Analysis of Entropy-Based Meta-heuristic Image Multilevel Thresholding Techniques Using SAD Metric

  • Abhishek Dhapola,
  • Shachi Sharma

摘要

Multilevel image thresholding is a complex task in image processing as it requires determining more than one thresholds, mostly using meta-heuristics. In popular entropy-based multilevel image thresholding techniques, the major challenges include computing the appropriate value of the entropic parameter automatically from image data and evaluating the performance of an algorithm in the absence of ground-truth images. The paper presents a new algorithm utilizing normalized sum of absolute differences metric. By selecting four different optimization methods and four entropy measures, sixteen variants of the proposed algorithm are developed. A large-scale performance analysis is conducted using 753 images from diverse domains consisting of a total of 48192 experiments. It is observed that SAD metric based new variants provide better performance in the absence of ground-truth images at the cost of slightly higher computation time.