Asymptotic Performance of Sparse Signal Detection Using Convex Programming Method

The detection of sparse signals against background noise is considered. Detecting signals of such kind is difficult since only a small portion of the signal carries information. Prior knowledge is usually assumed to ease detection. In this paper, we consider the general unknown and arbitrary sparse signal detection problem when no prior knowledge is available. Under a Neyman-Pearson hypothesis-testing framework, a new detection scheme is proposed by combining a generalized likelihood ratio test (GLRT)-like test statistic and convex programming methods which directly exploit sparsity in an underdetermined system of linear equations. We characterize large sample behavior of the proposed method by analyzing its asymptotic performance. Specifically, we give the condition for the Chernoff-consistent detection which shows that the proposed method is very sensitive to the 2 norm energy of the sparse signals. Both the false alarm rate and the miss rate tend to zero at vanishing signal-to-noise ratio (SNR), as long as the signal energy grows at least logarithmically with the problem dimension. Next we give a large deviation analysis to characterize the error exponent for the Neyman-Pearson detection. We derive the oracle error exponent assuming signal knowledge. Then we explicitly derive the error exponent of the proposed scheme and compare it with the oracle exponent. We complement our study with numerical experiments, showing that the proposed method performs in the vicinity of the likelihood ratio test (LRT) method in the finite sample scenario and the error probability degrades exponentially with the number of observations.     

Interception Algorithm of S-cubed Signal Model in Stealth Radar Equipment

Radar equipment of stealth platforms such as aircraft have adopted the newest modern technology to design the signal waveforms. One of the important and effective methods is the hybrid waveform called spread spectrum stretch (S-cubed) which combines linear frequency modulation (LFM) and discrete phase code. In order to investigate the function of enemy’s stealth radar equipment, the interception algorithm of S-cubed is needed. In this paper, a novel detection and parameter estimation approach for the reconnaissance S-cubed radar signal is presented. First, the generalized time-frequency representation of Zhao, Atlas, and Marks (ZAM-GTFR) and Hough transforms (HT) are applied to detecting the signal, and then the initial frequency and modulation slope of LFM are estimated from the ZAM-GTFR. On the basis of LFM information, the reconstructing signal is generated. Finally, the code rate of discrete phase code is extracted from the negative peaks of the ZAM-GTFR. Simulation results show that the proposed algorithm has higher estimation accuracy when the signal to noise ratio (SNR) is above 3 dB.     

基于迁移学习的SAR目标超分辨重建

针对合成孔径雷达(SAR)目标超分辨重建问题,提出了一种基于迁移学习的超分辨方法。在光学图像梯度域中联合训练超完备字典与稀疏编码映射,利用半耦合字典联系SAR图像与光学图像,寻找SAR图像在半耦合字典下的稀疏编码,并在高分辨率字典下完成重建。结合SAR图像的先验信息,使用正则化方法对SAR目标进行特征增强。所提方法在TerraSAR-X数据和MSTAR数据上进行了仿真实验,重建结果表明,相比目前的插值方法和稀疏表示方法,所提方法空间分辨率可提高0.5~1.5个像素。正则化增强结果表明,引入稀疏先验的正则化增强能够进一步提高空间分辨率并抑制杂波比,最后分析了正则化参数的选取对图像质量的影响。     

一种模糊决策专家系统的模型

目前决策型专家系统主要适合于解决精确的或不确定性决策问题,还存在模糊决策问题,如最佳方案选择问题。统一考虑决策问题中的不确定性和模糊性,提出了一种能统一处理带有不确定性和模糊性决策问题的单目标决策型专家系统模型。针对构造决策专家系统所涉及的具体问题,本文从知识表示、知识获取、模糊谓词计算、规则匹配、系统求解方式等几个方面介绍所提出的模型。     

局部空间-时间显著性的表达过程蕴涵对空间显著性的表达

