A Histogram Equalization Algorithm Based On Building A Grey Level Binary Tree Dynamically
OPTIK(2020)
摘要
Histogram equalization algorithms may produce artifacts when the image is enhanced. Complex filtering algorithms are used for good results, or end-to-end deep learning networks are implemented for image enhancement. The competitive algorithm proposed in this paper uses a binary tree structure to remap grayscale and suppress artifacts. The algorithm can get different degrees of image enhancement results by changing unique variables. The proposed competitive algorithm can also be used to expand the dataset of deep learning tasks. Code and figures are available at https://github.com/F-Quasimo/DEBTHE.y
更多查看译文
关键词
Data structure, Histogram equalization, Image enhancement, Binary tree, Grey mapping
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络