Sorry, you need to enable JavaScript to visit this website.

We consider stochastic motion planning in single-source single-destination robotic relay networks, under a cooperative beamforming framework. Assuming that the communication medium constitutes a spatiotemporal stochastic field, we propose a

The short-time Fourier transform (STFT) is widely used to analyze the spectra of temporal signals that vary through time. Signals defined over graphs, due to their intrinsic complexity, exhibit large variations in their patterns. In this work we propose a new formulation for an STFT for signals defined over graphs. This formulation draws on recent ideas from spectral graph theory, using personalized PageRank vectors as its fundamental building block.

We present an extension of recent semidefinite programming formulations for atomic decomposition over continuous dictionaries, with applications to continuous or 'gridless' compressed sensing. The dictionary considered in this paper is defined in terms of a general matrix pencil and is parameterized by a complex variable that varies over a segment of a line or circle in the complex plane. The main result of the paper is the formulation as a convex semidefinite optimization problem, and a simple constructive proof of the equivalence.

In this paper we focus on the relative position and orientation estimation between rigid bodies in an anchorless scenario. Several sensor units are installed on the rigid platforms, and the sensor placement on the rigid bodies is known beforehand (i.e., relative locations of the sensors on the rigid body are known). However, the absolute position of the rigid bodies is not known. We show that the relative localization of rigid bodies amounts to the estimation of a rotation matrix and the relative distance between the centroids of the rigid bodies.

Linear canonical transform (LCT) is an attractive and useful tool in optics and signal processing. In previous work, a generalization of the LCT with two extra parameters, called offset LCT (OLCT), has been developed. In this paper, a different definition of OLCT is proposed, which has a more concise form of inverse transform. We find a linear operator that commutes with the proposed OLCT. We prove that the commuting operator and the proposed OLCT have the same set of eigenfunctions with different eigenvalues.

The paper quantifies and compares the exact asymptotic performance of multiple measurement vector (MMV) and distributed sensing (DS) models. Both models assume multiple measurement instances y_k = A_kx_k + w_k; k = 1,2,...,K. The difference is that MMV involves identical measurement matrices whereas DS allows different matrices for different measurement instances. It has been recognized that DS works better than MMV empirically. However, the quantification of the performance difference is not available in the literature.

This is an overview poster on recent research of adaptive selection of estimation bandwidth for analysis of locally stationary multivariate processes.