混响
还原(数学)
计算机科学
基质(化学分析)
秩(图论)
矩阵分解
维数(图论)
稀疏逼近
稀疏矩阵
降维
数学
算法
声学
人工智能
物理
材料科学
特征向量
量子力学
组合数学
复合材料
高斯分布
几何学
纯数学
作者
Yunchao Zhu,Rui Duan,Kunde Yang
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI