Paul Hurley
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Paul Hurley has a total of 78 co-authors. Here are the top co-authors by number of shared publications:
Matthieu Simeoni
IBM Zurich Research Laboratory
11 shared publicationsGiovanni Cherubini
IBM Research - Zurich, 8803 Rüschlikon, Switzerland
4 shared publications- Robin Scheibler
LINE Corporation, Tokyo, Japan
4 shared publications Sanaz Kazemi
IBM Research - Zurich, 8803 Rüschlikon, Switzerland
4 shared publicationsTed Hurley
4 shared publicationsAndreas Kind
IBM Research Zurich
3 shared publications
Latest Publications
- Open Access
- 5 August 2025
- Published by Elsevier in Journal of Stroke and Cerebrovascular Diseases
- Vol. 34 (10) , 108413
Discrimination of ischemic versus hemorrhagic stroke type by presenting symptoms or signs: A systematic review and meta-analysis
- 5 August 2025
- Published by Elsevier in Journal of Stroke and Cerebrovascular Diseases
- Vol. 34 (10) , 108413
Open AccessDiscrimination of ischemic versus hemorrhagic stroke type by presenting symptoms or signs: A systematic review and meta-analysis
- Open Access
- 27 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 69 (1053587X) , 42-57
CPGD: Cadzow Plug-and-Play Gradient Descent for Generalised FRI
Finite rate of innovation (FRI) is a powerful reconstruction framework enabling the recovery of sparse Dirac streams from uniform low-pass filtered samples. An extension of this framework, called generalised FRI (genFRI), has been recently proposed for handling cases with arbitrary linear measurement models. In this context, signal reconstruction amounts to solving a joint constrained optimisation problem, yielding estimates of both the Fourier series coefficients of the Dirac stream and its so-called annihilating filter, involved in the regularisation term. This optimisation problem is however highly non convex and non linear in the data. Moreover, the proposed numerical solver is computationally intensive and without convergence guarantee. In this work, we propose an implicit formulation of the genFRI problem. To this end, we leverage a novel regularisation term which does not depend explicitly on the unknown annihilating filter yet enforces sufficient structure in the solution for stable recovery. The resulting optimisation problem is still non convex, but simpler since linear in the data and with less unknowns. We solve it by means of a provably convergent proximal gradient descent (PGD) method. Since the proximal step does not admit a simple closed-form expression, we propose an inexact PGD method, coined Cadzow plug-and-play gradient descent (CPGD). The latter approximates the proximal steps by means of Cadzow denoising, a well-known denoising algorithm in FRI. We provide local fixed-point convergence guarantees for CPGD. Through extensive numerical simulations, we demonstrate the superiority of CPGD against the state-of-the-art in the case of non uniform time samples.
- 27 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 69 (1053587X) , 42-57
Open AccessCPGD: Cadzow Plug-and-Play Gradient Descent for Generalised FRI
Finite rate of innovation (FRI) is a powerful reconstruction framework enabling the recovery of sparse Dirac streams from uniform low-pass filtered samples. An extension of this framework, called generalised FRI (genFRI), has been recently proposed for handling cases with arbitrary linear measurement models. In this context, signal reconstruction amounts to solving a joint constrained optimisation problem, yielding estimates of both the Fourier series coefficients of the Dirac stream and its so-called annihilating filter, involved in the regularisation term. This optimisation problem is however highly non convex and non linear in the data. Moreover, the proposed numerical solver is computationally intensive and without convergence guarantee. In this work, we propose an implicit formulation of the genFRI problem. To this end, we leverage a novel regularisation term which does not depend explicitly on the unknown annihilating filter yet enforces sufficient structure in the solution for stable recovery. The resulting optimisation problem is still non convex, but simpler since linear in the data and with less unknowns. We solve it by means of a provably convergent proximal gradient descent (PGD) method. Since the proximal step does not admit a simple closed-form expression, we propose an inexact PGD method, coined Cadzow plug-and-play gradient descent (CPGD). The latter approximates the proximal steps by means of Cadzow denoising, a well-known denoising algorithm in FRI. We provide local fixed-point convergence guarantees for CPGD. Through extensive numerical simulations, we demonstrate the superiority of CPGD against the state-of-the-art in the case of non uniform time samples.
- Open Access
Projected ICU and Mortuary load due to COVID-19 in Sydney
The spread of COVID-19 is expected to put a large strain on many hospital resources, including ICU bed space, and mortuary capacity. In this report we study the possible demands on ICU and mortuary capacity in Sydney, Australia, using an adapted SEIR epidemiological model.
Open AccessProjected ICU and Mortuary load due to COVID-19 in Sydney
The spread of COVID-19 is expected to put a large strain on many hospital resources, including ICU bed space, and mortuary capacity. In this report we study the possible demands on ICU and mortuary capacity in Sydney, Australia, using an adapted SEIR epidemiological model.
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4260-4264
Graph Spectral Clustering of Convolution Artefacts in Radio Interferometric Images
The starting point for deconvolution methods in radio astronomy is an estimate of the sky intensity called a dirty image. These methods rely on the telescope point-spread function so as to remove artefacts which pollute it. In this work, we show that the intensity field is only a partial summary statistic of the matched filtered interferometric data, which we prove is spatially correlated on the celestial sphere. This allows us to define a sky covariance function. This previously unexplored quantity brings us additional information that can be leveraged in the process of removing dirty image artefacts. We demonstrate this using a novel unsupervised learning method. The problem is formulated on a graph: each pixel interpreted as a node, linked by edges weighted according to their spatial correlation. We then use spectral clustering to separate the artefacts in groups, and identify physical sources within them.
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4260-4264
Graph Spectral Clustering of Convolution Artefacts in Radio Interferometric Images
The starting point for deconvolution methods in radio astronomy is an estimate of the sky intensity called a dirty image. These methods rely on the telescope point-spread function so as to remove artefacts which pollute it. In this work, we show that the intensity field is only a partial summary statistic of the matched filtered interferometric data, which we prove is spatially correlated on the celestial sphere. This allows us to define a sky covariance function. This previously unexplored quantity brings us additional information that can be leveraged in the process of removing dirty image artefacts. We demonstrate this using a novel unsupervised learning method. The problem is formulated on a graph: each pixel interpreted as a node, linked by edges weighted according to their spatial correlation. We then use spectral clustering to separate the artefacts in groups, and identify physical sources within them.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1837-1841
A Functional Framework for Ultrasound Imaging
Delay-And-Sum (DAS), the state-of-art in ultrasound imaging, is known to be sub-optimal, resulting in low resolution and contrast. Most proposed improvements involve ad-hoc re-weighting, or hit computational bottlenecks given real-time requirements. This paper takes a fresh perspective on the problem, leveraging a functional framework to obtain a regularized least-squares estimate of the tissue reflectivity function. An explicit solution is derived, which - for specific cases - can be efficiently implemented, making it suitable for real-time imaging. In our formulation, DAS appears as a back-projection without any optimal properties. We illustrate the framework through first a one-dimensional set-up, and then a two-dimensional extension with Synthetic Aperture Focusing Technique (SAFT). The one-dimensional simulations show a 77% resolution improvement with respect to DAS, which artificially limits the available bandwidth. On a standard performance-assessment phantom, simulations show that SAFT depth resolution can be improved by 71%.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1837-1841
A Functional Framework for Ultrasound Imaging
Delay-And-Sum (DAS), the state-of-art in ultrasound imaging, is known to be sub-optimal, resulting in low resolution and contrast. Most proposed improvements involve ad-hoc re-weighting, or hit computational bottlenecks given real-time requirements. This paper takes a fresh perspective on the problem, leveraging a functional framework to obtain a regularized least-squares estimate of the tissue reflectivity function. An explicit solution is derived, which - for specific cases - can be efficiently implemented, making it suitable for real-time imaging. In our formulation, DAS appears as a back-projection without any optimal properties. We illustrate the framework through first a one-dimensional set-up, and then a two-dimensional extension with Synthetic Aperture Focusing Technique (SAFT). The one-dimensional simulations show a 77% resolution improvement with respect to DAS, which artificially limits the available bandwidth. On a standard performance-assessment phantom, simulations show that SAFT depth resolution can be improved by 71%.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1983-19832
Towards More Accurate Radio Telescope Images
Radio interferometry usually compensates for high levels of noise in sensor/antenna electronics by throwing data and energy at the problem: observe longer, then store and process it all. We propose instead a method to remove the noise explicitly before imaging. To this end, we developed an algorithm that first decomposes the instances of antenna correlation matrix, the so-called visibility matrix, into additive components using Singular Spectrum Analysis and then cluster these components using graph Laplacian matrix. We show through simulation the potential for radio astronomy, in particular, illustrating the benefit for LOFAR, the low frequency array in Netherlands. Least-squares images are estimated with far higher accuracy with low computation cost without the need for long observation time.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1983-19832
Towards More Accurate Radio Telescope Images
Radio interferometry usually compensates for high levels of noise in sensor/antenna electronics by throwing data and energy at the problem: observe longer, then store and process it all. We propose instead a method to remove the noise explicitly before imaging. To this end, we developed an algorithm that first decomposes the instances of antenna correlation matrix, the so-called visibility matrix, into additive components using Singular Spectrum Analysis and then cluster these components using graph Laplacian matrix. We show through simulation the potential for radio astronomy, in particular, illustrating the benefit for LOFAR, the low frequency array in Netherlands. Least-squares images are estimated with far higher accuracy with low computation cost without the need for long observation time.
- Open Access
- 15 December 2017
- Published by EDP Sciences in Astronomy & Astrophysics
- Vol. 608, A136
LEAP: Looking beyond pixels with continuous-space EstimAtion of Point sources
Context. Two main classes of imaging algorithms have emerged in radio interferometry: the CLEAN algorithm and its multiple variants, and compressed-sensing inspired methods. They are both discrete in nature, and estimate source locations and intensities on a regular grid. For the traditional CLEAN-based imaging pipeline, the resolution power of the tool is limited by the width of the synthesized beam, which is inversely proportional to the largest baseline. The finite rate of innovation (FRI) framework is a robust method to find the locations of point-sources in a continuum without grid imposition. The continuous formulation makes the FRI recovery performance only dependent on the number of measurements and the number of sources in the sky. FRI can theoretically find sources below the perceived tool resolution. To date, FRI had never been tested in the extreme conditions inherent to radio astronomy: weak signal / high noise, huge data sets, large numbers of sources. Aims. The aims were (i) to adapt FRI to radio astronomy, (ii) verify it can recover sources in radio astronomy conditions with more accurate positioning than CLEAN, and possibly resolve some sources that would otherwise be missed, (iii) show that sources can be found using less data than would otherwise be required to find them, and (iv) show that FRI does not lead to an augmented rate of false positives. Methods. We implemented a continuous domain sparse reconstruction algorithm in Python. The angular resolution performance of the new algorithm was assessed under simulation, and with visibility measurements from the LOFAR telescope. Existing catalogs were used to confirm the existence of sources. Results. We adapted the FRI framework to radio interferometry, and showed that it is possible to determine accurate off-grid point-source locations and their corresponding intensities. In addition, FRI-based sparse reconstruction required less integration time and smaller baselines to reach a comparable reconstruction quality compared to a conventional method. The achieved angular resolution is higher than the perceived instrument resolution, and very close sources can be reliably distinguished. The proposed approach has cubic complexity in the total number (typically around a few thousand) of uniform Fourier data of the sky image estimated from the reconstruction. It is also demonstrated that the method is robust to the presence of extended-sources, and that false-positives can be addressed by choosing an adequate model order to match the noise level.
- 15 December 2017
- Published by EDP Sciences in Astronomy & Astrophysics
- Vol. 608, A136
Open AccessLEAP: Looking beyond pixels with continuous-space EstimAtion of Point sources
Context. Two main classes of imaging algorithms have emerged in radio interferometry: the CLEAN algorithm and its multiple variants, and compressed-sensing inspired methods. They are both discrete in nature, and estimate source locations and intensities on a regular grid. For the traditional CLEAN-based imaging pipeline, the resolution power of the tool is limited by the width of the synthesized beam, which is inversely proportional to the largest baseline. The finite rate of innovation (FRI) framework is a robust method to find the locations of point-sources in a continuum without grid imposition. The continuous formulation makes the FRI recovery performance only dependent on the number of measurements and the number of sources in the sky. FRI can theoretically find sources below the perceived tool resolution. To date, FRI had never been tested in the extreme conditions inherent to radio astronomy: weak signal / high noise, huge data sets, large numbers of sources. Aims. The aims were (i) to adapt FRI to radio astronomy, (ii) verify it can recover sources in radio astronomy conditions with more accurate positioning than CLEAN, and possibly resolve some sources that would otherwise be missed, (iii) show that sources can be found using less data than would otherwise be required to find them, and (iv) show that FRI does not lead to an augmented rate of false positives. Methods. We implemented a continuous domain sparse reconstruction algorithm in Python. The angular resolution performance of the new algorithm was assessed under simulation, and with visibility measurements from the LOFAR telescope. Existing catalogs were used to confirm the existence of sources. Results. We adapted the FRI framework to radio interferometry, and showed that it is possible to determine accurate off-grid point-source locations and their corresponding intensities. In addition, FRI-based sparse reconstruction required less integration time and smaller baselines to reach a comparable reconstruction quality compared to a conventional method. The achieved angular resolution is higher than the perceived instrument resolution, and very close sources can be reliably distinguished. The proposed approach has cubic complexity in the total number (typically around a few thousand) of uniform Fourier data of the sky image estimated from the reconstruction. It is also demonstrated that the method is robust to the presence of extended-sources, and that false-positives can be addressed by choosing an adequate model order to match the noise level.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7, 2134-2138
Denoising radio interferometric images by subspace clustering
Radio interferometry usually compensates for high levels of noise in sensor/antenna electronics by throwing data and energy at the problem: observe longer, then store and process it all. Furthermore, only the end image is cleaned, reducing flexibility substantially. We propose instead a method to remove the noise explicitly before imaging. To this end, we developed an algorithm that first decomposes the sensor signals into components using Singular Spectrum Analysis and then cluster these components using graph Laplacian matrix. We show through simulation the potential for radio astronomy, in particular, illustrating the benefit for LOFAR, the low frequency array in Netherlands. From telescopic data to least-squares image estimates, far higher accuracy with low computation cost results without the need for long observation time.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7, 2134-2138
Denoising radio interferometric images by subspace clustering
Radio interferometry usually compensates for high levels of noise in sensor/antenna electronics by throwing data and energy at the problem: observe longer, then store and process it all. Furthermore, only the end image is cleaned, reducing flexibility substantially. We propose instead a method to remove the noise explicitly before imaging. To this end, we developed an algorithm that first decomposes the sensor signals into components using Singular Spectrum Analysis and then cluster these components using graph Laplacian matrix. We show through simulation the potential for radio astronomy, in particular, illustrating the benefit for LOFAR, the low frequency array in Netherlands. From telescopic data to least-squares image estimates, far higher accuracy with low computation cost results without the need for long observation time.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3570-3574
Robust recovery for aperture synthesis imaging
We propose a sparse reconstruction method based on compressed sensing theory for aperture synthesis imaging. Our algorithm directly works on observational data without grid-ding. We achieve fast convergence by introducing an adaptive tolerance parameter based on the noise level and a thresholding value based on the cumulative sum of the power of the estimated source components. We demonstrate the accuracy in estimating the source positions and intensities in extremely low signal-to-noise (SNR) scenarios in Monte Carlo simulation. We could recover both point sources and extended sources with our algorithm using a Dirac basis from real data.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3570-3574
Robust recovery for aperture synthesis imaging
We propose a sparse reconstruction method based on compressed sensing theory for aperture synthesis imaging. Our algorithm directly works on observational data without grid-ding. We achieve fast convergence by introducing an adaptive tolerance parameter based on the noise level and a thresholding value based on the cumulative sum of the power of the estimated source components. We demonstrate the accuracy in estimating the source positions and intensities in extremely low signal-to-noise (SNR) scenarios in Monte Carlo simulation. We could recover both point sources and extended sources with our algorithm using a Dirac basis from real data.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
On an analytical, spatially-varying, point-spread-function
The point spread function (PSF), namely the response of an ultrasound system to a point source, is a powerful measure of the quality of an imaging system. The lack of an analytical formulation inhibits many applications ranging from apodization optimization, array-design, and deconvolution algorithms. We propose to fill this gap through a general PSF derivation that is flexible with respect to the type of transmission (synthetic aperture, plane-wave, diverging-wave etc.), while faithfully capturing the spatially-variant blurring of the Tissue Reflectivity Function as caused by Delay-And-Sum reconstruction. We validate the derived PSF against simulation using Field II, and show that accounting for PSF spatial-variability in sparse-based deconvolution improves reconstruction.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
On an analytical, spatially-varying, point-spread-function
The point spread function (PSF), namely the response of an ultrasound system to a point source, is a powerful measure of the quality of an imaging system. The lack of an analytical formulation inhibits many applications ranging from apodization optimization, array-design, and deconvolution algorithms. We propose to fill this gap through a general PSF derivation that is flexible with respect to the type of transmission (synthetic aperture, plane-wave, diverging-wave etc.), while faithfully capturing the spatially-variant blurring of the Tissue Reflectivity Function as caused by Delay-And-Sum reconstruction. We validate the derived PSF against simulation using Field II, and show that accounting for PSF spatial-variability in sparse-based deconvolution improves reconstruction.