George Papanicolaou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
George Papanicolaou has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Josselin Garnier
CMAP
30 shared publications - Jean-Pierre Fouque
Department of Statistics and Applied Probability, University of California, Santa Barbara, USA
20 shared publications - Knut Sølna
University of California at Irvine
20 shared publications - Miguel Moscoso
Departamento de Matemáticas, Escuela Politécnica Superior, Universidad Carlos III de Madrid, Leganés, Madrid, 28911, Spain
10 shared publications - Chrysoula Tsogka
University of California Merced
9 shared publications - Alexei Novikov
Mathematics Department Penn State University 16802 University Park PA
7 shared publications
Latest Publications
- Open Access
- 2 January 2026
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 123 (1)
Data-driven superresolution imaging in disordered media
We propose a methodology that exploits large and diverse datasets to accurately estimate the ambient medium’s Green’s functions in strongly scattering media. Given these estimates, excellent imaging results are achieved, with a resolution that is better than that of a homogeneous medium. This phenomenon, known as superresolution, arises because the ambient scattering medium effectively enlarges the physical imaging aperture. While superresolution has been demonstrated and analyzed extensively in the context of physical time reversal, time reversal itself is not imaging. Our proposed methodology, based on either conventional optimization methods or neural networks, makes it possible to achieve superresolution imaging in complex media.
- 2 January 2026
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 123 (1)
Open AccessData-driven superresolution imaging in disordered media
We propose a methodology that exploits large and diverse datasets to accurately estimate the ambient medium’s Green’s functions in strongly scattering media. Given these estimates, excellent imaging results are achieved, with a resolution that is better than that of a homogeneous medium. This phenomenon, known as superresolution, arises because the ambient scattering medium effectively enlarges the physical imaging aperture. While superresolution has been demonstrated and analyzed extensively in the context of physical time reversal, time reversal itself is not imaging. Our proposed methodology, based on either conventional optimization methods or neural networks, makes it possible to achieve superresolution imaging in complex media.
- Open Access
Wave-informed dictionary learning for high-resolution imaging in complex media
We propose an approach for imaging in scattering media when large and diverse data sets are available. It has two steps. Using a dictionary learning algorithm the first step estimates the true Green's function vectors as columns in an unordered sensing matrix. The array data comes from many sparse sets of sources whose location and strength are not known to us. In the second step, the columns of the estimated sensing matrix are ordered for imaging using Multi-Dimensional Scaling with connectivity information derived from cross-correlations of its columns, as in time reversal. For these two steps to work together we need data from large arrays of receivers so the columns of the sensing matrix are incoherent for the first step, as well as from sub-arrays so that they are coherent enough to obtain the connectivity needed in the second step. Through simulation experiments, we show that the proposed approach is able to provide images in complex media whose resolution is that of a homogeneous medium.
Open AccessWave-informed dictionary learning for high-resolution imaging in complex media
We propose an approach for imaging in scattering media when large and diverse data sets are available. It has two steps. Using a dictionary learning algorithm the first step estimates the true Green's function vectors as columns in an unordered sensing matrix. The array data comes from many sparse sets of sources whose location and strength are not known to us. In the second step, the columns of the estimated sensing matrix are ordered for imaging using Multi-Dimensional Scaling with connectivity information derived from cross-correlations of its columns, as in time reversal. For these two steps to work together we need data from large arrays of receivers so the columns of the sensing matrix are incoherent for the first step, as well as from sub-arrays so that they are coherent enough to obtain the connectivity needed in the second step. Through simulation experiments, we show that the proposed approach is able to provide images in complex media whose resolution is that of a homogeneous medium.
- 12 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Imaging
- Vol. 8 (25730436) , 784-794
Quantitative Phase and Absorption Contrast Imaging
We present an algorithm for coherent diffractive imaging with phaseless measurements. It treats the forward model as a combination of coherent and incoherent waves. The algorithm reconstructs absorption and phase contrast that quantifies the attenuation and the refraction of the waves propagating through an object. It requires coherent or partially coherent illuminations, and several detectors to record the intensity of the distorted wave that passes through the object under inspection. The diversity of illuminations, obtained by putting masks between the source and the object, provides enough information for imaging. The computational cost of our algorithm is linear in the number of pixels of the image. Therefore, it is efficient for high-resolution imaging. Our algorithm guarantees exact recovery if the image is sparse for a given basis. Numerical experiments in the setting of phaseless diffraction imaging of sparse objects validate the efficiency and the precision of the suggested algorithm.
- 12 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Imaging
- Vol. 8 (25730436) , 784-794
Quantitative Phase and Absorption Contrast Imaging
We present an algorithm for coherent diffractive imaging with phaseless measurements. It treats the forward model as a combination of coherent and incoherent waves. The algorithm reconstructs absorption and phase contrast that quantifies the attenuation and the refraction of the waves propagating through an object. It requires coherent or partially coherent illuminations, and several detectors to record the intensity of the distorted wave that passes through the object under inspection. The diversity of illuminations, obtained by putting masks between the source and the object, provides enough information for imaging. The computational cost of our algorithm is linear in the number of pixels of the image. Therefore, it is efficient for high-resolution imaging. Our algorithm guarantees exact recovery if the image is sparse for a given basis. Numerical experiments in the setting of phaseless diffraction imaging of sparse objects validate the efficiency and the precision of the suggested algorithm.
- 19 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 69 (1053587X) , 2042-2055
Fast Signal Recovery From Quadratic Measurements
We present a novel approach for recovering a sparse signal from quadratic measurements corresponding to a rank-one tensorization of the data vector. Such quadratic measurements, referred to as interferometric or cross-correlated data, naturally arise in many fields such as remote sensing, spectroscopy, holography and seismology. Compared to the sparse signal recovery problem that uses linear measurements, the unknown in this case is a matrix formed by the cross correlations of the sought signal. This creates a bottleneck for the inversion since the number of unknowns grows quadratically with the dimension of the signal. The main idea of the proposed approach is to reduce the dimensionality of the problem by recovering only the diagonal of the unknown matrix, whose dimension grows linearly with the size of the signal, and use an efficient Noise Collector to absorb the cross-correlated data that come from the off-diagonal elements of this matrix. These elements do not carry extra information about the support of the signal, but significantly contribute to these data. With this strategy, we recover the unknown matrix by solving a convex linear problem whose cost is similar to the one that uses linear measurements. Our theory shows that the proposed approach provides exact support recovery when the data is not too noisy, and that there are no false positives for any level of noise. It also demonstrates that the level of sparsity that can be recovered scales almost linearly with the number of data. The numerical experiments presented in the paper corroborate these findings.
- 19 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 69 (1053587X) , 2042-2055
Fast Signal Recovery From Quadratic Measurements
We present a novel approach for recovering a sparse signal from quadratic measurements corresponding to a rank-one tensorization of the data vector. Such quadratic measurements, referred to as interferometric or cross-correlated data, naturally arise in many fields such as remote sensing, spectroscopy, holography and seismology. Compared to the sparse signal recovery problem that uses linear measurements, the unknown in this case is a matrix formed by the cross correlations of the sought signal. This creates a bottleneck for the inversion since the number of unknowns grows quadratically with the dimension of the signal. The main idea of the proposed approach is to reduce the dimensionality of the problem by recovering only the diagonal of the unknown matrix, whose dimension grows linearly with the size of the signal, and use an efficient Noise Collector to absorb the cross-correlated data that come from the off-diagonal elements of this matrix. These elements do not carry extra information about the support of the signal, but significantly contribute to these data. With this strategy, we recover the unknown matrix by solving a convex linear problem whose cost is similar to the one that uses linear measurements. Our theory shows that the proposed approach provides exact support recovery when the data is not too noisy, and that there are no false positives for any level of noise. It also demonstrates that the level of sparsity that can be recovered scales almost linearly with the number of data. The numerical experiments presented in the paper corroborate these findings.
- Open Access
- 11 May 2020
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 117 (21) , 11226-11232
The Noise Collector for sparse recovery in high dimensions
Significance: The ability to detect sparse signals from noisy, high-dimensional data is a top priority in modern science and engineering. For optimal results, current approaches need to tune parameters that depend on the level of noise, which is often difficult to estimate. We develop a parameter-free, computationally efficient,-norm minimization approach that has a zero false discovery rate (no false positives) with high probability for any level of noise while it detects the exact location of sparse signals when the noise is not too large.- 11 May 2020
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 117 (21) , 11226-11232
Open AccessThe Noise Collector for sparse recovery in high dimensions
Significance: The ability to detect sparse signals from noisy, high-dimensional data is a top priority in modern science and engineering. For optimal results, current approaches need to tune parameters that depend on the level of noise, which is often difficult to estimate. We develop a parameter-free, computationally efficient,-norm minimization approach that has a zero false discovery rate (no false positives) with high probability for any level of noise while it detects the exact location of sparse signals when the noise is not too large. - 24 March 2020
- Published by With Intelligence LLC in The Journal of Financial Data Science
- Vol. 2 (2) , 85-109
PCA for Implied Volatility Surfaces
Principal component analysis (PCA) is a useful tool when trying to construct factor models from historical asset returns. For the implied volatilities of US equities, there is a PCA-based model with a principal eigenportfolio whose return time series lies close to that of an overarching market factor. The authors show that this market factor is the index resulting from the daily compounding of a weighted average of implied-volatility returns, with weights based on the options’ open interest and Vega. The authors also analyze the singular vectors derived from the tensor structure of the implied volatilities of S&P 500 constituents and find evidence indicating that some type of open interest- and Vega-weighted index should be one of at least two significant factors in this market. TOPICS:Statistical methods, simulations, big data/machine learning Key Findings • Principal component analysis of a comprehensive dataset of implied volatility surfaces from options on US equities shows that their collective behavior is captured by just nine factors, whereas the effective spatial dimension of the residuals is closer to 500 than to the nominal dimension of 28,000, revealing the large redundancy in the data. • Portfolios of implied volatility surface returns, weighed suitably by open interest and Vega, track the principal eigenportfolio associated with a market portfolio of options, in analogy to equity portfolios. • Retention of the tensor structure in the eigenportfolio analysis improves the tracking between the open interest–Vega weighted (tensor) implied volatility surface returns portfolio and the (tensor) eigenportfolio, indicating that data structure matters.
- 24 March 2020
- Published by With Intelligence LLC in The Journal of Financial Data Science
- Vol. 2 (2) , 85-109
PCA for Implied Volatility Surfaces
Principal component analysis (PCA) is a useful tool when trying to construct factor models from historical asset returns. For the implied volatilities of US equities, there is a PCA-based model with a principal eigenportfolio whose return time series lies close to that of an overarching market factor. The authors show that this market factor is the index resulting from the daily compounding of a weighted average of implied-volatility returns, with weights based on the options’ open interest and Vega. The authors also analyze the singular vectors derived from the tensor structure of the implied volatilities of S&P 500 constituents and find evidence indicating that some type of open interest- and Vega-weighted index should be one of at least two significant factors in this market. TOPICS:Statistical methods, simulations, big data/machine learning Key Findings • Principal component analysis of a comprehensive dataset of implied volatility surfaces from options on US equities shows that their collective behavior is captured by just nine factors, whereas the effective spatial dimension of the residuals is closer to 500 than to the nominal dimension of 28,000, revealing the large redundancy in the data. • Portfolios of implied volatility surface returns, weighed suitably by open interest and Vega, track the principal eigenportfolio associated with a market portfolio of options, in analogy to equity portfolios. • Retention of the tensor structure in the eigenportfolio analysis improves the tracking between the open interest–Vega weighted (tensor) implied volatility surface returns portfolio and the (tensor) eigenportfolio, indicating that data structure matters.
- Open Access
PCA for Implied Volatility Surfaces
Principal component analysis (PCA) is a useful tool when trying to construct factor models from historical asset returns. For the implied volatilities of U.S. equities there is a PCA-based model with a principal eigenportfolio whose return time series lies close to that of an overarching market factor. The authors show that this market factor is the index resulting from the daily compounding of a weighted average of implied-volatility returns, with weights based on the options' open interest (OI) and Vega. The authors also analyze the singular vectors derived from the tensor structure of the implied volatilities of S&P500 constituents, and find evidence indicating that some type of OI and Vega-weighted index should be one of at least two significant factors in this market.
Open AccessPCA for Implied Volatility Surfaces
Principal component analysis (PCA) is a useful tool when trying to construct factor models from historical asset returns. For the implied volatilities of U.S. equities there is a PCA-based model with a principal eigenportfolio whose return time series lies close to that of an overarching market factor. The authors show that this market factor is the index resulting from the daily compounding of a weighted average of implied-volatility returns, with weights based on the options' open interest (OI) and Vega. The authors also analyze the singular vectors derived from the tensor structure of the implied volatilities of S&P500 constituents, and find evidence indicating that some type of OI and Vega-weighted index should be one of at least two significant factors in this market.
- 28 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Imaging
- Vol. 6 (25730436) , 87-94
Synthetic Aperture Imaging With Intensity-Only Data
We consider imaging the reflectivity of scatterers from intensity-only data recorded by a single moving transducer that both emits and receives signals, forming a synthetic aperture. By exploiting frequency illumination diversity, we obtain multiple intensity measurements at each location, from which we determine field cross-correlations using an appropriate phase controlled illumination strategy and the inner product polarization identity. The field cross-correlations obtained this way do not, however, provide all the missing phase information because they are determined up to a phase that depends on the receiver's location. The main result of this paper is an algorithm with which we recover the field cross-correlations up to a single phase that is common to all the data measured over the synthetic aperture, so all the data are synchronized. Thus, we can image coherently with data over all frequencies and measurement locations as if full phase information was recorded.
- 28 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Imaging
- Vol. 6 (25730436) , 87-94
Synthetic Aperture Imaging With Intensity-Only Data
We consider imaging the reflectivity of scatterers from intensity-only data recorded by a single moving transducer that both emits and receives signals, forming a synthetic aperture. By exploiting frequency illumination diversity, we obtain multiple intensity measurements at each location, from which we determine field cross-correlations using an appropriate phase controlled illumination strategy and the inner product polarization identity. The field cross-correlations obtained this way do not, however, provide all the missing phase information because they are determined up to a phase that depends on the receiver's location. The main result of this paper is an algorithm with which we recover the field cross-correlations up to a single phase that is common to all the data measured over the synthetic aperture, so all the data are synchronized. Thus, we can image coherently with data over all frequencies and measurement locations as if full phase information was recorded.
- Open Access
Synthetic aperture imaging with intensity-only data
We consider imaging the reflectivity of scatterers from intensity-only data recorded by a single moving transducer that both emits and receives signals, forming a synthetic aperture. By exploiting frequency illumination diversity, we obtain multiple intensity measurements at each location, from which we determine field cross-correlations using an appropriate phase controlled illumination strategy and the inner product polarization identity. The field cross-correlations obtained this way do not, however, provide all the missing phase information because they are determined up to a phase that depends on the receiver's location. The main result of this paper is an algorithm with which we recover the field cross-correlations up to a single phase that is common to all the data measured over the synthetic aperture, so all the data are synchronized. Thus, we can image coherently with data over all frequencies and measurement locations as if full phase information was recorded.
Open AccessSynthetic aperture imaging with intensity-only data
We consider imaging the reflectivity of scatterers from intensity-only data recorded by a single moving transducer that both emits and receives signals, forming a synthetic aperture. By exploiting frequency illumination diversity, we obtain multiple intensity measurements at each location, from which we determine field cross-correlations using an appropriate phase controlled illumination strategy and the inner product polarization identity. The field cross-correlations obtained this way do not, however, provide all the missing phase information because they are determined up to a phase that depends on the receiver's location. The main result of this paper is an algorithm with which we recover the field cross-correlations up to a single phase that is common to all the data measured over the synthetic aperture, so all the data are synchronized. Thus, we can image coherently with data over all frequencies and measurement locations as if full phase information was recorded.
- Open Access
Robust multifrequency imaging with MUSIC
In this paper, we study the MUltiple SIgnal Classification (MUSIC) algorithm often used to image small targets when multiple measurement vectors are available. We show that this algorithm may be used when the imaging problem can be cast as a linear system that admits a special factorization. We discuss several active array imaging configurations where this factorization is exact, as well as other configurations where the factorization only holds approximately and, hence, the results provided by MUSIC deteriorate. We give special attention to the most general setting where an active array with an arbitrary number of transmitters and receivers uses signals of multiple frequencies to image the targets. This setting provides all the possible diversity of information that can be obtained from the illuminations. We give a theorem that shows that MUSIC is robust with respect to additive noise provided that the targets are well separated. The theorem also shows the relevance of using appropriate sets of controlled parameters, such as excitations, to form the images with MUSIC robustly. We present numerical experiments that support our theoretical results.
Open AccessRobust multifrequency imaging with MUSIC
In this paper, we study the MUltiple SIgnal Classification (MUSIC) algorithm often used to image small targets when multiple measurement vectors are available. We show that this algorithm may be used when the imaging problem can be cast as a linear system that admits a special factorization. We discuss several active array imaging configurations where this factorization is exact, as well as other configurations where the factorization only holds approximately and, hence, the results provided by MUSIC deteriorate. We give special attention to the most general setting where an active array with an arbitrary number of transmitters and receivers uses signals of multiple frequencies to image the targets. This setting provides all the possible diversity of information that can be obtained from the illuminations. We give a theorem that shows that MUSIC is robust with respect to additive noise provided that the targets are well separated. The theorem also shows the relevance of using appropriate sets of controlled parameters, such as excitations, to form the images with MUSIC robustly. We present numerical experiments that support our theoretical results.