We present a source localization method based on a sparse representation of sensor measurements with an overcomplete basis composed of samples from the array manifold. We enforce sparsity by imposing penalties based on the /spl lscr//sub 1/-norm. A number of recent theoretical results on sparsifying properties of /spl lscr//sub 1/ penalties justify this choice. Explicitly enforcing the sparsity of the representation is motivated by a desire to obtain a sharp estimate of the spatial spectrum that exhibits super-resolution. We propose to use the singular value decomposition (SVD) of the data matrix to summarize multiple time or frequency samples. Our formulation leads to an optimization problem, which we solve efficiently in a second-order cone (SOC) programming framework by an interior point implementation. We propose a grid refinement method to mitigate the effects of limiting estimates to a grid of spatial locations and introduce an automatic selection criterion for the regularization parameter involved in our approach. We demonstrate the effectiveness of the method on simulated data by plots of spatial spectra and by comparing the estimator variance to the Crame/spl acute/r-Rao bound (CRB). We observe that our approach has a number of advantages over other source localization techniques, including increased resolution, improved robustness to noise, limitations in data quantity, and correlation of the sources, as well as not requiring an accurate initialization.

/pdf/a-sparse-signal-reconstruction-perspective-for-source-52kw5wqztd.pdf

A sparse signal reconstruction perspective for source localization with sensor arrays

We present a rank reduction algorithm that permits simultaneous reconstruction and random noise attenuation of seismic records. We based our technique on multichannel singular spectrum analysis (MSSA). The technique entails organizing spatial data at a given temporal frequency into a block Hankel matrix that in ideal conditions is a matrix of rank k , where k is the number of plane waves in the window of analysis. Additive noise and missing samples will increase the rank of the block Hankel matrix of the data. Consequently, rank reduction is proposed as a means to attenuate noise and recover missing traces. We present an iterative algorithm that resembles seismic data reconstruction with the method of projection onto convex sets. In addition, we propose to adopt a randomized singular value decomposition to accelerate the rank reduction stage of the algorithm. We apply MSSA reconstruction to synthetic examples and a field data set. Synthetic examples were used to assess the performance of the method in two...

Simultaneous seismic data denoising and reconstruction via multichannel singular spectrum analysis

Array processing is widely used in sensing applications for estimating the locations and waveforms of the sources in a given field. In the absence of a large number of snapshots, which is the case in numerous practical applications, such as underwater array processing, it becomes challenging to estimate the source parameters accurately. This paper presents a nonparametric and hyperparameter, free-weighted, least squares-based iterative adaptive approach for amplitude and phase estimation (IAA-APES) in array processing. IAA-APES can work well with few snapshots (even one), uncorrelated, partially correlated, and coherent sources, and arbitrary array geometries. IAA-APES is extended to give sparse results via a model-order selection tool, the Bayesian information criterion (BIC). Moreover, it is shown that further improvements in resolution and accuracy can be achieved by applying the parametric relaxation-based cyclic approach (RELAX) to refine the IAA-APES&BIC estimates if desired. IAA-APES can also be applied to active sensing applications, including single-input single-output (SISO) radar/sonar range-Doppler imaging and multi-input single-output (MISO) channel estimation for communications. Simulation results are presented to evaluate the performance of IAA-APES for all of these applications, and IAA-APES is shown to outperform a number of existing approaches.

/pdf/source-localization-and-sensing-a-nonparametric-iterative-4s686v96t8.pdf

Source Localization and Sensing: A Nonparametric Iterative Adaptive Approach Based on Weighted Least Squares

SUMMARY Seismic data recovery from data with missing traces on otherwise regular acquisition grids forms a crucial step in the seismic processing flow. For instance, unsuccessful recovery leads to imaging artefacts and to erroneous predictions for the multiples, adversely affecting the performance of multiple elimination. A non-parametric transform-based recovery method is presented that exploits the compression of seismic data volumes by recently developed curvelet frames. The elements of this transform are multidimensional and directional and locally resemble wave fronts present in the data, which leads to a compressible representation for seismic data. This compression enables us to formulate a new curvelet-based seismic data recovery algorithm through sparsity-promoting inversion. The concept of sparsity-promoting inversion is in itself not new to geophysics. However, the recent insights from the field of ‘compressed sensing’ are new since they clearly identify the three main ingredients that go into a successful formulation of a recovery problem, namely a sparsifying transform, a sampling strategy that subdues coherent aliases and a sparsity-promoting program that recovers the largest entries of the curvelet-domain vector while explaining the measurements. These concepts are illustrated with a stylized experiment that stresses the importance of the degree of compression by the sparsifying transform. With these findings, a curvelet-based recovery algorithms is developed, which recovers seismic wavefields from seismic data volumes with large percentages of traces missing. During this construction, we benefit from the main three ingredients of compressive sampling, namely the curvelet compression of seismic data, the existence of a favourable sampling scheme and the formulation of a large-scale sparsity-promoting solver based on a cooling method. The recovery performs well on synthetic as well as real data by virtue of the sparsifying property of curvelets. Our results are applicable to other areas such as global seismology.

/pdf/non-parametric-seismic-data-recovery-with-curvelet-frames-3bf5izdudw.pdf

Non-parametric seismic data recovery with curvelet frames

In seismic data processing, we often need to interpolate and extrapolate data at missing spatial locations. The reconstruction problem can be posed as an inverse problem where, from inadequate and incomplete data, we attempt to reconstruct the seismic wavefield at locations where measurements were not acquired.We propose a wavefield reconstruction scheme for spatially band‐limited signals. The method entails solving an inverse problem where a wavenumber‐domain regularization term is included. The regularization term constrains the solution to be spatially band‐limited and imposes a prior spectral shape. The numerical algorithm is quite efficient since the method of conjugate gradients in conjunction with fast matrix–vector multiplications, implemented via the fast Fourier transform (FFT), is adopted. The algorithm can be used to perform multidimensional reconstruction in any spatial domain.

Minimum weighted norm interpolation of seismic records

We present an iterative nonparametric approach to spectral estimation that is particularly suitable for estimation of line spectra. This approach minimizes a cost function derived from Bayes' theorem. The method is suitable for line spectra since a "long tailed" distribution is used to model the prior distribution of spectral amplitudes. Since the data themselves are used as constraints, phase information can also be recovered and used to extend the data outside the original window. The objective function is formulated in terms of hyperparameters that control the degree of fit and spectral resolution. Noise rejection can also be achieved by truncating the number of iterations. Spectral resolution and extrapolation length are controlled by a single parameter. When this parameter is large compared with the spectral powers, the algorithm leads to zero extrapolation of the data, and the estimated Fourier transform yields the periodogram. When the data are sampled at a constant rate, the algorithm uses one Levinson recursion per iteration. For irregular sampling, the algorithm uses one Cholesky decomposition per iteration. The performance of the algorithm is illustrated with three different problems that arise in geophysical data: (1) harmonic retrieval from a time series contaminated with noise; (2) linear event detection from a finite aperture array of receivers, (3) interpolation/extrapolation of gapped data. The performance of the algorithm as a spectral estimator is tested with the Kay and Marple (1981) data set.

/pdf/interpolation-and-extrapolation-using-a-high-resolution-1nes4km12f.pdf

C.J. Walker

Papers

Interpolation and extrapolation using a high-resolution discrete Fourier transform