Publications
255 results found
Deng X, Song P, Rodrigues MRD, et al., 2019, RADAR: robust algorithm for depth image super resolution based on FRI theory and multimodal dictionary learning, IEEE Transactions on Circuits and Systems for Video Technology, Pages: 1-1, ISSN: 1051-8215
Depth image super-resolution is a challenging problem, since normally high upscaling factors are required (e.g., 16×), and depth images are often noisy. In order to achieve large upscaling factors and resilience to noise, we propose a Robust Algorithm for Depth imAge super Resolution (RADAR) that combines the power of finite rate of innovation (FRI) theory with multimodal dictionary learning. Given a low-resolution (LR) depth image, we first model its rows and columns as piece-wise polynomials and propose a FRI-based depth upscaling (FDU) algorithm to super-resolve the image. Then, the upscaled moderate quality (MQ) depth image is further enhanced with the guidance of a registered high-resolution (HR) intensity image. This is achieved by learning multimodal mappings from the joint MQ depth and HR intensity pairs to the HR depth, through a recently proposed triple dictionary learning (TDL) algorithm. Moreover, to speed up the super-resolution process, we introduce a new projection-based rapid upscaling (PRU) technique that pre-calculates the projections from the joint MQ depth and HR intensity pairs to the HR depth. Compared with state-of-the-art deep learning based methods, our approach has two distinct advantages: we need a fraction of training data but can achieve the best performance, and we are resilient to mismatches between training and testing datasets. Extensive numerical results show that the proposed method outperforms other state-of-the-art methods on either noise-free or noisy datasets with large upscaling factors up to 16× and can handle unknown blurring kernels well.
Alexandru R, Dragotti PL, 2019, Rumour source detection in social networks using partial observations, IEEE Global Conference on Signal and Information Processing 2018, Publisher: IEEE
The spread of information on graphs has beenextensively studied in engineering, biology, and economics. Re-cently, however, several authors have started to address themore challenging inverse problem, of localizing the origin of anepidemic, given observed traces of infection. In this paper, weintroduce a novel technique to estimate the location of a sourceof multiple epidemics on a general graph, assuming knowledgeof the start times of rumours, and using observations from asmall number of monitors.
Quicke P, Howe CL, Song P, et al., 2019, Calculation of high numerical aperture lightfield microscope point spread functions
3D deconvolution of lightfield images enables high resolution reconstruction of sample volumes. Previous point spread function calculations assume low to moderate NA objectives. Here we present a simple vectorial calculation valid for high NA objectives.
Erdemir E, Gündüz D, Dragotti PL, 2019, Smart meter privacy, Privacy in Dynamical Systems, Pages: 19-41, ISBN: 9789811504921
The newgeneration electricity supply network, called the smart grid (SG), provides consumers with an active management and control of the power. By utilizing digital communications and sensing technologies which make the grid smart, SGs yield more efficient electricity transmission, reduced peak demand, improved security and increased integration of renewable energy systems compared to the traditional grid. Smart meters (SMs) are one of the core enablers of SG systems; they measure and record the high resolution electricity consumption information of a household almost in a real time basis, and report it to the utility provider (UP) at regular time intervals. SM measurements can be used for time-of-use pricing, trading user-generated energy, and mitigating load variations. However, real-time SM readings can also reveal sensitive information about the consumer’s activities which the user may not want to share with the UP, resulting in serious privacy concerns. SM privacy enabling techniques proposed in the literature can be categorized as SM data manipulation and demand shaping. While the SMdata is modified before being reported to the UP in the former method, the latter requires direct manipulation of the real energy consumption by exploiting physical resources, such as a renewable energy source (RES) or a rechargeable battery (RB). In this chapter, a datamanipulation privacy-enabling technique and three different demand shaping privacy-enabling techniques are presented, considering SM with a RES and an RB, SM with only an RB andSMwith only a RES. Information theoretic measures are used to quantify SM privacy. Optimal energy management strategies and bounds which are obtained using control theory, specifically Markov decision processes (MDPs), and rate distortion theory are analyzed.
Song P, Jadan HV, Quicke P, et al., 2019, Location estimation for light field microscopy based on convolutional sparse coding
In this work, we propose an algorithm to estimate the depth location of objects from lightfield microscopy data by leveraging the sparsity of Epipolar Plane Images (EPIs) and convolutional sparse coding.
Alexandru R, Dragotti PL, 2019, Time encoding and perfect recovery of non-bandlimited signals with an integrate-and-fire system, 13th International Conference on Sampling Theory and Applications (SampTA), Publisher: IEEE
- Author Web Link
- Cite
- Citations: 3
Erdemir E, Dragotti PL, Gunduz D, 2019, Privacy-Aware Location Sharing with Deep Reinforcement Learning, IEEE International Workshop on Information Forensics and Security (WIFS), Publisher: IEEE, ISSN: 2157-4766
- Author Web Link
- Cite
- Citations: 1
Alexandru R, Dragotti PL, 2019, Diffusion Source Detection in a Network using Partial Observations, Conference on Wavelets and Sparsity XVIII, Publisher: SPIE-INT SOC OPTICAL ENGINEERING, ISSN: 0277-786X
- Author Web Link
- Cite
- Citations: 3
Alexandru R, Dragotti PL, 2019, TIME-BASED SAMPLING AND RECONSTRUCTION OF NON-BANDLIMITED SIGNALS, 44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Publisher: IEEE, Pages: 7948-7952, ISSN: 1520-6149
- Author Web Link
- Cite
- Citations: 5
Huang J-J, Dragotti PL, 2019, A DEEP DICTIONARY MODEL TO PRESERVE AND DISENTANGLE KEY FEATURES IN A SIGNAL, 44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Publisher: IEEE, Pages: 3702-3706, ISSN: 1520-6149
- Author Web Link
- Cite
- Citations: 5
Erdemir E, Dragotti PL, Gunduz D, 2019, PRIVACY-COST TRADE-OFF IN A SMART METER SYSTEM WITH A RENEWABLE ENERGY SOURCE AND A RECHARGEABLE BATTERY, 44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Publisher: IEEE, Pages: 2687-2691, ISSN: 1520-6149
- Author Web Link
- Cite
- Citations: 11
Deng X, Dragotti PL, 2019, COUPLED ISTA NETWORK FOR MULTI-MODAL IMAGE SUPER-RESOLUTION, 44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Publisher: IEEE, Pages: 1862-1866, ISSN: 1520-6149
- Author Web Link
- Cite
- Citations: 3
Alexandru R, Malhotra P, Reynolds S, et al., 2018, Estimating the topology of neural networks from distributed observations., European Signal Processing Conference 2018, Publisher: IEEE
We address the problem of estimating the effective connectivity of the brain network, using the input stimulus model proposed by Izhikevich in [1], which accurately reproduces the behaviour of spiking and bursting biological neurons, whilst ensuring computational simplicity. We first analyse the temporal dynamics of neural networks, showing that the spike propagation within the brain can be modelled as a diffusion process. This helps prove the suitability of NetRate algorithm proposed by Rodriguez in [2] to infer the structure of biological neural networks. Finally, we present simulation results using synthetic data to verify the performance of the topology estimation algorithm.
Dragotti P, Huang J, 2018, Photo realistic image completion via dense correspondence, IEEE Transactions on Image Processing, Vol: 27, Pages: 5234-5247, ISSN: 1057-7149
In this paper, we propose an image completion algorithm based on dense correspondence between the input image and an exemplar image retrieved from the Internet. Contrary to traditional methods which register two images according to sparse correspondence, in this paper, we propose a hierarchical PatchMatch method that progressively estimates a dense correspondence, which is able to capture small deformations between images. The estimated dense correspondence has usually large occlusion areas that correspond to the regions to be completed. A nearest neighbor field (NNF) interpolation algorithm interpolates a smooth and accurate NNF over the occluded region. Given the calculated NNF, the correct image content from the exemplar image is transferred to the input image. Finally, as there could be a color difference between the completed content and the input image, a color correction algorithm is applied to remove the visual artifacts. Numerical results show that our proposed image completion method can achieve photo realistic image completion results.
Reynolds SC, abrahamsson T, sjostrom PJ, et al., 2018, CosMIC: a consistent metric for spike inference from calcium imaging, Neural Computation, Vol: 30, Pages: 2726-2756, ISSN: 0899-7667
In recent years, the development of algorithms to detect neuronal spiking activity from two-photon calcium imaging data has received much attention. Meanwhile, few researchers have examined the metrics used to assess the similarity of detected spike trains with the ground truth. We highlight the limitations of the two most commonly used metrics, the spike train correlation and success rate, and propose an alternative, which we refer to as CosMIC. Rather than operating on the true and estimated spike trains directly, the proposed metric assesses the similarity of the pulse trains obtained from convolution of the spike trains with a smoothing pulse. The pulse width, which is derived from the statistics of the imaging data, reflects the temporal tolerance of the metric. The final metric score is the size of the commonalities of the pulse trains as a fraction of their average size. Viewed through the lens of set theory, CosMIC resembles a continuous Sørensen-Dice coefficient — an index commonly used to assess the similarity of discrete, presence/absence data. We demonstrate the ability of the proposed metric to discriminate the precision and recall of spike train estimates. Unlike the spike train correlation, which appears to reward overestimation, the proposed metric score is maximised when the correct number of spikes have been detected. Furthermore, we show that CosMIC is more sensitive to the temporal precision of estimates than the success rate.
Deng X, Huang J, Liu M, et al., 2018, U-FRESH: AN FRI-BASED SINGLE IMAGE SUPER RESOLUTION ALGORITHM AND AN APPLICATION IN IMAGE COMPRESSION, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Publisher: IEEE, Pages: 1807-1811
Huang J-J, Dragotti PL, 2018, A DEEP DICTIONARY MODEL FOR IMAGE SUPER-RESOLUTION, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Publisher: IEEE, Pages: 6777-6781
Yang G, Yu S, Hao D, et al., 2018, DAGAN: deep de-aliasing generative adversarial networks for fast compressed sensing MRI reconstruction, IEEE Transactions on Medical Imaging, Vol: 37, Pages: 1310-1321, ISSN: 0278-0062
Compressed Sensing Magnetic Resonance Imaging (CS-MRI) enables fast acquisition, which is highly desirable for numerous clinical applications. This can not only reduce the scanning cost and ease patient burden, but also potentially reduce motion artefacts and the effect of contrast washout, thus yielding better image quality. Different from parallel imaging based fast MRI, which utilises multiple coils to simultaneously receive MR signals, CS-MRI breaks the Nyquist-Shannon sampling barrier to reconstruct MRI images with much less required raw data. This paper provides a deep learning based strategy for reconstruction of CS-MRI, and bridges a substantial gap between conventional non-learning methods working only on data from a single image, and prior knowledge from large training datasets. In particular, a novel conditional Generative Adversarial Networks-based model (DAGAN) is proposed to reconstruct CS-MRI. In our DAGAN architecture, we have designed a refinement learning method to stabilise our U-Net based generator, which provides an endto-end network to reduce aliasing artefacts. To better preserve texture and edges in the reconstruction, we have coupled the adversarial loss with an innovative content loss. In addition, we incorporate frequency domain information to enforce similarity in both the image and frequency domains. We have performed comprehensive comparison studies with both conventional CSMRI reconstruction methods and newly investigated deep learning approaches. Compared to these methods, our DAGAN method provides superior reconstruction with preserved perceptual image details. Furthermore, each image is reconstructed in about 5 ms, which is suitable for real-time processing.
Dragotti PL, 2018, A Brief Message From the New Editor-in-Chief, IEEE TRANSACTIONS ON SIGNAL PROCESSING, Vol: 66, Pages: 1952-1952, ISSN: 1053-587X
Lu Y, Onativia J, Dragotti P, 2018, Sparse representation in Fourier and local bases Using ProSparse: a probabilistic analysis, IEEE Transactions on Information Theory, Vol: 64, Pages: 2639-2647, ISSN: 0018-9448
Finding the sparse representation of a signal in an overcomplete dictionary has attracted a lot of attention over the past years. This paper studies ProSparse, a new polynomial complexity algorithm that solves the sparse representation problem when the underlying dictionary is the union of a Vandermonde matrix and a banded matrix. Unlike our previous work which establishes deterministic (worst-case) sparsity bounds for ProSparse to succeed, this paper presents a probabilistic average-case analysis of the algorithm. Based on a generatingfunction approach, closed-form expressions for the exact success probabilities of ProSparse are given. The success probabilities are also analyzed in the high-dimensional regime. This asymptotic analysis characterizes a sharp phase transition phenomenon regarding the performance of the algorithm.
Schuck R, Go MA, Garasto S, et al., 2018, Multiphoton minimal inertia scanning for fast acquisition of neural activity signals, Journal of Neural Engineering, Vol: 15, ISSN: 1741-2552
Objective: Multi-photon laser scanning microscopy provides a powerful tool for monitoring the spatiotemporal dynamics of neural circuit activity. It is, however, intrinsically a point scanning technique. Standard raster scanning enables imaging at subcellular resolution; however, acquisition rates are limited by the size of the field of view to be scanned. Recently developed scanning strategies such as Travelling Salesman Scanning (TSS) have been developed to maximize cellular sampling rate by scanning only select regions in the field of view corresponding to locations of interest such as somata. However, such strategies are not optimized for the mechanical properties of galvanometric scanners. We thus aimed to develop a new scanning algorithm which produces minimal inertia trajectories, and compare its performance with existing scanning algorithms. Approach: We describe here the Adaptive Spiral Scanning (SSA) algorithm, which fits a set of near-circular trajectories to the cellular distribution to avoid inertial drifts of galvanometer position. We compare its performance to raster scanning and TSS in terms of cellular sampling frequency and signal-to-noise ratio (SNR). Main Results: Using surrogate neuron spatial position data, we show that SSA acquisition rates are an order of magnitude higher than those for raster scanning and generally exceed those achieved by TSS for neural densities comparable with those found in the cortex. We show that this result also holds true for in vitro hippocampal mouse brain slices bath loaded with the synthetic calcium dye Cal-520 AM. The ability of TSS to "park" the laser on each neuron along the scanning trajectory, however, enables higher SNR than SSA when all targets are precisely scanned. Raster scanning has the highest SNR but at a substantial cost in number of cells scanned. To understand the impact of sampling rate and SNR on functional calcium imaging, we used the Crame ́r-Rao Bound on e
Markovsky I, Dragotti PL, 2018, Using Hankel Structured Low-Rank Approximation for Sparse Signal Recovery, 14th International Conference on Latent Variable Analysis and Signal Separation (LVA/ICA), Publisher: SPRINGER INTERNATIONAL PUBLISHING AG, Pages: 479-487, ISSN: 0302-9743
Reynolds SC, Abrahamsson T, Schuck R, et al., 2017, ABLE: an activity-based level set segmentation algorithm for two-photon calcium imaging data, eNeuro, Vol: 4, Pages: 1-13, ISSN: 2373-2822
We present an algorithm for detecting the location of cells from two-photon calcium imaging data. In our framework, multiple coupled active contours evolve, guided by a model-based cost function, to identify cell boundaries. An active contour seeks to partition a local region into two subregions, a cell interior and exterior, in which all pixels have maximally ‘similar’ time courses. This simple, local model allows contours to be evolved predominantly independently. When contours are sufficiently close, their evolution is coupled, in a manner that permits overlap. We illustrate the ability of the proposed method to demix overlapping cells on real data. The proposed framework is flexible, incorporating no prior information regarding a cell’s morphology or stereotypical temporal activity, which enables the detection of cells with diverse properties. We demonstrate algorithm performance on a challenging mouse in vitro dataset, containing synchronously spiking cells, and a manually labelled mouse in vivo dataset, on which ABLE achieves a 67.5% success rate.
Schuck R, Go MA, Garasto S, et al., 2017, Multiphoton minimal inertia scanning for fast acquisition of neural activity signals
<jats:title>Abstract</jats:title><jats:p>Multi-photon laser scanning microscopy provides a powerful tool for monitoring the spatiotemporal dynamics of neural circuit activity. It is, however, intrinsically a point scanning technique. Standard raster scanning enables imaging at subcellular resolution; however, acquisition rates are limited by the size of the field of view to be scanned. Recently developed scanning strategies such as Travelling Salesman Scanning (TSS) have been developed to maximize cellular sampling rate by scanning only regions of interest in the field of view corresponding to locations of interest such as somata. However, such strategies are not optimized for the mechanical properties of galvanometric scanners. We describe here the Adaptive Spiral Scanning (SSA) algorithm, which fits a set of near-circular trajectories to the cellular distribution to avoid inertial drifts of galvanometer position. We compare its performance to raster scanning and TSS in terms of cellular sampling frequency and signal-to-noise ratio (SNR). Using surrogate neuron spatial position data, we show that SSA acquisition rates are an order of magnitude higher than those for raster scanning and generally exceed those achieved by TSS for neural densities comparable with those found in the cortex. We show that this result also holds true for <jats:italic>in vitro</jats:italic> hippocampal mouse brain slices bath loaded with the synthetic calcium dye Cal-520 AM. The ability of TSS to ”park” the laser on each neuron along the scanning trajectory, however, enables higher SNR than SSA when all targets are precisely scanned. Raster scanning has the highest SNR but at a substantial cost in number of cells scanned. To understand the impact of sampling rate and SNR on functional calcium imaging, we used the Cramér-Rao Bound on evoked calcium traces recorded simultaneously with electrophysiology traces to calculate the lower bound estima
Murray-Bruce J, Dragotti PL, 2017, Spatiotemporal Sampling Trade-off for Inverse Diffusion Source Problems, 12th International Conference on Sampling Theory and Applications (SAMPTA), Publisher: IEEE, Pages: 55-59
We consider the spatiotemporal sampling of diffusion fields induced by M point sources, and study the associated inverse problem of recovering the initial parameters of the unknown sources. In particular, we focus on characterising qualitatively the error of the obtained source estimates. To achieve this, we obtain an expression with which we can trade the sensor density for performance accuracy. In other words, by evaluating the optimal sampling instant for a given sensor density-and using the corresponding field samples at that instant-we can expect to obtain an improvement in the estimation performance when compared to an arbitrary sampling instant. Finally, several numerical simulations are presented, to support the theoretical results obtained.
Huang J-J, Dragotti PL, 2017, Sparse Signal Recovery Using Structured Total Maximum Likelihood, 12th International Conference on Sampling Theory and Applications (SAMPTA), Publisher: IEEE, Pages: 639-643
In this paper, we consider the sparse signal recovery problem when the dictionary is a Fourier frame. Based on the annihilation relation, the sparse signal recovery from noisy observations is posed as a structured total maximum likelihood (STML) problem. The recent structured total least squares (STLS) approach for finite rate of innovation signal recovery can be viewed as a particular version of our method. We transform the STML problem which has an additional logdet term into a form similar to the STLS problem. It can be effectively tackled using an iterative quadratic maximum likelihood like algorithm. From simulation results, our proposed STML approach outperforms the STLS based algorithm and the state-of-the-art sparse recovery algorithms.
Frossard P, Dragotti PL, Ortega A, et al., 2017, Introduction to the Cooperative Special Issue on Graph Signal Processing in the IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS and the IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, IEEE Journal of Selected Topics in Signal Processing, Vol: 11, Pages: 771-773, ISSN: 1932-4553
The papers in this special issue are intended to address some of the main research challenges in Graph Signal Processing by presenting a collection of the latest advances in the domain. These papers examine key representation, learning and processing aspects for signals living on graphs and networks, as well as new methods and applications in graph signal processing. Numerous applications rely on the processing of high dimensional data that reside on irregular or otherwise unordered structures that are naturally modeled as networks. The need for new tools to process such data has led to the emergence of the field of graph signal processing, which merges algebraic and spectral graph theoretic concepts with computational harmonic analysis to process signals on structures such as graphs. This important new paradigm in signal processing research, coupled with its numerous applications in very different domains, has fueled the rapid development of an inter-disciplinary research community that has been working on theoretical aspects of graph signal processing and applications to diverse problems such as big data analysis, coding and compression of 3D point clouds, biological data processing, and brain network analysis.
Frossard P, Dragotti PL, Ortega A, et al., 2017, Introduction to the COOPERATIVE SPECIAL ISSUE ON GRAPH SIGNAL PROCESSING IN THE IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING AND THE IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, Vol: 3, Pages: 448-450, ISSN: 2373-776X
Dragotti P, Murray-Bruce J, 2017, A Sampling Framework for Solving Physics-driven Inverse Source Problems, IEEE Transactions on Signal Processing, Vol: 65, Pages: 6365-6380, ISSN: 1053-587X
Partial differential equations are central to describing many physical phenomena. In many applications these phenomena are observed through a sensor network, with the aim of inferring its underlying properties. Leveraging from certain results in sampling and approximation theory, we present a new framework for solving a class of inverse source problems for physical fields governed by linear partial differential equations. Specifically, we demonstrate that the unknown field sources can be recovered from a sequence of, so called, generalised measurements by using multidimensional frequency estimation techniques. Next we show that---for physics-driven fields---this sequence of generalised measurements can be estimated by computing a linear weighted-sum of the sensor measurements; whereby the exact weights (of the sums) correspond to those that reproduce multidimensional exponentials, when used to linearly combine translates of a particular prototype function related to the Green's function of our underlying field. Explicit formulae are then derived for the sequence of weights, that map sensor samples to the exact sequence of generalised measurements when the Green's function satisfies the generalised Strang-Fix condition. Otherwise, the same mapping yields a close approximation of the generalised measurements. Based on this new framework we develop practical, noise robust, sensor network strategies for solving the inverse source problem, and then present numerical simulation results to verify their performance.
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.