一种新的自组织聚类网络及其在数据融合目标分类中的应用

介绍了一种新的自组织聚类人工神经网络(DIGNET)模型和网络的非监督学习算法。针对数据融合和目标识别的特点,提出了基于DIGNET的决策层数据融合目标分类方法。利用仿真数据研究了DIGNET和自组织特征映射网络(SOFM)的聚类性能以及基于DIGNET的决策层数据融合结构,实验结果表明DIGNET较SOFM正确分类率高、抗噪能力好;基于DIGNET的决策层数据融合能够有效地实现融合识别。将该数据融合方法应用于前视红外(FLIR)和可见光摄像机目标跟踪系统,结果表明该方法是可行的。     

一种基于离散数据从局部到全局的网络重构算法

网络的结构和功能彼此相互影响,网络上的功能往往体现为网络上的动力学过程,网络上的动力学过程通过网络中的行为表象数据进行体现.因此,根据网络上可观测的相关数据对网络结构进行重构将成为可能.本文拟解决如何根据网络上可观测的离散数据还原网络拓扑结构的问题,提出了在网络局部利用每一条离散数据对应节点的相似程度来推测节点间发生连...     

基于DIGNET网络的数据融合方法

针对数据融合和目标识别的特点,提出了基于DIGNET自组织聚类人工神经网络的数据融合方法。考虑到多传感器系统测量多个参量的特点,用并行的子网络结构代替中间隐层,实现了基于决策层的信息融合目标识别。利用仿真数据对基于DIGNET的数据融合方法进行了实验研究。实验结果表明,该方法具有数据正确分类率高和抗噪能力强等优点,有效地实现了融合识别。将该方法应用于前视红外和可见光双传感器目标跟踪系统的数据融合识别是可行的。     

A new jet algorithm based on the k-means clustering for the reconstruction of heavy states from jets

A jet algorithm based on the k-means clustering procedure is proposed which can be used for the invariant-mass reconstruction of heavy states decaying to hadronic jets. The proposed algorithm was tested by reconstructing e⁺e^-→tt̄→6 jets and e⁺e^-→W⁺W^-→4 jets processes at using a Monte Carlo simulation. It was shown that the algorithm has a reconstruction efficiency similar to traditional jet-finding algorithms, and leads to 25% and 40% improvement of the top-quark and W mass resolution, respectively, compared to the k_T (Durham) algorithm. In addition, it is expected that the peak positions measured with the new algorithm have smaller systematical uncertainty.     

A modified equally sloped algorithm based on the total variation algorithm in computed tomography for insufficient data

Computed tomography (CT) has become an important technique for analyzing the inner structures of material, biological and energy fields. However, there are often challenges in the practical application of CT due to insufficient data. For example, the maximum rotation angle of the sample stage is limited by sample space or image reconstruction from the limited number of views required to reduce the X‐ray dose delivered to the sample. Therefore, it is difficult to acquire CT images with complete data. In this work, an iterative reconstruction algorithm based on the minimization of the image total variation (TV) has been utilized to develop equally sloped tomography (EST), and the reconstruction was carried out from limited‐angle, few‐view and noisy data. A synchrotron CT experiment on hydroxyapatite was also carried out to demonstrate the ability of the TV‐EST algorithm. The results indicated that the new TV‐EST algorithm was capable of achieving high‐quality reconstructions from projections with insufficient data.     

A complex target terrain SAR raw data generation and evaluation based on inversed equalized hybrid-domain algorithm processing

In this paper, synthetic aperture radar raw data generation of complex target terrain based on inverse equalized hybrid-domain processing technique is proposed. Firstly, the basic synthetic aperture radar (SAR) echo model is derived via spectral analysis of extended chirp scaling. Then, the inverse equalized extended chirp scaling algorithm (ECSA) procedure is applied directly step by step to a real input SAR image in order to generate the raw data of the reference SAR image. The whole raw data generation (RDG) procedure only consists of Inverse Equalized ECSA (IEECSA) without integral equation and computation complexity, which means easier implementation and higher efficiency. By applying the resulted RDG into different image formation algorithms (IFAs), not only the final images are reconstructed but also the resulted RDG is evaluated in practice. Finally, valid image quality assessment techniques are implemented on the reconstructed images. The simulations not only confirm the validity of the proposed RDG method based on inverse equalized hybrid-domain technique but also evaluate the quality metrics of reconstructed images as a method of reliability assurance.     

