3 June 2021 in IEEE Control Systems Letters
In this letter, we consider the binary classification problem via distributed Support Vector Machines (SVMs), where the idea is to train a network of agents, with limited share of data, to cooperatively learn the SVM classifier for the global database. Agents only share processed information regarding the classifier parameters and the gradient of the local loss functions instead of their raw data. In contrast to the existing work, we propose a continuous-time algorithm that incorporates network topology changes in discrete jumps. This hybrid nature allows us to remove chattering that arises because of the discretization of the underlying CT process. We show that the proposed algorithm converges to the SVM classifier over time-varying weight balanced directed graphs by using arguments from the matrix perturbation theory.
28 September 2022 in IEEE Open Journal of Control Systems
This paper considers distributed allocation strategies, formulated as a distributed sum-preserving (fixed-sum) allocation of resources over a multi-agent network in the presence of heterogeneous arbitrary time-varying delays. We propose a double time-scale scenario for unknown delays and a faster single time-scale scenario for known delays. Further, the links among the nodes are considered subject to certain nonlinearities (e.g, quantization and saturation/clipping). We discuss different models for nonlinearities and how they may affect the convergence, sum-preserving feasibility constraint, and solution optimality over general weight-balanced uniformly strongly connected networks and, further, time-delayed undirected networks. Our proposed scheme works in a variety of applications with general non-quadratic strongly-convex smooth objective functions. The non-quadratic part, for example, can be due to additive convex penalty or barrier functions to address the local box constraints. The network can change over time, is not necessarily connected at all times, but is only assumed to be uniformly-connected. The novelty of this work is to address all-time feasible Laplacian gradient solutions in presence of nonlinearities, switching digraph topology (not necessarily all-time connected), and heterogeneous time-varying delays.
16 March 2021 in Optics Express
Creating immersive 3D stereoscopic, autostereoscopic, and lightfield experiences are becoming the center point of optical design of future head mounted displays and lightfield displays. However, despite the advancement in 3D and light field displays, there is no consensus on what are the necessary quantized depth levels for such emerging displays at stereoscopic or monocular modalities. Here we start from psychophysical theories and work toward defining and prioritizing quantized levels of depth that would saturate the human depth perception. We propose a general optimization framework, which locates the depth levels in a globally optimal way for band limited displays. While the original problem is computationally intractable, we manage to find a tractable reformulation as maximally covering a region of interest with a selection of hypographs corresponding to the monocular depth of field profiles. The results indicate that on average 1731 stereoscopic and 7 monocular depth levels (distributed optimally from 25 cm to infinity) would saturate the visual depth perception. Such that adding further depth levels adds negligible improvement. Also the first 3 depth levels should be allocated at (148), then (83, 170), then (53, 90, 170) distances respectively from the face plane to minimize the monocular error in the entire population. The study further discusses the 3D spatial profile of the quantized stereoscopic and monocular depth levels. The study provides fundamental guidelines for designing optimal near eye displays, light-field monitors, and 3D screens.
19 March 2018 in IEEE Transactions on Image Processing
We present a general method for extracting a region from an image (or 3D object) that can be expressed, or approximated, by taking unions and set differences from a collection of template shapes in a dictionary. We build on recent work that shows how this geometric problem can be recast in the language of linear algebra, with set operations on shapes translated into linear combinations of vectors, and solved using convex programming. This paper presents a set of sufficient conditions for which this convex program returns the “correct” shape. These conditions are robust in that they can account for the shapes that have indistinct boundaries, or model mismatch between the shapes in the dictionary and the target region in the image. We also present two different methods for solving the convex extraction program. The first method simply recasts the problem as a linear program, while the second uses the alternating direction method of multipliers with a series of easily computed proximal operators. We present a number of numerical experiments that use the framework to perform image segmentation, optical character recognition, and find multi-resolution geometrical descriptions of 3D objects.
14 September 2020 in IEEE Transactions on Signal Processing
We consider the bilinear inverse problem of recovering two vectors, $\vx\in\R^L$ and $\vw\in\R^L$ , from their entrywise product. We consider the case where $\vx$ and $\vw$ have known signs and are sparse with respect to known dictionaries of size $K$ and $N$ , respectively. Here, $K$ and $N$ may be larger than, smaller than, or equal to $L$ . We introduce $\ell_1$ -BranchHull, which is a convex program posed in the natural parameter space and does not require an approximate solution or initialization in order to be stated or solved. Under the assumptions that $\vx$ and $\vw$ satisfy a comparable-effective-sparsity condition and are $S_1$ - and $S_2$ -sparse with respect to a random dictionary, we present a recovery guarantee in a noisy case. We show that $\ell_1$ -BranchHull is robust to small dense noise with high probability if the number of measurements satisfy $L\geq\Omega\left((S_1+S_2)\log^{2}(K+N)\right)$ . Numerical experiments show that the scaling constant in the theorem is not too large. We also introduce variants of $\ell_1$ -BranchHull for the purposes of tolerating noise and outliers, and for the purpose of recovering piecewise constant signals. We provide an ADMM implementation of these variants and show they can extract piecewise constant behavior from real images.