Moving Target Recognition Based on Transfer Learning and Three-Dimensional Over-Complete Dictionary

被引:12
|
作者
Yang, Zhutian [1 ]
Deng, Jun [2 ]
Nallanathan, Arumugam [3 ]
机构
[1] Harbin Inst Technol, Sch Elect & Informat Engn, Harbin 150001, Peoples R China
[2] Tech Univ Munich, Machine Intelligence & Signal Proc Grp, D-80333 Munich, Germany
[3] Kings Coll London, Dept Informat, London WC2R 2LS, England
关键词
Moving target recognition; three-dimensional; over-complete dictionary; transfer learning; noise robust;
D O I
10.1109/JSEN.2016.2568462
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In radar target recognition using high-resolution range profile, moving target recognition is a challenging issue, due to the target-aspect angle variation. To address the problem, two key issues need to be solved. First, we need to reflect the target moving status. Next, we need to find the common knowledge among different target-aspect angles. Accordingly, a novel moving target recognition based on three distribution over-complete dictionary in conjunction with transfer learning is proposed. Specifically, we propose a three distribution over-complete dictionary to represent the target and extract its moving status by dictionary learning. Moreover, we structure the feature set with generation among target-aspect angles by using a transfer learning method. This framework can be trained by using a small number of samples from limited target-aspect angles to recognize the targets of other target-aspect angles. Another advantage of this method is that it is robust against signal noise rate variation. Simulation results are presented to demonstrate the effectiveness of the proposed scheme.
引用
收藏
页码:5671 / 5678
页数:8
相关论文
共 50 条
  • [1] A Signal Classification and Recognition Method Based on Over-Complete Dictionary in Compressed Sensing
    Ning, Wanzheng
    [J]. PROCEEDINGS OF 2020 IEEE 5TH INFORMATION TECHNOLOGY AND MECHATRONICS ENGINEERING CONFERENCE (ITOEC 2020), 2020, : 316 - 320
  • [2] Structural similarity constrained over-complete dictionary learning
    Deng, Chengzhi
    Ma, Lu
    Wang, Shengqian
    Liu, Juanjuan
    Zhu, Huasheng
    [J]. Journal of Computational Information Systems, 2013, 9 (12): : 4699 - 4706
  • [3] Regularization Over-complete Dictionary Learning With Application to Image Denoising
    Zhang Fen
    Xie Kai
    [J]. 2012 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT CONTROL, AUTOMATIC DETECTION AND HIGH-END EQUIPMENT (ICADE), 2012, : 30 - 34
  • [4] A Secure Data Hiding System Based on Over-Complete Dictionary Partitioning
    Hua, Guang
    Zhao, Lifan
    Bi, Guoan
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON ADVANCED INTELLIGENT MECHATRONICS (AIM), 2016, : 1047 - 1052
  • [5] An Over-Complete Dictionary Design Based on GSR for SAR Image Despeckling
    Liu, Su
    Zhang, Gong
    Soon, Yeo Tat
    [J]. IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, 2017, 14 (12) : 2230 - 2234
  • [6] Sparse signal subspace decomposition based on adaptive over-complete dictionary
    Hong Sun
    Cheng-wei Sang
    Didier Le Ruyet
    [J]. EURASIP Journal on Image and Video Processing, 2017
  • [7] Sparse signal subspace decomposition based on adaptive over-complete dictionary
    Sun, Hong
    Sang, Cheng-wei
    Le Ruyet, Didier
    [J]. EURASIP JOURNAL ON IMAGE AND VIDEO PROCESSING, 2017,
  • [8] IRIS SUPER-RESOLUTION VIA NONPARAMETRIC OVER-COMPLETE DICTIONARY LEARNING
    Aljadaany, Raied
    Luu, Khoa
    Venugopalan, Shreyas
    Savvides, Marios
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2015, : 3856 - 3860
  • [9] AN OVER-COMPLETE DICTIONARY BASED REGULARIZED RECONSTRUCTION OF A FIELD OF ENSEMBLE AVERAGE PROPAGATORS
    Ye, Wenxing
    Vemuri, Baba C.
    Entezari, Alireza
    [J]. 2012 9TH IEEE INTERNATIONAL SYMPOSIUM ON BIOMEDICAL IMAGING (ISBI), 2012, : 940 - 943
  • [10] Partial Matching of Facial Expression Sequence Using Over-Complete Transition Dictionary for Emotion Recognition
    Lee, Seung Ho
    Ro, Yong Man
    [J]. IEEE TRANSACTIONS ON AFFECTIVE COMPUTING, 2016, 7 (04) : 389 - 408