@techreport {sharan2020lsh,
	title = {Large scale high-frequency wavefield reconstruction with recursively weighted matrix factorizations},
	number = {TR-CSE-2020-4},
	year = {2020},
	month = {10},
	abstract = {Acquiring seismic data on a regular periodic fine grid is challenging. By exploiting the low-rank approximation property of fully sampled seismic data in some transform domain, low-rank matrix completion offers a scalable way to reconstruct seismic data on a regular periodic fine grid from coarsely randomly sampled data acquired in the field. While wavefield reconstruction have been applied successfully at the lower end of the spectrum, its performance deteriorates at the higher frequencies where the low-rank assumption no longer holds rendering this type of wavefield reconstruction ineffective in situations where high resolution images are desired. We overcome this shortcoming by exploiting similarities between adjacent frequency slices explicitly. During low-rank matrix factorization, these similarities translate to alignment of subspaces of the factors, a notion we propose to employ as we reconstruct monochromatic frequency slices recursively starting at the low frequencies. While this idea is relatively simple in its core, to turn this recent insight into a successful scalable wavefield reconstruction scheme for 3D seismic requires a number of important steps. First, we need to move the weighting matrices, which encapsulate the prior information from adjacent frequency slices, from the objective to the data misfit constraint. This move considerably improves the performance of the weighted low-rank matrix factorization on which our wavefield reconstructions is based. Secondly, we introduce approximations that allow us to decouple computations on a row-by-row and column-by-column basis, which in turn allow to parallelize the alternating optimization on which our low-rank factorization relies. The combination of weighting and decoupling leads to a computationally feasible full-azimuth wavefield reconstruction scheme that scales to industry-scale problem sizes. We demonstrate the performance of the proposed parallel algorithm on a 2D field data and on a 3D synthetic dataset. In both cases our approach produces high-fidelity broadband wavefield reconstructions from severely subsampled data.},
	keywords = {5D reconstruction, compressed sensing, frequency-domain, parallel, signal processing},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2020/sharan2020lsh/sharan2020lsh.html},
	author = {Shashin Sharan and Yijun Zhang and Oscar Lopez and Felix J. Herrmann}
}
@conference {kumar2018EAGEcsb,
	title = {Compressed sensing based land simultaneous acquisition using encoded sweeps},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2018},
	note = {(EAGE, Copenhagen)},
	month = {06},
	abstract = {Simultaneous shooting methods using encoded sweeps can enhance the productivity of land acquisition in situations where deployment of many vibrators and larger receiver spread is not possible in the field due to obstructions or permit limitations. However, the existing framework requires shooting the full sequence of encoded sweeps on each shot point to reconstruct the complete frequency bandwidth Green{\textquoteright}s function. Although this simultaneous shooting method reduces the sweeping time vs conventional sequential shooting, the gain in efficiency is limited. To further reduce the sweeping time, we propose to acquire randomly selected subsets of the encoded sweeps sequences followed by a rank-minimization based joint source separation and spectral interpolation framework to reconstruct the full bandwidth deblended Green{\textquoteright}s function. We demonstrate the advantages of proposed sampling and reconstruction framework using a synthetic seismic line simulated using SEG-SEAM Phase II land velocity and density model.},
	keywords = {compressed sensing, EAGE, land, SEAM, source separation, spectral interpolation},
	doi = {10.3997/2214-4609.201800643},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2018/kumar2018EAGEcsb/kumar2018EAGEcsb.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2018/kumar2018EAGEcsb/kumar2018EAGEcsb_pres.pdf},
	author = {Rajiv Kumar and Shashin Sharan and Nick Moldoveanu and Felix J. Herrmann}
}
@conference {herrmann2015SEGWScse,
	title = {Compressive Sensing in Exploration Seismology - where we came from, where we are now, and where we need to go},
	booktitle = {SEG Geophysical Compressed Sensing Workshop; Beijing, China},
	year = {2015},
	note = {(SEG Workshop, Beijing, China)},
	month = {12},
	keywords = {compressed sensing, SEG, workshop},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2015/herrmann2015SEGWScse/herrmann2015SEGWScse_pres.pdf},
	author = {Felix J. Herrmann}
}
@conference {herrmann2015ASEGrae,
	title = {Randomized algorithms in exploration seismology},
	booktitle = {ASEG Annual Conference Proceedings},
	year = {2015},
	note = {(ASEG, Perth)},
	month = {02},
	abstract = {As in several other industries, progress in exploration seismology relies on the collection and processing of massive data volumes that grow exponentially in size as the survey area and desired resolution increase. This exponential growth {\textendash}- in combination with the increased complexity of the next-generation of iterative wave-equation based inversion algorithms {\textendash}- puts strains on our acquisition systems and computational back ends impeding progress in our field. During this talk, I will review how recent randomized algorithms from Compressive Sensing and Machine learning can be used to overcome some of these challenges by fundamentally rethinking how we sample and process seismic data. The key idea here is to reduce acquisition and computational costs by deliberately working on small randomized subsets of the data at a desired accuracy. I will illustrate these concepts using a variety of compelling examples on realistic synthetics and field data.},
	keywords = {Acquisition, ASEG, compressed sensing, FWI, Imaging, seismology},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ASEG/2015/herrmann2015ASEGrae/herrmann2015ASEGrae.pdf},
	author = {Felix J. Herrmann}
}
@conference {witte2015IIPFWIspl,
	title = {Sparsity-promoting least-square migration with linearized Bregman and compressive sensing},
	booktitle = {Inaugural Full-Waveform Inversion Workshop},
	year = {2015},
	note = {(Natal, Brazil)},
	month = {08-09},
	abstract = {We present a novel adaptation of a recently developed relatively simple iterative algorithm to solve large-scale sparsity-promoting optimization problems. Our algorithm is particularly suitable to large-scale geophysical inversion problems, such as sparse least-squares reverse-time migration or Kirchoff migration since it allows for a tradeoff between parallel computations, memory allocation, and turnaround times, by working on subsets of the data with different sizes. Comparison of the proposed method for sparse least-squares imaging shows a performance that rivals and even exceeds the performance of state-of-the art one-norm solvers that are able to carry out least-squares migration at the cost of a single migration with all data.},
	keywords = {Bregman, compressed sensing, FWI, migration, sparsity promotion, time domain},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/IIPFWI/witte2015IIPFWIspl/witte2015IIPFWIspl_pres.pdf},
	author = {Philipp A. Witte and Ning Tu and Ernie Esser and Mengmeng Yang and Mathias Louboutin and Felix J. Herrmann}
}
@article {mansour2013GEOPiwr,
	title = {Improved wavefield reconstruction from randomized sampling via weighted one-norm minimization},
	journal = {Geophysics},
	volume = {78},
	number = {5},
	year = {2013},
	month = {08},
	pages = {V193-V206},
	abstract = {Missing-trace interpolation aims to recover the gaps caused by physical obstacles or deliberate subsampling to control acquisition costs in otherwise regularly sampled seismic wavefields. Although transform-domain sparsity promotion has proven to be an effective tool to solve this recovery problem, current recovery techniques do not fully utilize a priori information derived from the locations of the transform-domain coefficients, especially when curvelet domain sparsity is exploited. We use recovery by weighted one-norm minimization, which exploits correlations between the locations of significant curvelet coefficients of different partitions, e.g., shot records, common-offset gathers, or frequency slices of the acquired data. We use these correlations to define a sequence of 2D curvelet-based recovery problems that exploit 3D continuity exhibited by seismic wavefields without relying on the highly redundant 3D curvelet transform. To test the performance of our weighted algorithm, we compared recoveries from different data sorting and partitioning scenarios for a seismic line from the Gulf of Suez. These tests demonstrated that our method is superior to standard $\ell_1$ minimization in terms of antialiasing capability, reconstruction quality and computational memory requirements.},
	keywords = {compressed sensing, randomized sampling, Trace interpolation, weighted one-norm minimization},
	doi = {10.1190/geo2012-0383.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2013/mansour2013GEOPiwr/mansour2013GEOPiwr.pdf},
	author = {Hassan Mansour and Felix J. Herrmann and Ozgur Yilmaz}
}
@article {vandenberg2009ACMstf,
	title = {Sparco: a testing framework for sparse reconstruction},
	journal = {ACM Transactions on Mathematical Software},
	volume = {35},
	number = {4},
	year = {2009},
	month = {02},
	pages = {1-16},
	abstract = {Sparco is a framework for testing and benchmarking algorithms for sparse reconstruction. It includes a large collection of sparse reconstruction problems drawn from the imaging, compressed sensing, and geophysics literature. Sparco is also a framework for implementing new test problems and can be used as a tool for reproducible research. Sparco is implemented entirely in Matlab, and is released as open-source software under the GNU Public License.},
	keywords = {compressed sensing, linear operators, Sparse recovery},
	url = {http://doi.acm.org/10.1145/1462173.1462178},
	author = {Ewout van den Berg and Michael P. Friedlander and Gilles Hennenfent and Felix J. Herrmann and Rayan Saab and Ozgur Yilmaz}
}
