共查询到20条相似文献,搜索用时 40 毫秒
1.
Blind source separation (BSS) is a problem that is often encountered in many applications, such as biomedical signal processing and analysis, speech and image processing, wireless telecommunication systems, data mining, sonar, radar enhancement, etc. One often solves the BSS problem by using the statistical properties of original sources, e.g., non-Gaussianity or time-structure information. Nevertheless, real-life mixtures are likely to contain both non-Gaussianity and time-structure information sources, rendering the algorithms using only one statistical property fail. In this paper, we address the BSS problem when source signals have non-Gaussianity and temporal structure with nonlinear autocorrelation. Based on the two statistical characteristics of sources, we develop an objective function. Maximizing the objective function, we propose a gradient ascent source separation algorithm. Furthermore, We give some mathematical properties for the algorithm. Computer simulations for sources with square temporal autocorrelation and non-Gaussianity illustrate the efficiency of the proposed approach. 相似文献
2.
Blind source separation (BSS) is an increasingly popular data analysis technique with many applications. Several methods for BSS using the statistical properties of original sources have been proposed; for a famous case, non-Gaussianity, this leads to independent component analysis (ICA). In this paper, we propose a hybrid BSS method based on linear and nonlinear complexity pursuit, which combines three statistical properties of source signals: non-Gaussianity, linear predictability and nonlinear predictability. A gradient learning algorithm is presented by minimizing a loss function. Simulations verify the efficient implementation of the proposed method. 相似文献
3.
The normal operation of propulsion gearboxes ensures the ship safety. Chaos indicators could efficiently indicate the state change of the gearboxes. However, accurate detection of gearbox hybrid faults using Chaos indicators is a challenging task and the detection under speed variation conditions is attracting considerable attentions. Literature review suggests that the gearbox vibration is a kind of nonlinear mixture of variant vibration sources and the blind source separation (BSS) is reported to be a promising technique for fault vibration analysis, but very limited work has addressed the nonlinear BSS approach for hybrid faults decoupling diagnosis. Aiming to enhance the fault detection performance of Chaos indicators, this work presents a new nonlinear BSS algorithm for gearbox hybrid faults detection under a speed variation condition. This new method appropriately introduces the kernel spectral regression (KSR) framework into the morphological component analysis (MCA). The original vibration data are projected into the reproducing kernel Hilbert space (RKHS) where the instinct nonlinear structure in the original data can be linearized by KSR. Thus the MCA is able to deal with nonlinear BSS in the KSR space. Reliable hybrid faults decoupling is then achieved by this new nonlinear MCA (NMCA). Subsequently, by calculating the Chaos indicators of the decoupled fault components and comparing them with benchmarks, the hybrid faults can be precisely identified. Two specially designed case studies were implemented to evaluate the proposed NMCA-Chaos method on hybrid gear faults decoupling diagnosis. The performance of the NMCA-Chaos was compared with state of art techniques. The analysis results show high performance of the proposed method on hybrid faults detection in a marine propulsion gearbox with large speed variations. 相似文献
4.
Andri Mirzal 《Advances in Data Analysis and Classification》2017,11(1):25-48
Blind source separation (BSS) is a problem of recovering source signals from signal mixtures without or very limited information about the sources and the mixing process. From literatures, nonnegative matrix factorization (NMF) and independent component analysis (ICA) seem to be the mainstream techniques for solving the BSS problems. Even though the using of NMF and ICA for BSS is well studied, there is still a lack of works that compare the performances of these techniques. Moreover, the nonuniqueness property of NMF is rarely mentioned even though this property actually can make the reconstructed signals vary significantly, and thus introduces the difficulty on how to choose the representative reconstructions from several possible outcomes. In this paper, we compare the performances of NMF and ICA as BSS methods using some standard NMF and ICA algorithms, and point out the difficulty in choosing the representative reconstructions originated from the nonuniqueness property of NMF. 相似文献
5.
Nong Gu Daniel Lazard Fabrice Rouillier Yong Xiang 《Mathematics in Computer Science》2007,1(2):291-304
The basic objective of blind signal separation is to recover a set of source signals from a set of observations that are mixtures
of the sources with no, or very limited knowledge about the mixture structure and source signals. To extract the original
sources, many algorithms have been proposed; among them, the cross-correlation and constant modulus algorithm (CC-CMA) appears
to be the algorithm of choice due to its computational simplicity.
An important issue in CC-CMA algorithm is the global convergence analysis, because the cost function is not quadratic nor
convex and contains undesirable stationary points. If these undesirable points are local minimums, the convergence of the
algorithm may not be guaranteed and the CC-CMA would fail to separate source signals.
The main result of this paper is to complete the classification of these stationary points and to prove that they are not
local minimums unless if the mixing parameter is equal to 1.
This is obtained by using the theory of discriminant varieties to determine the stationnary points as a function of the parameter
and then to show that the Hessian matrix of the cost function is not positive semidefinite at these stationnay points, unless
if the mixing parameter is 1.
相似文献
6.
Blind source extraction (BSE) is an important technique to extract a desired source from the mixed signals and the post-nonlinear (PNL) mixture is more realistic model in many situations. In this paper, we address the problem of extracting the source of interest from the PNL mixture. First, the prior knowledge about the desired source, such as its normalized kurtosis range, can be treated as a constraint and incorporated into the contrast function. Therefore, BSE from the PNL mixture can be formulated a constrained optimization problem. Second, the inverse of the unknown nonlinear function is approximated by the multi-layer perceptions (MLP) network because neural network can uniformly approximate any continuous function if there is sufficient number of neurons in the hidden layer. Finally, the source of interest can be extracted from the PNL mixture by minimizing the constrained optimization problem with standard gradient descent method. Extensive computer simulations and experiments demonstrate the validity of our algorithm. 相似文献
7.
Hongjuan Zhang Zhenwei Shi Chonghui Guo Enmin Feng 《Journal of Computational and Applied Mathematics》2009
Blind source extraction (BSE) has become one of the promising methods in the field of signal processing and analysis, which only desires to extract “interesting” source signals with specific stochastic property or features so as to save lots of computing time and resources. This paper addresses BSE problem, in which desired source signals have some available reference signals. Based on this prior information, we develop an objective function for extraction of temporally correlated sources. Maximizing this objective function, a semi-blind source extraction fixed-point algorithm is proposed. Simulations on artificial electrocardiograph (ECG) signals and the real-world ECG data demonstrate the better performance of the new algorithm. Moreover, comparisons with existing algorithms further indicate the validity of our new algorithm, and also show its robustness to the estimated error of time delay. 相似文献
8.
The paper presents a new approach for machine vibration analysis and health monitoring combining blind source separation (BSS) and change detection in source signals. So, the problem is transferred from the original space of the measurements to the space of independent sources, where the reduced number of components is going to simplify the monitoring problem while the change detection methods are going to be applied for scalar signals. The assessment of the approach on a real machine is presented in this paper. 相似文献
9.
In this paper, by means of the image space analysis, we obtain optimality conditions for vector optimization of objective multifunction with multivalued constraints based on disjunction of two suitable subsets of the image space. By the oriented distance function a nonlinear regular separation is introduced and some optimality conditions for the constrained extremum problem are obtained. It is shown that the existence of a nonlinear separation is equivalent to a saddle point condition for the generalized Lagrangian function. 相似文献
10.
11.
Discrete autoregressive process of order 1 (DAR(1)) has been used as a popular stochastic model for correlated traffic sources because it parsimoniously uses a single parameter to capture the desirable correlation structure. In contrast with DAR(1), discrete autoregressive process of order 2 (DAR(2)) uses one more parameter to provide a much richer pattern in the autocorrelation function and is able to capture slower decay rate and longer memory. To investigate how the additional traffic parameter in DAR(2) influences the queueing performance, this paper provides an analysis of the discrete‐time DAR(2)/D/1 queue. The performance measures concerned are the mean and second‐order statistics of queue size, which are both important in the queueing systems seen in telecommunication networks. Under a mild condition, these performance indices are derived in closed form that allows for efficient computing. An approximate version of these results is also developed to relax the condition and cover more general sources, and both versions serve as a simple tool set for performance evaluation. The numerical examples use this tool to demonstrate that the DAR(2) source may cause up to 30% poorer performance than DAR(1) when the traffic is heavy, bursty, and highly correlated. This indicates that the effect from slower decay rate in autocorrelation is not negligible and using the extra parameter is necessary particularly when the queue is heavily loaded with correlated traffic. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
12.
本文旨在针对线性比式和规划这一NP-Hard非线性规划问题提出新的全局优化算法.首先,通过引入p个辅助变量把原问题等价的转化为一个非线性规划问题,这个非线性规划问题的目标函数是乘积和的形式并给原问题增加了p个新的非线性约束,再通过构造凸凹包络的技巧对等价问题的目标函数和约束条件进行相应的线性放缩,构成等价问题的一个下界线性松弛规划问题,从而提出了一个求解原问题的分支定界算法,并证明了算法的收敛性.最后,通过数值结果比较表明所提出的算法是可行有效的. 相似文献
13.
介绍一种非线性约束优化的不可微平方根罚函数,为这种非光滑罚函数提出了一个新的光滑化函数和对应的罚优化问题,获得了原问题与光滑化罚优化问题目标之间的误差估计. 基于这种罚函数,提出了一个算法和收敛性证明,数值例子表明算法对解决非线性约束优化具有有效性. 相似文献
14.
非线性纵向数据模型中自相关性和随机效应的存在性检验 总被引:2,自引:2,他引:0
刻画纵向数据协方差结构有三种可能因素 ,即序列相关 (特别是一阶自相关 )、随机效应和常规的随机误差 (Diggleetal,2 0 0 2 ) .本文研究非线性纵向数据模型的自相关性和随机效应存在性的单个和联合检验 ,得到了检验的score统计量 ,并利用血浆药物渗透数据 (Davidian&Gilinan ,1 995)说明检验方法的应用 . 相似文献
15.
Z. Flikop 《European Journal of Operational Research》1985,19(2):262-267
For routing assignments a special model and an optimization algorithm are proposed. The efficiency of the routing assignments is evaluated by the average value of the total cost of delays for all packets in the network. It is the objective function. The main idea is that traffic, which is transmitted from the source node to the destination node, can be split between two or more logical paths. The minimum of the objective function can be found by varying the traffic on every path and simultaneously from all the source nodes to the destination nodes. If this approach is applied, then the objective function is nonseparable and nonlinear. Because its shape is unknown in advance, an adaptive nonlinear optimization algorithm is proposed. For evaluating its efficiency a special set of test functions has been used. 相似文献
16.
Silvia Bonettini Thomas Serafini 《Journal of Computational and Applied Mathematics》2009,231(1):236-248
Nonlinear image deblurring procedures based on probabilistic considerations have been widely investigated in the literature. This approach leads to model the deblurring problem as a large scale optimization problem, with a nonlinear, convex objective function and non-negativity constraints on the sign of the variables. The interior point methods have shown in the last years to be very reliable in nonlinear programs. In this paper we propose an inexact Newton interior point (IP) algorithm designed for the solution of the deblurring problem. The numerical experience compares the IP method with another state-of-the-art method, the Lucy Richardson algorithm, and shows a significant improvement of the processing time. 相似文献
17.
In this paper, we propose a mechanism to tighten Reformulation-Linearization Technique (RLT) based relaxations for solving nonconvex programming problems by importing concepts from semidefinite programming (SDP), leading to a new class of semidefinite cutting planes. Given an RLT relaxation, the usual nonnegativity restrictions on the matrix of RLT product variables is replaced by a suitable positive semidefinite constraint. Instead of relying on specific SDP solvers, the positive semidefinite stipulation is re-written to develop a semi-infinite linear programming representation of the problem, and an approach is developed that can be implemented using traditional optimization software. Specifically, the infinite set of constraints is relaxed, and members of this set are generated as needed via a separation routine in polynomial time. In essence, this process yields an RLT relaxation that is augmented with valid inequalities, which are themselves classes of RLT constraints that we call semidefinite cuts. These semidefinite cuts comprise a relaxation of the underlying semidefinite constraint. We illustrate this strategy by applying it to the case of optimizing a nonconvex quadratic objective function over a simplex. The algorithm has been implemented in C++, using CPLEX callable routines, and two types of semidefinite restrictions are explored along with several implementation strategies. Several of the most promising lower bounding strategies have been implemented within a branch-and-bound framework. Computational results indicate that the cutting plane algorithm provides a significant tightening of the lower bound obtained by using RLT alone. Moreover, when used within a branch-and-bound framework, the proposed lower bound significantly reduces the effort required to obtain globally optimal solutions. 相似文献
18.
Hongchao Zhang 《Computational Optimization and Applications》2014,57(1):27-43
A new nonmonotone algorithm is proposed and analyzed for unconstrained nonlinear optimization. The nonmonotone techniques applied in this algorithm are based on the estimate sequence proposed by Nesterov (Introductory Lectures on Convex Optimization: A Basic Course, 2004) for convex optimization. Under proper assumptions, global convergence of this algorithm is established for minimizing general nonlinear objective function with Lipschitz continuous derivatives. For convex objective function, this algorithm maintains the optimal convergence rate of convex optimization. In numerical experiments, this algorithm is specified by employing safe-guarded nonlinear conjugate gradient search directions. Numerical results show the nonmonotone algorithm performs significantly better than the corresponding monotone algorithm for solving the unconstrained optimization problems in the CUTEr (Bongartz et al. in ACM Trans. Math. Softw. 21:123–160, 1995) library. 相似文献
19.
In this paper, we try to solve the semidefinite program with box constraints. Since the traditional projection method for constrained optimization with box constraints is not suitable to the semidefinite constraints, we present a new algorithm based on the feasible direction method. In the paper, we discuss two cases: the objective function in semidefinite programming is linear and nonlinear, respectively. We establish the convergence of our algorithm, and report the numerical experiments which show the effectiveness of the algorithm. 相似文献
20.
共享单车是我国大力提倡的低碳交通出行模式,加快共享单车发展是解决最后一公里、城市拥堵和环境污染等问题的重要途径。由于人们停放共享单车的无规律性,使得共享单车系统中各车桩的单车库存量存在不平衡。如何合理的对车桩中的单车进行重新调配,来满足用户的需求,是相关企业亟待解决的问题。共享单车的调配路线优化是优化车桩库存量的重要手段之一。本文研究多仓库条件下的货车调配路线优化问题,建立了一个混合整数非线性规划模型。不同于传统的路径优化问题的研究大多是以成本或时间为目标,本文采用基于车桩库存量的非线性惩罚函数来表示用户需求,从而使得所研究的问题是一个凸函数优化问题。为了简化本文的问题,将目标函数分段线性化。基于车桩网络的特点,设计了变邻域搜索算法,以及构建初始解的贪婪算法。最后,以某共享单车公司为例,进行算例分析,来说明模型和算法的合理性和有效性。 相似文献