@techreport {orozco2022MIDLmei,
	title = {Memory Efficient Invertible Neural Networks for 3D Photoacoustic Imaging},
	number = {TR-CSE-2022-2},
	year = {2022},
	month = {04},
	abstract = {Photoacoustic imaging (PAI) can image high-resolution structures of clinical interest such as vascularity in cancerous tumor monitoring. When imaging human subjects, geometric restrictions force limited-view data retrieval causing imaging artifacts. Iterative physical model based approaches reduce artifacts but require prohibitively time consuming PDE solves. Machine learning (ML) has accelerated PAI by combining physical models and learned networks. However, the depth and overall power of ML methods is limited by memory intensive training. We propose using invertible neural networks (INNs) to alleviate memory pressure. We demonstrate INNs can image 3D photoacoustic volumes in the setting of limited-view, noisy, and subsampled data. The frugal constant memory usage of INNs enables us to train an arbitrary depth of learned layers on a consumer GPU with 16GB RAM.},
	keywords = {invertible networks, medical imaging, photoacoustic imaging, Physics and Machine Learning Hybrid},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2022/orozco2022MIDLmei/midl_2022.html},
	author = {Rafael Orozco and Mathias Louboutin and Felix J. Herrmann}
}
@techreport {louboutin2021NIPSmcte,
	title = {Low-memory stochastic backpropagation with multi-channel randomized trace estimation},
	number = {TR-CSE-2021-1},
	year = {2021},
	month = {06},
	abstract = {Thanks to the combination of state-of-the-art accelerators and highly optimized open software frameworks, there has been tremendous progress in the performance of deep neural networks. While these developments have been responsible for many breakthroughs, progress towards solving large-scale problems, such as video encoding and semantic segmentation in 3D, is hampered because access to on-premise memory is often limited. Instead of relying on (optimal) checkpointing or invertibility of the network layers{\textendash}-to recover the activations during backpropagation{\textendash}-we propose to approximate the gradient of convolutional layers in neural networks with a multi-channel randomized trace estimation technique. Compared to other methods, this approach is simple, amenable to analyses, and leads to a greatly reduced memory footprint. Even though the randomized trace estimation introduces stochasticity during training, we argue that this is of little consequence as long as the induced errors are of the same order as errors in the gradient due to the use of stochastic gradient descent. We discuss the performance of networks trained with stochastic backpropagation and how the error can be controlled while maximizing memory usage and minimizing computational overhead.},
	keywords = {Convolutions, HPC, Low Memory, machine learning, randomized linear algebra},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2021/louboutin2021NIPSmcte/louboutin2021NIPSmcte.pdf},
	software = {https://github.com/slimgroup/XConv},
	author = {Mathias Louboutin and Ali Siahkoohi and Rongrong Wang and Felix J. Herrmann}
}
@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}
}
@techreport {louboutin2020SCsta,
	title = {Scaling through abstractions {\textendash} high-performance vectorial wave simulations for seismic inversion with Devito},
	number = {TR-CSE-2020-3},
	year = {2020},
	month = {4},
	institution = {Georgia Institute of Technology},
	abstract = {[Devito] is an open-source Python project based on domain-specific language and compiler technology. Driven by the requirements of rapid HPC applications development in exploration seismology, the language and compiler have evolved significantly since inception. Sophisticated boundary conditions, tensor contractions, sparse operations and features such as staggered grids and sub-domains are all supported; operators of essentially arbitrary complexity can be generated. To accommodate this flexibility whilst ensuring performance, data dependency analysis is utilized to schedule loops and detect computational-properties such as parallelism. In this article, the generation and simulation of MPI-parallel propagators (along with their adjoints) for the pseudo-acoustic wave-equation in tilted transverse isotropic media and the elastic wave-equation are presented. Simulations are carried out on industry scale synthetic models in a HPC Cloud system and reach a performance of 28TFLOP/s, hence demonstrating Devito{\textquoteright}s suitability for production-grade seismic inversion problems.},
	keywords = {devito, elastic, finite-difference, HPC, large-scale, RTM, TTI},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2020/louboutin2020SCsta/louboutin2020SCsta.html},
	author = {Mathias Louboutin and Fabio Luporini and Philipp A. Witte and Rhodri Nelson and George Bisbas and Jan Thorbecke and Felix J. Herrmann and Gerard Gorman}
}
@techreport {louboutin2020SEGtwri,
	title = {Time-domain Wavefield Reconstruction Inversion in a TTI medium},
	number = {TR-CSE-2020-1},
	year = {2020},
	month = {4},
	institution = {Georgia Institute of Technology},
	abstract = {We introduce a generalization of time-domain wavefield reconstruction inversion to anisotropic acoustic modeling. Wavefield reconstruction inversion has been extensively researched in recent years for its ability to mitigate cycle skipping. The original method was formulated in the frequency domain with acoustic isotropic physics. However, frequency-domain modeling requires sophisticated iterative solvers that are difficult to scale to industrial-size problems and more realistic physical assumptions, such as tilted transverse isotropy, object of this study. The work presented here is based on a recently proposed dual formulation of wavefield reconstruction inversion, which allows time-domain propagator that are suitable to both large scales and more accurate physics.},
	keywords = {anisotropy, FWI, TTI, WRI},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2020/louboutin2020SEGtwri/louboutin2020SEGtwri.html},
	url2 = {https://arxiv.org/pdf/2004.07355.pdf},
	author = {Mathias Louboutin and Gabrio Rizzuti and Felix J. Herrmann}
}
@techreport {siahkoohi2019TRnna,
	title = {Neural network augmented wave-equation simulation},
	number = {TR-CSE-2019-1},
	year = {2019},
	month = {09},
	institution = {Georgia Institute of Technology},
	abstract = {Accurate forward modeling is important for solving inverse problems. An inaccurate wave-equation simulation, as a forward operator, will offset the results obtained via inversion. In this work, we consider the case where we deal with incomplete physics. One proxy of incomplete physics is an inaccurate discretization of Laplacian in simulation of wave equation via finite-difference method. We exploit intrinsic one-to-one similarities between timestepping algorithm with Convolutional Neural Networks (CNNs), and propose to intersperse CNNs between low-fidelity timesteps. Augmenting neural networks with low-fidelity timestepping algorithms may allow us to take large timesteps while limiting the numerical dispersion artifacts. While simulating the wave-equation with low-fidelity timestepping algorithm, by correcting the wavefield several time during propagation, we hope to limit the numerical dispersion artifact introduced by a poor discretization of the Laplacian. As a proof of concept, we demonstrate this principle by correcting for numerical dispersion by keeping the velocity model fixed, and varying the source locations to generate training and testing pairs for our supervised learning algorithm.},
	keywords = {deep learning, finite difference, wave equation},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2019/siahkoohi2019TRnna/siahkoohi2019TRnna.html},
	url2 = {https://arxiv.org/pdf/1910.00925.pdf},
	author = {Ali Siahkoohi and Mathias Louboutin and Felix J. Herrmann}
}
@techreport {witte2016OGHPClst,
	title = {A large-scale time-domain seismic modeling and inversion workflow in Julia},
	number = {TR-EOAS-2017-1},
	year = {2017},
	institution = {UBC},
	abstract = {We present our initial steps towards the development of a large-scale seismic modeling workflow in Julia that provides a framework for wave equation based inversion methods like full waveform inversion or least squares migration. Our framework is based on the Devito, a finite difference domain specific language compiler that generates highly optimized and parallel code. We develop a flexible workflow that is based on abstract matrixfree linear operators and enables developers to write code that closely resembles the underlying math, while at the same time leveraging highly optimized wave equation solvers, allowing us to solve large-scale three-dimensional inverse problems.},
	keywords = {HPC, inversion, Modelling},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2017/witte2016OGHPClst/witte2016OGHPClst.pdf},
	author = {Philipp A. Witte and Mathias Louboutin and Gerard Gorman and Felix J. Herrmann}
}
@techreport {louboutin2016OGHPCocp,
	title = {Optimizing the computational performance of time-domain modelling{\textendash}-leveraging multiple right-hand-sides},
	number = {TR-EOAS-2017-2},
	year = {2017},
	institution = {UBC},
	abstract = {Exploration geophysics heavily relies upon fast solvers for the wave-equation and its adjoint. The main computational cost of a wave-equation solver is to compute the Laplacian, or more complex finite-difference operators, at every time step. The performance of many discretizations is limited by the relatively low operational intensity (number of floating point operations divided by memory traffic) of the finite-difference stencil. Solving the wave-equation for multiple sources/right-hand-sides (RHSs) at once mitigates this problem by increasing the operational intensity. This is implemented by rewriting the classical matrix-vector product into a matrix-matrix product where each column of the second matrix represent the solution wavefield for each given source. This minor modification to the solver is shown to achieve a 2-4 times speedup compared to a single source solver. We concentrate in this paper on acoustic modelling, but our approach can easily be extended to anisotropic or elastic cases for both forward and adjoint modelling.},
	keywords = {finite differences, HPC, Modelling, time domain},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2017/louboutin2016OGHPCocp/louboutin2016OGHPCocp.pdf},
	author = {Mathias Louboutin and Gerard Gorman and Felix J. Herrmann}
}
@techreport {louboutin2016SEGocp,
	title = {Optimizing the computational performance and maintainability of time-domain modelling{\textendash}-leveraging multiple right-hand-sides},
	number = {TR-EOAS-2016-2},
	year = {2016},
	month = {06},
	institution = {UBC},
	abstract = {Numerical solvers for the wave equation are a key component of Full-Waveform Inversion (FWI) and Reverse-Time Migration (RTM). The main computational cost of a wave-equation solver stems from the computation of the Laplacian at each time step. When using a finite difference discretization this can be characterized as a structured grid computation within Colella{\textquoteright}s Seven Dwarfs. Independent of the degree of parallelization the performance will be limited by the relatively low operational intensity (number of operations divided by memory traffic) of finite-difference stencils, that is so say that the method is memory bandwidth bound. For this reason many developers have focused on porting their code to platforms that have higher memory bandwidth, such as GPU{\textquoteright}s, or put significant effort into highly intrusive optimisations. However, these optimisations rarely strike the right performance vs productivity balance as the software becomes less maintainable and extensible. By solving the wave equation for multiple sources/right-hand-sides (RHSs) at once, we overcome this problem arriving at a time-stepping solver with higher operational intensity. In essence, we arrive at this result by turning the usual matrix-vector products into a matrix-matrix products where the first matrix implements the discretized wave equation and each column of the second matrix contain separate wavefields for each given source. By making this relatively minor change to the solver we readily achieved a $\times2$ speedup. While we limit ourselves to acoustic modeling, our approach can easily be extended to the anisotropic or elastic cases.},
	keywords = {3D, Modelling, time domain},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2016/louboutin2016SEGocp/louboutin2016SEGocp.html},
	author = {Mathias Louboutin and Gerard Gorman and Felix J. Herrmann}
}
@techreport {witte2015TRoam,
	title = {Overview on anisotropic modeling and inversion},
	number = {TR-EOAS-2015-6},
	year = {2015},
	month = {08},
	institution = {UBC},
	abstract = {This note provides an overview on strategies for modeling and inversion with the anisotropic wave equation. Since linear and non-linear inversion methods like least squares RTM and Full Waveform Inversion depend on matching observed field data with synthetically modelled data, accounting for anisotropy effects is necessary in order to accurately match waveforms at long offsets and propagation times. In this note, the two main strategies for anisotropic modelling by solving either a pseudo acoustic wave equation or a pure quasi-P-wave equation are discussed and an inversion workflow using the pure quasi-P-wave equation is provided. In particular, we derive the exact adjoint of the anisotropic forward modelling and jacobian operator and give a detailled describtion of their implementation. The anistropic FWI workflow is tested on a sythetic data example.},
	keywords = {anisotropy, full waveform inversion, Modeling},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2015/witte2015TRoam/witte2015TRoam.html},
	author = {Philipp A. Witte and Mathias Louboutin and Felix J. Herrmann}
}
@techreport {lago2015EAGEtrg,
	title = {Towards a robust geometric multigrid scheme for Helmholtz equation},
	number = {TR-EOAS-2015-3},
	year = {2015},
	month = {01},
	institution = {UBC},
	abstract = {We discuss an improvement of existing multigrid techniques for the solution of the time harmonic wave equation targeting application to seismic inversion and imaging, using non-traditional smoothing and coarse correction techniques, namely the CGMN and CRMN methods. We aim at developing a multigrid scheme to be used as a preconditioner for FGMRES showing less sensibility to changes in the discretization of the operator. We compare this multigrid scheme with recent developments in the multigrid field obtaining very satisfactory results. Our numerical experiments using SEG/EAGE Overthrust velocity model showing not only more robustness when switching from a basic 7 points stencil to a more compact 27 points stencil, but also a considerable reduction in the number of preconditioning steps required to attain convergence, a result encouraging further investigation.},
	keywords = {CGMN, CRMN, Helmholtz, multigrid},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2015/lago2015EAGEtrg/lago2015EAGEtrg.pdf},
	author = {Rafael Lago and Felix J. Herrmann}
}
@techreport {kumar2014SEGmcu,
	title = {Matrix completion on unstructured grids : 2-D seismic data regularization and interpolation},
	number = {TR-EOAS-2014-3},
	year = {2014},
	month = {04},
	institution = {UBC},
	abstract = {Seismic data interpolation via rank-minimization techniques has been recently introduced in the seismic community. All the existing rank-minimization techniques assume the recording locations to be on a regular grid, e.g. sampled periodically, but seismic data are typically irregularly sampled along spatial axes. Other than the irregularity of the sampled grid, we often have missing data. In this paper, we study the effect of grid irregularity to conduct matrix completion on a regular grid for unstructured data. We propose an improvement of existing rank-minimization techniques to do regularization. We also demonstrate that we can perform seismic data regularization and interpolation simultaneously. We illustrate the advantages of the modification using a real seismic line from the Gulf of Suez to obtain high quality results for regularization and interpolation, a key application in exploration geophysics.},
	keywords = {interpolation, matrix completion, NFFT, regularization},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2014/kumar2014SEGmcu/kumar2014SEGmcu.html},
	author = {Rajiv Kumar and Oscar Lopez and Ernie Esser and Felix J. Herrmann}
}
@techreport {li2013EAGEwebmplijsp,
	title = {Wave-equation based multi-parameter linearized inversion with joint-sparsity promotion},
	number = {TR-EOAS-2013-1},
	year = {2013},
	month = {01},
	institution = {UBC},
	abstract = {The successful application of linearized inversion is affected by the prohibitive size of the data, computational resources required, and how accurately the model parameters reflects the real Earth properties. The issue of data size and computational resources can be addressed by combining ideas from sparsity promoting and stochastic optimization, which can allow us to invert model perturbation with a small subset of the data, yielding a few PDE solves for the inversion. In this abstract, we are aiming at addressing the issue of accuracy of model parameters by inverting density and velocity simultaneously rather than only using velocity. As a matter of face, the effects of density and velocity variations towards the wavefield are very similar, which will cause energy leakage between density and velocity images. To overcome this issue, we proposed a incoherence enhanced method that can reduce the similarity between the effect of density and velocity. Moreover, the location of structural variations in velocity and density are often overlapped in geological setting, thus in this abstract, we also exploit this property with joint-sparsity promoting to further improve the imaging result.},
	keywords = {incoherence enhancement, joint-sparsity, Linearized inversion},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2013/li2013EAGEwebmplijsp/li2013EAGEwebmplijsp.pdf},
	author = {Xiang Li and Felix J. Herrmann}
}
@techreport {almatar10SEGesfd,
	title = {Estimation of surface-free data by curvelet-domain matched filtering and sparse inversion},
	number = {TR-EOAS-2010-1},
	year = {2010},
	institution = {Department of Earth and Ocean Sciences},
	address = {University of British Columbia, Vancouver},
	abstract = {Matching seismic wavefields and images lies at the heart of many pre-post-processing steps part of seismic imaging- whether one is matching predicted wavefield components, such as multiples, to the actual to-be-separated wavefield components present in the data or whether one is aiming to restore migration amplitudes by scaling, using an image-to-remigrated- image matching procedure to calculate the scaling coefficients. The success of these wavefield matching procedures depends on our ability to (i) control possible overfitting, which may lead to accidental removal of energy or to inaccurate image-amplitude corrections, (ii) handle data or images with nonunique dips, and (iii) apply subsequent wavefield separations or migraton amplitude corrections stably. In this paper, we show that the curvelet transform allows us to address all these issues by im- posing smoothness in phase space, by using their capability to handle conflicting dips, and by leveraging their ability to represent seismic data and images sparsely. This latter property renders curvelet-domain sparsity promotion an effective prior.},
	keywords = {SEG},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2010/almatar10SEGesfd/almatar10SEGesfd.pdf},
	author = {Mufeed H. AlMatar and Tim T.Y. Lin and Felix J. Herrmann}
}
@techreport {lebed08TRhgg,
	title = {A hitchhiker{\textquoteright}s guide to the galaxy of transform-domain sparsification},
	number = {TR-EOAS-2008-4},
	year = {2008},
	institution = {UBC Earth and Ocean Sciences Department},
	abstract = {The ability to efficiently and sparsely represent seismic data is becoming an increasingly important problem in geophysics. Over the last decade many transforms such as wavelets, curvelets, contourlets, surfacelets, shearlets, and many other types of {\textquoteright}x-lets{\textquoteright} have been developed to try to resolve this issue. In this abstract we compare the properties of four of these commonly used transforms, namely the shift-invariant wavelets, complex wavelets, curvelets and surfacelets. We also briefly explore the performance of these transforms for the problem of recovering seismic wavefields from incomplete measurements.},
	keywords = {SLIM},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2008/lebed08TRhgg/lebed08TRhgg.pdf},
	author = {Evgeniy Lebed and Felix J. Herrmann}
}
