Matrix sensing problems capitalize on the knowledge that a data matrix of interest exhibits low rank properties. This low dimensional structure often arises because the data matrix is obtained by sampling a smooth function on a regular (or structured) grid. However, in many practical situations the measurements are taken on an irregular grid (that is accurately known). This results in an “unstructured data matrix” that is less fit for the low rank model in comparison to its regular counterpart and therefore subject to degraded reconstruction via rank penalization techniques. In this paper, we propose and analyze a modified low-rank matrix recovery work-flow that admits unstructured observations. By incorporating a regularization operator which accurately maps structured data to unstructured data, into the nuclear-norm minimization problem, we are able to compensate for data irregularity. Furthermore, by construction our formulation yields output that is supported on a structured grid. We establish recovery error bounds for our methodology and offer matrix sensing and matrix completion numerical experiments including applications to seismic trace interpolation to demonstrate the potential of the approach.
16 January 2023 in IEEE Transactions on Geoscience and Remote Sensing
Seismic imaging in challenging sedimentary basins and reservoirs requires acquiring, processing, and imaging very large volumes of data (tens of terabytes). To reduce the cost of acquisition and the time from acquiring the data to producing a subsurface image, novel acquisition systems based on compressive sensing, low-rank matrix recovery, and randomized sampling have been developed and implemented. These approaches allow practitioners to achieve dense wavefield reconstruction from a substantially reduced number of field samples. However, designing acquisition surveys suited for this new sampling paradigm remains a critical and challenging role in oil, gas, and geothermal exploration. Typical random designs studied in the low-rank matrix recovery and compressive sensing literature are difficult to achieve by standard industry hardware. For practical purposes, a compromise between stochastic and realizable samples is needed. In this paper, we propose a deterministic and computationally cheap tool to alleviate randomized acquisition design, prior to survey deployment and large-scale optimization. We consider universal and deterministic matrix completion results in the context of seismology, where a bipartite graph representation of the source-receiver layout allows for the respective spectral gap to act as a quality metric for wavefield reconstruction. We provide realistic scenarios to demonstrate the utility of the spectral gap as a flexible tool that can be incorporated into existing survey design workflows for successful seismic data acquisition via low-rank and sparse signal recovery.
27 April 2023 in Information and Inference: A Journal of the IMA
We propose a novel statistical inference methodology for multiway count data that is corrupted by false zeros that are indistinguishable from true zero counts. Our approach consists of zero-truncating the Poisson distribution to neglect all zero values. This simple truncated approach dispenses with the need to distinguish between true and false zero counts and reduces the amount of data to be processed. Inference is accomplished via tensor completion that imposes low-rank tensor structure on the Poisson parameter space. Our main result shows that an $N$-way rank-$R$ parametric tensor $\boldsymbol{\mathscr{M}}\in (0,\infty )^{I\times \cdots \times I}$ generating Poisson observations can be accurately estimated by zero-truncated Poisson regression from approximately $IR^2\log _2^2(I)$ non-zero counts under the nonnegative canonical polyadic decomposition. Our result also quantifies the error made by zero-truncating the Poisson distribution when the parameter is uniformly bounded from below. Therefore, under a low-rank multiparameter model, we propose an implementable approach guaranteed to achieve accurate regression in under-determined scenarios with substantial corruption by false zeros. Several numerical experiments are presented to explore the theoretical results.
7 August 2023 in Sampling Theory, Signal Processing, and Data Analysis
Many empirical studies suggest that samples of continuous-time signals taken at locations randomly deviated from an equispaced grid (i.e.,off-the-grid) can benefit signal acquisition, e.g., undersampling and anti-aliasing. However, explicit statements of such advantages and their respective conditions are scarce in the literature. This paper provides some insight on this topic when the sampling positions are known, with grid deviations generated i.i.d. from a variety distributions. By solving a square-root LASSO decoder with an interpolation kernel we demonstrate the capabilities of nonuniform samples for compressive sampling, an effective paradigm for undersampling and anti-aliasing. For functions in the Wiener algebra that admit a discretes-sparse representation in some transform domain, we show that $${\mathcal {O}}(s{{\,\mathrm{poly\,\hspace{-2pt}log}\,}}N)$$ random off-the-grid samples are sufficient to recover an accurate $$\frac{N}{2}$$ -bandlimited approximation of the signal. For sparse signals (i.e., $$s \ll N$$ ), this sampling complexity is a great reduction in comparison to equispaced sampling where $${\mathcal {O}}(N)$$ measurements are needed for the same quality of reconstruction (Nyquist–Shannon sampling theorem). We further consider noise attenuation via oversampling (relative to a desired bandwidth), a standard technique with limited theoretical understanding when the sampling positions are non-equispaced. By solving a least squares problem, we show that $${\mathcal {O}}(N\log N)$$ i.i.d. randomly deviated samples provide an accurate $$\frac{N}{2}$$ -bandlimited approximation of the signal with suppression of the noise energy by a factor $$\sim \frac{1}{\sqrt{\log (N)}}.$$