Browsing by Subject "Local minimums"
Now showing 1 - 4 of 4
Results Per Page
Sort Options
Item Open Access A complexity-reduced ML parametric signal reconstruction method(2011) Deprem, Z.; Leblebicioglu, K.; Arkan O.; Çetin, A.E.The problem of component estimation from a multicomponent signal in additive white Gaussian noise is considered. A parametric ML approach, where all components are represented as a multiplication of a polynomial amplitude and polynomial phase term, is used. The formulated optimization problem is solved via nonlinear iterative techniques and the amplitude and phase parameters for all components are reconstructed. The initial amplitude and the phase parameters are obtained via time-frequency techniques. An alternative method, which iterates amplitude and phase parameters separately, is proposed. The proposed method reduces the computational complexity and convergence time significantly. Furthermore, by using the proposed method together with Expectation Maximization (EM) approach, better reconstruction error level is obtained at low SNR. Though the proposed method reduces the computations significantly, it does not guarantee global optimum. As is known, these types of non-linear optimization algorithms converge to local minimum and do not guarantee global optimum. The global optimum is initialization dependent. © 2011 Z. Deprem et al.Item Open Access A distributed positioning algorithm for cooperative active and passive sensors(IEEE, 2010) Gholami, M.R.; Gezici, Sinan; Rydström, M.; Ström, E.G.The problem of positioning a target node is studied for wireless sensor networks with cooperative active and passive sensors. Two-way time-of-arrival and time-difference-of-arrival measurements made by both active and passive nodes are used to estimate the position of the target node. A maximum likelihood estimator (MLE) can be employed to solve the problem. Due to the nonlinear nature of the cost function in the MLE, an iterative search might converge to local minima which often results in large estimation errors. To avoid this drawback, we instead formulate the problem of positioning as finding the intersection of a number of convex sets derived from measurements. To obtain this intersection, we apply the projection onto convex sets approach, which is robust and can be implemented in a distributed manner. Simulations are performed to compare the performance of the MLE and the proposed method. ©2010 IEEE.Item Open Access Empirical mode decomposition aided by adaptive low pass filtering(IEEE, 2012) Öztürk, Onur; Arıkan, Orhan; Çetin, A. EnisEmpirical Mode Decomposition (EMD) is an adaptive signal analysis technique which derives its basis functions from the signal itself. EMD is realized through successive iterations of a sifting process requiring local mean computation. For that purpose, local minima and maxima of the signal are assumed to constitute proper local time scales. EMD lacks accuracy, however, experiencing the so-called mode mixing phenomenon in the presence of noise which creates artificial extrema. In this paper, we propose adaptively filtering the signal in Discrete Cosine Transform domain before each local mean computation step to prevent mode mixing. Denoising filter thresholds are optimized for a product form criterion which is a function of the preserved energy and the eliminated number of extrema of the signal after filtering. Results obtained from synthetic signals reveal the potential of the proposed technique. © 2012 IEEE.Item Open Access Positioning algorithms for cooperative networks in the presence of an unknown turn-around time(IEEE, 2011) Gholami, M.R.; Gezici, Sinan; Ström, E.G.; Rydström, M.This paper addresses the problem of single node positioning in cooperative network using hybrid two-way time-of-arrival and time-difference-of-arrival where, the turn-around time at the target node is unknown. Considering the turn-around time as a nuisance parameter, the derived maximum likelihood estimator (MLE) brings a difficult global optimization problem due to local minima in the cost function of the MLE. To avoid drawbacks in solving the MLE, we obtain a linear two-step estimator using non-linear pre-processing which is algebraic and closed-form in each step. To compare different methods, Cramér-Rao lower bound (CRLB) is derived. Simulation results confirm that the proposed linear estimator attains the CRLB for sufficiently high signal-to-noise ratios. © 2011 IEEE.