A new sensor selection scheme for Bayesian learning based sparse signal recovery in WSNs

In this paper, we address the issue of sparse signal recovery in wireless sensor networks (WSNs) based on Bayesian learning. We first formulate a compressed sensing (CS)-based signal recovery problem for the detection of sparse event in WSNs. Then, from the perspective of energy saving and communication overhead reduction of the WSNs, we develop an optimal sensor selection algorithm by employing a lower-bound of the mean square error (MSE) for the MMSE estimator. To tackle the nonconvex difficulty of the optimum sensor selection problem, a convex relaxation is introduced to achieve a suboptimal solution. Both uncorrelated and correlated noises are considered and a low-complexity realization of the sensor selection algorithm is also suggested. Based on the selected subset of sensors, the sparse Bayesian learning (SBL) is utilized to reconstruct the sparse signal. Simulation results illustrate that our proposed approaches lead to a superior performance over the reference methods in comparison.     

Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization

Multiple-prespecified-dictionary sparse representation (MSR) has shown powerful potential in compressive sensing (CS) image reconstruction, which can exploit more sparse structure and prior knowledge of images for minimization. Due to the popular L₁ regularization can only achieve the suboptimal solution of L₀ regularization, using the nonconvex regularization can often obtain better results in CS reconstruction. This paper proposes a nonconvex adaptive weighted L_p regularization CS framework via MSR strategy. We first proposed a nonconvex MSR based L_p regularization model, then we propose two algorithms for minimizing the resulting nonconvex L_p optimization problem. According to the fact that the sparsity levels of each regularizers are varying with these prespecified-dictionaries, an adaptive scheme is proposed to weight each regularizer for optimization by exploiting the difference of sparsity levels as prior knowledge. Simulated results show that the proposed nonconvex framework can make a significant improvement in CS reconstruction than convex L₁ regularization, and the proposed MSR strategy can also outperforms the traditional nonconvex L_p regularization methodology.     

压缩感知稀疏信号重构算法研究

压缩感知理论是利用信号的稀疏性,采用重构算法通过少量的观测值就可以实现对该信号的精确重构。SL0（Smoothed l0）算法是基于l0范数的稀疏信号重构算法,通过控制参数逐步逼近最优解。针对平滑函数的选取问题,文章提出一种新的平滑函数序列近似l0范数,实现稀疏信号的精确重构。仿真结果表明,在相同实验条件下文章算法较传统算法有着较高的重构概率。     

A novel performance criterion approach to optimum design of PID controller using cuckoo search algorithm for AVR system

This article presents a novel tuning design of Proportional-Integral-Derivative (PID) controller in the Automatic Voltage Regulator (AVR) system by using Cuckoo Search (CS) algorithm with a new time domain performance criterion. This performance criterion was chosen to minimize the maximum overshoot, rise time, settling time and steady state error of the terminal voltage. In order to compare CS with other evolutionary algorithms, the proposed objective function was used in Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) algorithms for PID design of the AVR system. The performance of the proposed CS based PID controller was compared to the PID controllers tuned by the different evolutionary algorithms using various objective functions proposed in the literature. Dynamic response and a frequency response of the proposed CS based PID controller were examined in detail. Moreover, the disturbance rejection and robustness performance of the tuned controller against parametric uncertainties were obtained, separately. Energy consumptions of the proposed PID controller and the PID controllers tuned by the PSO and ABC algorithms were analyzed thoroughly. Extensive simulation results demonstrate that the CS based PID controller has better control performance in comparison with other PID controllers tuned by the PSO and ABC algorithms. Furthermore, the proposed objective function remarkably improves the PID tuning optimization technique.     

A family of proportionate normalized subband adaptive filter algorithms

