@article {jumah2014GPdre,
	title = {Dimensionality-reduced estimation of primaries by sparse inversion},
	journal = {Geophysical Prospecting},
	volume = {62},
	number = {5},
	year = {2014},
	note = {(Geophysical Prospecting)},
	month = {09},
	pages = {972-993},
	abstract = {Wave-equation based methods, such as the estimation of primaries by sparse inversion, have been successful in the mitigation of the adverse effects of surface-related multiples on seismic imaging and migration-velocity analysis. However, the reliance of these methods on multidimensional convolutions with fully sampled data exposes the {\textquoteleft}curse of dimensionality{\textquoteright}, which leads to disproportional growth in computational and storage demands when moving to realistic 3D field data. To remove this fundamental impediment, we propose a dimensionality-reduction technique where the {\textquoteleft}data matrix{\textquoteright} is approximated adaptively by a randomized low-rank factorization. Compared to conventional methods, which need for each iteration passage through all data possibly requiring on-the-fly interpolation, our randomized approach has the advantage that the total number of passes is reduced to only one to three. In addition, the low-rank matrix factorization leads to considerable reductions in storage and computational costs of the matrix multiplies required by the sparse inversion. Application of the proposed method to two-dimensional synthetic and real data shows that significant performance improvements in speed and memory use are achievable at a low computational up-front cost required by the low-rank factorization.},
	keywords = {factorization, primaries, sparse inversion},
	doi = {10.1111/1365-2478.12113},
	url = {http://onlinelibrary.wiley.com/doi/10.1111/1365-2478.12113/abstract},
	url2 = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2014/jumah2014GPdre/jumah2014GPdre.pdf},
	author = {Bander Jumah and Felix J. Herrmann}
}
@mastersthesis {jumah2012THdre,
	title = {Dimensionality-reduced estimation of primaries by sparse inversion},
	year = {2012},
	note = {(MSc)},
	month = {02},
	school = {The University of British Columbia},
	type = {masters},
	address = {Vancouver},
	abstract = {Data-driven methods{\textemdash}such as the estimation of primaries by sparse inversion suffer from the curse of dimensionality that leads to disproportional growth in computational and storage demands when moving to realistic 3D field data. To remove this fundamental impediment, we propose a dimensionality-reduction technique where the data matrix is approximated adaptively by a randomized low-rank factorization. Compared to conventional methods, which need passes through all the data possibly including on-the-fly interpolations for each iteration, our approach has the advantage that the passes is reduced to one to three. In addition, the low-rank matrix factorization leads to considerable reductions in storage and computational costs of the matrix multiplies required by the sparse inversion. Application of the proposed formalism to synthetic and real data shows that significant performance improvements in speed and memory use are achievable at a low computational overhead required by the low-rank factorization.},
	keywords = {MSc, thesis},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2012/jumah2012THdre.pdf},
	author = {Bander Jumah}
}
@presentation {jumah2011SINBADdrEPSI,
	title = {Dimensionality-reduced estimation of primaries by sparse inversion},
	year = {2011},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2011, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2011/Fall/jumah2011SINBADdrEPSI/jumah2011SINBADdrEPSI_pres.pdf},
	author = {Bander Jumah}
}
@conference {jumah2011SEGdrepsi,
	title = {Dimensionality-reduced estimation of primaries by sparse inversion},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {30},
	year = {2011},
	month = {09},
	pages = {3520-3525},
	publisher = {SEG},
	organization = {SEG},
	abstract = {Data-driven methods{\textendash}-such as the estimation of primaries by sparse inversion{\textendash}-suffer from the "curse of dimensionality", which leads to disproportional growth in computational and storage demands when moving to realistic 3-D field data. To remove this fundamental impediment, we propose a dimensionality reduction technique where the "data matrix" is approximated adaptively by a randomized low-rank approximation. Compared to conventional methods, our approach has the advantage that the cost of the low-rank approximation is reduced significantly, which may lead to considerable reductions in storage and computational costs of the sparse inversion. Application of the proposed formalism to synthetic data shows that significant improvements are achievable at low computational overhead required to compute the low-rank approximations.},
	keywords = {Presentation, Processing, SEG},
	doi = {10.1190/1.3627931},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2011/Jumah11SEGdrepsi/Jumah11SEGdrepsi.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2011/Jumah11SEGdrepsi/Jumah11SEGdrepsi_pres.pdf},
	author = {Bander Jumah and Felix J. Herrmann}
}
