@article {kumar2017hrc,
	title = {Highly repeatable 3D compressive full-azimuth towed-streamer time-lapse acquisition {\textendash}- a numerical feasibility study at scale},
	journal = {The Leading Edge},
	volume = {36},
	number = {8},
	year = {2017},
	note = {(The Leading Edge)},
	month = {08},
	pages = {677-687},
	abstract = {Most conventional 3D time-lapse (or 4D) acquisitions are ocean-bottom cable (OBC) or ocean-bottom node (OBN) surveys since these surveys are relatively easy to replicate compared to towed-streamer surveys. To attain high degrees of repeatability, survey replicability and dense periodic sampling has become the norm for 4D surveys that renders this technology expensive. Conventional towed-streamer acquisitions suffer from limited illumination of subsurface due to narrow azimuth. Although, acquisition techniques such as multi-azimuth, wide-azimuth, rich-azimuth acquisition, etc., have been developed to illuminate the subsurface from all possible angles, these techniques can be prohibitively expensive for densely sampled surveys. This leads to uneven sampling, i.e., dense receiver and coarse source sampling or vice-versa, in order to make these acquisitions more affordable. Motivated by the design principles of Compressive Sensing (CS), we acquire economic, randomly subsampled (or compressive) and simultaneous towed-streamer time-lapse data without the need of replicating the surveys. We recover densely sampled time-lapse data on one and the same periodic grid by using a joint-recovery model (JRM) that exploits shared information among different time-lapse recordings, coupled with a computationally cheap and scalable rank-minimization technique. The acquisition is low cost since we have subsampled measurements (about 70\% subsampled), simulated with a simultaneous long-offset acquisition configuration of two source vessels travelling across a survey area at random azimuths. We analyze the performance of our proposed compressive acquisition and subsequent recovery strategy by conducting a synthetic, at scale, seismic experiment on a 3D time-lapse model containing geological features such as channel systems, dipping and faulted beds, unconformities and a gas cloud. Our findings indicate that the insistence on replicability between surveys and the need for OBC/OBN 4D surveys can, perhaps, be relaxed. Moreover, this is a natural next step beyond the successful CS acquisition examples discussed in this special issue.},
	keywords = {3D, CS, marine, rank minimization, simultaneous long offset, time-lapse seismic},
	doi = {10.1190/tle36080677.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2017/kumar2017hrc/kumar2017hrc.html},
	author = {Rajiv Kumar and Haneet Wason and Shashin Sharan and Felix J. Herrmann}
}
@conference {zhang2017SEGmsd,
	title = {Massive 3D seismic data compression and inversion with hierarchical Tucker},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2017},
	note = {(SEG, Houston)},
	month = {09},
	pages = {1347-1352},
	abstract = {Modern-day oil and gas exploration, especially in areas of complex geology such as fault belts and sub-salt areas, is an increasingly expensive and risky endeavour. Typically long-offset and dense sampling seismic data are required for subsequent shot based processing procedures, e.g. wave-equation based inversion (WEI) and surface-related multiple elimination (SRME). However, these strict requirements result in an exponential growth in data volume size and prohibitive demands on computational resources, given the multidimensional nature of the data volumes. Moreover the physical constraints and cost limitations impose restrictions on acquiring fully sampled data. In this work, we propose to invert our large-scale data from a set of subsampled measurements, resulting in an estimate of the true volume in a compressed low-rank tensor format. Rather than expanding the data to its fully-sampled form for later downstream processes, we demonstrate how to use this compressed data directly via on-the-fly common shot or receiver gathers extraction. The combination of massive compression and fast on demand data reconstruction of 3D shot or receiver gathers leads to a substantial reduction in memory costs but with minimal effects on results in the subsequent processing procedures. We demonstrate the effective implementation of our proposed framework on full-waveform inversion on a 3D seismic synthetic data set generated from a Overthrust model.},
	keywords = {3D, FWI, SEG, tensor algebra},
	doi = {10.1190/segam2017-17742951.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2017/zhang2017SEGmsd/zhang2017SEGmsd.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2017/zhang2017SEGmsd/zhang2017SEGmsd_pres.pdf},
	author = {Yiming Zhang and Curt Da Silva and Rajiv Kumar and Felix J. Herrmann}
}
@article {kumar2014GEOPemc,
	title = {Efficient matrix completion for seismic data reconstruction},
	journal = {Geophysics},
	volume = {80},
	number = {5},
	year = {2015},
	note = {(Geophysics)},
	month = {09},
	pages = {V97-V114},
	abstract = {Despite recent developments in improved acquisition, seismic data often remain undersampled along source and receiver coordinates, resulting in incomplete data for key applications such as migration and multiple prediction. We have interpreted the missing-trace interpolation problem in the context of matrix completion (MC), and developed three practical principles for using low-rank optimization techniques to recover seismic data. Specifically, we strive for recovery scenarios wherein the original signal is low rank and the subsampling scheme increases the singular values of the matrix. We use an optimization program that restores this low-rank structure to recover the full volume. Omitting one or more of these principles can lead to poor interpolation results, as we found experimentally. In light of this theory, we compensate for the high-rank behavior of data in the source-receiver domain by using the midpoint-offset transformation for 2D data and a source-receiver permutation for 3D data to reduce the overall singular values. Simultaneously, to work with computationally feasible algorithms for large-scale data, we use a factorization-based approach to MC, which significantly speeds up the computations compared with repeated singular value decompositions without reducing the recovery quality. In the context of our theory and experiments, we also find that windowing the data too aggressively can have adverse effects on the recovery quality. To overcome this problem, we carried out our interpolations for each frequency independently while working with the entire frequency slice. The result is a computationally efficient, theoretically motivated framework for interpolating missing-trace data. Our tests on realistic 2D and 3D seismic data sets show that our method compares favorably in terms of computational speed and recovery quality with existing curvelet- and tensor-based techniques.},
	keywords = {2D, 3D, algorithm, interpolation, low-rank, signal processing},
	doi = {10.1190/geo2014-0369.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2015/kumar2014GEOPemc/kumar2014GEOPemc.pdf},
	url2 = {http://library.seg.org/doi/abs/10.1190/geo2014-0369.1},
	author = {Rajiv Kumar and Curt Da Silva and Okan Akalin and Aleksandr Y. Aravkin and Hassan Mansour and Ben Recht and Felix J. Herrmann}
}