In this paper, the concept of proportionate adaptation is extended to the normalized subband adaptive filter (NSAF), and seven proportionate normalized subband adaptive filter algorithms are established. The proposed algorithms are proportionate normalized subband adaptive filter (PNSAF), μ‐law PNSAF (MPNSAF), improved PNSAF (IPNSAF), the improved IPNSAF (IIPNSAF), the set-membership IPNSAF (SM-IPNSAF), the selective partial update IPNSAF (SPU-IPNSAF), and SM-SPU-IPNSAF which are suitable for sparse system identification in network echo cancellation. When the impulse response of the echo path is sparse, the PNSAF has initial faster convergence than NSAF but slows down dramatically after initial convergence. The MPNSAF algorithm has fast convergence speed during the whole adaptation. The IPNSAF algorithm is suitable for both sparse and dispersive impulse responses. The SM-IPNSAF exhibits good performance with significant reduction in the overall computational complexity compared with the ordinary IPNSAF. In SPU-IPNSAF, the filter coefficients are partially updated rather than the entire filter at every adaptation. In SM-SPU-IPNSAF algorithm, the concepts of SM and SPU are combined which leads to a reduction in computational complexity. The simulation results show good performance of the proposed algorithms.     

Sparse subspace clustering with jointly learning representation and affinity matrix

In recent years, sparse subspace clustering (SSC) has been witnessed to its advantages in subspace clustering field. Generally, the SSC first learns the representation matrix of data by self-expressive, and then constructs affinity matrix based on the obtained sparse representation. Finally, the clustering result is achieved by applying spectral clustering to the affinity matrix. As described above, the existing SSC algorithms often learn the sparse representation and affinity matrix in a separate way. As a result, it may not lead to the optimum clustering result because of the independence process. To this end, we proposed a novel clustering algorithm via learning representation and affinity matrix conjointly. By the proposed method, we can learn sparse representation and affinity matrix in a unified framework, where the procedure is conducted by using the graph regularizer derived from the affinity matrix. Experimental results show the proposed method achieves better clustering results compared to other subspace clustering approaches.     

Sparse Bayesian learning approach for discrete signal reconstruction

This study addresses the problem of discrete signal reconstruction from the perspective of sparse Bayesian learning (SBL). Generally, it is intractable to perform the Bayesian inference with the ideal discretization prior under the SBL framework. To overcome this challenge, we introduce a novel discretization enforcing prior to exploit the knowledge of the discrete nature of the signal-of-interest. By integrating the discretization enforcing prior into the SBL framework and applying the variational Bayesian inference (VBI) methodology, we devise an alternating optimization algorithm to jointly characterize the finite-alphabet feature and reconstruct the unknown signal. When the measurement matrix is i.i.d. Gaussian per component, we further embed the generalized approximate message passing (GAMP) into the VBI-based method, so as to directly adopt the ideal prior and significantly reduce the computational burden. Simulation results demonstrate substantial performance improvement of the two proposed methods over existing schemes. Moreover, the GAMP-based variant outperforms the VBI-based method with i.i.d. Gaussian measurement matrices but it fails to work for non i.i.d. Gaussian matrices.     

Generalized singular value thresholding operator based nonconvex low-rank and sparse decomposition for moving object detection

Moving object detection is one of the most challenging tasks in computer vision and many other fields, which is the basis for high-level processing. Low-rank and sparse decomposition (LRSD) is widely used in moving object detection. The existing methods primarily address the LRSD problem by exploiting the approximation of rank functions and sparse constraints. Conventional methods usually consider the nuclear norm as the approximation of the low-rank matrix. However, the actual results show that the nuclear norm is not the best approximation of the rank function since it simultaneously minimize all the singular values. In this paper, we exploit a novel nonconvex surrogate function to approximate the low-rank matrix and propose a generalized formulation for nonconvex low-rank and sparse decomposition based on the generalized singular value thresholding (GSVT) operator. And then, we solve the proposed nonconvex problem via the alternating direction method of multipliers (ADMM), and also analyze its convergence. Finally, we give numerical results to validate the proposed algorithm on both synthetic data and real-life image data. The results demonstrate that our model has superior performance. And we use the proposed nonconvex model for moving objects detection, and provide the experimental results. The results show that the proposed method is more effective than representative LRSD based moving objects detection algorithms.     

一种基于minimax准则的压缩采样信号检测方法

压缩感知理论是在已知信号具有稀疏性或可压缩性的条件下,对信号数据进行采集、编解码的新理论.压缩感知理论指出,当观测矩阵满足等容性原理时,可以通过远小于奈奎斯特采样点数的信号点数去重建原始信号.本文将压缩采样的框架应用到信号检测模型中去,提出了一种使用minimax准则对压缩采样的信号进行检测的方法,并从理论上证明了这种方法有很好的检测性能,最后采用蒙特卡罗仿真实验验证了理论分析的结果.     

Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model