建立的基于独立成分分析进行特征提取器的学习,进而模拟人类对视觉信息的局部空间-时间显著性的表达过程的计算模型,蕴涵了对局部空间显著性的有效表达;从而当据其设计为机器人主动视觉的注意机制的视线控制而用的算法,可以同一个处理过程适用于动态场景或静态场景的情形。对获自动态场景的特征提取器的频率特性的分析,揭示了此种内在的包含性的成因;算法的实验结果显示了局部空间-时间显著性表达过程对静态场景的局部空间显著性可有效表达。     

Method for denoising and reconstructing radar HRRP using modified sparse auto-encoder

A high resolution range profile (HRRP) is a summation vector of the sub-echoes of the target scattering points acquired by a wide-band radar. Generally, HRRPs obtained in a non-cooperative complex electromagnetic environment are contaminated by strong noise. Effective pre-processing of the HRRP data can greatly improve the accuracy of target recognition. In this paper, a denoising and reconstruction method for HRRP is proposed based on a Modified Sparse Auto-Encoder, which is a representative non-linear model. To better reconstruct the HRRP, a sparse constraint is added to the proposed model and the sparse coefficient is calculated based on the intrinsic dimension of HRRP. The denoising of the HRRP is performed by adding random noise to the input HRRP data during the training process and fine-tuning the weight matrix through singular-value decomposition. The results of simulations showed that the proposed method can both reconstruct the signal with fidelity and suppress noise effectively, significantly outperforming other methods, especially in low Signal-to-Noise Ratio conditions.     

基于对偶四元数的编队飞行卫星相对位姿描述及算法研究

针对编队飞行微小卫星,突破轨道姿态分而治之的传统模式,利用对偶四元数,提出了主从星间的相对位置和姿态统一描述方法,建立了对偶四元数卫星编队运动学模型。该方法区别于描述刚体纯旋转变换的四元数方法,将主从星的本体系之间坐标变换的旋转和平移过程进行融合、统一,并具有非常简洁的形式。同时,给出了求解模型的算法,解算出主从星间的相对位置和姿态。仿真结果表明该模型及算法科学合理,能够满足编队飞行的测控要求。     

求解对称矩阵极端特征的Chebyshev—PBL方法

为了加速预处理块Lanczos方法的收敛法，本文采用组合Chebyshev迭代和预处理块Lanczos方法，提出了求解大型对称稀疏矩阵极端特征的一种新方法－Chebyshev－PBL方法。数值结果表明，新方法对计算大型对称稀疏矩阵的几个最大（或最小）特征值是有效的。     

Young Children's Perception of Diagrammatic Representations

Diagrams and pictorial representations are common in children's lives and require abstraction away from visual perception. In three experiments, we investigated 4- to 8-year-olds’ comprehension of such representations. In Experiment 1 (N = 80), children were shown photographs of geometric objects and asked to choose the corresponding line drawing from among sets of four, or vice versa. Results showed considerable developmental progression, especially around age 6. Experiment 2 (N = 16) ruled out that 4-year-olds’ difficulties were due to problems with the visual matching task itself. Experiment 3 (N = 32) showed comparable performance for matching diagrams to 3D objects rather than to photographs. Findings suggest increasing understanding of diagrammatic representations around the time of school entry.     

一种空间非合作目标的稀疏点云配准算法

点云数据配准是三维重构的关键技术之一,为了提高空间非合作目标的稀疏扫描点云数据配准的速度和精度,提出一种改进的基于四点算法的全局配准算法进行初始配准,再使用迭代最近点算法精确配准.针对直接扫描所得到点云数据量大的问题,本文提出一种基于KD Tree点云均匀采样简化算法,并且对传统基于四点算法中的阈值参数进行了统一,确定了各误差阈值参数和点云密度之间的关系.仿真结果表明,该方法能够快速、有效地实现卫星稀疏点云的配准,改进的四点算法配准耗时仅为几何哈希算法的42.49%.