Hierarchical recognition system for target recognition from sparse representations (Q1665932): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finite-time filtering for switched linear systems with a mode-dependent average dwell time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the Dimensionality of Data with Neural Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-time \(H_\infty\) estimation for discrete-time Markov jump systems with time-varying transition probabilities subject to average Dwell time switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic finite-time boundedness for Markovian jumping neural networks with time-varying delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Training Products of Experts by Minimizing Contrastive Divergence / rank
 
Normal rank

Latest revision as of 10:53, 16 July 2024

scientific article
Language Label Description Also known as
English
Hierarchical recognition system for target recognition from sparse representations
scientific article

    Statements

    Hierarchical recognition system for target recognition from sparse representations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 August 2018
    0 references
    Summary: A hierarchical recognition system (HRS) based on constrained Deep Belief Network (DBN) is proposed for SAR Automatic Target Recognition (SAR ATR). As a classical Deep Learning method, DBN has shown great performance on data reconstruction, big data mining, and classification. However, few works have been carried out to solve small data problems (like SAR ATR) by Deep Learning method. In HRS, the deep structure and pattern classifier are combined to solve small data classification problems. After building the DBN with multiple Restricted Boltzmann Machines (RBMs), hierarchical features can be obtained, and then they are fed to classifier directly. To obtain more natural sparse feature representation, the Constrained RBM (CRBM) is proposed with solving a generalized optimization problem. Three RBM variants, \(L_1\)-RNM, \(L_2\)-RBM, and \(L_{1 / 2}\)-RBM, are presented and introduced to HRS in this paper. The experiments on MSTAR public dataset show that the performance of the proposed HRS with CRBM outperforms current pattern recognition methods in SAR ATR, like PCA + SVM, LDA + SVM, and NMF + SVM.
    0 references
    0 references
    0 references
    0 references

    Identifiers