Improved Density Peak Clustering Based on Information Entropy for Ancient Character Images

被引:6
|
作者
Weng, Yu [1 ]
Zhang, Ning [1 ]
Yang, Xiaoxian [2 ]
机构
[1] Minzu Univ China, Sch Informat Engn, Beijing 100081, Peoples R China
[2] Shanghai Polytech Univ, Sch Comp & Informat Engn, Shanghai 201209, Peoples R China
来源
IEEE ACCESS | 2019年 / 7卷
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
Density peak clustering; information entropy; ancient character image; FAST SEARCH; ANNOTATION; FIND;
D O I
10.1109/ACCESS.2019.2923694
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A large number of IoT applications require the use of supervised machine learning, a type of machine learning algorithm that requires data to be labeled before the model can be trained. Because manually labeling large datasets is a time-consuming,error-prone, and expensive task, automated machine learning methods can be used. To tackle the challenge in which an ancient character image needs to be manually labeled, this paper explores the classification method of ancient Chinese character images based on density peak clustering. We design a metric function of density peak clustering and propose an improved density peak clustering method based on information entropy for ancient book image classification. The method enumerates the distance threshold of clustering, then calculates the information entropy of the clustering result, and determines the class distance threshold by analyzing the attenuation of the information entropy, thereby completing the image clustering process. The improved metric function is used to calculate the similarity between images. A greedy strategy is used as the basis of the merging operation of the class members to achieve the purpose of increasing the degree of information entropy attenuation. The experimental results on the dataset of the Yi character images prove that the method can accurately classify unknown character images of ancient books.
引用
收藏
页码:81691 / 81700
页数:10
相关论文
共 50 条
  • [1] Hybrid Clustering Algorithm Based on Improved Density Peak Clustering
    Guo, Limin
    Qin, Weijia
    Cai, Zhi
    Su, Xing
    APPLIED SCIENCES-BASEL, 2024, 14 (02):
  • [2] A Density Peak Clustering Algorithm Based on Information Bottleneck
    Liu, Yongli
    Zhao, Congcong
    Chao, Hao
    JOURNAL OF INFORMATION PROCESSING SYSTEMS, 2023, 19 (06): : 778 - 790
  • [3] A retrieval method of ancient Chinese character images based on neighbor clustering
    Jiang, Li
    Yang, Fang
    Miao, Xiufen
    Ha, Yan
    Tian, Xuedong
    2011 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), VOLS 1-4, 2012, : 1686 - 1689
  • [4] An Improved Density Peak Clustering Algorithm
    Hou, Jian
    E, Xu
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2017, 2017, 10585 : 211 - 221
  • [5] Microfeature Segmentation Algorithm for Biological Images Using Improved Density Peak Clustering
    Li, Man
    Sha, Haiyin
    Liu, Hongying
    COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE, 2022, 2022
  • [6] An Improved Clustering Algorithm Based on Density Peak and Nearest Neighbors
    Zhao, Chao
    Yang, Junchuang
    Wen, Kexin
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2022, 2022
  • [7] Pear flower density classification based on improved density peak clustering algorithm
    Zhou G.
    Sun L.
    Liang F.
    Zhang X.
    Nongye Gongcheng Xuebao/Transactions of the Chinese Society of Agricultural Engineering, 2023, 39 (01): : 126 - 135
  • [8] An improved hierarchical clustering method based on the k-NN and density peak clustering
    Shi, Zhicheng
    Guo, Renzhong
    Zhao, Zhigang
    TRANSACTIONS IN GIS, 2023, 27 (08) : 2197 - 2212
  • [9] An entropy-based density peak clustering for numerical gene expression datasets
    Maheshwari, Rashmi
    Mishra, Amaresh Chandra
    Mohanty, Sraban Kumar
    APPLIED SOFT COMPUTING, 2023, 142
  • [10] An improved evolutionary density peak clustering algorithm
    Li, Peng
    Xie, Haibin
    Jiang, Tianrui
    Yan, Jiading
    PROCEEDINGS OF THE 33RD CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2021), 2021, : 2252 - 2257