首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 31 毫秒
1.
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.  相似文献   

2.
Unsupervised feature selection is very attractive in many practical applications, as it needs no semantic labels during the learning process. However, the absence of semantic labels makes the unsupervised feature selection more challenging, as the method can be affected by the noise, redundancy, or missing in the originally extracted features. Currently, most methods either consider the influence of noise for sparse learning or think over the internal structure information of the data, leading to suboptimal results. To relieve these limitations and improve the effectiveness of unsupervised feature selection, we propose a novel method named Adaptive Dictionary and Structure Learning (ADSL) that conducts spectral learning and sparse dictionary learning in a unified framework. Specifically, we adaptively update the dictionary based on sparse dictionary learning. And, we also introduce the spectral learning method of adaptive updating affinity matrix. While removing redundant features, the intrinsic structure of the original data can be retained. In addition, we adopt matrix completion in our framework to make it competent for fixing the missing data problem. We validate the effectiveness of our method on several public datasets. Experimental results show that our model not only outperforms some state-of-the-art methods on complete datasets but also achieves satisfying results on incomplete datasets.  相似文献   

3.
The stacked extreme learning machine (S-ELM) is an advanced framework of deep learning. It passes the ‘reduced’ outputs of the previous layer to the current layer, instead of directly propagating the previous outputs to the next layer in traditional deep learning. The S-ELM could address some large and complex data problems with a high accuracy and a relatively low requirement for memory. However, there is still room for improvement of the time complexity as well as robustness while using S-ELM. In this article, we propose an enhanced S-ELM by replacing the original principle component analysis (PCA) technique used in this algorithm with the correntropy-optimized temporal PCA (CTPCA), which is robust for outliers rejection and significantly improves the training speed. Then, the CTPCA-based S-ELM performs better than S-ELM in both accuracy and learning speed, when dealing with dataset disturbed by outliers. Furthermore, after integrating the extreme learning machine (ELM) sparse autoencoder (AE) method into the CTPCA-based S-ELM, the learning accuracy is further improved while spending a little more training time. Meanwhile, the sparser and more compact feature information are available by using the ELM sparse AE with more computational efforts. The simulation results on some benchmark datasets verify the effectiveness of our proposed methods.  相似文献   

4.
匡彪 《科技广场》2014,(8):88-92
针对声矢量DOA估计问题,根据声矢量阵的特点,结合MVDR算法的思想,本文提出了一种声矢量阵DOA估计新算法。该算法将声矢量阵振速通道的数据协方差矩阵相加得到新的协方差矩阵,然后结合声矢量阵声压通道的数据协方差矩阵,通过类似于V-MVDR算法的角度扫描过程实现目标的DOA估计,该算法无需已知信源数目且不需要特征值分解运算,具有良好的DOA方位估计和分辨性能,计算机仿真结果验证了本文算法的有效性。  相似文献   

5.
In this paper, we address the problem of tracking DOA of multiple moving targets with known signal source waveforms and unknown gains in the presence of Gaussian noise using a nonuniform linear array. Herein, we make use of the fact that the output of each sensor can be described as a linear regression model whose coefficients each contain a pair of DOA and gain information corresponding to one target. These coefficients are determined by solving a linear least squares (LS) problem and then updated recursively based on a block QR decomposition recursive least squares (QRD-RLS) technique or a block regularized LS technique. Since the coefficients from different sensors have the same amplitude but variable phase information for the same signal, along with simple algebraic manipulations the well-known generalized least squares (GLS) are used to obtain an asymptotically-optimal DOA estimate without requiring a search over a large region of the parameter space. Computer simulations show that the proposed DOA tracking techniques when applied to a sparse antenna array can provide a better tracking performance than some of the existing methods do.  相似文献   

6.
In this work, we investigate compressed sensing (CS) techniques based on the exploitation of prior knowledge to support telemedicine. In particular, prior knowledge is obtained by computing the probability of appearance of non-zero elements in each row of a sparse matrix, which is then employed in sensing matrix design and recovery algorithms for CS systems. A robust sensing matrix is designed by jointly reducing the average mutual coherence and the projection of the sparse representation error. A Probability-Driven Normalized Iterative Hard Thresholding (PD-NIHT) algorithm is developed as the recovery method, which also exploits the prior knowledge of the probability of appearance of non-zero elements and can bring performance benefits. Simulations for synthetic data and different organs of endoscopy image are carried out, where the proposed sensing matrix and PD-NIHT algorithm achieve a better performance than previously reported algorithms.  相似文献   

7.
In this paper, the event-triggered distributed multi-sensor data fusion algorithm is presented for wireless sensor networks (WSNs) based on a new event-triggered strategy. The threshold of the event is set according to the chi-square distribution that is constructed by the difference of the measurement of the current time and the measurement of the last sampled moment. When the event-triggered decision variable value is larger than the threshold, the event is triggered and the observation is sampled for state estimation. In designing the dynamic event-triggered strategy, we relate the threshold with the quantity in the chi-square distribution table. Therefore, compared to the existed event-triggered algorithms, this novel event-triggered strategy can give the specific sampling/communication rate directly and intuitively. In addition, for the presented distributed fusion in wireless sensor networks, only the measurements in the neighborhood (i.e., the neighbor nodes and the neighbor’s neighbor nodes) of the fusion center are fused so that it can obtain the optimal state estimation under limited energy consumption. A numerical example is used to illustrate the effectiveness of the presented algorithm.  相似文献   

