@mastersthesis {zhang2023THlsw,
	title = {Large scale wavefield reconstruction via weighted matrix factorization and seismic survey design},
	year = {2023},
	note = {(PhD)},
	month = {06},
	school = {Georgia Institute of Technology},
	type = {phd},
	address = {Atlanta},
	abstract = {Seismic data acquisition plays a crucial role in identifying potential oil and gas reservoirs during the early phases of exploration. However, obtaining finely sampled seismic data can be costly and physically impossible. Recent developments in Compressive Sensing have resulted in seismic data being increasingly collected at random along spatial coordinates. Although random sampling improves acquisition efficiency, it shifts the burden from seismic acquisition to data processing. Wavefield recovery is one of the required processes for reconstructing fully seismic data from coarsely subsampled data. Among the various techniques proposed for wavefield reconstruction, matrix completion methods are computationally efficient and straightforward to implement. These methods exploit the low-rank structure of fully seismic data. However, matrix completion performs well at low-to-mid frequencies and degrades at higher frequencies due to the failure of low-rank structure to accurately approximate higher frequencies. To address this issue, this thesis proposed a recursively weighted matrix completion method. Although effective, this method is computationally expensive, and a more efficient method for handling 2D seismic data was also proposed. Compared to 2D seismic data, 3D seismic data can detect reflections outside of the 2D plane but poses a computational challenge due to its large scale. To overcome this challenge, this thesis proposed a parallel weighted reconstruction method to improve the reconstruction of 3D seismic data. Land seismic data presents a greater challenge due to contamination by ground roll, which consists of surface waves with a high spatial frequency content and large amplitude. To address this issue, a practical workflow was proposed in this thesis to improve the recovery of land seismic data. Although matrix completion is an efficient technique for reconstructing fully seismic data, the optimal acquisition design is still being investigated. Recent studies have shown that the spectral gap can be used to predict and characterize the quality of wavefield reconstruction via matrix completion for a given subsampling mask. Based on these findings, a simulation-free seismic survey design for both 2D and 3D seismic data was proposed in this thesis to obtain an improved subsampling survey by minimizing the spectral gap ratio. Furthermore, this concept was extended to the design of a time-lapse seismic survey, which is essential for reservoir management and monitoring geological carbon storage but is difficult and expensive to acquire. To improve the reconstruction of the time-lapse wavefield, a joint recovery model was proposed that leverages the benefits of the non-replicated baseline and monitor subsampled seismic data. A time-lapse seismic survey design that incorporates the joint recovery model with spectral gap was proposed to generate sparse, non-replicated time-lapse acquisition geometries that favor wavefield recovery.},
	keywords = {5D reconstruction, Acquisition, compressed sensing, frequency-domain, JRM, matrix factorization, parallel, PhD, signal processing, spectral gap, survey design, time-lapse, wavefield reconstruction},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2023/zhang2023THlsw/zhang2023THlsw.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2023/zhang2023THlsw/zhang2023THlsw_pres.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Thesis/2023/zhang2023THlsw},
	author = {Yijun Zhang}
}
@mastersthesis {sharan2020THlsh,
	title = {Large scale high-frequency seismic wavefield reconstruction, acquisition via rank minimization and sparsity-promoting source estimation},
	year = {2020},
	note = {(PhD)},
	month = {11},
	school = {Georgia Institute of Technology},
	type = {phd},
	address = {Atlanta},
	abstract = {Seismic data reconstruction on a dense periodic grid from seismic data acquired on a coarse grid is a common approach followed by most of the oil \& gas companies. This approach allows them to save on operationally challenging and expensive dense seismic data acquisition. Dense seismic data is one of the key requirements for generating high-resolution images of earth{\textquoteright}s subsurface for exploration and production decisions. Based on the Compressive Sensing (CS) paradigm, low-rank matrix factorization based seismic data reconstruction methods are computationally cheaper and scalable to large datasets in comparison to sparsity-promotion based methods. The sparsity-promotion based methods are based on transformation in certain transform domains that can be computationally expensive for large datasets. Although, low-rank matrix factorization based methods perform well at lower frequencies, their performance degrades at higher frequencies due to increase in rank of approximating matrix. One of the contributions of this thesis is a recursively weighted matrix factorization approach to improve the quality of reconstructed data at higher frequencies. This recursively weighted approach exploits the similarity between adjacent frequency slices. Although, recursively weighted method improves the data reconstruction quality at higher frequencies, it can be computationally expensive for large scale seismic datasets. This is because of the interdependence of frequencies preventing simultaneous reconstruction of frequencies. Another contribution of this thesis is a computationally efficient recursively weighted framework for large scale dataset by parallelizing data reconstruction over rows of low-rank factors of each frequency slices. To reduce the cost and turnaround time of seismic data acquisition simultaneous source acquisition is adapted by the oil and gas industry in last few years. Another contribution of this thesis is a low-rank based method for simultaneous separation and reconstruction of seismic data on a dense periodic grid from large scale seismic data acquired with simultaneous source acquisition. Next part of this thesis focuses on accurate detection of fractures created by hydraulic fracturing in unconventional reservoirs for economical production of oil and gas. Fracturing of rocks during hydraulic fracturing gives rise to microseismic events, which are localized along these fractures. In this work, a sparsity-promoting microseismic source estimation framework is proposed to detect closely spaced microseismic sources along with estimation of their associated source-time functions from noisy microseismic data recorded by receivers along the earth{\textquoteright}s surface or along monitor wells. Detecting closely spaced microseismic events helps in delineating fractures and estimation of source-time function is useful in estimating fracture{\textquoteright}s origin in time. Also, source-time functions can be potentially useful for estimating the source-mechanism. Also, this method does not make any prior assumption on number of microseismic sources or shape of their source-time functions. Therefore, this method is useful for detecting microseismic sources with different source signatures and frequency content. Last part of this thesis focuses on sparsity-promoting photoacoustic imaging to detect photoabsorbers along with estimating the associated source-time functions. Traditional photoacoustic imaging can only estimate the locations of photoacoustic absorbers. Also, traditional methods require dense transducer coverage whereas sparsity-promotion based method can work with reduced transducer sampling reducing the overall data storage cost.},
	keywords = {compressed sensing, low-rank, PhD, Sparsity-promoting, wavefield reconstruction},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2020/sharan2020THlsh/sharan2020THlsh.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2020/sharan2020THlsh/sharan2020THlsh_pres.pdf},
	author = {Shashin Sharan}
}
@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}
}
@conference {kumar2018EAGEcsb,
	title = {Compressed sensing based land simultaneous acquisition using encoded sweeps},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2018},
	note = {(EAGE, Copenhagen)},
	month = {06},
	abstract = {Simultaneous shooting methods using encoded sweeps can enhance the productivity of land acquisition in situations where deployment of many vibrators and larger receiver spread is not possible in the field due to obstructions or permit limitations. However, the existing framework requires shooting the full sequence of encoded sweeps on each shot point to reconstruct the complete frequency bandwidth Green{\textquoteright}s function. Although this simultaneous shooting method reduces the sweeping time vs conventional sequential shooting, the gain in efficiency is limited. To further reduce the sweeping time, we propose to acquire randomly selected subsets of the encoded sweeps sequences followed by a rank-minimization based joint source separation and spectral interpolation framework to reconstruct the full bandwidth deblended Green{\textquoteright}s function. We demonstrate the advantages of proposed sampling and reconstruction framework using a synthetic seismic line simulated using SEG-SEAM Phase II land velocity and density model.},
	keywords = {compressed sensing, EAGE, land, SEAM, source separation, spectral interpolation},
	doi = {10.3997/2214-4609.201800643},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2018/kumar2018EAGEcsb/kumar2018EAGEcsb.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2018/kumar2018EAGEcsb/kumar2018EAGEcsb_pres.pdf},
	author = {Rajiv Kumar and Shashin Sharan and Nick Moldoveanu and Felix J. Herrmann}
}
@conference {herrmann2015SEGWScse,
	title = {Compressive Sensing in Exploration Seismology - where we came from, where we are now, and where we need to go},
	booktitle = {SEG Geophysical Compressed Sensing Workshop; Beijing, China},
	year = {2015},
	note = {(SEG Workshop, Beijing, China)},
	month = {12},
	keywords = {compressed sensing, SEG, workshop},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2015/herrmann2015SEGWScse/herrmann2015SEGWScse_pres.pdf},
	author = {Felix J. Herrmann}
}
@conference {herrmann2015ASEGrae,
	title = {Randomized algorithms in exploration seismology},
	booktitle = {ASEG Annual Conference Proceedings},
	year = {2015},
	note = {(ASEG, Perth)},
	month = {02},
	abstract = {As in several other industries, progress in exploration seismology relies on the collection and processing of massive data volumes that grow exponentially in size as the survey area and desired resolution increase. This exponential growth {\textendash}- in combination with the increased complexity of the next-generation of iterative wave-equation based inversion algorithms {\textendash}- puts strains on our acquisition systems and computational back ends impeding progress in our field. During this talk, I will review how recent randomized algorithms from Compressive Sensing and Machine learning can be used to overcome some of these challenges by fundamentally rethinking how we sample and process seismic data. The key idea here is to reduce acquisition and computational costs by deliberately working on small randomized subsets of the data at a desired accuracy. I will illustrate these concepts using a variety of compelling examples on realistic synthetics and field data.},
	keywords = {Acquisition, ASEG, compressed sensing, FWI, Imaging, seismology},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ASEG/2015/herrmann2015ASEGrae/herrmann2015ASEGrae.pdf},
	author = {Felix J. Herrmann}
}
@conference {witte2015IIPFWIspl,
	title = {Sparsity-promoting least-square migration with linearized Bregman and compressive sensing},
	booktitle = {Inaugural Full-Waveform Inversion Workshop},
	year = {2015},
	note = {(Natal, Brazil)},
	month = {08-09},
	abstract = {We present a novel adaptation of a recently developed relatively simple iterative algorithm to solve large-scale sparsity-promoting optimization problems. Our algorithm is particularly suitable to large-scale geophysical inversion problems, such as sparse least-squares reverse-time migration or Kirchoff migration since it allows for a tradeoff between parallel computations, memory allocation, and turnaround times, by working on subsets of the data with different sizes. Comparison of the proposed method for sparse least-squares imaging shows a performance that rivals and even exceeds the performance of state-of-the art one-norm solvers that are able to carry out least-squares migration at the cost of a single migration with all data.},
	keywords = {Bregman, compressed sensing, FWI, migration, sparsity promotion, time domain},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/IIPFWI/witte2015IIPFWIspl/witte2015IIPFWIspl_pres.pdf},
	author = {Philipp A. Witte and Ning Tu and Ernie Esser and Mengmeng Yang and Mathias Louboutin and Felix J. Herrmann}
}
@article {ghadermarzy2013ncs,
	title = {Non-convex compressed sensing using partial support information},
	journal = {Journal of Sampling Theory in Signal and Image Processing},
	volume = {13},
	number = {3},
	year = {2014},
	pages = {249-270},
	abstract = {In this paper we address the recovery conditions of weighted $\ell_p$ minimization for signal reconstruction from compressed sensing measurements when partial support in- formation is available. We show that weighted $\ell_p$ minimization with 0 < p < 1 is stable and robust under weaker sufficient conditions compared to weighted $\ell_1$ minimization. Moreover, the sufficient recovery conditions of weighted $\ell_p$ are weaker than those of regular $\ell_p$ minimization if at least 50\% of the support estimate is accurate. We also review some algorithms which exist to solve the non-convex $\ell_p$ problem and illustrate our results with numerical experiments.},
	keywords = {compressed sensing, nonconvex optimization, sparse reconstruction, weighted $\ell_p$},
	url = {http://arxiv.org/abs/1311.3773},
	author = {Navid Ghadermarzy and Hassan Mansour and Ozgur Yilmaz}
}
@article {mansour2013GEOPiwr,
	title = {Improved wavefield reconstruction from randomized sampling via weighted one-norm minimization},
	journal = {Geophysics},
	volume = {78},
	number = {5},
	year = {2013},
	month = {08},
	pages = {V193-V206},
	abstract = {Missing-trace interpolation aims to recover the gaps caused by physical obstacles or deliberate subsampling to control acquisition costs in otherwise regularly sampled seismic wavefields. Although transform-domain sparsity promotion has proven to be an effective tool to solve this recovery problem, current recovery techniques do not fully utilize a priori information derived from the locations of the transform-domain coefficients, especially when curvelet domain sparsity is exploited. We use recovery by weighted one-norm minimization, which exploits correlations between the locations of significant curvelet coefficients of different partitions, e.g., shot records, common-offset gathers, or frequency slices of the acquired data. We use these correlations to define a sequence of 2D curvelet-based recovery problems that exploit 3D continuity exhibited by seismic wavefields without relying on the highly redundant 3D curvelet transform. To test the performance of our weighted algorithm, we compared recoveries from different data sorting and partitioning scenarios for a seismic line from the Gulf of Suez. These tests demonstrated that our method is superior to standard $\ell_1$ minimization in terms of antialiasing capability, reconstruction quality and computational memory requirements.},
	keywords = {compressed sensing, randomized sampling, Trace interpolation, weighted one-norm minimization},
	doi = {10.1190/geo2012-0383.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2013/mansour2013GEOPiwr/mansour2013GEOPiwr.pdf},
	author = {Hassan Mansour and Felix J. Herrmann and Ozgur Yilmaz}
}
@mastersthesis {ghadermarzy2013THups,
	title = {Using prior support information in compressed sensing},
	year = {2013},
	note = {(MSc)},
	month = {08},
	school = {The University of British Columbia},
	type = {masters},
	address = {Vancouver},
	abstract = {Compressed sensing is a data acquisition technique that entails recovering estimates of sparse and compressible signals from $n$ linear measurements, significantly fewer than the signal ambient dimension $N$. In this thesis we show how we can reduce the required number of measurements even further if we incorporate prior information about the signal into the reconstruction algorithm. Specifically, we study certain weighted nonconvex $\ell_p$ minimization algorithms and a weighted approximate message passing algorithm. In Chapter 1 we describe compressed sensing as a practicable signal acquisition method in application and introduce the generic sparse approximation problem. Then we review some of the algorithms used in compressed sensing literature and briefly introduce the method we used to incorporate prior support information into these problems. In Chapter 2 we derive sufficient conditions for stable and robust recovery using weighted $\ell_p$ minimization and show that these conditions are better than those for recovery by regular $\ell_p$ and weighted $\ell_1$. We present extensive numerical experiments, both on synthetic examples and on audio, and seismic signals. In Chapter 3 we derive weighted AMP algorithm which iteratively solves the weighted $\ell_1$ minimization. We also introduce a reweighting scheme for weighted AMP algorithms which enhances the recovery performance of weighted AMP. We also apply these algorithms on synthetic experiments and on real audio signals.},
	keywords = {compressed sensing, MSc, thesis, weighted $\ell_1$},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2013/ghadermarzy2013THups.pdf},
	author = {Navid Ghadermarzy}
}
@conference {mansour2012SSPwspgl1,
	title = {Beyond $\ell_1$ norm minimization for sparse signal recovery},
	booktitle = {2012 IEEE Statistical Signal Processing Workshop (SSP) (SSP{\textquoteright}12)},
	year = {2012},
	month = {03},
	publisher = {IEEE},
	organization = {IEEE},
	address = {Ann Arbor, Michigan, USA},
	abstract = {Sparse signal recovery has been dominated by the basis pursuit denoise (BPDN) problem formulation for over a decade. In this paper, we propose an algorithm that outperforms BPDN in finding sparse solutions to underdetermined linear systems of equations at no additional computational cost. Our algorithm, called WSPGL1, is a modification of the spectral projected gradient for $\ell_1$ minimization (SPGL1) algorithm in which the sequence of LASSO subproblems are replaced by a sequence of weighted LASSO subproblems with constant weights applied to a support estimate. The support estimate is derived from the data and is updated at every iteration. The algorithm also modifies the Pareto curve at every iteration to reflect the new weighted $\ell_1$ minimization problem that is being solved. We demonstrate through extensive simulations that the sparse recovery performance of our algorithm is superior to that of $\ell_1$ minimization and approaches the recovery performance of iterative re-weighted $\ell_1$ (IRWL1) minimization of Cand{\`e}s, Wakin, and Boyd. Moreover, our algorithm has the computational cost of a single BPDN problem.},
	keywords = {compressed sensing, iterative algorithms, partial support recovery, Sparse recovery, weighted $\ell_1$ minimization},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SSP/2012/mansour2012SSPwspgl1/mansour2012SSPwspgl1.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SSP/2012/mansour2012SSPwspgl1/mansour2012SSPwspgl1_pres.pdf},
	author = {Hassan Mansour}
}
@article {vandenberg2011SIAMsol,
	title = {Sparse optimization with least-squares constraints},
	journal = {SIAM Journal on Optimization},
	volume = {21},
	number = {4},
	year = {2011},
	month = {11},
	pages = {1201{\textendash}1229},
	abstract = {The use of convex optimization for the recovery of sparse signals from incomplete or compressed data is now common practice. Motivated by the success of basis pursuit in recovering sparse vectors, new formulations have been proposed that take advantage of different types of sparsity. In this paper we propose an efficient algorithm for solving a general class of sparsifying formulations. For several common types of sparsity we provide applications, along with details on how to apply the algorithm, and experimental results.},
	keywords = {basis pursuit, compressed sensing, convex program, duality, group sparsity, matrix completion, Newton{\textquoteright}s method, root-finding, sparse solutions},
	doi = {10.1137/100785028},
	url = {http://www.math.ucdavis.edu/\%7Empf/2010-sparse-optimization-with-least-squares.html},
	author = {Ewout van den Berg and Michael P. Friedlander}
}
@article {vandenberg2009ACMstf,
	title = {Sparco: a testing framework for sparse reconstruction},
	journal = {ACM Transactions on Mathematical Software},
	volume = {35},
	number = {4},
	year = {2009},
	month = {02},
	pages = {1-16},
	abstract = {Sparco is a framework for testing and benchmarking algorithms for sparse reconstruction. It includes a large collection of sparse reconstruction problems drawn from the imaging, compressed sensing, and geophysics literature. Sparco is also a framework for implementing new test problems and can be used as a tool for reproducible research. Sparco is implemented entirely in Matlab, and is released as open-source software under the GNU Public License.},
	keywords = {compressed sensing, linear operators, Sparse recovery},
	url = {http://doi.acm.org/10.1145/1462173.1462178},
	author = {Ewout van den Berg and Michael P. Friedlander and Gilles Hennenfent and Felix J. Herrmann and Rayan Saab and Ozgur Yilmaz}
}