This paper focuses on the identification of multiple-input single-output output-error systems with unknown time-delays. Since the time-delays are unknown, an identification model with a high dimensional and sparse parameter vector is derived based on overparameterization. Traditional identification methods cannot get sparse solutions and require a large number of observations unless the time-delays are predetermined. Inspired by the sparse optimization and the greedy algorithms, an auxiliary model based orthogonal matching pursuit iterative (AM-OMPI) algorithm is proposed by using the orthogonal matching pursuit, and then based on the gradient search, an auxiliary model based gradient pursuit iterative algorithm is proposed, which is computationally more efficient than the AM-OMPI algorithm. The proposed methods can simultaneously estimate the parameters and time-delays from a small number of sampled data. A simulation example is used to illustrate the effectiveness of the proposed algorithms.     

Optimum and suboptimum methods for permuting a matrix into bordered triangular form

In this paper we consider the problem of permuting a large sparse n×n matrix into an optimum bordered triangular form using nonsymmetric permutations. By making use of the degree switching operations in the digraph of the matrix and minimum essential set of the digraph we present a formal solution to the problem. Next we present an algorithm for finding a minimal essential set for a strongly connected digraph using the structural properties of the digraph. We also present an algorithm for permuting a n×n matrix into a near optimum bordered triangular form by making use of output set assignment concepts. Examples are given to illustrate our algorithms.     

压缩感知在脉冲超宽带穿墙雷达中的应用

传统的超宽带穿墙雷达数据采样需要满足 Nyquist 采样定理,超宽带大数据量增大了 A/D 转换时的硬件压力,压缩感知理论突破了传统 Nyquist 采样的限制,它是基于信号的稀疏性,测量矩阵的随机性和非线性优化算法来对信号进行压缩采样和重构.文章针对超宽带穿墙雷达的具体工作过程和穿墙雷达目标成像空间的稀疏性提出了一种基于压缩感知理论的成像方法,并通过仿真表明了该方法的可行性和有效性.     

基于不变矩的海面红外目标识别

针对焦平面红外探测器对海面目标进行探测所得到的红外图像，提出一种基于不变矩的海面红外目标识别的方法。该方法采用空间域处理和基于灰度相似性的区域分割来提取目标区域，计算其七不变矩值，利用目标区域的面积大小、矩阵组数值等作为先验知识，对识别目标进行识别。此方法经过了实测图像的检验，正确识别率为94.53%。     

矩阵在并行计算中的通信优化研究

为了提高并行应用系统的效率,研究了针对大型稀疏矩阵的压缩通信问题。通过对矩阵压缩通信过程中矩阵稀疏度、网络带宽、处理器计算能力之间的关系进行定量分析,推导出稀疏度下界计算公式。通过对不同稀疏度情况下算法所取得的效率进行分析,总结出压缩通信中稀疏度与通信效率之间的函数关系。结果表明本算法在稀疏矩阵通信方面效率有明显的提高。     

浅谈基于稀疏表示的图像融合算法

图像融合已成为图像处理和计算机视觉领域的一项重要技术。随着压缩感知理论的发展,稀疏表示成为了压缩感知中的一个重要的研究内容。文章系统地阐述了当前图像融合技术的研究现状,重点介绍了稀疏表示在图像融合中的应用,并对目前图像融合算法存在的问题以及未来的发展进行了展望。     

Whose posts to read: Finding social sensors for effective information acquisition

In the era of big data, it is extremely challenging to decide what information to receive and filter out in order to effectively acquire high-quality information, particularly in social media where large-scale User Generated Contents (UGC) is widely and quickly disseminated. Considering that each individual user in social network can take actions to drive the process of information diffusion, it is naturally appealing to aggregate spreading information effectively at the individual level by regarding each user as a social sensor. Along this line, in this paper, we propose a framework for effective information acquisition in social media. To be more specific, we introduce a novel measurement, the preference-based Detection Ability to evaluate the ability of social sensors to detect diffusing events, and the problem of effective information acquisition is then reduced to achieving social sensing maximization through discovering valid social sensors. In pursuit of social sensing maximization, we propose two algorithms to resolve the longstanding problems in traditional greedy methods from the perspectives of efficiency and performance. On the one hand, we propose an efficient algorithm termed LeCELF, which resolves the redundant re-evaluations in the traditional Cost-Effective Lazy Forward (CELF) algorithm. On the other hand, we observe the participation paradox phenomenon in the social sensing network, and proceed to propose a randomized selection-based algorithm called FRIENDOM to choose social sensors to improve the effectiveness of information acquisition. Experiments on a disease spreading network and real-world microblog datasets have validated that LeCELF greatly reduces the running time, whereas FRIENDOM achieves a better detection performance. The proposed framework and corresponding algorithms can be applicable in many other settings in resolving information overload problems.     

