NuSPAN: A Proximal Average Network for Nonuniform Sparse Model -- Application to Seismic Reflectivity Inversion
We solve the problem of sparse signal deconvolution in the context of seismic reflectivity inversion, which pertains to high-resolution recovery of the subsurface reflection coefficients. Our formulation employs a nonuniform, non-convex synthesis sparse model comprising a combination of convex and non-convex regularizers, which results in accurate approximations of the l0 pseudo-norm. The resulting iterative algorithm requires the proximal average strategy. When unfolded, the iterations give rise to a learnable proximal average network architecture that can be optimized in a data-driven fashion. We demonstrate the efficacy of the proposed approach through numerical experiments on synthetic 1-D seismic traces and 2-D wedge models in comparison with the benchmark techniques. We also present validations considering the simulated Marmousi2 model as well as real 3-D seismic volume data acquired from the Penobscot 3D survey off the coast of Nova Scotia, Canada.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Fast Multitaper Power Spectrum Estimation in Nonuniformly Sampled Time Series
Nonuniformly sampled signals are prevalent in real-world applications, but their power spectra estimation, usually from a finite number of samples of a single realization, presents a significant challenge. The optimal so…
Time SeriesControlled Learning of Pointwise Nonlinearities in Neural-Network-Like Architectures
We present a general variational framework for the training of freeform nonlinearities in layered computational architectures subject to some slope constraints. The regularization that we add to the traditional training …
DenoisingSynthesis of Sparse Linear Arrays via Low-Rank Hankel Matrix Completion
In the process of realizing the synthesis of the antenna array synthesis, it is of practical significance to arrange the nonuniform array and reduce the number of elements. According to the Matrix Pencil Method (MPM), we…
Matrix CompletionNovel sparse PCA method via Runge Kutta numerical method(s) for face recognition
Face recognition is a crucial topic in data science and biometric security, with applications spanning military, finance, and retail industries. This paper explores the implementation of sparse Principal Component Analys…
Face RecognitionBetter Approximation and Faster Algorithm Using the Proximal Average
It is a common practice to approximate complicated'' functions with more friendly ones. In large-scale machine learning applications, nonsmooth losses/regularizers that entail great computational challenges are usually a…