8.
Most previous works of feature selection emphasized only the reduction of high dimensionality of the feature space. But in cases where many features are highly redundant with each other, we must utilize other means, for example, more complex dependence models such as Bayesian network classifiers. In this paper, we introduce a new information gain and divergence-based feature selection method for statistical machine learning-based text categorization without relying on more complex dependence models. Our feature selection method strives to reduce redundancy between features while maintaining information gain in selecting appropriate features for text categorization. Empirical results are given on a number of dataset, showing that our feature selection method is more effective than Koller and Sahami’s method [Koller, D., & Sahami, M. (1996). Toward optimal feature selection. In Proceedings of ICML-96, 13th international conference on machine learning], which is one of greedy feature selection methods, and conventional information gain which is commonly used in feature selection for text categorization. Moreover, our feature selection method sometimes produces more improvements of conventional machine learning algorithms over support vector machines which are known to give the best classification accuracy.  相似文献   

9.
Based on the conflict and crosstalk avoidance mechanism (CCAM), we propose a sleeping–awaking method for wireless sensor networks (WSNs) in which the maximal degree node (MDN) and all its neighbors run sleep or wake simultaneously while other nodes run the CCAM. This method is said to be the same sleeping–awaking method (SSAM). The SSAM is motivated by the congestion and collision problems of cliques, MDN and its neighbor set in the communicating graph of the WSN. In this communication way, the related protocol about the SSAM is provided accordingly. Under the designed protocol, we get a Markovian switching WSN with both white noise disturbance and multiple time-varying delays. Based on the theory of exponential stability in pth moment, we show that the protocol ensures the WSNs to keep in synchronization with the target function. A numerical example shows that the WSN can keep its target-synchronization even with large time delays.  相似文献   

10.
As the number of clients for federated learning (FL) has expanded to the billion level, a new research branch named secure federated submodel learning (SFSL) has emerged. In SFSL, mobile clients only download a tiny ratio of the global model from the coordinator’s global. However, SFSL provides little guarantees on the convergence and accuracy performance as the covered items may be highly biased. In this work, we formulate the problem of client selection through optimizing unbiased coverage of item index set for enhancing SFSL performance. We analyze the NP-hardness of this problem and propose a novel heuristic multi-group client selection framework by jointly optimizing index diversity and similarity. Specifically, heuristic exploration on some random client groups are performed progressively for an empirical approximate solution. Meanwhile, private set operations are used to preserve the privacy of participated clients. We implement the proposal by simulating large-scale SFSL application in a lab environment and conduct evaluations on two real-world data-sets. The results demonstrate the performance (w.r.t., accuracy and convergence speed) superiority of our selection algorithm than SFSL. The proposal is also shown to yield significant computation advantage with similar communication performance as SFSL.  相似文献   

11.
By only designing the internal coupling, quasi synchronization of heterogeneous complex networks coupled by N nonidentical Duffing-type oscillators without any external controller is investigated in this paper. To achieve quasi synchronization, the average of states of all nodes is designed as the virtual target. Heterogeneous complex networks with two kinds of nonlinear node dynamics are analyzed firstly. Some sufficient conditions on quasi synchronization are obtained without designing any external controller. Quasi synchronization means that the states of all nonidentical nodes will keep a bounded error with the virtual target. Then the heterogeneous complex network with impulsive coupling which means the network only has coupling at some discrete impulsive instants, is further discussed. Some sufficient conditions on heterogeneous complex network with impulsive coupling are derived. Based on these results, heterogeneous complex network can still reach quasi synchronization even if its nodes are only coupled at discrete impulsive instants. Finally, two examples are provided to verify the theoretical results.  相似文献   

12.
Sparsity regularized least squares are very popular for the solution of the underdetermined linear inverse problem. One of the recent progress is that structural information is incorporated to the sparse signal recovery for compressed sensing. Sparse group signal model, which is also called block-sparse signal, is one example in this way. In this paper, the internal structure of each group is further defined to get the globally sparse and locally dense group signal model. It assumes that most of the entries in the active groups are nonzero. To estimate this newly defined signal, minimization of the ?1?1 norm of the total variation is incorporated to the group Lasso which is the combination of a sparsity constraint and a data fitting constraint. The newly proposed optimization model is called globally sparse and locally dense group Lasso. The added total variation based constraint can encourage local dense distribution in each group. Theoretical analysis is performed to give a class of theoretical sufficient conditions to guarantee successful recovery. Simulations demonstrate the proposed method?s performance gains against Lasso and group Lasso.  相似文献   

