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

This work is a part of our research on scalable and/or distributed fusion and sensor calibration. We address parameter estimation in multi-sensor state space models which underpins surveillance applications with sensor networks. The parameter likelihood of the problem involves centralised Bayesian filtering of multi-sensor data, which lacks scalability with the number of sensors and induces a large communication load. We propose separable likelihoods which approximate the centralised likelihood with single sensor filtering terms.

Categories:
4 Views

A novel scheme for infrared small target detection in compressive domain is presented. First, the original image is separated into two components, i.e., the target and the background. Next, we compress them individually. Finally, the compressed target image is utilized to construct the corresponding compressive detector to perform detection in compressive domain.

Categories:
7 Views

There has been much recent interest in damped sinusoidal models, probably as a result of their relevance to magnetic resonance imaging. In \cite{about2010}, a model which allowed the sinusoid to decay to $0$ was examined, and a Fourier coefficient estimation procedure was proposed.

Categories:
4 Views

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

Categories:
5 Views

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.

Categories:
12 Views

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.

Categories:
1 Views

Pages