Energy Based Sensor Network Source Localization via Projection onto Convex Sets (POCS)
نویسندگان
چکیده
This paper addresses the problem of locating an acoustic source using a sensor network in a distributed manner, i.e., without transmitting the full data set to a central point for processing. This problem has been traditionally addressed through the maximum likelihood framework or nonlinear least squares. These methods, even though asymptotically optimal under certain conditions, pose a difficult global optimization problem. It is shown that the associated objective function may have multiple local optima and saddle points and hence any local search method might stagnate at a sub-optimal solution. In this paper, we formulate the problem as a convex feasibility problem and apply a distributed version of the projection onto convex sets (POCS) method. We give a closed form expression for the projection phase, which usually constitutes the heaviest computational aspect of POCS. Conditions are given under which, when the number of samples increases to infinity or in the absence of measurement noise, the convex feasibility problem has a unique solution at the true source location. In general, the method converges to a limit point or a limit cycle in the neighborhood of the true location. Simulation results show convergence to the global optimum with extremely fast convergence rates compared to the previous methods.
منابع مشابه
A Distributed Localization System for Sensor Networks
We propose a distributed algorithm for single acoustic source localization. The algorithm is based on the local estimate of time-difference-of-arrival (TDOA) at each pair of sensors, and the distributed implementation is based on the projection onto convex sets (POCS) principle. Convergence of the algorithm in the is discussed and an approximate closed form expression is given in the projection...
متن کاملConvex set theoretic image recovery by extrapolated iterations of parallel subgradient projections
Solving a convex set theoretic image recovery problem amounts to finding a point in the intersection of closed and convex sets in a Hilbert space. The projection onto convex sets (POCS) algorithm, in which an initial estimate is sequentially projected onto the individual sets according to a periodic schedule, has been the most prevalent tool to solve such problems. Nonetheless, POCS has several...
متن کاملCombettes : Convex Set Theoretic Image Recovery by Extrapolated Subgradient Projections 3
| Solving a convex set theoretic image recovery problem amounts to nding a point in the intersection of closed and convex sets in a Hilbert space. The POCS algorithm , in which an initial estimate is sequentially projected onto the individual sets according to a periodic schedule, has been the most prevalent tool to solve such problems. Nonetheless, POCS has several shortcomings: it converges s...
متن کاملProjection Onto Convex Sets ( POCS ) Based Signal Reconstruction Framework with an associated cost function
A new signal processing framework based on the projections onto convex sets (POCS) is developed for solving convex optimization problems. The dimension of the minimization problem is lifted by one and the convex sets corresponding to the epigraph of the cost function are defined. If the cost function is a convex function in RN the corresponding epigraph set is also a convex set in RN+1. The ite...
متن کاملDenoising Using Projection Onto Convex Sets (POCS) Based Framework
Two new optimization techniques based on projections onto convex space (POCS) framework for solving convex optimization problems are presented. The dimension of the minimization problem is lifted by one and sets corresponding to the cost function are defined. If the cost function is a convex function in R the corresponding set is also a convex set in R. The iterative optimization approach start...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005