A camouflage target detection method based on local minimum difference constraints

To address the problems of missing inside and incomplete edge contours in camouflaged target detection results, we propose a camouflaged moving target detection algorithm based on local minimum difference constraints(LMDC). The algorithm first uses the mean to optimize the initial background model, removes the stable background region by global comparison, and extracts the edge point set in the potential target region so that each boundary point(seed) grows along the center of the target. Finall...     

Joint channel estimation and symbol detection for space-time block code

The simplified joint channel estimation and symbol detection based on the EM (expectation-maximization) algorithm for space-time block code (STBC) are proposed. By assuming channel to be invariant within only one STBC word and utilizing the orthogonal structure of STBC, the computational complexity and cost of this algorithm are both very low, so it is very suitable to implementation in real systems.     

Adaptive Endpoint Detection Based on Subband Speech

Abstract: An adaptive endpoint detection algorithm based on band energy and adaptive smoothing algorithm is described.This algorithm utilizes the capability of adaptive smoothing algorithm that intensifies the discontinuity between localareas. The band energy features are selected because of their usefulness in detecting high energy regions (in the incomingsignal) and making the distinction between speech and noise. Heuristic "edge-focusing" is used to endpoint detection tosave the time in iteration.     

Successive quadratic programming multiuser detector

Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefmite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.     

Formalising and Detecting Community Structures in Real World Complex Networks

Community structure is an integral characteristic of real world networks whichever processes or areas they emerge from. This paper addresses the problem of community structure detection theoretically as well as computationally. The authors introduce a number of concepts such as the neighbourhood and strength of a subgraph, p-community, local maximal p-community, hubs, and outliers that play elemental role in formalising the concept of community structure in complex networks. A few preliminary results have been derived that lead to the development of an algorithm for community structure detection in undirected unweighted networks. The algorithm is based on a local seed expansion strategy that uses the concept of interaction coefficient. The authors have analysed the algorithm on a number of parameters such as accuracy, stability, and quality on synthetic and real world networks from different areas.     

Iterative learning based fault diagnosis for discrete linear uncertain systems

In order to detect and estimate faults in discrete lin-ear time-varying uncertain systems, the discrete iterative learning strategy is applied in fault diagnosis, and a novel fault detection and estimation algorithm is proposed. And the threshold limited technology is adopted in the proposed algorithm. Within the chosen optimal time region, residual signals are used in the proposed algorithm to correct the introduced virtual faults with iterative learning rules, making the virtual faults close to these occurred in practical systems. And the same method is repeated in the rest optimal time regions, thereby reaching the aim of fault diagnosis. The proposed algorithm not only completes fault detection and estimation for discrete linear time-varying uncertain systems, but also improves the reliability of fault detection and decreases the false alarm rate. The final simulation results verify the validity of the proposed algorithm.     

A Parallel Algorithm for Corner Detection on Object Contour

; A new parallel algorithm for corner detection on object contour is presented in the paper. In this algorithm whenever a point (pixel) is scanned, the k direction codes between the two sides of the point, which is on the edge of an object, are obtained by k-step forward and backward boundary tracking. A comer is determined by the sum of the difference between the two weighted code chains. Note that the whole chain code sequence or boundary of an object is not necessary to be extracted at all in this algorithm, and the corners are obtained immediately once the image is scanned, furthermore, what humans perceive as corners can be detected and localized by this algorithm.     

Intelligent fault-tolerant algorithm with two-stage and feedback for integrated navigation federated filtering

In order to take full advantage of federated filter in fault-tolerant design of integrated navigation system, the limitation of fault detection algorithm for gradual changing fault detection and the poor fault tolerance of global optimal fusion algorithm are the key problems to deal with. Based on theoretical analysis of the influencing factors of federated filtering fault tolerance, global fault-tolerant fusion algorithm and information sharing algorithm are proposed based on fuzzy assessment. It achieves intelligent fault-tolerant structure with two-stage and feedback, including real-time fault detection in sub-filters, and fault-tolerant fusion and information sharing in main filter. The simulation results demonstrate that the algorithm can effectively improve fault-tolerant ability and ensure relatively high positioning precision of integrated navigation system when a subsystem having gradual changing fault.     

Cued search algorithm with uncertain detection performance for phased array radars

A cued search algorithm with uncertain detection performance is proposed for phased array radars. Firstly, a target search model based on the information gain criterion is presented with known detection performance, and the statistical characteristic of the detection probability is calculated by using the fluctuant model of the target radar cross section （RCS）. Secondly, when the detection probability is completely unknown, its probability density function is modeled with a beta distribution, and its posterior probability distribution with the radar observation is derived based on the Bayesian theory. Finally simulation results show that the cued search algorithm with a known RCS fluctuant model can achieve the best performance, and the algorithm with the detection probability modeled as a beta distribution is better than that with a random selected detection probability because the model parameters can be updated by the radar observation to approach to the real value of the detection probability.     

Scale invariant features extraction for stereo vision

Stable local feature detection is a fundamental component of many stereo vision problems such as 3-D reconstruction, object localization, and object tracking. A robust method for extracting scale-invariant feature points is presented. First, the Harris corners in three-level pyramid are extracted. Then, the points detected at the highest level of the pyramid are correctly propagated to the lower level by pyramid based scale invariant (PBSI) method. The corners detected repeatedly in different levels are chosen as final feature points. Finally, the characteristic scale is obtained based on maximum entropy method. The experimental results show that the algorithm has low computation cost, strong antinoise capability, and excellent performance in the presence of significant scale changes.     

基于YOLOv5的舰船目标及关键部位检测算法

