@presentation {tu2014SINBADfis2,
	title = {Fast imaging with source estimation},
	year = {2014},
	publisher = {SINBAD},
	abstract = {In seismic imaging, an inaccurate estimate of the source wavelet may result in degraded seismic images. While conventional reverse-time migration requires the knowledge of the source wavelet as prior information, we propose to include source estimation in the fast compressive imaging procedure. Using the proposed method, we can obtain seismic images that are comparable to those imaged with the true source wavelet, with computational costs that are comparable to conventional RTM images with all the data. We also extend the proposed method to image data with surface-related multiples, where these multiples help to mitigate the amplitude ambiguity in source estimation. We verify the proposed method using realistic synthetic examples.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/tu2014SINBADfis2/tu2014SINBADfis2.pdf},
	author = {Ning Tu and Aleksandr Y. Aravkin and Tristan van Leeuwen and Tim T.Y. Lin and Felix J. Herrmann}
}
@article {aravkin2014SISCfmd,
	title = {Fast methods for denoising matrix completion formulations, with applications to robust seismic data interpolation},
	journal = {SIAM Journal on Scientific Computing},
	volume = {36},
	number = {5},
	year = {2014},
	note = {(SISC)},
	month = {10},
	pages = {S237-S266},
	abstract = {Recent SVD-free matrix factorization formulations have enabled rank minimization for systems with millions of rows and columns, paving the way for matrix completion in extremely large-scale applications, such as seismic data interpolation. In this paper, we consider matrix completion formulations designed to hit a target data-fitting error level provided by the user, and we propose an algorithm called LR-BPDN that is able to exploit factorized formulations to solve the corresponding optimization problem. Since practitioners typically have strong prior knowledge about target error level, this innovation makes it easy to apply the algorithm in practice, leaving only the factor rank to be determined. Within the established framework, we propose two extensions that are highly relevant to solving practical challenges of data interpolation. First, we propose a weighted extension that allows known subspace information to improve the results of matrix completion formulations. We show how this weighting can be used in the context of frequency continuation, an essential aspect to seismic data interpolation. Second, we propose matrix completion formulations that are robust to large measurement errors in the available data. We illustrate the advantages of LR-BPDN on collaborative filtering problems using the MovieLens 1M and 10M and Netflix 100M datasets. Then we use the new method, along with its robust and subspace reweighted extensions, to obtain high-quality reconstructions for large-scale seismic interpolation problems with real data, even in the presence of data contamination.},
	keywords = {factorized formulations, matrix completion, robust statistics, seismic trace interpolation, variational optimization},
	doi = {10.1137/130919210},
	url = {https://slim.gatech.edu/Publications/Public/Journals/SIAMJournalOnScientificComputing/2014/aravkin2014SISCfmd/aravkin2014SISCfmd.pdf},
	url2 = {http://epubs.siam.org/doi/abs/10.1137/130919210},
	author = {Aleksandr Y. Aravkin and Rajiv Kumar and Hassan Mansour and Ben Recht and Felix J. Herrmann}
}
@presentation {tu2013SINBADvp,
	title = {Fast imaging with multiples and source estimation},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Multiples are usually treated as unwanted components in seismic data. However, if correctly used, they can provide valuable information about the subsurface. In this presentation, I will talk about how to make use of multiples in $\ell_1$ regularized least-squares imaging, and how to estimate the source wavelet on the fly using multiples. Synthetic examples show that using multiples not only helps to retrieve the true-amplitude seismic image and the source wavelet, it also increases the wavenumber contents in the seismic image. By using dimensionality reduction techniques with rerandomization, we also greatly decrease the simulation cost without compromising the image quality.},
	keywords = {Presentation, SINBAD, SINBADSPRING2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Spring/tu2013SINBADvp/tu2013SINBADvp.pdf},
	author = {Ning Tu and Aleksandr Y. Aravkin and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {tu2013EAGElsm,
	title = {Fast least-squares migration with multiples and source estimation},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2013},
	month = {06},
	abstract = {The advent of modern computing has made it possible to do seismic imaging using least-squares reverse-time migration. We obtain superior images by solving an optimization problem that recovers the true-amplitude images. However, its success hinges on overcoming several issues, including overwhelming problem size, unknown source wavelet, and interfering coherent events like multiples. In this abstract, we reduce the problem size by using ideas from compressive sensing, and estimate source wavelet by generalized variable projection. We also demonstrate how to invert for subsurface information encoded in surface-related multiples by incorporating the free-surface operator as an areal source in reverse-time migration. Our synthetic examples show that multiples help to improve the resolution of the image, as well as remove the amplitude ambiguity in wavelet estimation.},
	keywords = {EAGE, Imaging, multiples, source estimation, sparse},
	doi = {10.3997/2214-4609.20130727},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/tu2013EAGElsm/tu2013EAGElsm.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/tu2013EAGElsm/tu2013EAGElsm_pres.pdf},
	author = {Ning Tu and Aleksandr Y. Aravkin and Tristan van Leeuwen and Felix J. Herrmann}
}
@techreport {rajiv2012SEGFRM,
	title = {Fast methods for rank minimization with applications to seismic-data interpolation},
	number = {TR-EOAS-2012-3},
	year = {2012},
	month = {04},
	institution = {Department of Earth and Ocean Sciences},
	address = {University of British Columbia, Vancouver},
	abstract = {Rank penalizing techniques are an important direction in seismic inverse problems, since they allow improved recovery by exploiting low-rank structure. A major downside of current state of the art techniques is their reliance on the SVD of seismic data structures, which can be prohibitively expensive. Fortunately, recent work allows us to circumvent this problem by working with matrix factorizations. We review a novel approach to rank penalization, and successfully apply it to the seismic interpolation problem by exploiting the low-rank structure of seismic data in the midpoint-offset domain. Experiments for the recovery of 2D monochromatic data matrices and seismic lines represented as 3D volumes support the feasibility and potential of the new approach.},
	keywords = {Optimization, Rank, Seismic data Interpolation},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2012/rajiv2012SEGFRM/rajiv2012SEGFRM.pdf},
	author = {Rajiv Kumar and Aleksandr Y. Aravkin and Felix J. Herrmann}
}
@article {Li11TRfrfwi,
	title = {Fast randomized full-waveform inversion with compressive sensing},
	journal = {Geophysics},
	volume = {77},
	number = {3},
	year = {2012},
	month = {05},
	pages = {A13-A17},
	abstract = {Wave-equation based seismic inversion can be formulated as a nonlinear inverse problem where the medium properties are obtained via minimization of a least- squares misfit functional. The demand for higher resolution models in more geologically complex areas drives the need to develop techniques that explore the special structure of full-waveform inversion to reduce the computational burden and to regularize the inverse problem. We meet these goals by using ideas from compressive sensing and stochastic optimization to design a novel Gauss-Newton method, where the updates are computed from random subsets of the data via curvelet-domain sparsity promotion. Application of this idea to a realistic synthetic shows improved results compared to quasi-Newton methods, which require passes through all data. Two different subset sampling strategies are considered: randomized source encoding, and drawing sequential shots firing at random source locations from marine data with missing near and far offsets. In both cases, we obtain excellent inversion results compared to conventional methods at reduced computational costs.},
	keywords = {Compressive Sensing, FWI, Optimization, SLIM},
	doi = {10.1190/geo2011-0410.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2012/Li11TRfrfwi/Li11TRfrfwi.pdf},
	author = {Xiang Li and Aleksandr Y. Aravkin and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {aravkin2012ICASSPfastseis,
	title = {Fast seismic imaging for marine data},
	booktitle = {ICASSP},
	year = {2012},
	publisher = {ICASSP},
	organization = {ICASSP},
	abstract = {Seismic imaging can be formulated as a linear inverse problem where a medium perturbation is obtained via minimization of a least-squares misfit functional. The demand for higher resolution images in more geophysically complex areas drives the need to develop techniques that handle problems of tremendous size with limited computational resources. While seismic imaging is amenable to dimensionality reduction techniques that collapse the data volume into a smaller set of "super-shots", these techniques break down for complex acquisition geometries such as marine acquisition, where sources and receivers move during acquisition. To meet these challenges, we propose a novel method that combines sparsity-promoting (SP) solvers with random subset selection of sequential shots, yielding a SP algorithm that only ever sees a small portion of the full data, enabling its application to very large-scale problems. Application of this technique yields excellent results for a complicated synthetic, which underscores the robustness of sparsity promotion and its suitability for seismic imaging.},
	keywords = {ICASSP},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICASSP/2012/AravkinLiHerrmann/AravkinLiHerrmann.pdf},
	author = {Aleksandr Y. Aravkin and Xiang Li and Felix J. Herrmann}
}
@conference {herrmann2011SEGffw,
	title = {Fast full-waveform inversion with compressive sensing},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2011},
	keywords = {Full-waveform inversion, SEG, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2011/HerrmannSEG2011fws/HerrmannSEG2011fws.pdf},
	author = {Aleksandr Y. Aravkin and Felix J. Herrmann and Tristan van Leeuwen and Xiang Li}
}
@conference {aravkin2011SIAMfwi,
	title = {Full waveform inversion with compressive updates},
	booktitle = {SIAM},
	year = {2011},
	publisher = {SIAM CS\&E 2011},
	organization = {SIAM CS\&E 2011},
	abstract = {Full-waveform inversion relies on large multi-experiment data volumes. While improvements in acquisition and inversion have been extremely successful, the current push for higher quality models reveals fundamental shortcomings handling increasing problem sizes numerically. To address this fundamental issue, we propose a randomized dimensionality-reduction strategy motivated by recent developments in stochastic optimization and compressive sensing. In this formulation conventional Gauss-Newton iterations are replaced by dimensionality-reduced sparse recovery problems with source encodings.},
	keywords = {Full-waveform inversion, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SIAM/2011/aravkin2011SIAMfwi/aravkin2011SIAMfwi.pdf},
	author = {Aleksandr Y. Aravkin and Felix J. Herrmann and Tristan van Leeuwen and James V. Burke and Xiang Li}
}
@conference {herrmann2011SLRAfwi,
	title = {Full waveform inversion with compressive updates},
	booktitle = {SLRA},
	year = {2011},
	publisher = {Sparse and Low Rank Approximation 2011},
	organization = {Sparse and Low Rank Approximation 2011},
	abstract = {Full-waveform inversion relies on large multi-experiment data volumes. While improvements in acquisition and inversion have been extremely successful, the current push for higher quality models reveals fundamental shortcomings handling increasing problem sizes numerically. To address this fundamental issue, we propose a randomized dimensionality-reduction strategy motivated by recent developments in stochastic optimization and compressive sensing. In this formulation conventional Gauss-Newton iterations are replaced by dimensionality-reduced sparse recovery problems with source encodings.},
	keywords = {Full-waveform inversion},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SLRA/2011/herrmann2011SLRAfwi/herrmann2011SLRAfwi.pdf},
	author = {Felix J. Herrmann and Aleksandr Y. Aravkin and Xiang Li and Tristan van Leeuwen}
}
@conference {li2011EAGEfwirr,
	title = {Full-waveform inversion with randomized L1 recovery for the model updates},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2011},
	month = {05},
	abstract = {Full-waveform inversion (FWI) is a data fitting procedure that relies on the collection of seismic data volumes and sophisticated computing to create high-resolution results. With the advent of FWI, the improvements in acquisition and inversion have been substantial, but these improvements come at a high cost because FWI involves extremely large multi-experiment data volumes. The main obstacle is the "curse of dimensionality" exemplified by Nyquist{\~O}s sampling criterion, which puts a disproportionate strain on current acquisition and processing systems as the size and desired resolution increases. In this paper, we address the "curse of dimensionality" by randomized dimensionality reduction of the FWI problem adapted from the field of CS. We invert for model updates by replacing the Gauss-Newton linearized subproblem for subsampled FWI with a sparsity promoting formulation, and solve this formulation using the SPGl1 algorithm. We speed up the algorithm and avoid overfitting the data by solving for the linearized updates only approximately. Our approach is successful because it reduces the size of seismic data volumes without loss of information. With this reduction, we can compute a Newton-like update with the reduced data volume at the cost of roughly one gradient update for the fully sampled wavefield.},
	keywords = {EAGE, Full-waveform inversion, Presentation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2011/li11EAGEfwirr/li11EAGEfwirr.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2011/li11EAGEfwirr/li11EAGEfwirr_pres.pdf},
	url2 = {http://earthdoc.eage.org/publication/publicationdetails/?publication=50345},
	author = {Xiang Li and Aleksandr Y. Aravkin and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {herrmann2011ICIAMconvexcompfwi,
	title = {FWI with sparse recovery: a convex-composite approach},
	booktitle = {ICIAM},
	year = {2011},
	month = {07},
	publisher = {ICIAM 2011},
	organization = {ICIAM 2011},
	abstract = {Iterative inversion algorithms require repeated simulation of 3D time-dependent acoustic, elastic, or electromagnetic wave fields, extending hundreds of wavelengths and hundreds of periods. Also, seismic data is rich in information at every representable scale. Thus simulation-driven optimization approaches to inversion impose great demands on simulator efficiency and accuracy. While computer hardware advances have been of critical importance in bringing inversion closer to practical application, algorithmic advances in simulator methodology have been equally important. Speakers in this two-part session will address a variety of numerical issues arising in the wave simulation, and in its application to inversion.},
	keywords = {Full-waveform inversion, ICIAM, Optimization},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICIAM/2011/herrmann2011ICIAMconvexcompfwi/herrmann2011ICIAMconvexcompfwi.pdf},
	author = {Felix J. Herrmann and Aleksandr Y. Aravkin and Tristan van Leeuwen and Xiang Li}
}
