@mastersthesis {zhang2018THlss,
	title = {Large-scale seismic data compression: application to full waveform inversion and extended image volume},
	year = {2018},
	note = {(MSc)},
	month = {04},
	school = {The University of British Columbia},
	type = {masters},
	address = {Vancouver},
	abstract = {Conventional oil and gas fields are increasingly difficult to explore and im- age, resulting in a call for more complex wave-equation based inversion al- gorithms that require dense long-o↵set samplings. Consequently, there is an exponential growth in the size of data volumes and prohibitive demands on computational resources. In this work, we propose a method to com- press and process seismic data directly in a low-rank tensor format, which drastically reduces the amount of storage required to represent the data. We first outline how seismic data exhibits low-rank structure in a particular transform-domain, which can be exploited to compress the dense data in one extremely storage-efficient tensor format when the data is fully sampled. In the more realistic case of missing data, we can use interpolation techniques based on the same tensor format to recover fully sampled data volume in compressed form. In either case, once we have our data represented in its compressed tensor form, we design an algorithm to extract source or receiver gathers directly from the compressed parameters. This extraction process can be done on-the-fly directly on the compressed data, in the full wave- form inversion context, and does not require scanning through the entire dataset in order to form shot gathers. To the best of our knowledge, this work is one of the first major contributions to working with seismic data applications directly in the compressed domain without reconstructing the entire data volume. We use a stochastic inversion approach, which works with small subsets of source experiments at each iteration, further to reduce the computational and memory costs of full waveform inversion. We also demonstrate how this data compression and extraction technique can be ap- plied to forming full subsurface image gathers through probing techniques.},
	keywords = {compression, extended image volume, FWI, hierarchical tucker, MSc, multilinear algebra, on-the-fly, thesis},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2018/zhang2018THlss/zhang2018THlss.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2018/zhang2018THlss/zhang2018THlss_pres.pdf},
	author = {Yiming Zhang}
}
@conference {dasilva2015WSLRigt,
	title = {Irregular grid tensor completion},
	booktitle = {Workshop on Low-rank Optimization and Applications},
	year = {2015},
	note = {(Workshop on Low-rank Optimization and Applications, University of Bonn, Germany)},
	month = {06},
	abstract = {Low rank tensor completion has recently garnered the attention of researchers owing to the ubiquity of tensors in the sciences and the theoretical and numerical challenges compared to matrix completion. Here we consider a tensor completion scheme where the data arises from sampling a continuous function. When the sampling grid is not periodic, the resulting tensor may not be low rank in the Hierarchical Tucker sense, which can adversely affect reconstruction quality when there are missing samples. In order to compensate for this off-grid sampling, we introduce a resampling operator (here, the non-uniform Fourier transform) that accounts for this non-uniformity moreso than merely treating the sampling grid as periodic. Numerical experiments demonstrate that this approach can improve reconstruction quality when there is relatively little data.},
	keywords = {hierarchical tucker, irregular sampling, off the grid, structured tensor, tensor interpolation},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/WS_LR/2015/dasilva2015WSLRigt/dasilva2015WSLRigt_poster.pdf},
	author = {Curt Da Silva and Felix J. Herrmann}
}
@conference {dasilva2015EAGEogt,
	title = {Off the grid tensor completion for seismic data interpolation},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2015},
	note = {(EAGE, Madrid)},
	month = {06},
	abstract = {The practical realities of acquiring seismic data in a realistic survey are often at odds with the stringent requirements of Shannon-Nyquist-based sampling theory. The unpredictable movement of the ocean{\textquoteleft}s currents can be detrimental in acquiring exactly equally-spaced samples while sampling at Nyquist-rates are expensive, given the huge dimensionality and size of the data volume. Recent work in matrix and tensor completion for seismic data interpolation aim to alleviate such stringent Nyquist-based sampling requirements but are fundamentally posed on a regularly-spaced grid. In this work, we extend our previous results in using the so-called Hierarchical Tucker (HT) tensor format for recovering seismic data to the irregularly sampled case. We introduce an interpolation operator that resamples our tensor from a regular grid (in which we impose our low-rank constraints) to our irregular sampling grid. Our framework is very flexible and efficient, depending primarily on the computational costs of this operator. We demonstrate the superiority of this approach on a realistic BG data set compared to using low-rank tensor methods that merely use binning.},
	keywords = {EAGE, hierarchical tucker, irregular sampling, off the grid, structured tensor, tensor interpolation},
	doi = {10.3997/2214-4609.201412978},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/dasilva2015EAGEogt/dasilva2015EAGEogt.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/dasilva2015EAGEogt/dasilva2015EAGEogt_pres.pdf},
	author = {Curt Da Silva and Felix J. Herrmann}
}
@conference {herrmann2014BIRSlrb,
	title = {Low-rank based matrix/tensor completions for the "real" (seismic) world},
	booktitle = {Workshop on Sparse Representations, Numerical Linear Algebra, and Optimization; Banff},
	year = {2014},
	note = {(Workshop at the Banff International Research Station for Mathematical Innovation and Discovery)},
	month = {10},
	keywords = {hierarchical tucker, low-rank, matrix completion, source separation, workshop},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/BIRS/2014/herrmann2014BIRSlrb_pres.pdf},
	author = {Felix J. Herrmann}
}
@conference {dasilva2014EAGEhtucknoisy,
	title = {Low-rank promoting transformations and tensor interpolation - applications to seismic data denoising},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {In this abstract, we extend our previous work in Hierarchical Tucker (HT) tensor completion, which uses an extremely efficient representation for representing high-dimensional tensors exhibit- ing low-rank structure, to handle subsampled tensors with noisy entries. We consider a "low-noise" case, so that the energies of the noise and the signal are nearly indistinguishable, and a {\textquoteright}high-noise{\textquoteright} case, in which the noise energy is now scaled to the amplitude of the entire data volume. We examine the effect of the noise in terms of the singular values along different matricizations of the data, i.e., reshaping of the tensor along different modes. By interpreting this effect in the context of tensor completion, we demonstrate the inefficacy of denoising by this method in the source-receiver do- main. In light of this observation, we transform the decimated, noisy data in to the midpoint-offset domain, which promotes low-rank behaviour in the signal and high-rank behaviour in the noise. This distinction between signal and noise allows low-rank interpolation to effectively denoise the signal with only a marginal increase in computational cost. We demonstrate the effectiveness of this approach on a 4D frequency slice.},
	keywords = {EAGE, hierarchical tucker, low-rank transform, riemannian optimization, seismic denoising, structured tensor, tensor interpolation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/dasilva2014EAGEhtucknoisy/dasilva2014EAGEhtucknoisy.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/dasilva2014EAGEhtucknoisy/dasilva2014EAGEhtucknoisy_pres.pdf},
	author = {Curt Da Silva and Felix J. Herrmann}
}
@presentation {dasilva2013SINBADSPRhtuck,
	title = {Hierarchical Tucker tensor optimization - applications to 4D seismic data interpolation},
	year = {2013},
	publisher = {SINBAD},
	abstract = {In this work, we develop optimization algorithms on the manifold of Hierarchical Tucker (HT) tensors, an extremely efficient format for representing high-dimensional tensors exhibiting particular low-rank structure. With some minor alterations to existing theoretical developments, we develop an optimization framework based on the geometric understanding of HT tensors as a smooth manifold, a generalization of smooth curves/surfaces. Building on the existing research of solving optimization problems on smooth manifolds, we develop Steepest Descent and Conjugate Gradient methods for HT tensors. The resulting algorithms converge quickly, are immediately parallelizable, and do not require the computation of SVDs. We also derive efficient Gauss-Newton based algorithms which converge much faster than standard, first-order methods. We also extend ideas about favourable sampling conditions for missing-data recovery from the field of Matrix Completion to Tensor Completion and demonstrate how the organization of data can affect the success of recovery. As a result, if one has data with randomly missing source pairs, using these ideas, coupled with an efficient solver, one can interpolate large-scale seismic data volumes with missing sources and/or receivers by exploiting the multidimensional dependencies in the data. We are able to recover data volumes amidst extremely high subsampling ratios (in some cases, > 75\%) using this approach and we demonstrate our recovery on a synthetic 5D data set provided to us by BG.},
	keywords = {3D data interpolation, hierarchical tucker, Presentation, SINBAD, SINBADSPRING2013, SLIM, structured tensor},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Spring/dasilva2013SINBADSPRhtuck/dasilva2013SINBADSPRhtuck.pdf},
	author = {Curt Da Silva and Felix J. Herrmann}
}
@conference {dasilva2013SAMPTAhtuck,
	title = {Hierarchical Tucker tensor optimization - applications to tensor completion},
	year = {2013},
	month = {07},
	abstract = {In this work, we develop an optimization framework for problems whose solutions are well-approximated by Hierarchical Tucker tensors, an efficient structured tensor format based on recursive subspace factorizations. Using the differential geometric tools presented here, we construct standard optimization algorithms such as Steepest Descent and Conjugate Gradient, for interpolating tensors in HT format. We also empirically examine the importance of one{\textquoteright}s choice of data organization in the success of tensor recovery by drawing upon insights from the Matrix Completion literature. Using these algorithms, we recover various seismic data sets with randomly missing source pairs.},
	keywords = {differential geometry, hierarchical tucker, riemannian optimization, SAMPTA, structured tensor, tensor interpolation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SAMPTA/2013/dasilva2013SAMPTAhtuck/dasilva2013SAMPTAhtuck.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SAMPTA/2013/dasilva2013SAMPTAhtuck/dasilva2013SAMPTAhtuck_pres.pdf},
	author = {Curt Da Silva and Felix J. Herrmann}
}
@conference {dasilva2013SEGhtuck,
	title = {Structured tensor missing-trace interpolation in the Hierarchical Tucker format},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {32},
	year = {2013},
	month = {09},
	pages = {3623-3627},
	publisher = {SEG},
	organization = {SEG},
	abstract = {Owing to the large scale and dimensionality of a 3D seismic experiment, acquiring fully-sampled data according to the Nyquist criterion is an exceedingly arduous and cost-prohibitive task. In this paper, we develop tools to interpolate 5D seismic volumes with randomly missing sources or receivers using a relatively novel tensor format known as the Hierarchical Tucker (HT) format. By exploiting the underlying smooth structure of HT tensors, specifically its smooth manifold structure, we develop solvers which are fast, immediately parallelizable, and SVD-free, making these solvers amenable to large-scale problems where SVD-based projection methods are far too costly. We also build on intuition of multidimensional sampling from the perspective of matrix-completion and demonstrate the ability of our algorithms to recover frequency slices even amidst very high levels of source subsampling on a synthetic large-scale 3D North Sea dataset.},
	keywords = {differential geometry, gauss newton, hierarchical tucker, riemannian optimization, SEG, structured tensor, tensor interpolation},
	doi = {10.1190/segam2013-0709.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/dasilva2013SEGhtuck/dasilva2013SEGhtuck.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/dasilva2013SEGhtuck/dasilva2013SEGhtuck_pres.pdf},
	author = {Curt Da Silva and Felix J. Herrmann}
}