New reconstruction and forecasting algorithm for TEC data

To reconstruct the missing data of the total electron content(TEC) observations, a new method is proposed, which is based on the empirical orthogonal functions(EOF) decomposition and the value of eigenvalue itself. It is a self-adaptive EOF decomposition without any prior information needed, and the error of reconstructed data can be estimated. The interval quartering algorithm and cross-validation algorithm are used to compute the optimal number of EOFs for reconstruction.The interval quartering algorithm can reduce the computation time. The application of the data interpolating empirical orthogonal functions(DINEOF) method to the real data have demonstrated that the method can reconstruct the TEC map with high accuracy, which can be employed on the real-time system in the future work.     

Personalized PageRank Clustering: A graph clustering algorithm based on random walks

Graph clustering has been an essential part in many methods and thus its accuracy has a significant effect on many applications. In addition, exponential growth of real-world graphs such as social networks, biological networks and electrical circuits demands clustering algorithms with nearly-linear time and space complexity. In this paper we propose Personalized PageRank Clustering (PPC) that employs the inherent cluster exploratory property of random walks to reveal the clusters of a given graph. We combine random walks and modularity to precisely and efficiently reveal the clusters of a graph. PPC is a top-down algorithm so it can reveal inherent clusters of a graph more accurately than other nearly-linear approaches that are mainly bottom-up. It also gives a hierarchy of clusters that is useful in many applications. PPC has a linear time and space complexity and has been superior to most of the available clustering algorithms on many datasets. Furthermore, its top-down approach makes it a flexible solution for clustering problems with different requirements.     

数字图像相关技术的综合算法及其在断裂力学中的应用

鉴于散斑图的随机噪声和相关搜索运算过程仍是当今影响相关图像技术所获结果精度与计算速度两大有待研究解决的主要问题,提出一种基于小波变换、序惯相似度检测和统计相关算法三者相结合的新算法。其基本原理是应用小波变换对变形前后的散斑图进行滤波平滑处理;利用序惯相似度检测算法进行粗搜索,找到可能的匹配点;在可能的匹配点应用统计相关法进行细搜索,最终找到匹配点的位置。基本实验、计算和应用表明,这种算法在消除噪声和提高运算速度等方面,取得了良好的效果。     

Development and exploration of a new methodology for the fitting and analysis of XAS data

A new data analysis methodology for X‐ray absorption near‐edge spectroscopy (XANES) is introduced and tested using several examples. The methodology has been implemented within the context of a new Matlab‐based program discussed in a companion related article [Delgado‐Jaime et al. (2010), J. Synchrotron Rad. 17 , 132–137]. The approach makes use of a Monte Carlo search method to seek appropriate starting points for a fit model, allowing for the generation of a large number of independent fits with minimal user‐induced bias. The applicability of this methodology is tested using various data sets on the Cl K‐edge XAS data for tetragonal CuCl₄^2?, a common reference compound used for calibration and covalency estimation in M—Cl bonds. A new background model function that effectively blends together background profiles with spectral features is an important component of the discussed methodology. The development of a robust evaluation function to fit multiple‐edge data is discussed and the implications regarding standard approaches to data analysis are discussed and explored within these examples.     

A new cluster algorithm for the Baxter-Wu model

We propose a new cluster algorithm for the Baxter-Wu model that significantly reduces critical slowing down. We examine the behavior of the created clusters as we vary the temperature and then specify dynamic exponents. Comparison is made with the Metropolis algorithm and with the other existing cluster algorithm.     

模拟蚂蚁觅食行为的乳腺钙化点边缘提取

针对计算机辅助乳腺癌诊断中钙化点的提取具有较大难度的问题,计算了乳腺数字图像中每个像素点的最大梯度值。首先按照等梯度合并的原则将像素点划分为像素组,按照等分整个梯度区间的原则给定初始梯度聚类中心,模拟蚁群觅食行为中学习机制,以概率选择的方式进行像素点组的聚类得到新的聚类中心,然后再以模糊C均值法(FCM)对得到的聚类进行优化,从而提取出属于钙化点边缘的像素点。实验证明,通过选择适当的参数,用此方法提取乳腺钙化点边缘的效果良好。     

