@mastersthesis {li2015THsps,
	title = {Sparsity promoting seismic imaging and full-waveform inversion},
	year = {2015},
	note = {(PhD)},
	month = {07},
	school = {The University of British Columbia},
	type = {phd},
	address = {Vancouver},
	abstract = {This thesis will address the large computational costs of solving least-squares migration and full-waveform inversion problems. Least-squares seismic imaging and full-waveform inversion are seismic inversion techniques that require iterative minimizations of large least-squares misfit functions. Each iteration requires an evaluation of the Jacobian operator and its adjoint, both of which require two wave-equation solves for all sources, creating prohibitive computational costs. In order to reduce costs, we utilize randomized dimensionality reduction techniques, reducing the number of sources used during inversion. The randomized dimensionality reduction techniques create subsampling related artifacts, which we mitigate by using curvelet-domain sparsity-promoting inversion techniques. Our method conducts least-squares imaging at the approximate cost of one reverse-time migration with all sources, and computes the Gauss-Newton full-waveform inversion update at roughly the cost of one gradient update with all sources. Finally, during our research of the full-waveform inversion problem, we discovered that we can utilize our method as an alternative approach to add sparse constraints on the entire velocity model by imposing sparsity constraints on each model update separately, rather than regularizing the total velocity model as typically practiced. We also observed this alternative approach yields a faster decay of the residual and model error as a function of iterations. We provided empirical arguments why and when imposing sparsity on the updates can lead to improved full-waveform inversion results.},
	keywords = {Full-waveform inversion, Gauss-Newton method, least-squares imaging, seismic imaging, sparsity promoting},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2015/li2015THsps/li2015THsps.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2015/li2015THsps/li2015THsps_pres.pdf},
	author = {Xiang Li}
}
@presentation {fang2014SINBADsew,
	title = {Source estimation for WRI and its application},
	year = {2014},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/fang2014SINBADsew/fang2014SINBADsew.pdf},
	author = {Zhilong Fang and Xiang Li and Bas Peters and Felix J. Herrmann}
}
@conference {li2012SEGspmamp,
	title = {Sparsity-promoting migration accelerated by message passing},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {31},
	year = {2012},
	month = {11},
	pages = {1-6},
	publisher = {SEG},
	organization = {SEG},
	abstract = {Seismic imaging via linearized inversion requires multiple iterations to minimize the least-squares misfit as a function of the medium perturbation. Unfortunately, the cost for these iterations are prohibitive because each iteration requires many wave-equation simulations, which without direct solvers require an expensive separate solve for each source. To overcome this problem, we use dimensionality-reduction to decrease the size of seismic imaging problem by turning the large number of sequential shots into a much small number of simultaneous shots. In our approach, we take advantage of sparsifying transforms to remove source crosstalk resulting from randomly weighting and stacking sequential shots into a few super shots. We also take advantage of the fact that the convergence of large-scale sparsity-promoting solvers can be improved significantly by borrowing ideas from message passing, which are designed to break correlation built up between the linear system and the model iterate. In this way, we arrive at a formulation where we run the sparsity-promoting solver for a relatively large number of very iterations. Aside from leading to a significant speed up, our approach had the advantage of greatly reducing the memory imprint and IO requirements. We demonstrate this feature by solving a sparsity-promoting imaging problem with operators of reverse-time migration, which is computationally infeasible without the dimensionality reduction.},
	keywords = {Imaging, inversion, SEG},
	doi = {10.1190/segam2012-1500.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2012/li2012SEGspmamp/li2012SEGspmamp.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2012/li2012SEGspmamp/li2012SEGspmamp_pres.pdf},
	author = {Xiang Li and Felix J. Herrmann}
}
