Robust shallow water reverberation reduction methods based on low-rank and sparsity decomposition

被引:11
|
作者
Zhu, Yunchao [1 ,2 ]
Duan, Rui [1 ,2 ]
Yang, Kunde [1 ,2 ]
机构
[1] Northwestern Polytech Univ, Sch Marine Sci & Technol, Xian 710072, Shaanxi, Peoples R China
[2] Northwestern Polytech Univ, Minist Ind & Informat Technol, Key Lab Ocean Acoust & Sensing, Xian 710072, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
ECHO STATISTICS; SONAR; CLUTTER; ENVIRONMENT; MATRIX; SUPPRESSION; SCATTERERS; TRACKING; DOPPLER;
D O I
10.1121/10.0010353
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
Using the characteristics of low rank for reverberation and sparsity for the target echo in multi-ping detection, the low-rank and sparsity decomposition method can effectively reduce reverberation. However, in the case of highly sparse reverberation or a stationary target, the distinctions in the characteristics between the reverberation and target echo become ambiguous. As a result, the reverberation reduction performance is degraded. To guarantee a meaningful decomposition based on the random orthogonal model and random sparsity model, the identifiability condition (IC) for the decomposition was derived from the perspective of the low-rank matrix and sparse matrix, respectively. According to the IC, sparsity compensation for the low-rank matrix was proposed to address the false alarm probability inflation (FAPI) induced by highly sparse reverberation. In addition, increasing the dimension of the sparse matrix was also proposed to manage the detection probability shrinkage caused by a stationary target. The robust reverberation reduction performance was validated via simulations and field experiments. It is demonstrated that FAPI can be eliminated by increasing the sparse coefficient of the low-rank matrix to 0.30 and a stationary target could be detected with a large ping number, i.e., a high dimension, of the sparse matrix. (c) 2022 Acoustical Society of America.
引用
收藏
页码:2826 / 2842
页数:17
相关论文
共 50 条
  • [1] Application of a Randomized Algorithm for Extracting a Shallow Low-Rank Structure in Low-Frequency Reverberation
    Pang, Jie
    Gao, Bo
    REMOTE SENSING, 2023, 15 (14)
  • [2] Robust sparse low-rank embedding for image reduction
    Liu, Zhonghua
    Lu, Yue
    Lai, Zhihui
    Ou, Weihua
    Zhang, Kaibing
    APPLIED SOFT COMPUTING, 2021, 113
  • [3] Pansharpening Based on Low-Rank and Sparse Decomposition
    Rong, Kaixuan
    Jiao, Licheng
    Wang, Shuang
    Liu, Fang
    IEEE JOURNAL OF SELECTED TOPICS IN APPLIED EARTH OBSERVATIONS AND REMOTE SENSING, 2014, 7 (12) : 4793 - 4805
  • [4] A Low-Rank Direct Solver for Nonconformal Domain Decomposition Methods
    Lu, Jiaqing
    IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2024, 72 (08) : 6663 - 6677
  • [5] PERFORMANCE ANALYSIS OF A ROBUST LOW-RANK STAP FILTER IN LOW-RANK GAUSSIAN CLUTTER
    Ginolhac, G.
    Forster, P.
    2010 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2010, : 2746 - 2749
  • [6] Seismic signal enhancement based on the low-rank methods
    Bai, Min
    Huang, Guangtan
    Wang, Hang
    Chen, Yangkang
    GEOPHYSICAL PROSPECTING, 2020, 68 (09) : 2783 - 2807
  • [7] Truncated γ norm-based low-rank and sparse decomposition
    Yang, Zhenzhen
    Yang, Yongpeng
    Fan, Lu
    Bao, Bing-Kun
    MULTIMEDIA TOOLS AND APPLICATIONS, 2022, 81 (27) : 38279 - 38295
  • [8] Low-Rank PSD Approximation in Input-Sparsity Time
    Clarkson, Kenneth L.
    Woodruff, David P.
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2061 - 2072
  • [9] Is Input Sparsity Time Possible for Kernel Low-Rank Approximation?
    Musco, Cameron
    Woodruff, David P.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), 2017, 30
  • [10] KRYLOV METHODS FOR LOW-RANK REGULARIZATION
    Gazzola, Silvia
    Meng, Chang
    Nagy, James G.
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2020, 41 (04) : 1477 - 1504