A complex networks approach for data clustering

This work proposes a method for data clustering based on complex networks theory. A data set is represented as a network by considering different metrics to establish the connection between each pair of objects. The clusters are obtained by taking into account five community detection algorithms. The network-based clustering approach is applied in two real-world databases and two sets of artificially generated data. The obtained results suggest that the exponential of the Minkowski distance is the most suitable metric to quantify the similarities between pairs of objects. In addition, the community identification method based on the greedy optimization provides the best cluster solution. We compare the network-based clustering approach with some traditional clustering algorithms and verify that it provides the lowest classification error rate.     

基于簇相似度的网络社团结构探测算法

社团结构对复杂系统的结构特性和动力学特性有重要影响.提出了一个度量社团相似度的模型,称为簇相似度.该模型能够度量两个社团的相似度大小,为研究社团间的作用机制提供帮助.而且基于该模型,设计了一个社团划分算法.算法采用层次聚类的思想,每次合并两个相似度最大的社团,并通过一个评价函数选择最优社团划分.数值实验以及与CNM,GN,EigenMod等主流算法做比较,表明本算法的精度和效率都比较高,尤其对于边密度较高的网络,性能非常理想.     

A new efficient two-channel backward algorithm for speech intelligibility enhancement: A subband approach

This paper addresses the problem of speech intelligibility enhancement by adaptive filtering algorithms employed with subband techniques. The two structures named the forward and backward blind source separation structures are extensively used in the speech enhancement and source separation areas, and largely studied in the literature with convolutive and non-convolutive mixtures. These two structures use two-microphones to generate the convolutive/non-convolutive mixing signal, and provide at the outputs the target and the jammer signal components. In this paper, we focus our interest on the backward structure employed to enhance the speech signal from a convolutive mixture. Furthermore, we propose a subband implementation of this structure to improve its behavior with speech signal. The new proposed subband-Backward BSS (SBBSS) structure allows a very important improvement of the convergence speed of the adaptive filtering algorithms when the subband-number is selected high. In order to improve the robustness of the proposed subband structure, we have adapted then applied a new criterion that combines the System Mismatch and the Mean-Errors criterion minimization. The proposed subband backward structure, when it is combined with this new criterion minimization, allows to enhance the output speech signal by reducing the distortion and the noise components. The performance of the proposed subband backward structure is validated through several objective criteria which are given and described in this paper.     

基于Mean-shift的灰度目标跟踪新算法

Mean-shift算法是一种非参数密度估计算法,可以实现快速的最优匹配,在目标的实时跟踪领域起着非常重要的作用。为了有效的将Mean-shift算法应用到灰度图像中,采用了以方向直方图建立目标模型的策略,提出了在灰度图像中以Mean-shift为核心的目标跟踪算法。实验结果表明,该算法具有不受光照条件影响的优点,在低对比度的情况下仍能实现稳定、实时的跟踪目标。     

基于遗传算法构建巴耳末公式

基于遗传算法构建了巴耳末公式．通过建立合适的拟合数学模型，用计算机对数学模型进行优化，使之尽可能反映氢原子实际谱线分布，并求出经验常量和拟合公式，最后分析了所得结果．     

A new algorithm on PMD pulse-width compression

An algorithm on PMD pulse-width compression is proposed. The new algorithm is more efficient than some recent result and is guaranteed to be globally convergent. Also all iteration points are feasible Jones vectors. These properties are important since in many situations, PMD control needs to be implemented in real time.     

基于均值漂移的遥感图像海陆边界分割算法

光学遥感图像海陆边界分割是海洋近岸目标检测和识别的重要技术基础。由于光学遥感图像分辨率的提高,海陆边界分割存在背景复杂、干扰多等问题。为解决复杂背景下高清遥感图像海陆边界分割问题,提出了一种新的海陆边界分割算法。该方法包含三个部分:使用均值漂移算法将遥感图像处理成若干同质区域;采用一种新的基于扫描线的方法选择海水区域种子像素点,利用区域增长算法填充海水区域;通过连通区域分析的方法分离陆地部分,得到海陆分割结果。实验证明,该方法能够对于复杂背景下的光学遥感图像实现准确、稳定的海陆分割,算法具有较强的鲁棒性和准确性。