A fast exact weighted subband adaptive algorithm and its application to mono and stereo acoustic echo cancellation

The fast affine projection (FAP) algorithm (Gay and Tavathia, Proceedings of the IEEE International Conference on Acoustic, Speech and Signal Processing, 1995, 3023) is known to outperform the NLMS with a slight increase in complexity, but it involves the fast calculation of the inverse of a covariance matrix of the input data that could undermine the performance of the algorithm. The block subband adaptive algorithm in (Courville and Duhamel, IEEE Trans. Signal Processing 46(9) (1998) 2359) has also illustrated significant improvement in performance over the NLMS and other frequency domain adaptive algorithms. However, it is known that block processing algorithms have lower tracking capabilities than the their sample-by-sample counterparts. In this paper, we present a sample-by-sample version of the algorithm in (Courville and Duhamel, IEEE Trans. Signal Processing 46(9) (1998) 2359) and develop a low complexity implementation of this algorithm. As a sample-by-sample algorithm, it avoids the reduced tracking capability of block algorithms. Because it does not use matrix inversion, it avoids the numerical problems of FAP algorithms. We will show that the new sample-by-sample algorithm approximates the affine projection algorithm and possesses a similar property in reducing coefficient bias that appears in monophonic and stereophonic teleconferencing when the receiving room impulse responses are undermodeled. The new fast sample-by-sample algorithm is extended for stereo acoustic echo cancellation. Simulations of echo cancellations in actual rooms are presented to verify our findings.     

A Wikipedia powered state-based approach to automatic search query enhancement

This paper describes the development and testing of a novel Automatic Search Query Enhancement (ASQE) algorithm, the Wikipedia N Sub-state Algorithm (WNSSA), which utilises Wikipedia as the sole data source for prior knowledge. This algorithm is built upon the concept of iterative states and sub-states, harnessing the power of Wikipedia’s data set and link information to identify and utilise reoccurring terms to aid term selection and weighting during enhancement. This algorithm is designed to prevent query drift by making callbacks to the user’s original search intent by persisting the original query between internal states with additional selected enhancement terms. The developed algorithm has shown to improve both short and long queries by providing a better understanding of the query and available data. The proposed algorithm was compared against five existing ASQE algorithms that utilise Wikipedia as the sole data source, showing an average Mean Average Precision (MAP) improvement of 0.273 over the tested existing ASQE algorithms.     

Data-driven attacks and data recovery with noise on state estimation of smart grid

In this paper, we focus on the false data injection attacks (FDIAs) on state estimation and corresponding countermeasures for data recovery in smart grid. Without the information about the topology and parameters of systems, two data-driven attacks (DDAs) with noisy measurements are constructed, which can escape the detection from the residue-based bad data detection (BDD) in state estimator. Moreover, in view of the limited energy of adversaries, the feasibility of proposed DDAs is improved, such as more sparse and low-cost DDAs than existing work. In addition, a new algorithm for measurement data recovery is introduced, which converts the data recovery problem against the DDAs into the problem of the low rank approximation with corrupted and noisy measurements. Especially, the online low rank approximate algorithm is employed to improve the real-time performance. Finally, the information on the 14-bus power system is employed to complete the simulation experiments. The results show that the constructed DDAs are stealthy under BBD but can be eliminated by the proposed data recovery algorithms, which improve the resilience of the state estimator against the attacks.     

关联规则挖掘算法分析与探讨

关联规则挖掘算法是数据挖掘领域的主要研究方向之一。对几种经典的关联规则挖掘算法进行了分析、探讨和比较,给出了一种基于支持矩阵的、不需要产生候选项目集的算法设计思想。算法为事务数据库中的每个项目设置二进制向量,利用逻辑与运算构造支持矩阵来挖掘频繁项目集,极大地节省了存储空间,提高了算法运行效率。