为进一步提升对可见光图像中水面舰船目标的检测识别成功率, 提出一种基于YOLOv5的舰船目标识别算法。使用基于随机池化方法的空间金字塔池化网络, 运用双向特征金字塔网络进行多尺度特征融合, 采用指数线性单元函数作为激活函数加快网络训练收敛速度, 提升算法鲁棒性, 从而实现了对水面舰船目标和舰船关键部位的快速准确识别。通过在舰船目标及其关键部位数据集上实验验证, 对比多个经典目标检测方法, 在识别准确率上均有不同程度提升, 对比原YOLOv5s模型, 平均精度均值提升3.03%, 速度提升2 FPS, 模型保持了YOLOv5轻量化的特点, 在应用部署上有良好前景。     

一种低信噪比下点目标检测新算法

针对红外探测系统对远距离目标进行实时临控的应用场合,提出了一种快速点目标检测算法。该算法将原始图像序列分割成多个小段,通过递推使用速度匹配滤波,能快速得到图像序列中目标轨迹的能量,从而提高低信噪比下点目标的检测能力。与其它检测算法相比,新算法具有检测概率高、算法复杂低等特点。对算法的原理和性能进行了详细地分析,通过仿真实验证明了该算法的有效性。     

基于超密集特征金字塔网络的SAR图像舰船检测

针对星载合成孔径雷达(synthetic aperture radar, SAR)图像舰船目标检测困难的问题,提出了一种基于超密集特征金字塔网络的检测算法。首先,利用残差神经网络提取原始图像特征,构建特征图。其次,跨尺度连接多个特征层获取超密集特征金字塔,建立多尺度的高层语义特征映射,增强特征传播和重用。然后，再利用区域建议网络提取每层金字塔的候选区域输入检测网络。最后,通过融合候选区域及其周边上下文信息,将检测网络注意力集中至海域以抑制虚警,并为分类器计算置信度和边框回归提供补充信息。多组仿真实验证明,所提网络框架设定合理且检测性能优越。     

基于超密集特征金字塔网络的SAR图像舰船检测

针对星载合成孔径雷达(synthetic aperture radar, SAR)图像舰船目标检测困难的问题,提出了一种基于超密集特征金字塔网络的检测算法。首先,利用残差神经网络提取原始图像特征,构建特征图。其次,跨尺度连接多个特征层获取超密集特征金字塔,建立多尺度的高层语义特征映射,增强特征传播和重用。然后,再利用区域建议网络提取每层金字塔的候选区域输入检测网络。最后,通过融合候选区域及其周边上下文信息,将检测网络注意力集中至海域以抑制虚警,并为分类器计算置信度和边框回归提供补充信息。多组仿真实验证明,所提网络框架设定合理且检测性能优越。     

融合边界监督策略的改进特征金字塔算法研究

针对语义分割中存在的边界划分不够准确及存在多尺度目标等问题，提出了一种融合边界监督策略的改进特征金字塔算法。通过融合的边界监督策略和改进的特征金字塔算法分别解决边界划分不准确和存在多尺度目标的问题，并且在上采样过程中加入注意力机制，进一步提升分割效果。实验结果表明：该算法分别在Camvid和PASCAL VOC2012两个数据集上取得了58.69%和78.59%的平均交并比(mean intersection over union， MIOU)指标，在分割效果上有较好的表现。     

Governance Behaviors of Listed Firms' Real Controlling Shareholders under Ultimate Control Structures

The popularity of concentrated ultimate control rights and the deviation between cash flow rights and control rights around the world show that the logical starting point of corporate governance studies changes to study on the confliction of interests between real controlling shareholders and investors. Under the background of China's reality, integrating the private benefits of control and reputation mechanisms, a unified framework is built to study the conditions and influential factors of the real controlling shareholders' tunneling, monitoring, and propping behaviors. This research points out that the pyramid ownership structures determine the real controlling shareholders' behaviors and then affect the corporate performance. Thus, this research modifies the jump logic relationship between pyramid ownership structures and corporate performance.     

高速运动雷达弱小目标检测方法研究

针对强杂波下高速运动的雷达弱小目标的特点,提出了一种基于短时滑窗相参积累和改进动态规划的检测前跟踪相结合的算法。首先,将雷达的回波信号构成一个先入先出的队列,进行短时滑窗相参积累。其次,在航迹跟踪时采用了基于改进动态规划的检测前跟踪算法,并且在原来的状态转移的基础上又对后续状态进行了估计,从而降低了相邻两帧间目标强度起伏的影响。实测数据证明此算法检测性能好,计算量较小,实际可行。     

基于SCA的欠定跳频网台分选方法

针对组网跳频信号在欠定条件下网台分选效果不佳的问题,提出了一种基于稀疏成分分析(sparse component analysis, SCA)的欠定跳频网台分选方法。在估计混合矩阵时,首先利用观测信号的实部与虚部方向一致性检测时频单源点,在采用S变换构造时频比矩阵的基础上,利用方差法实现了混合矩阵估计;在源信号恢复时,利用改进的子空间投影法得到源信号的时频域分离,最后可通过S逆变换得到时域分离信号,从而实现了欠定条件下的跳频网台分选。仿真结果表明，该方法有效实现了混合跳频信号在欠定条件下的网台分选且适用于跳频同步或异步组网方式,提高了分选性能和抗噪性能。     

离散特征点探测算法

在建立新的特征点响应函数的基础上，提出了一种特征点探测算法，算法以图像分块为基础，通过计算每一分块内的特征点，进行特征点连通集约简获得离散特征点集，实验证明，算法效率得到了较大提高，解决了使用全局特征响应阈值造成的特征点聚集和不敏感特征点被错误剔除的问题．