@conference {zhang2020SEGwrw,
	title = {Wavefield recovery with limited-subspace weighted matrix factorizations},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2020},
	note = {(SEG, virtual)},
	month = {09},
	pages = {2858-2862},
	abstract = {Modern-day seismic imaging and monitoring technology increasingly rely on dense full-azimuth sampling. Unfortunately, the costs of acquiring densely sampled data rapidly become prohibitive and we need to look for ways to sparsely collect data, e.g. from sparsely distributed ocean bottom nodes, from which we then derive densely sampled surveys through the method of wavefield reconstruction. Because of their relatively cheap and simple calculations, wavefield reconstruction via matrix factorizations has proven to be a viable and scalable alternative to the more generally used transform-based methods. While this method is capable of processing all full azimuth data frequency by frequency slice, its performance degrades at higher frequencies because monochromatic data at these frequencies is not as well approximated by low-rank factorizations. We address this problem by proposing a recursive recovery technique, which involves weighted matrix factorizations where recovered wavefields at the lower frequencies serve as prior information for the recovery of the higher frequencies. To limit the adverse effects of potential overfitting, we propose a limited-subspace recursively weighted matrix factorization approach where the size of the row and column subspaces to construct the weight matrices is constrained. We apply our method to data collected from the Gulf of Suez, and our results show that our limited-subspace weighted recovery method significantly improves the recovery quality.},
	keywords = {algorithm, data reconstruction, frequency-domain, interpolation, Processing, SEG},
	doi = {10.1190/segam2020-3428365.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2020/zhang2020SEGwrw/zhang2020SEGwrw.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2020/zhang2020SEGwrw/zhang2020SEGwrw_pres.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2020/zhang2020SEGwrw/zhang2020SEGwrw_pres.mp4},
	software = {https://github.com/slimgroup/Software.SEG2020},
	author = {Yijun Zhang and Shashin Sharan and Oscar Lopez and Felix J. Herrmann}
}
@article {peters2019aos,
	title = {Algorithms and software for projections onto intersections of convex and non-convex sets with applications to inverse problems},
	journal = {arXiv e-prints},
	year = {2019},
	note = {(arXiv)},
	month = {03},
	abstract = {We propose algorithms and software for computing projections onto the intersection of multiple convex and non-convex constraint sets. The software package, called SetIntersectionProjection, is intended for the regularization of inverse problems in physical parameter estimation and image processing. The primary design criterion is working with multiple sets, which allows us to solve inverse problems with multiple pieces of prior knowledge. Our algorithms outperform the well known Dykstra{\textquoteright}s algorithm when individual sets are not easy to project onto because we exploit similarities between constraint sets. Other design choices that make the software fast and practical to use, include recently developed automatic selection methods for auxiliary algorithm parameters, fine and coarse grained parallelism, and a multilevel acceleration scheme. We provide implementation details and examples that show how the software can be used to regularize inverse problems. Results show that we benefit from working with all available prior information and are not limited to one or two regularizers because of algorithmic, computational, or hyper-parameter selection issues.},
	keywords = {algorithm, software},
	url = {http://arxiv.org/abs/1902.09699},
	author = {Bas Peters and Felix J. Herrmann}
}
@conference {zhang2019SEGhfw,
	title = {High-frequency wavefield recovery with weighted matrix factorizations},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2019},
	note = {(SEG, San Antonio)},
	month = {09},
	pages = {3959-3963},
	abstract = {Acquired seismic data is normally not the fully sampled data we would like to work with since traces are missing due to physical constraints or budget limitations. Rank minimization is an effective way to recovering the missing trace data. Unfortunately, this technique{\textquoteright}s performance may deteriorate at higher frequency because high-frequency data can not necessarily be captured accurately by low-rank matrix factorizations albeit remedies exist such as hierarchical semi-separable matrices. As a result, recovered data often suffers from low signal to noise ratio S/Rs at the higher frequencies. To deal with this situation, we propose a weighted recovery method that improves the performance at the high frequencies by recursively using information from matrix factorizations at neighboring lower frequencies. Essentially, we include prior information from previously reconstructed frequency slices during the wavefield reconstruction. We apply our method to data collected from the Gulf of Suez, which shows that our method performs well compared to the traditional method without weighting.},
	keywords = {algorithm, data reconstruction, frequency-domain, interpolation, Processing, SEG},
	doi = {10.1190/segam2019-3215103.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2019/zhang2019SEGhfw/zhang2019SEGhfw.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2019/zhang2019SEGhfw/zhang2019SEGhfw_pres.pdf},
	author = {Yijun Zhang and Shashin Sharan and Felix J. Herrmann}
}
@article {peters2016cvp,
	title = {Constraints versus penalties for edge-preserving full-waveform inversion},
	journal = {The Leading Edge},
	volume = {36},
	number = {1},
	year = {2017},
	note = {(The Leading Edge)},
	month = {01},
	pages = {94-100},
	abstract = {Full-waveform inversion is challenging in complex geologic areas. Even when provided with an accurate starting model, the inversion algorithms often struggle to update the velocity model. Compared with other areas in applied geophysics, including prior information in full-waveform inversion is still in its relative infancy. In part, this is due to the fact that it is difficult to incorporate prior information that relates to geologic settings where strong discontinuities in the velocity model dominate, because these settings call for nonsmooth regularizations. We tackle this problem by including constraints on the spatial variations and value ranges of the inverted velocities, as opposed to adding penalties to the objective, which is more customary in mainstream geophysical inversion. By demonstrating the lack of predictability of edge-preserving inversion when the regularization is in the form of an added penalty term, we advocate the inclusion of constraints instead. Our examples show that the latter leads to more predictable results and to significant improvements in the delineation of salt bodies when these constraints are relaxed gradually in combination with extending the search space to approximately fit the observed data but not the noise.},
	keywords = {algorithm, full waveform inversion, noise, Optimization, penalty methods, salt dome, total variation},
	doi = {10.1190/tle36010094.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2016/peters2016cvp/peters2016cvp.html},
	author = {Bas Peters and Felix J. Herrmann}
}
@conference {sharan2017SEGhrf,
	title = {High resolution fast microseismic source collocation and source time function estimation},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2017},
	note = {(SEG, Houston)},
	month = {09},
	pages = {2778-2783},
	abstract = {Sparsity promotion based joint microseismic source collocation and source time function estimation, using Linearized Bregman algorithm, although simple to implement, suffers from slow convergence. This is due to the fact that Linearized Bregman algorithm has only first order of convergence. In this work, we propose to accelerate the existing Linearized Bregman algorithm using the L-BFGS algorithm. Without any initial guess for the source location or source time function, our method is able to estimate the source location and source time function for kinematically correct smooth velocity model. We demonstrate the effectiveness of our method for multiple sources spaced within half a wavelength. We also compare our results with Linearized Bregman based method in {\textquoteleft}{\textquoteleft}2.5{\textquoteleft}{\textquoteleft}D instead of {\textquoteleft}{\textquoteleft}2{\textquoteleft}{\textquoteleft}D.},
	keywords = {algorithm, Full-waveform inversion, microseismic, passive imaging, SEG, wave equation},
	doi = {10.1190/segam2017-17787749.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2017/sharan2017SEGhrf/sharan2017SEGhrf.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2017/sharan2017SEGhrf/sharan2017SEGhrf_pres.pdf},
	author = {Shashin Sharan and Rongrong Wang and Felix J. Herrmann}
}
@article {kumar2014GEOPemc,
	title = {Efficient matrix completion for seismic data reconstruction},
	journal = {Geophysics},
	volume = {80},
	number = {5},
	year = {2015},
	note = {(Geophysics)},
	month = {09},
	pages = {V97-V114},
	abstract = {Despite recent developments in improved acquisition, seismic data often remain undersampled along source and receiver coordinates, resulting in incomplete data for key applications such as migration and multiple prediction. We have interpreted the missing-trace interpolation problem in the context of matrix completion (MC), and developed three practical principles for using low-rank optimization techniques to recover seismic data. Specifically, we strive for recovery scenarios wherein the original signal is low rank and the subsampling scheme increases the singular values of the matrix. We use an optimization program that restores this low-rank structure to recover the full volume. Omitting one or more of these principles can lead to poor interpolation results, as we found experimentally. In light of this theory, we compensate for the high-rank behavior of data in the source-receiver domain by using the midpoint-offset transformation for 2D data and a source-receiver permutation for 3D data to reduce the overall singular values. Simultaneously, to work with computationally feasible algorithms for large-scale data, we use a factorization-based approach to MC, which significantly speeds up the computations compared with repeated singular value decompositions without reducing the recovery quality. In the context of our theory and experiments, we also find that windowing the data too aggressively can have adverse effects on the recovery quality. To overcome this problem, we carried out our interpolations for each frequency independently while working with the entire frequency slice. The result is a computationally efficient, theoretically motivated framework for interpolating missing-trace data. Our tests on realistic 2D and 3D seismic data sets show that our method compares favorably in terms of computational speed and recovery quality with existing curvelet- and tensor-based techniques.},
	keywords = {2D, 3D, algorithm, interpolation, low-rank, signal processing},
	doi = {10.1190/geo2014-0369.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2015/kumar2014GEOPemc/kumar2014GEOPemc.pdf},
	url2 = {http://library.seg.org/doi/abs/10.1190/geo2014-0369.1},
	author = {Rajiv Kumar and Curt Da Silva and Okan Akalin and Aleksandr Y. Aravkin and Hassan Mansour and Ben Recht and Felix J. Herrmann}
}
@conference {lin2014SEGmdg,
	title = {Mitigating data gaps in the estimation of primaries by sparse inversion without data reconstruction},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2014},
	note = {(SEG)},
	month = {10},
	pages = {4157-4161},
	abstract = {We propose to solve the Estimation of Primaries by Sparse Inversion problem from a sesimic record with missing near-offsets and large holes without any explicit data reconstruction, by instead simulating the missing multiple contributions with terms involving auto-convolutions of the primary wavefield. Exclusion of the unknown data as an inversion variable from the REPSI process is desireable, since it eliminates a significant source of local minima that arises from attempting to invert for the unobserved traces using primary and multiple models that may be far-away from the true solution. In this talk we investigate the necessary modifications to the Robust EPSI algorithm to account for the resulting non-linear modeling operator, and demonstrate that just a few auto-convolution terms are enough to satisfactorily mitigate the effects of data gaps during the inversion process.},
	keywords = {algorithm, EPSI, inversion, multiples, REPSI, SEG},
	doi = {http://dx.doi.org/10.1190/segam2014-1680.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2014/lin2014SEGmdg/lin2014SEGmdg.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2014/lin2014SEGmdg/lin2014SEGmdg_pres.pdf},
	author = {Tim T.Y. Lin and Felix J. Herrmann}
}
@conference {lin2013EAGEcsd,
	title = {Cosparse seismic data interpolation},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2013},
	month = {06},
	abstract = {Many modern seismic data interpolation and redatuming algorithms rely on the promotion of transform-domain sparsity for high-quality results. Amongst the large diversity of methods and different ways of realizing sparse reconstruction lies a central question that often goes unaddressed: is it better for the transform-domain sparsity to be achieved through explicit construction of sparse representations (e.g., by thresholding of small transform-domain coefficients), or by demanding that the algorithm return physical signals which produces sparse coefficients when hit with the forward transform? Recent results show that the two approaches give rise to different solutions when the transform is redundant, and that the latter approach imposes a whole new class of constraints related to where the forward transform produces zero coefficients. From this framework, a new reconstruction algorithm is proposed which may allow better reconstruction from subsampled signaled than what the sparsity assumption alone would predict. In this work we apply the new framework and algorithm to the case of seismic data interpolation under the curvelet domain, and show that it admits better reconstruction than some existing L1 sparsity-based methods derived from compressive sensing for a range of subsampling factors.},
	keywords = {algorithm, cosparsity, curvelet, EAGE, interpolation, Optimization},
	doi = {10.3997/2214-4609.20130387},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/lin2013EAGEcsd/lin2013EAGEcsd.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/lin2013EAGEcsd/lin2013EAGEcsd_pres.pdf},
	author = {Tim T.Y. Lin and Felix J. Herrmann}
}
@article {lin2013GEOPrepsi,
	title = {Robust estimation of primaries by sparse inversion via one-norm minimization},
	journal = {Geophysics},
	volume = {78},
	number = {3},
	year = {2013},
	month = {05},
	pages = {R133-R150},
	abstract = {A recently proposed method called estimation of primaries by sparse inversion (EPSI) avoids the need for adaptive subtraction of approximate multiple predictions by directly inverting for the multiple-free subsurface impulse response as a collection of band-limited spikes. Although it can be shown that the correct primary impulse response is obtained through the sparsest possible solution, the original EPSI algorithm was not designed to take advantage of this result, and instead it relies on a multitude of inversion parameters, such as the level of sparsity per gradient update. We proposed and tested a new algorithm, named robust EPSI, in which we make obtaining the sparsest solution an explicit goal. Our approach remains a gradient-based approach like the original algorithm, but it is derived from a new biconvex optimization framework based on an extended basis-pursuit denoising formulation. Furthermore, because it is based on a general framework, robust EPSI can recover the impulse response in transform domains, such as sparsifying curvelet-based representations, without changing the underlying algorithm. We discovered that the sparsity-minimizing objective of our formulation enabled it to operate successfully on a variety of synthetic and field marine data sets without excessive tweaking of inversion parameters. We also found that recovering the solution in alternate sparsity domains can significantly improve the quality of the directly estimated primaries, especially for weaker late-arrival events. In addition, we found that robust EPSI produces a more artifact-free impulse response compared to the original algorithm.},
	keywords = {algorithm, biconvex, EPSI, multiples, Optimization, Pareto, sparsity, waveform inversion},
	doi = {10.1190/geo2012-0097.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2013/lin2013GEOPrepsi/lin2013GEOPrepsi.pdf},
	author = {Tim T.Y. Lin and Felix J. Herrmann}
}
