Browsing by Subject "Blind source separation"

Now showing 1 - 3 of 3

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.
Open Access
Maximum likelihood estimation of Gaussian mixture models using particle swarm optimization
(IEEE, 2010-08) Arı, Çağlar; Aksoy, Selim
We present solutions to two problems that prevent the effective use of population-based algorithms in clustering problems. The first solution presents a new representation for arbitrary covariance matrices that allows independent updating of individual parameters while retaining the validity of the matrix. The second solution involves an optimization formulation for finding correspondences between different parameter orderings of candidate solutions. The effectiveness of the proposed solutions are demonstrated on a novel clustering algorithm based on particle swarm optimization for the estimation of Gaussian mixture models. © 2010 IEEE.
Open Access
Unsupervised classification of remotely sensed images using Gaussian mixture models and particle swarm optimization
(IEEE, 2010) Arı, Çağlar; Aksoy, Selim
Gaussian mixture models (GMM) are widely used for un-supervised classification applications in remote sensing. Expectation-Maximization (EM) is the standard algorithm employed to estimate the parameters of these models. However, such iterative optimization methods can easily get trapped into local maxima. Researchers use population-based stochastic search algorithms to obtain better estimates. We present a novel particle swarm optimization-based algorithm for maximum likelihood estimation of Gaussian mixture models. The proposed approach provides solutions for important problems in effective application of population-based algorithms to the clustering problem. We present a new parametrization for arbitrary covariance matrices that allows independent updating of individual parameters during the search process. We also describe an optimization formulation for identifying the correspondence relations between different parameter orderings of candidate solutions. Experiments on a hyperspectral image show better clustering results compared to the commonly used EM algorithm for estimating GMMs. © 2010 IEEE.