- Journal Home
- Volume 36 - 2024
- Volume 35 - 2024
- Volume 34 - 2023
- Volume 33 - 2023
- Volume 32 - 2022
- Volume 31 - 2022
- Volume 30 - 2021
- Volume 29 - 2021
- Volume 28 - 2020
- Volume 27 - 2020
- Volume 26 - 2019
- Volume 25 - 2019
- Volume 24 - 2018
- Volume 23 - 2018
- Volume 22 - 2017
- Volume 21 - 2017
- Volume 20 - 2016
- Volume 19 - 2016
- Volume 18 - 2015
- Volume 17 - 2015
- Volume 16 - 2014
- Volume 15 - 2014
- Volume 14 - 2013
- Volume 13 - 2013
- Volume 12 - 2012
- Volume 11 - 2012
- Volume 10 - 2011
- Volume 9 - 2011
- Volume 8 - 2010
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2009
- Volume 4 - 2008
- Volume 3 - 2008
- Volume 2 - 2007
- Volume 1 - 2006
Cited by
- BibTex
- RIS
- TXT
In this paper we discuss the inverse scattering algorithm for predicting internal multiple reflections (reverberation artefacts), focusing our attention on the construction mechanisms. Roughly speaking, the algorithm combines amplitude and phase information of three different arrivals (sub-events) in the data set to predict one multiple reflection. The three events are conditioned by a certain relation which requires that their pseudo-depths, defined as the depths of their turning points relative to the constant background velocity, satisfy a lower-higher-lower relationship. This implicitly assumes a pseudo-depth monotonicity condition, i.e., the relation between the actual depths and the pseudo-depths of any two sub-events is the same. We study this relation in pseudo-depth and show that it is directly connected with a similar relation between the vertical or intercept times of the sub-events. The paper also provides the first multidimensional analysis of the algorithm (for a vertically varying acoustic model) with analytical data. We show that the construction of internal multiples is performed in the plane waves domain and, as a consequence, the internal multiples with headwaves sub-events are also predicted by the algorithm. Furthermore we analyze the differences between the time monotonicity condition in vertical or intercept time and total travel time and show a 2D example which satisfies the former but not the latter. Finally we discuss one case in which the monotonicity condition is not satisfied by the sub-events of an internal multiple and discuss ways of lowering these restrictions and of expanding the algorithm to address these types of multiples.
}, issn = {1991-7120}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/cicp/7729.html} }In this paper we discuss the inverse scattering algorithm for predicting internal multiple reflections (reverberation artefacts), focusing our attention on the construction mechanisms. Roughly speaking, the algorithm combines amplitude and phase information of three different arrivals (sub-events) in the data set to predict one multiple reflection. The three events are conditioned by a certain relation which requires that their pseudo-depths, defined as the depths of their turning points relative to the constant background velocity, satisfy a lower-higher-lower relationship. This implicitly assumes a pseudo-depth monotonicity condition, i.e., the relation between the actual depths and the pseudo-depths of any two sub-events is the same. We study this relation in pseudo-depth and show that it is directly connected with a similar relation between the vertical or intercept times of the sub-events. The paper also provides the first multidimensional analysis of the algorithm (for a vertically varying acoustic model) with analytical data. We show that the construction of internal multiples is performed in the plane waves domain and, as a consequence, the internal multiples with headwaves sub-events are also predicted by the algorithm. Furthermore we analyze the differences between the time monotonicity condition in vertical or intercept time and total travel time and show a 2D example which satisfies the former but not the latter. Finally we discuss one case in which the monotonicity condition is not satisfied by the sub-events of an internal multiple and discuss ways of lowering these restrictions and of expanding the algorithm to address these types of multiples.