13.
Similarity search with hashing has become one of the fundamental research topics in computer vision and multimedia. The current researches on semantic-preserving hashing mainly focus on exploring the semantic similarities between pointwise or pairwise samples in the visual space to generate discriminative hash codes. However, such learning schemes fail to explore the intrinsic latent features embedded in the high-dimensional feature space and they are difficult to capture the underlying topological structure of data, yielding low-quality hash codes for image retrieval. In this paper, we propose an ordinal-preserving latent graph hashing (OLGH) method, which derives the objective hash codes from the latent space and preserves the high-order locally topological structure of data into the learned hash codes. Specifically, we conceive a triplet constrained topology-preserving loss to uncover the ordinal-inferred local features in binary representation learning. By virtue of this, the learning system can implicitly capture the high-order similarities among samples during the feature learning process. Moreover, the well-designed latent subspace learning is built to acquire the noise-free latent features based on the sparse constrained supervised learning. As such, the latent under-explored characteristics of data are fully employed in subspace construction. Furthermore, the latent ordinal graph hashing is formulated by jointly exploiting latent space construction and ordinal graph learning. An efficient optimization algorithm is developed to solve the resulting problem to achieve the optimal solution. Extensive experiments conducted on diverse datasets show the effectiveness and superiority of the proposed method when compared to some advanced learning to hash algorithms for fast image retrieval. The source codes of this paper are available at https://github.com/DarrenZZhang/OLGH .  相似文献   

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

15.
Radio tomographic imaging (RTI) has wide applications in the detection and tracking of objects that do not require any sensor to be attached to the object. Consequently, it leads to device-free localization (DFL). RTI uses received signal strength (RSS) at different sensor nodes for imaging purposes. The attenuation maps, known as spatial loss fields (SLFs), measure the power loss at each pixel in the wireless sensor network (WSN) of interest. These SLFs help us to detect obstacles and aid in the imaging of objects. The centralized RTI system requires the information of all sensor nodes available at the fusion centre (FC), which in turn increases the communication overhead. Furthermore, the failure of links may lead to improper imaging in the RTI system. Hence, a distributed approach for the RTI system resolves such problems. In this paper, a consensus-based distributed strategy is used for distributed estimation of the SLF. The major contribution of this work is to propose a fully decentralized RTI system by using a consensus-based alternating direction method of multipliers (ADMM) algorithm to alleviate the practical issues with centralized and distributed incremental strategies. We proposed distributed consensus ADMM (DCADMM-RTI) and distributed sparse consensus ADMM (DSCADMM-RTI) for the RTI system to properly localize targets in a distributed fashion. Furthermore, the effect of quantization noise is verified by using the distributed consensus algorithms while sharing the quantized data among the neighbourhoods.  相似文献   

16.
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.  相似文献   

17.
In this paper, we propose a new learning method for extracting bilingual word pairs from parallel corpora in various languages. In cross-language information retrieval, the system must deal with various languages. Therefore, automatic extraction of bilingual word pairs from parallel corpora with various languages is important. However, previous works based on statistical methods are insufficient because of the sparse data problem. Our learning method automatically acquires rules, which are effective to solve the sparse data problem, only from parallel corpora without any prior preparation of a bilingual resource (e.g., a bilingual dictionary, a machine translation system). We call this learning method Inductive Chain Learning (ICL). Moreover, the system using ICL can extract bilingual word pairs even from bilingual sentence pairs for which the grammatical structures of the source language differ from the grammatical structures of the target language because the acquired rules have the information to cope with the different word orders of source language and target language in local parts of bilingual sentence pairs. Evaluation experiments demonstrated that the recalls of systems based on several statistical approaches were improved through the use of ICL.  相似文献   

18.
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.  相似文献   

19.
利用多维Neville算法实现基于转导思想的函数估计   总被引：1，自引：0，他引：1  
根据转导思想的函数估计 ,不用估计函数的模型和参数 ,直接估计函数在给定点的值 ,从根本上区别于传统的函数估计方法 ,但具体的实现算法是一个公开的问题 .讨论使用多维Neville算法实现基于转导思想的函数估计的问题 .利用投影的方法 ,将传统的Neville算法推广到了多维空间 ,在数值计算中引入了核函数的思想 ,从而解决了多维空间的计算问题 ,得到利用多维的Neville算法实现函数估计的方法 .数值试验的结果表明 ,这种方法成功地克服了函数插值的龙格 (Runge)现象 ,有很好的逼近效果 ,并且可以处理多维的函数估计问题 ;同时也给出了对核函数参数进行估计这个难题的一些讨论 .该算法对转导思想的实现提供了一个崭新的途径 .  相似文献   

20.
林晓青 《情报探索》2013,(10):124-126
阐述了接受理论对图书馆开展人性化服务的启示。以南京邮电大学仙林图书馆为例,从建筑和馆舍布局人性化、资源采购人性化、学科服务人性化等方面,介绍了该馆运用接受理论开展人性化服务的经验,旨在为其他高校图书馆提供借鉴。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号