Method for pigment spectral matching identification based on adaptive levenshtein distance

被引:2
|
作者
Wang, Ke [1 ,2 ]
Wang, Huiqin [1 ,2 ]
Wang, Zhan [3 ]
Yin, Ying [2 ]
Mao, Li [2 ]
Zhang, Yi [2 ]
机构
[1] Xian Univ Architecture & Technol, Sch Management, Xian 710055, Shaanxi, Peoples R China
[2] Xian Univ Architecture & Technol, Sch Informat & Control Engn, Xian 710055, Shaanxi, Peoples R China
[3] Shaanxi Prov Inst Cultural Rel Protect, Xian 710075, Shaanxi, Peoples R China
来源
OPTIK | 2019年 / 178卷
基金
中国国家自然科学基金;
关键词
Spectral matching; Levenshtein distance; Adaptive threshold; Pigment identification;
D O I
10.1016/j.ijleo.2018.09.043
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
In order to solve the low accuracy of the classic spectral matching algorithms in matching the spectral data of different pigment materials in the homochromatic similar system, this paper proposed a spectral matching algorithm based on adaptive threshold levenshtein distance. The levenshtein distance was researched to improve the matching accuracy by using its characteristics of to be sensitive to the spectral reflectance difference. At the same time, by adaptively setting the judgment condition of levenshtein distance, the error of this algorithm in matching the spectral data of the same pigment material under different conditions is reduced. And the identification accuracy of different pigment materials in the homochromatic similar system is improved. The experimental results show that compared with the traditional spectral matching algorithm, the matching accuracy of the adaptive levenshtein distance algorithm is higher, and the identification result for the pigment is better.
引用
收藏
页码:74 / 82
页数:9
相关论文
共 50 条
  • [1] Pigment Spectral Matching Recognition Method Based on Adaptive Edit Distance
    Wang Ke
    Wang Huiqin
    Yin Ying
    Mao Li
    Zhang Yi
    LASER & OPTOELECTRONICS PROGRESS, 2018, 55 (11)
  • [2] Levenshtein distance for graph spectral features
    Wilson, RC
    Hancock, ER
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 2, 2004, : 489 - 492
  • [3] A Clustering Method of Encrypted Video Traffic Based on Levenshtein Distance
    Yang, Luming
    Fu, Shaojing
    Luo, Yuchuan
    Wang, Yongjun
    Zhao, Wentao
    2021 17TH INTERNATIONAL CONFERENCE ON MOBILITY, SENSING AND NETWORKING (MSN 2021), 2021, : 1 - 8
  • [4] An Automatic Error Identification Method in Call Control Protocol Using Levenshtein Distance
    Umoto, Keishu
    Ata, Shingo
    Chimura, Yasubumi
    Nakamura, Nobuyuki
    Yao, Taketsugu
    2020 23RD CONFERENCE ON INNOVATION IN CLOUDS, INTERNET AND NETWORKS AND WORKSHOPS (ICIN 2020), 2020, : 266 - 273
  • [5] Enhancing Iris Matching Using Levenshtein Distance with Alignment Constraints
    Uhl, Andreas
    Wild, Peter
    ADVANCES IN VISUAL COMPUTING, PT I, 2010, 6453 : 469 - 478
  • [6] Kernels based on weighted Levenshtein distance
    Xu, JH
    Zhang, XG
    2004 IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2004, : 3015 - 3018
  • [7] An Identification Method of Spectral Information Divergence Pigment Based on Statistical Manifold
    Wang Weichao
    Wang Huiqin
    Wang Ke
    Wang Zhan
    LASER & OPTOELECTRONICS PROGRESS, 2018, 55 (01)
  • [8] Travel time measurement by vehicle sequence matching method - Evaluation method of vehicle sequence using levenshtein distance
    Takahashi, Satoshi
    Izumi, Takashi
    2006 SICE-ICASE INTERNATIONAL JOINT CONFERENCE, VOLS 1-13, 2006, : 5955 - +
  • [9] Adaptive superpixel segmentation and pigment identification of colored relics based on visible spectral images
    Liu, Shiwei
    Wei, Chun-ao
    Li, Miaoxin
    Cui, Xinyu
    Li, Junfeng
    HERITAGE SCIENCE, 2024, 12 (01):
  • [10] Distributions of cognates in Europe as based on Levenshtein distance
    Schepens, Job
    Dijkstra, Ton
    Grootjen, Franc
    BILINGUALISM-LANGUAGE AND COGNITION, 2012, 15 (01) : 157 - 166