@mastersthesis {dasilva2017THlso,
	title = {Large-scale optimization algorithms for missing data completion and inverse problems},
	year = {2017},
	note = {(PhD)},
	month = {09},
	school = {The University of British Columbia},
	type = {phd},
	address = {Vancouver},
	abstract = {Inverse problems are an important class of problems found in many areas of science and engineering. In these problems, one aims to estimate unknown parameters of a physical system through indirect multi-experiment measurements. Inverse problems arise in a number of fields including seismology, medical imaging, and astronomy, among others. An important aspect of inverse problems is the quality of the acquired data itself. Real-world data acquisition restrictions, such as time and budget constraints, often results in measured data with missing entries. Many inversion algorithms assume that the input data is fully sampled and relatively noise free and produce poor results when these assumptions are violated. Given the multidimensional nature of real-world data, we propose a new low-rank optimization method on the smooth manifold of Hierarchical Tucker tensors. Tensors that exhibit this low-rank structure can be recovered from solving this non-convex program in an efficient manner. We successfully interpolate realistically sized seismic data volumes using this approach. If our low-rank tensor is corrupted with non-Gaussian noise, the resulting optimization program can be formulated as a convex-composite problem. This class of problems involves minimizing a non-smooth but convex objective composed with a nonlinear smooth mapping. In this thesis, we develop a level set method for solving composite-convex problems and prove that the resulting subproblems converge linearly. We demonstrate that this method is competitive when applied to examples in noisy tensor completion, analysis-based compressed sensing, audio declipping, total-variation deblurring and denoising, and one-bit compressed sensing. With respect to solving the inverse problem itself, we introduce a new software design framework that manages the cognitive complexity of the various components involved. Our framework is modular by design, which enables us to easily integrate and replace components such as linear solvers, finite difference stencils, preconditioners, and parallelization schemes. As a result, a researcher using this framework can formulate her algorithms with respect to high-level components such as objective functions and hessian operators. We showcase the ease with which one can prototype such algorithms in a 2D test problem and, with little code modification, apply the same method to large-scale 3D problems.},
	keywords = {convex composite, interpolation, low-rank, Optimization, PhD, software design, tensor, tensor completion},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2017/dasilva2017THlso/dasilva2017THlso.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2017/dasilva2017THlso/dasilva2017THlso_pres.pdf},
	author = {Curt Da Silva}
}
@presentation {kumar2016SINBADFlrm,
	title = {Low-rank methods for on-the-fly slicing \& dicing of seismic data \& image volumes},
	year = {2016},
	publisher = {SINBAD},
	abstract = {Conventional oil and gas fields are increasingly difficult to explore and produce, which calls for more complex wave-equation based inversion (WEI) algorithms that require dense long-offset samplings. These requirements result in an exponential growth in data volumes and prohibitive demands on computational resources. In this work, we propose a fast, resilient, and scalable wave-equation based inversion methodology for both the data and image-domain, which can handle complicated wave physics. First we show that both the data and image domains exhibit low-rank structure in a transform-domain, which can be exploited to compress the dense data or image volumes. Then, by accessing information from the compressed volumes on-the fly, we devise a scalable computational inversion framework driven by gradient calculations, which works with small subsets of source experiments. In the full-waveform inversion context, we demonstrate the efficacy of low-rank interpolation to improve downstream inversion results compared to merely inverting the velocity model using the subsampled data volume directly. We demonstrate the effectiveness of the proposed framework on two different waveform-inversion formulations, specifically performing full-waveform inversion on 5D data set generated using the overthrust model, and wave-equation based migration velocity analysis on the Marmousi model. This is joint work with Curt Da Silva and Yiming Zhang.},
	keywords = {Presentation, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/kumar2016SINBADFlrm/kumar2016SINBADFlrm.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/kumar2016SINBADFlrm/kumar2016SINBADFlrm.mov},
	author = {Rajiv Kumar and Curt Da Silva and Yiming Zhang and Felix J. Herrmann}
}
@presentation {dasilva2014SINBADlss,
	title = {Large-scale seismic data interpolation in a parallel computing environment},
	year = {2014},
	publisher = {SINBAD},
	abstract = {This talk will outline the details for a parallel implementation of the SPG-LR algorithm for matrix completion and its applications to large-scale seismic data interpolation. Previous work done in our group on LR-based matrix factorization has been shown to be extremely efficient for seismic data interpolation that fits in memory. We extend the SPGL1 framework that this method is built on to instances where the full seismic data volume cannot entirely fit in the memory of one computational node and must be run in a distributed environment. We will also look at off-the-grid regularization for tensor completion using a non-uniform FFT operator and examine its effects on interpolating an irregularly sampled, 3D seismic frequency slice.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/dasilva2014SINBADlss/dasilva2014SINBADlss.pdf},
	author = {Curt Da Silva and Felix J. Herrmann}
}
@presentation {dasilva2014SINBADlrp,
	title = {Low-rank promoting transformations and tensor interpolation - applications to seismic data denoising},
	year = {2014},
	publisher = {SINBAD},
	abstract = {In this presentation, we extend our previous work in Hierarchical Tucker (HT) tensor completion, which uses an extremely efficient representation for representing high-dimensional tensors exhibiting low-rank structure, to handle subsampled tensors with noisy entries. We consider a {\textquoteleft}low-noise{\textquoteright} case, so that the energies of the noise and the signal are nearly indistinguishable, and a {\textquoteleft}high-noise{\textquoteright} case, in which the noise energy is now scaled to the amplitude of the entire data volume. For the low-noise case in particular, standard trace-by-trace energy comparisons cannot distinguish noise from signal. We examine the behaviour of noise in terms of the singular values along different matricizations of the data, i.e. reshaping of the tensor along different dimensions. By interpreting this effect in the context of tensor completion, we demonstrate the inefficacy of denoising by this method in the source-receiver domain. 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, without knowledge of the noise location, with only a marginal increase in computational cost. We demonstrate the effectiveness of this approach on a 4D frequency slice.},
	keywords = {Presentation, SINBAD, SINBADSPRING2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Spring/dasilva2014SINBADlrp/dasilva2014SINBADlrp.pdf},
	author = {Curt Da Silva and 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}
}
