27 March 2023 in IEEE Transactions on Signal Processing
We focus on the problem of finding optimal sensor locations for source localization techniques based on either time of arrival (TOA) or received signal strength (RSS) measurements. Without any specific assumption on the actual source position, we propose a design framework that directly establishes the optimal sensor locations by minimizing suitable Cramer-Rao bound (CRB)-related cost functions. Specifically, we just consider a region where the source is likely to be present and focus on two cost functions: the former relies on the trace/determinant of CRB averaged over a grid of points resulting from the sampling of the surveillance area (shortly average CRB), whereas, the latter leverages the maximum trace/determinant of CRB over the mentioned grid (shortly worst-case CRB). Moreover, each sensor position is constrained to lie within a pre-specified set (deployment constraint set). Hence, we propose an optimization framework based on block majorization-minimization to deal with both the design paradigms. The iterative steps of the technique monotonically decrease the corresponding figure of merit and eventually converge to a stationary point of the design problem. The proposed methodology can also handle the case of nonuniform noise variances. Finally, through various numerical simulations, we show the effectiveness of the developed resource allocation policies.
30 August 2022 in IEEE Transactions on Aerospace and Electronic Systems
Source localization techniques incorporating hybrid measurements improve the reliability and accuracy of the location estimate. Given a set of hybrid sensors that can collect combined time of arrival (TOA), received signal strength (RSS) and angle of arrival (AOA) measurements, the localization accuracy can be enhanced further by optimally designing the placements of the hybrid sensors. In this paper, we present an optimal sensor placement methodology, which is based on the principle of majorization-minimization (MM), for hybrid localization technique. We first derive the Cramer-Rao lower bound (CRLB) of the hybrid measurement model, and formulate the design problem using the A-optimal criterion. Next, we introduce an auxiliary variable to reformulate the design problem into an equivalent saddle-point problem, and then construct simple surrogate functions (having closed form solutions) over both primal and dual variables. The application of MM in this paper is distinct from the conventional MM (that is usually developed only over the primal variable), and we believe that the MM framework developed in this paper can be employed to solve many optimization problems. The main advantage of our method over most of the existing state-of-the-art algorithms (which are mostly analytical in nature) is its ability to work for both uncorrelated and correlated noise in the measurements. We also discuss the extension of the proposed algorithm for the optimal placement designs based on D and E optimal criteria. Finally, the performance of the proposed method is studied under different noise conditions and different design parameters.
28 March 2024 in IEEE Transactions on Radar Systems
In this paper, we propose a numerical method for the optimal placement of the receivers in a multistatic target localization system (with a single transmitter and multiple receivers) in order to improve the achievable target estimation accuracy of time-sum-of-arrival (TSOA) localization techniques, for 2D and 3D scenarios. The proposed algorithm is based on the principle of block majorization minimization (block MM) which is a combination of block coordinate descent and majorization-minimization (MM) methods. More precisely, we formulate the design objective for the placement of sensors performing TSOA measurements using A - and D - optimality criteria, and propose an iterative algorithm to find the optimal solution by first splitting the design variable into M blocks (where M is the number of receivers) and then applying the principle of MM on each block. The proposed method can additionally handle the cases where the transmitter also acts as a receiver. The framework can also be applied to the case of non-uniform noise variances at the receivers. Several numerical simulation results are included to show the benefits offered by the developed design algorithm.
3 March 2022 in IEEE Transactions on Signal Processing
In this paper, we introduce a novel iterative algorithm for the problem of phase-retrieval where the measurements consist of only the magnitude of linear function of the unknown signal, and the noise in the measurements follow Poisson distribution. The proposed algorithm is based on the principle of majorization-minimization (MM); however, the application of MM here is very novel and distinct from the way MM has been usually used to solve optimization problems in the literature. More precisely, we reformulate the original minimization problem into a saddle point problem by invoking Fenchel dual representation of the $\log (\cdot)$ term in the Poisson likelihood function. We then propose tighter surrogate functions over both primal and dual variables resulting in a double-loop MM algorithm, which we have named as Primal-Dual Majorization-Minimization (PDMM) algorithm. The iterative steps of the resulting algorithm are simple to implement and involve only computing matrix vector products. We also extend our algorithm to handle various $\ell _{1}$ regularized Poisson phase-retrieval problems (which exploit sparsity). The proposed algorithm is compared with previously proposed algorithms such as wirtinger flow (WF), MM (conventional), and alternating direction methods of multipliers (ADMM) for the Poisson data model. The simulation results under different experimental settings show that PDMM is faster than the competing methods, and its performance in recovering the original signal is at par with the state-of-the-art algorithms.
6 April 2022 in IEEE Signal Processing Letters
In this letter, we propose an algorithm for learning a sparse weighted graph by estimating its adjacency matrix under the assumption that the observed signals vary smoothly over the nodes of the graph. The proposed algorithm is based on the principle of majorization minimization (MM), wherein we first obtain a tight surrogate function for the graph learning objective and then solve the resultant surrogate problem which has a simple closed form solution. The proposed algorithm does not require tuning of any hyperparameter and it has the desirable feature of eliminating the inactive variables in the course of the iterations - which can be used to speed up the algorithm. The numerical simulations conducted using both synthetic and real world (brain-network) data show that the proposed algorithm converges faster, in terms of the average number of iterations, than several existing methods in the literature.
14 January 2022 in IEEE Signal Processing Letters
Abstract--- In this paper, we propose an iterative algorithm named PGPAL for the phase-retrieval problem under the scenario when the measurements follow Poisson plus Gaussian (PG) distribution, which is a more realistic model in applications like astronomy, microscopy, medical imaging, and remote sensing. The proposed algorithm is based on majorization-minimization (MM) framework, in which a simple surrogate function that tightly upperbounds the challenging underlying maximum-likelihood (ML) objective is constructed and minimized iteratively. The proposed algorithm monotonically decreases the ML objective and the algorithm is guaranteed to converge to a stationary point of the ML objective. Numerical simulations are performed for the one-dimensional phase-retrieval case, and the performance of the proposed method is compared with the recently proposed Poisson phase-retrieval algorithm, which assumes the measurement model to be only Poisson distributed. The performance of the proposed MM-based algorithm in terms of the normalized root mean square error (NRMSE) is found to be much better in comparison to the method for Poisson phase-retrieval.