@article {yin2024tfp,
	title = {Time-lapse full-waveform permeability inversion: a feasibility study},
	journal = {The Leading Edge},
	volume = {43},
	year = {2024},
	note = {(The Leading Edge)},
	month = {8},
	abstract = {Time-lapse seismic monitoring necessitates integrated workflows that combine seismic and reservoir modeling to enhance reservoir property estimation. We present a feasibility study of an end-to-end inversion framework that directly inverts for permeability from prestack time-lapse seismic data. To assess the method{\textquoteright}s robustness, we design experiments focusing on its sensitivity to initial models and potential errors in modeling. Our study leverages the Compass model to simulate CO2 storage in saline aquifers, which is derived from well and seismic data from the North Sea, a candidate site for geological carbon storage.},
	keywords = {4D, CCS, coupled inversion, end-to-end, fluid-flow, GCS, inversion, monitoring, time-lapse},
	doi = {10.1190/tle43080544.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2024/yin2024tfp/paper.html},
	author = {Ziyi Yin and Mathias Louboutin and Olav M{\o}yner and Felix J. Herrmann}
}
@article {sanavi2021tad,
	title = {True amplitude depth migration using curvelets},
	journal = {Geophysics},
	volume = {86},
	number = {4},
	year = {2021},
	note = {(Geophysics)},
	month = {07},
	pages = {S299-S310},
	abstract = {We have developed a true amplitude solution to the seismic imaging problem. We derive a diagonal scaling approach for the normal operator approximation in the curvelet domain. This is based on the theorem that states that curvelets remain approximately invariant under the action of the normal operator. We use curvelets as essential tools for approximation and inversion. We also exploit the theorem that states that the curvelet-domain approximation should be smooth in phase space by enforcing the smoothness of curvelet coefficients in the angle and space domains. We analyze our method using a reverse time migration-demigration code, simulating the acoustic wave equation on different synthetic models. Our method produces a good resolution with reflecting dips, reproduces the true amplitude reflectors, and compensates for incomplete illumination in seismic images.},
	keywords = {amplitude, depth migration, Imaging, inversion, LSRTM},
	doi = {10.1190/geo2019-0307.1},
	author = {Hamideh Sanavi and Peyman P. Moghaddam and Felix J. Herrmann}
}
@article {yang2020tdsp,
	title = {Time-domain sparsity promoting least-squares reverse time migration with source estimation},
	journal = {Geophysical Prospecting},
	volume = {68},
	number = {9},
	year = {2020},
	note = {(Geophysical Prospecting)},
	month = {08},
	pages = {2697-2711},
	abstract = {Least-squares reverse time migration is well-known for its capability to generate artifact-free true-amplitude subsurface images through fitting observed data in the least-squares sense. However, when applied to realistic imaging problems, this approach is faced with issues related to overfitting and excessive computational costs induced by many wave-equation solves. The fact that the source function is unknown complicates this situation even further. Motivated by recent results in stochastic optimization and transform-domain sparsity-promotion, we demonstrate that the computational costs of inversion can be reduced significantly while avoiding imaging artifacts and restoring amplitudes. While powerfull, these new approaches do require accurate information on the source-time function, which is often lacking. Without this information, the imaging quality deteriorates rapidly. We address this issue by presenting an approach where the source-time function is estimated on the fly through a technique known as variable projection. Aside from introducing negligible computational overhead, the proposed method is shown to perform well on imaging problems with noisy data and problems that involve complex settings such as salt. In either case, the presented method produces high resolution high-amplitude fidelity images including an estimates for the source-time function. In addition, due to its use of stochastic optimization, we arrive at these images at roughly one to two times the cost of conventional reverse time migration involving all data.},
	keywords = {penalty, source estimation, sparsity inversion},
	doi = {10.1111/1365-2478.13021},
	url = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2020/yang2020tdsp/yang2020tdsp.html},
	author = {Mengmeng Yang and Zhilong Fang and Philipp A. Witte and Felix J. Herrmann}
}
@article {kumar2018toi,
	title = {Target-oriented imaging using extended image volumes{\textemdash}a low-rank factorization approach},
	journal = {Geophysical Prospecting},
	volume = {67},
	number = {5},
	year = {2019},
	note = {(Geophysical Prospecting)},
	pages = {1312-1328},
	abstract = {Imaging in geological challenging environments has led to new developments, including the idea of generating reflection responses by means of interferometric redatuming at a given target datum in the subsurface, when the target datum lies beneath a complex overburden. One way to perform this redatuming is via conventional model-based wave-equation techniques. But those techniques can be computationally expensive for large-scale seismic problems since the number of wave-equation solves is equal to two-times the number of sources involved during seismic data acquisition. Also conventional shot-profile techniques require lots of memory to save full subsurface extended image volumes. Therefore, they only form subsurface image volumes in either horizontal or vertical directions. We now present a randomized singular value decomposition based approach built upon the matrix probing scheme, which takes advantage of the algebraic structure of the extended imaging system. This low-rank representation enables us to overcome both the computational cost associated with the number of wave-equation solutions and memory usage due to explicit storage of full subsurface extended image volumes employed by conventional migration methods. Experimental results on complex geological models demonstrate the efficacy of the proposed methodology and allow practical reflection-based extended imaging for large-scale 5D seismic data.},
	keywords = {extended image volumes, randomized linear algebra, target-oriented imaging},
	doi = {10.1111/1365-2478.12779},
	url = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2019/kumar2018toi/kumar2018toi.html},
	author = {Rajiv Kumar and Marie Graff-Kray and Ivan Vasconcelos and Felix J. Herrmann}
}
@article {esser2016tvr,
	title = {Total-variation regularization strategies in full-waveform inversion},
	journal = {SIAM Journal on Imaging Sciences},
	volume = {11},
	number = {1},
	year = {2018},
	note = {(SIAM Journal on Imaging Sciences)},
	pages = {376-406},
	abstract = {We propose an extended full-waveform inversion formulation that includes general convex constraints on the model. Though the full problem is highly nonconvex, the overarching optimization scheme arrives at geologically plausible results by solving a sequence of relaxed and warm-started constrained convex subproblems. The combination of box, total-variation, and successively relaxed asymmetric total-variation constraints allows us to steer free from parasitic local minima while keeping the estimated physical parameters laterally continuous and in a physically realistic range. For accurate starting models, numerical experiments carried out on the challenging 2004 BP velocity benchmark demonstrate that bound and total-variation constraints improve the inversion result significantly by removing inversion artifacts, related to source encoding, and by clearly improved delineation of top, bottom, and flanks of a high-velocity high-contrast salt inclusion. The experiments also show that for poor starting models these two constraints by themselves are insufficient to detect the bottom of high-velocity inclusions such as salt. Inclusion of the one-sided asymmetric total-variation constraint overcomes this issue by discouraging velocity lows to buildup during the early stages of the inversion. To the author{\textquoteright}s knowledge the presented algorithm is the first to successfully remove the imprint of local minima caused by poor starting models and band-width limited finite aperture data.},
	keywords = {constrained optimization, Full-waveform inversion, hinge loss, salt, total variation},
	doi = {10.1137/17M111328X},
	url = {https://slim.gatech.edu/Publications/Public/Journals/SIAMJournalOnImagingSciences/2018/esser2016tvr/esser2016tvr.pdf},
	url2 = {https://doi.org/10.1137/17M111328X},
	author = {Ernie Esser and Llu{\'\i}s Guasch and Tristan van Leeuwen and Aleksandr Y. Aravkin and Felix J. Herrmann}
}
@article {vandenberg2010IEEEter,
	title = {Theoretical and empirical results for recovery from multiple measurements},
	journal = {IEEE Transactions on Information Theory},
	volume = {56},
	number = {5},
	year = {2010},
	month = {05},
	pages = {2516-2527},
	abstract = {The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an extension of the single-measurement-vector (SMV) problem widely studied in compressed sensing. We analyze the recovery properties for two types of recovery algorithms. First, we show that recovery using sum-of-norm minimization cannot exceed the uniform recovery rate of sequential SMV using L1 minimization, and that there are problems that can be solved with one approach but not with the other. Second, we analyze the performance of the ReMBo algorithm [M. Mishali and Y. Eldar, IEEE Trans. Sig. Proc., 56 (2008)] in combination with L1 minimization, and show how recovery improves as more measurements are taken. From this analysis it follows that having more measurements than number of nonzero rows does not improve the potential theoretical recovery rate.},
	keywords = {convex optimization, joint sparsity, multiple channels, Sparse recovery},
	doi = {10.1109/TIT.2010.2043876},
	url = {http://www.math.ucdavis.edu/\%7Empf/2010-joint-sparsity.html},
	author = {Ewout van den Berg and Michael P. Friedlander}
}
