Matching by pixel distribution comparison: Multisource image template matching

被引:1
|
作者
Mei, Lichun [1 ,5 ]
Zhao, Yuanfu [2 ]
Wang, Huaiye [3 ]
Wang, Caiyun [4 ]
Zhang, Jun [3 ]
Zhao, Xiaoxia [3 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Elect & Informat Engn, Nanjing, Peoples R China
[2] Beijing Microelect Technol Inst, Beijing, Peoples R China
[3] Beijing Space Feiteng Equipment Technol Co LTD, Beijing, Peoples R China
[4] Nanjing Univ Aeronaut & Astronaut, Coll Astronaut, Nanjing, Peoples R China
[5] Nanjing Univ Aeronaut & Astronaut, Coll Elect & Informat Engn, 29 Yudao St, Nanjing 211106, JS, Peoples R China
关键词
heterogeneous image; image matching; multi-source image; neural network; template matching; visible and infrared images; DESCRIPTOR; SAR;
D O I
10.1049/sil2.12176
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Efficient and accurate template matching in multisource images is a difficult task when hardware platform resources are limited. Motivated by the problems encountered in present methods, a template matching scheme, called Matching by Pixel Distribution Comparison (MPDC), is proposed to reduce the use of system resources by combining traditional algorithms and neural networks. The MPDC scheme first extracts the distribution information of image pixels through the developed extended Slice Transform (eSLT) matrix to overcome the non-linear intensity difference between heterogeneous images. Then the similarity between heterogeneous images is evaluated by comparing the pixel distribution rules reflected by the eSLT matrix. A similarity score table is constructed based on the pixel distribution comparison, and the similarity score between heterogeneous image pairs can be calculated by querying this table. The comparison of eSLT matrices can be completed through either experience scoring or neural network learning. The experimental results show that, on a hardware platform with limited resources, the 64 x 64 template can be matched by sliding on the 256 x 256 query image in 2.85 s, and it only takes at least 19.84 s for neural network training on the CPU. The matching performance is also better than many popular multisource image algorithms.
引用
收藏
页数:15
相关论文
共 50 条
  • [1] Fast template matching in multi-modal image under pixel distribution mapping
    Mei, Lichun
    Wang, Caiyun
    Wang, Huaiye
    Zhao, Yuanfu
    Zhang, Jun
    Zhao, Xiaoxia
    INFRARED PHYSICS & TECHNOLOGY, 2022, 127
  • [2] Pixel-to-pixel matching for image recognition using Hungarian graph matching
    Keysers, D
    Deselaers, T
    Ney, H
    PATTERN RECOGNITION, 2004, 3175 : 154 - 162
  • [3] High-speed Image Matching by Selecting Effective Feature Pixel in Template
    Nakamura, Shunta
    Saitoh, Fumihiko
    IDW'11: PROCEEDINGS OF THE 18TH INTERNATIONAL DISPLAY WORKSHOPS, VOLS 1-3, 2011, : 1035 - 1038
  • [4] Volume image registration by template matching
    Ding, L
    Goshtasby, A
    Satter, M
    IMAGE AND VISION COMPUTING, 2001, 19 (12) : 821 - 832
  • [5] Volumetric image registration by template matching
    Ding, LJ
    Kularatna, T
    Goshtasby, A
    Satter, M
    MEDICAL IMAGING 2000: IMAGE PROCESSING, PTS 1 AND 2, 2000, 3979 : 1235 - 1246
  • [6] AN ANALYSIS OF TEMPLATE MATCHING IN IMAGE REGISTRATION
    OLIVER, CJ
    OPTICA ACTA, 1984, 31 (02): : 233 - 248
  • [7] Rotation invariant image template matching based on correlation of curvature distribution
    Saitoh, F
    ELECTRICAL ENGINEERING IN JAPAN, 2003, 145 (04) : 56 - 63
  • [9] Template update criterion for template matching of image sequences
    Kaneko, T
    Hori, O
    16TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL II, PROCEEDINGS, 2002, : 1 - 5
  • [10] Fast image matching algorithm based on template partitioning and subtemplate matching
    Wu, Zhaoming
    Deng, Chengzhi
    Sun, Xiaowei
    International Journal of Wireless and Mobile Computing, 2015, 8 (04) : 377 - 383