Landuse Classification from Satellite Imagery using Deep LearningDataWorks Summit
With the abundance of remote sensing satellite imagery, the possibilities are endless as to the kind of insights that can be derived from them. One such use is to determine land use for agriculture and non-agricultural purposes.
In this talk, we’ll be looking at leveraging Sentinel-2 satellite imagery data along with OpenStreetMap labels to be able to classify land use as agricultural or non-agricultural.
Sentinel-2 data has a 10-meter resolution in RGB bands and is well-suited for land use classification. Using these two datasets, many different machine learning tasks can be performed like image segmentation into two classes (farm land and non-farm land) or more challenging task of identification of crop type being cultivated on fields.
For this talk, we’ll be looking at leveraging convolutional neural networks (CNNs) built with Apache MXNet to train deep learning models for land use classification. We’ll be covering the different deep learning architectures considered for this particular use case along with the appropriate metrics.
We’ll be leveraging streaming pipelines built on Apache Flink and Apache NiFi for model training and inference. Developers will come away with a better understanding of how to analyze satellite imagery and the different deep learning architectures along with their pros/cons when analyzing satellite imagery for land use. SUNEEL MARTHI and CHRIS OLIVIER, Software Development Engineer Amazon Web Services
Hashing has witnessed an increase in popularity over the
past few years due to the promise of compact encoding and fast query
time. In order to be effective hashing methods must maximally preserve
the similarity between the data points in the underlying binary representation.
The current best performing hashing techniques have utilised
supervision. In this paper we propose a two-step iterative scheme, Graph
Regularised Hashing (GRH), for incrementally adjusting the positioning
of the hashing hypersurfaces to better conform to the supervisory signal:
in the first step the binary bits are regularised using a data similarity
graph so that similar data points receive similar bits. In the second
step the regularised hashcodes form targets for a set of binary classifiers
which shift the position of each hypersurface so as to separate opposite
bits with maximum margin. GRH exhibits superior retrieval accuracy to
competing hashing methods.
Landuse Classification from Satellite Imagery using Deep LearningDataWorks Summit
With the abundance of remote sensing satellite imagery, the possibilities are endless as to the kind of insights that can be derived from them. One such use is to determine land use for agriculture and non-agricultural purposes.
In this talk, we’ll be looking at leveraging Sentinel-2 satellite imagery data along with OpenStreetMap labels to be able to classify land use as agricultural or non-agricultural.
Sentinel-2 data has a 10-meter resolution in RGB bands and is well-suited for land use classification. Using these two datasets, many different machine learning tasks can be performed like image segmentation into two classes (farm land and non-farm land) or more challenging task of identification of crop type being cultivated on fields.
For this talk, we’ll be looking at leveraging convolutional neural networks (CNNs) built with Apache MXNet to train deep learning models for land use classification. We’ll be covering the different deep learning architectures considered for this particular use case along with the appropriate metrics.
We’ll be leveraging streaming pipelines built on Apache Flink and Apache NiFi for model training and inference. Developers will come away with a better understanding of how to analyze satellite imagery and the different deep learning architectures along with their pros/cons when analyzing satellite imagery for land use. SUNEEL MARTHI and CHRIS OLIVIER, Software Development Engineer Amazon Web Services
Hashing has witnessed an increase in popularity over the
past few years due to the promise of compact encoding and fast query
time. In order to be effective hashing methods must maximally preserve
the similarity between the data points in the underlying binary representation.
The current best performing hashing techniques have utilised
supervision. In this paper we propose a two-step iterative scheme, Graph
Regularised Hashing (GRH), for incrementally adjusting the positioning
of the hashing hypersurfaces to better conform to the supervisory signal:
in the first step the binary bits are regularised using a data similarity
graph so that similar data points receive similar bits. In the second
step the regularised hashcodes form targets for a set of binary classifiers
which shift the position of each hypersurface so as to separate opposite
bits with maximum margin. GRH exhibits superior retrieval accuracy to
competing hashing methods.
Time Series Analysis:Basic Stochastic Signal RecoveryDaniel Cuneo
Simple case of a recovering a stochastic signal from a time series with a linear combination of nuisance signals.
Errata:
corrected error in the Gaussian fit.
corrected the JackKnife example and un-centers data.
Corrected sig fig language and rationale
removed jk calculation of mean reformatted cells
Learning to Project and Binarise for Hashing-based Approximate Nearest Neighb...Sean Moran
In this paper we focus on improving the effectiveness of hashing-based approximate nearest neighbour search. Generating similarity preserving hashcodes for images has been shown to be an effective and efficient method for searching through large datasets. Hashcode generation generally involves two steps: bucketing the input feature space with a set of hyperplanes, followed by quantising the projection of the data-points onto the normal vectors to those hyperplanes. This procedure results in the makeup of the hashcodes depending on the positions of the data-points with respect to the hyperplanes in the feature space, allowing a degree of locality to be encoded into the hashcodes. In this paper we study the effect of learning both the hyperplanes and the thresholds as part of the same model. Most previous research either learn the hyperplanes assuming a fixed set of thresholds, or vice-versa. In our experiments over two standard image datasets we find statistically significant increases in retrieval effectiveness versus a host of state-of-the-art data-dependent and independent hashing models.
R package 'bayesImageS': a case study in Bayesian computation using Rcpp and ...Matt Moores
There are many approaches to Bayesian computation with intractable likelihoods, including the exchange algorithm, approximate Bayesian computation (ABC), thermodynamic integration, and composite likelihood. These approaches vary in accuracy as well as scalability for datasets of significant size. The Potts model is an example where such methods are required, due to its intractable normalising constant. This model is a type of Markov random field, which is commonly used for image segmentation. The dimension of its parameter space increases linearly with the number of pixels in the image, making this a challenging application for scalable Bayesian computation. My talk will introduce various algorithms in the context of the Potts model and describe their implementation in C++, using OpenMP for parallelism. I will also discuss the process of releasing this software as an open source R package on the CRAN repository.
A Fast Implicit Gaussian Curvature FilterYuanhao Gong
Minimizing Gaussian curvature is computationally expensive in traditional way. We present a new method that can minimize the Gaussian curvature without computing it. Our filter is 100 times faster than traditional solvers.
bayesImageS: Bayesian computation for medical Image Segmentation using a hidd...Matt Moores
There are many approaches to Bayesian computation with intractable likelihoods, including the exchange algorithm, approximate Bayesian computation (ABC), thermodynamic integration, and composite likelihood. These approaches vary in accuracy as well as scalability for datasets of significant size. The Potts model is an example where such methods are required, due to its intractable normalising constant. This model is a type of Markov random field, which is commonly used for image segmentation. The dimension of its parameter space increases linearly with the number of pixels in the image, making this a challenging application for scalable Bayesian computation. My talk will introduce various algorithms in the context of the Potts model and describe their implementation in C++, using OpenMP for parallelism.
Bayesian Inference and Uncertainty Quantification for Inverse ProblemsMatt Moores
So-called “inverse” problems arise when the parameters of a physical system cannot be directly observed. The mapping between these latent parameters and the space of noisy observations is represented as a mathematical model, often involving a system of differential equations. We seek to infer the parameter values that best fit our observed data. However, it is also vital to obtain accurate quantification of the uncertainty involved with these parameters, particularly when the output of the model will be used for forecasting. Bayesian inference provides well-calibrated uncertainty estimates, represented by the posterior distribution over the parameters. In this talk, I will give a brief introduction to Markov chain Monte Carlo (MCMC) algorithms for sampling from the posterior distribution and describe how they can be combined with numerical solvers for the forward model. We apply these methods to two examples of ODE models: growth curves in ecology, and thermogravimetric analysis (TGA) in chemistry. This is joint work with Matthew Berry, Mark Nelson, Brian Monaghan and Raymond Longbottom.
UH Professor Arthur Weglein's M-OSRP Annual Report, 2013Arthur Weglein
UH Physic Professor & the Director of the Mission Oriented Seismic Research Program Arthur B. Weglein's introduction of the annual report for the year 2013. Arthur B. Weglein, a professor in the Department of Physics & the Department of Earth & Atmospheric science, he holds the Hugh Roy and Lillie distinguished chair in Physic at University of Houston
The internal-multiple elimination algorithm for all first-order internal mult...Arthur Weglein
The ISS (Inverse-Scattering-Series) internal-multiple attenuation algorithm (Araújo et al. (1994)
and Weglein et al. (1997)) can predict the correct time and approximate amplitude for all firstorder
internal multiples without any information of the earth. This algorithm is effective and
can attenuate internal multiples in many cases. However, in certain places, both on-shore
and off-shore, the multiple is often proximal to or interfering with the primaries. Therefore,
the task of completely removing internal multiples without damaging primaries becomes more
challenging and subtle and currently beyond the collective capability of the petroleum industry.
Weglein (2014) proposed a three-pronged strategy for providing an effective response to this
pressing and prioritized challenge. One part of the strategy is to develop an internal-multiple
elimination algorithm that can predict both the correct amplitude and the correct time for all
internal multiples. The ISS internal-multiple elimination algorithm for all first-order internal
multiples generated from all reflectors in a 1D earth is proposed in this report. The primaries in
the reflection data that enters the algorithm provides that elimination capability, automatically
without our requiring the primaries to be identified or in any way separated. The other events in
the reflection data, that is, the internal multiples, will not be helpful in this elimination scheme.
That is a limitation of this algorithm. We will propose a modified strategy for providing the
elimination ability without the current shortcoming. We note that this elimination algorithm
based on the ISS internal-multiple attenuation algorithm is derived by using reverse engineering
to provide the difference between elimination and attenuation for a 1D earth. This particular
elimination algorithm is model type dependent since the reverse engineering method is model
type dependent. The ISS internal-multiple attenuation algorithm is completely model type
independent and in future work we will pursue the development of an eliminator for a multidimensional
earth by identifying terms in the inverse scattering series that have that purpose.
Time Series Analysis:Basic Stochastic Signal RecoveryDaniel Cuneo
Simple case of a recovering a stochastic signal from a time series with a linear combination of nuisance signals.
Errata:
corrected error in the Gaussian fit.
corrected the JackKnife example and un-centers data.
Corrected sig fig language and rationale
removed jk calculation of mean reformatted cells
Learning to Project and Binarise for Hashing-based Approximate Nearest Neighb...Sean Moran
In this paper we focus on improving the effectiveness of hashing-based approximate nearest neighbour search. Generating similarity preserving hashcodes for images has been shown to be an effective and efficient method for searching through large datasets. Hashcode generation generally involves two steps: bucketing the input feature space with a set of hyperplanes, followed by quantising the projection of the data-points onto the normal vectors to those hyperplanes. This procedure results in the makeup of the hashcodes depending on the positions of the data-points with respect to the hyperplanes in the feature space, allowing a degree of locality to be encoded into the hashcodes. In this paper we study the effect of learning both the hyperplanes and the thresholds as part of the same model. Most previous research either learn the hyperplanes assuming a fixed set of thresholds, or vice-versa. In our experiments over two standard image datasets we find statistically significant increases in retrieval effectiveness versus a host of state-of-the-art data-dependent and independent hashing models.
R package 'bayesImageS': a case study in Bayesian computation using Rcpp and ...Matt Moores
There are many approaches to Bayesian computation with intractable likelihoods, including the exchange algorithm, approximate Bayesian computation (ABC), thermodynamic integration, and composite likelihood. These approaches vary in accuracy as well as scalability for datasets of significant size. The Potts model is an example where such methods are required, due to its intractable normalising constant. This model is a type of Markov random field, which is commonly used for image segmentation. The dimension of its parameter space increases linearly with the number of pixels in the image, making this a challenging application for scalable Bayesian computation. My talk will introduce various algorithms in the context of the Potts model and describe their implementation in C++, using OpenMP for parallelism. I will also discuss the process of releasing this software as an open source R package on the CRAN repository.
A Fast Implicit Gaussian Curvature FilterYuanhao Gong
Minimizing Gaussian curvature is computationally expensive in traditional way. We present a new method that can minimize the Gaussian curvature without computing it. Our filter is 100 times faster than traditional solvers.
bayesImageS: Bayesian computation for medical Image Segmentation using a hidd...Matt Moores
There are many approaches to Bayesian computation with intractable likelihoods, including the exchange algorithm, approximate Bayesian computation (ABC), thermodynamic integration, and composite likelihood. These approaches vary in accuracy as well as scalability for datasets of significant size. The Potts model is an example where such methods are required, due to its intractable normalising constant. This model is a type of Markov random field, which is commonly used for image segmentation. The dimension of its parameter space increases linearly with the number of pixels in the image, making this a challenging application for scalable Bayesian computation. My talk will introduce various algorithms in the context of the Potts model and describe their implementation in C++, using OpenMP for parallelism.
Bayesian Inference and Uncertainty Quantification for Inverse ProblemsMatt Moores
So-called “inverse” problems arise when the parameters of a physical system cannot be directly observed. The mapping between these latent parameters and the space of noisy observations is represented as a mathematical model, often involving a system of differential equations. We seek to infer the parameter values that best fit our observed data. However, it is also vital to obtain accurate quantification of the uncertainty involved with these parameters, particularly when the output of the model will be used for forecasting. Bayesian inference provides well-calibrated uncertainty estimates, represented by the posterior distribution over the parameters. In this talk, I will give a brief introduction to Markov chain Monte Carlo (MCMC) algorithms for sampling from the posterior distribution and describe how they can be combined with numerical solvers for the forward model. We apply these methods to two examples of ODE models: growth curves in ecology, and thermogravimetric analysis (TGA) in chemistry. This is joint work with Matthew Berry, Mark Nelson, Brian Monaghan and Raymond Longbottom.
UH Professor Arthur Weglein's M-OSRP Annual Report, 2013Arthur Weglein
UH Physic Professor & the Director of the Mission Oriented Seismic Research Program Arthur B. Weglein's introduction of the annual report for the year 2013. Arthur B. Weglein, a professor in the Department of Physics & the Department of Earth & Atmospheric science, he holds the Hugh Roy and Lillie distinguished chair in Physic at University of Houston
The internal-multiple elimination algorithm for all first-order internal mult...Arthur Weglein
The ISS (Inverse-Scattering-Series) internal-multiple attenuation algorithm (Araújo et al. (1994)
and Weglein et al. (1997)) can predict the correct time and approximate amplitude for all firstorder
internal multiples without any information of the earth. This algorithm is effective and
can attenuate internal multiples in many cases. However, in certain places, both on-shore
and off-shore, the multiple is often proximal to or interfering with the primaries. Therefore,
the task of completely removing internal multiples without damaging primaries becomes more
challenging and subtle and currently beyond the collective capability of the petroleum industry.
Weglein (2014) proposed a three-pronged strategy for providing an effective response to this
pressing and prioritized challenge. One part of the strategy is to develop an internal-multiple
elimination algorithm that can predict both the correct amplitude and the correct time for all
internal multiples. The ISS internal-multiple elimination algorithm for all first-order internal
multiples generated from all reflectors in a 1D earth is proposed in this report. The primaries in
the reflection data that enters the algorithm provides that elimination capability, automatically
without our requiring the primaries to be identified or in any way separated. The other events in
the reflection data, that is, the internal multiples, will not be helpful in this elimination scheme.
That is a limitation of this algorithm. We will propose a modified strategy for providing the
elimination ability without the current shortcoming. We note that this elimination algorithm
based on the ISS internal-multiple attenuation algorithm is derived by using reverse engineering
to provide the difference between elimination and attenuation for a 1D earth. This particular
elimination algorithm is model type dependent since the reverse engineering method is model
type dependent. The ISS internal-multiple attenuation algorithm is completely model type
independent and in future work we will pursue the development of an eliminator for a multidimensional
earth by identifying terms in the inverse scattering series that have that purpose.
Surface-related multiple elimination through orthogonal encoding in the laten...Oleg Ovcharenko
We explore the feasibility of surface-related multiple elimination by two-step separation where primaries and multiples are separated in the latent space of a convolutional autoencoder. First, we train a convolutional autoencoder to produce orthogonal embeddings of primaries and multiples. Second, we train another network to classify the latent space embedding of target data into respective wave types and decode predictions back to the data domain. Moreover, we propose an end-to-end workflow for the generation of realistic synthetic seismic data sufficient for knowledge transfer from training on synthetic to inference on field data. We evaluate the two-step separation approach in synthetic setup and highlight the strengths and weaknesses of using masks in encoder latent space for surface-related multiple elimination.
Arthur B. Weglein, Hong Liang, and Chao Ma M-OSRP/Physics Dept./University o...Arthur Weglein
Arthur B. Weglein, a professor in the Department of Physics and the Department of Earth and Atmospheric Sciences in Houston TX. Read more on Research & Awards.
Accuracy of the internal multiple prediction when a time-saving method based ...Arthur Weglein
The inverse scattering series (ISS) is a direct inversion method for a multidimensional acoustic,
elastic and anelastic earth. It communicates that all inversion processing goals can be
achieved directly and without any subsurface information. This task is reached through a taskspecific
subseries of the ISS. Using primaries in the data as subevents of the first-order internal
multiples, the leading-order attenuator can predict the time of all the first-order internal multiples
and is able to attenuate them.
Internal-multiple attenuation on Encana data - Qiang Fu and Arthur B. WegleinArthur Weglein
The attenuation of internal-multiple energy on land data is currently one of the most challenging
tasks in seismic data preprocessing. In general, poor data quality and the lack of velocity
information for complicated geological structure (especially in the near surface) in land data often
result in poor predictions by the internal multiple attenuation methods requiring subsurface
information. Inverse Scattering Series (ISS) internal-multiple attenuation is a very promising
algorithm for attenuating internal-multiple energy on land seismic exploration data. The key
characteristic of the ISS-based methods is that they do not require any information about the
subsurface– i.e., they are fully data driven. Internal multiples from all possible generators are
predicted simultaneously from the input data. In this paper we apply Inverse Scattering Series
(ISS) internal- multiple-attenuation algorithms on land seismic data from Canada.
PROGRAMMA ATTIVITA’ DIDATTICA A.A. 2016/17
DOTTORATO DI RICERCA IN INGEGNERIA STRUTTURALE E GEOTECNICA
____________________________________________________________
STOCHASTIC DYNAMICS AND MONTE CARLO SIMULATION IN EARTHQUAKE ENGINEERING APPLICATIONS
Lecture Series by
Agathoklis Giaralis, Ph.D., M.ASCE., P.E. City, University of London
Visiting Professor Sapienza University of Rome
Dengue Vector Population Forecasting Using Multisource Earth Observation Prod...University of Pavia
This presentation introduces a technique for using recurrent neural networks to forecast Ae. aegypti mosquito (Dengue transmission vector) counts at neighborhood-level, using Earth Observation data inputs as proxies to environmental variables. The model is validated using in situ data in two Brazilian cities, and compared with state-of-the-art multioutput random forest and k-nearest neighbor models. The approach exploits a clustering step performed before the model definition, which simplifies the task by aggregating mosquito count sequences with similar temporal patterns.
This presentation was made to students of the College of Control Science and Engineering, China University of Petroleum (East China) on the 31th of May, 2021.
Arthur B. weglein, Hong Liang & Chao Ma - Research Paper Arthur Weglein
Seismic research paper published by the arthurs, Arthur B. weglein, Hong Liang & Chao Ma. Arthur B. Weglein is the director of the mission oriented seismic research, University of houston
Wavelet estimation for a multidimensional acoustic or elastic earthArthur Weglein
A new and general wave theoretical wavelet estimation
method is derived. Knowing the seismic wavelet
is important both for processing seismic data and for
modeling the seismic response. To obtain the wavelet,
both statistical (e.g., Wiener-Levinson) and deterministic
(matching surface seismic to well-log data) methods
are generally used. In the marine case, a far-field
signature is often obtained with a deep-towed hydrophone.
The statistical methods do not allow obtaining
the phase of the wavelet, whereas the deterministic
method obviously requires data from a well. The
deep-towed hydrophone requires that the water be
deep enough for the hydrophone to be in the far field
and in addition that the reflections from the water
bottom and structure do not corrupt the measured
wavelet. None of the methods address the source
array pattern, which is important for amplitude-versus-
offset (AVO) studies.
The inverse scattering series for tasks associated with primaries: direct non...Arthur Weglein
The inverse scattering series for tasks associated with primaries: direct non-linear inversion of 1D elastic media. In this paper, research on direct inversion for two pa-
rameter acoustic media (Zhang and Weglein, 2005) is
extended to the three parameter elastic case. We present
the first set of direct non-linear inversion equations for
1D elastic media (i.e., depth varying P-velocity, shear
velocity and density). The terms for moving mislocated
reflectors are shown to be separable from amplitude
correction terms. Although in principle this direct
inversion approach requires all four components of elastic
data, synthetic tests indicate that consistent value-added
results may be achieved given only ˆDPP measurements.
We can reasonably infer that further value would derive
from actually measuring ˆDPP , ˆD PS, ˆDSP and ˆDSS as
the method requires. The method is direct with neither
a model matching nor cost function minimization.
Internal multiple attenuation using inverse scattering: Results from prestack 1 & 2D acoustic and
elastic synthetics
R. T. Coates*, Schlumberger Cambridge Research, A. B. Weglein, Arco Exploration and Production Technology
Summary
The attenuation of internal multiples in a multidimensional
earth is an important and longstanding problem in exploration
seismics. In this paper we report the results of applying
an attenuation algorithm based on the inverse scattering
series to synthetic prestack data sets generated in on
and two dimensional earth models. The attenuation algorithm
requires no information about the subsurface structure
or the velocity field. However, detailed information about
the source wavelet is a prerequisite. An attractive feature of:
the attenuation algorithm is the preservation of the amplitude
(and phase) of primary events in the data; thus allowing for
subsequent AVO and other true amplitude processing.
The Inverse Scattering Series (ISS) is a direct inversion method
for a multidimensional acoustic, elastic and anelastic earth. It
communicates that all inversion processing goals are able to
be achieved directly and without any subsurface information.
This task is reached through a task-specific subseries of the
ISS. Using primaries in the data as subevents of the first-order
internal multiples, the leading-order attenuator can predict the
time of all the first-order internal multiples and is able to attenuate
them.
However, the ISS internal multiple attenuation algorithm can
be a computationally demanding method specially in a complex
earth. By using an approach that is based on two angular
quantities and that was proposed in Terenghi et al. (2012), the
cost of the algorithm can be controlled. The idea is to use the
two angles as key-control parameters, by limiting their variation,
to disregard some calculated contributions of the algorithm
that are negligible. Moreover, the range of integration
can be chosen as a compromise of the required degree of accuracy
and the computational time saving.
This time-saving approach is presented
Inverse scattering series for multiple attenuation: An example with surface a...Arthur Weglein
A multiple attenuation method derived from an inverse scattering
series is described. The inversion series approach allows a
separation of multiple attenuation subseries from the full series.
The surface multiple attenuation subseries was described and illustrated
in Carvalho et al. (1991, 1992). The internal multiple
attenuation method consists of selecting the parts of the odd
terms that are associated with removing only multiply reflected
energy. The method, for both types of multiples, is multidimensional
and does not rely on periodicity or differential moveout,
nor does it require a model of the reflectors generating the multiples.
An example with internal and surface multiples will be
presented.
In this paper we present a multidimensional method for attenuating internal multiples that derives from
an inverse scattering series . The method doesn't depend on periodicity or differential moveout, nor does it
require a model for the multiple generating reflectors.
Summary
Methods for removal of free-surface and internal multiples have been developed from bath a feedback model approach and inverse scatterin g theory. White these two formulations derive from different mathematica) viewpoints,
the resulting algorithm s for free-surface multiple are very similar. By contrast , the feedback and inverse scattering
method for internal multiple are totally different and have different requirements for sub surface information or
interpretive intervention . The former removes all multiple related to a certain boundary with the a of a surface
integral along this boundary ; the alter wilt predict and attenuate a ll internal multiple a t the same time . In this paper, we continue our comparison study of these internal multiple attenuation method ; specifically , we examine two
different realizations of the feedback method and the inverse scattering technique .
Internal multiple attenuation using inverse scattering: Results from prestack...Arthur Weglein
The attenuation of internal multiples in a multidimensional
earth is an important and longstanding problem in exploration
seismics. In this paper we report the results of applying
an attenuation algorithm based on the inverse scattering
series to synthetic prestack data sets generated in on
and two dimensional earth models. The attenuation algorithm
requires no information about the subsurface structure
or the velocity field. However, detailed information about
the source wavelet is a prerequisite. An attractive feature of:
the attenuation algorithm is the preservation of the amplitude
(and phase) of primary events in the data; thus allowing for
subsequent AVO and other true amplitude processing.
Wavelet estimation for a multidimensional acoustic or elastic earth- Arthur W...Arthur Weglein
A new and general wave theoretical wavelet estimation
method is derived. Knowing the seismic wavelet
is important both for processing seismic data and for
modeling the seismic response. To obtain the wavelet,
both statistical (e.g., Wiener-Levinson) and deterministic
(matching surface seismic to well-log data) methods
are generally used. In the marine case, a far-field
signature is often obtained with a deep-towed hydrophone.
The statistical methods do not allow obtaining
the phase of the wavelet, whereas the deterministic
method obviously requires data from a well. The
deep-towed hydrophone requires that the water be
deep enough for the hydrophone to be in the far field
and in addition that the reflections from the water
bottom and structure do not corrupt the measured
wavelet. None of the methods address the source
array pattern, which is important for amplitude-versus-
offset (AVO) studies
Inverse scattering series for multiple attenuation: An example with surface a...Arthur Weglein
A multiple attenuation method derived from an inverse scattering
series is described. The inversion series approach allows a
separation of multiple attenuation subseries from the full series.
The surface multiple attenuation subseries was described and illustrated
in Carvalho et al. (1991, 1992). The internal multiple
attenuation method consists of selecting the parts of the odd
terms that are associated with removing only multiply reflected
energy. The method, for both types of multiples, is multidimensional
and does not rely on periodicity or differential moveout,
nor does it require a model of the reflectors generating the multiples.
An example with internal and surface multiples will be
presented.
Deghosting is a longstanding seismic objective and problem that has received considerable renewed attention due to : (1). an interest in so-called "broadband seismology" and the low frequency /low vertical wave number.
All of the perturbative approaches to multidimensional wave
equation processing. for example. wave equation migration (see,
e.g., Claerbout, 1971; French, 1975: Schneider, 1978; Stolt, 1978;
Sattlegger et al, 1980), or Born approximation inversion (see,
e.g., Cohen and Bleistein, 1979; Raz, 1981: Clayton and Stolt,
1981) require some input velocity information. In the Born approximation
to inversion, a reference or background velocity is
chosena nd a perturbationa boutt his velocity is determined.S imilarly,
a velocity model is a required input to all wave equation
migration techniques.
Acorn Recovery: Restore IT infra within minutesIP ServerOne
Introducing Acorn Recovery as a Service, a simple, fast, and secure managed disaster recovery (DRaaS) by IP ServerOne. A DR solution that helps restore your IT infra within minutes.
Sharpen existing tools or get a new toolbox? Contemporary cluster initiatives...Orkestra
UIIN Conference, Madrid, 27-29 May 2024
James Wilson, Orkestra and Deusto Business School
Emily Wise, Lund University
Madeline Smith, The Glasgow School of Art
0x01 - Newton's Third Law: Static vs. Dynamic AbusersOWASP Beja
f you offer a service on the web, odds are that someone will abuse it. Be it an API, a SaaS, a PaaS, or even a static website, someone somewhere will try to figure out a way to use it to their own needs. In this talk we'll compare measures that are effective against static attackers and how to battle a dynamic attacker who adapts to your counter-measures.
About the Speaker
===============
Diogo Sousa, Engineering Manager @ Canonical
An opinionated individual with an interest in cryptography and its intersection with secure software development.
Have you ever wondered how search works while visiting an e-commerce site, internal website, or searching through other types of online resources? Look no further than this informative session on the ways that taxonomies help end-users navigate the internet! Hear from taxonomists and other information professionals who have first-hand experience creating and working with taxonomies that aid in navigation, search, and discovery across a range of disciplines.
This presentation by Morris Kleiner (University of Minnesota), was made during the discussion “Competition and Regulation in Professions and Occupations” held at the Working Party No. 2 on Competition and Regulation on 10 June 2024. More papers and presentations on the topic can be found out at oe.cd/crps.
This presentation was uploaded with the author’s consent.
Getting started with Amazon Bedrock Studio and Control Tower
Arthur weglein
1. THE SIGNIFICANCE OF INCORPORATING A
3D POINT SOURCE IN THE INVERSE SCATTERING SERIES
(ISS) INTERNAL MULTIPLE ATTENUATOR
FOR A 1D SUBSURFACE
Xinglu Lin* and Arthur B. Weglein
M-OSRP, University of Houston
Oct. 19th, 2015
1
2. BACKGROUND
The ISS internal-multiple attenuation algorithm:
Is the only method that does not need any subsurface
information and is earth model-type independent.
Can predict all internal multiples at once.
Is widely used by major service and oil companies.
(e.g. CGG, PGS, Schlumberger, Petrobras, Aramco, KOC, BP…)
2
3. BACKGROUND
Onshore effectiveness:
“Their performance was demonstrated with complex synthetic and
challenging land field data sets with encouraging results; other internal
multiple-suppression methods were unable to demonstrate similar
effectiveness.”
—Yi Luo et al., 2011, TLE, 884-889
“Elimination of land internal multiples based on the inverse scattering series”
3
6. MOTIVATION AND HIGHLIGHT IN THIS TALK
There are on-shore and off-shore regions, which are close to 1D earth and have
serious internal multiple problems. (e.g., Central North sea, Canada)
The frequently used ISS internal multiple attenuator for a 1D subsurface is
reduced from a full 2D theory.
However, the source is better to be assumed as a 3D point source (e.g. dynamite,
airgun).
The objective of this paper is to improve the internal-multiple prediction with
incorporating a 3D point source in the ISS internal multiple attenuation
algorithm for a 1D subsurface.
6
7. THEORY
The ISS internal multiple attenuation algorithm is a multi-
dimensional method (Araujo et al., 1994; Weglein et al., 1997).
7
Start with a complete 3D ISS internal multiple
attenuator
Reduced it for a 1D subsurface
8. ISS INTERNAL MULTIPLE ATTENUATOR
ASSUMING A 3D POINT SOURCE AND A 3D SUBSURFACE
3D theory requires:
8
Z
Y
X
Source
Receiver
3D earth-Properties
vary in (x,y,z)
direction.
10. q
r
Source
Receiver
3D source-1D earth algorithm requires:
10
Z
Y
X
1D earth -
Properties vary
in z-direction.
Independent of
azimuth angle
ISS INTERNAL MULTIPLE ATTENUATOR
ASSUMING A 3D POINT SOURCE AND A 1D SUBSURFACE
11. Source
Receiver
3D source-1D earth algorithm requires:
11
Z
Y
X
Recorded Seismic data:
D(rh,t)
rh
ISS INTERNAL MULTIPLE ATTENUATOR
ASSUMING A 3D POINT SOURCE AND A 1D SUBSURFACE
12. ISS internal multiple attenuator for 1D subsurface (Araujo et al., 1994; Weglein et
al., 1997) :
ISS INTERNAL MULTIPLE ATTENUATOR
FOR A 1D SUBSURFACE
12
13. ISS internal multiple attenuator for 1D subsurface (Araujo et al., 1994; Weglein et
al., 1997) :
ISS INTERNAL MULTIPLE ATTENUATOR
FOR A 1D SUBSURFACE
13
z1
14. ISS internal multiple attenuator for 1D subsurface (Araujo et al., 1994; Weglein et
al., 1997) :
ISS INTERNAL MULTIPLE ATTENUATOR
FOR A 1D SUBSURFACE
14
z1
z2
15. ISS internal multiple attenuator for 1D subsurface (Araujo et al., 1994; Weglein et
al., 1997) :
15
z1
z2
z3
ISS INTERNAL MULTIPLE ATTENUATOR
FOR A 1D SUBSURFACE
16. ISS internal multiple attenuator for 1D subsurface (Araujo et al., 1994; Weglein et
al., 1997) :
16
z1
z2
z3
ISS INTERNAL MULTIPLE ATTENUATOR
FOR A 1D SUBSURFACE
17. ISS internal multiple attenuator for 1D subsurface (Araujo et al., 1994; Weglein et
al., 1997) :
17
D(rh,t) b1(kh,z) D3(rh, t)b3(kh, ω)
Attenuate the internal multiples: D(rh,t)+D3(rh, t)
ISS INTERNAL MULTIPLE ATTENUATOR
FOR A 1D SUBSURFACE
18. ISS internal multiple attenuator for 1D subsurface (Araujo et al., 1994; Weglein et
al., 1997) :
18
D(rh,t) b1(kh,z) D3(rh, t)b3(kh, ω)
Input preparation Output transform
ISS INTERNAL MULTIPLE ATTENUATOR
FOR A 1D SUBSURFACE
19. ISS INTERNAL MULTIPLE ATTENUATOR
ASSUMING A 2D LINE SOURCE
19
D(rh,t) b1(kh,z)
ISS prediction
D3(rh, t)
Fourier transform Inverse Fourier transform
b3(kh, ω)
Attenuate the internal multiples: D(rh,t)+D3(rh, t)
20. ISS INTERNAL MULTIPLE ATTENUATOR
ASSUMING A 3D POINT SOURCE
20
D(rh,t) b1(kh,z)
ISS prediction
D3(rh, t)
Hankel transform Inverse Hankel transform
b3(kh, ω)
Attenuate the internal multiples: D(rh,t)+D3(rh, t)
21. ISS INTERNAL MULTIPLE ATTENUATOR
ASSUMING A 3D POINT SOURCE
21
D(rh,t) b1(kh,z)
ISS prediction
D3(rh, t)
Asymptotic transform Inverse asymptotic transform
b3(kh, ω)
Attenuate the internal multiples: D(rh,t)+D3(rh, t)
22. DIFFERENCE BETWEEN
ISS INTERNAL MULTIPLE ATTENUATOR ASSUMING
A 3D POINT SOURCE V.S. A 2D LINE SOURCE
22
Asymptotic transform Inverse asymptotic transform
D(rh,t) b1(kh,z) D3(rh, t)b3(kh, ω)
Hankel transform Inverse Hankel transform
Assuming
a 2D line source
Assuming
a 3D point source
Fourier transform Inverse Fourier transform
ISS prediction
23. NUMERICAL TESTS
Numerical tests on a 3D source – 1D earth dataset:
Internal multiple prediction assuming a 2D line source
Fourier transform
Internal multiple prediction assuming a 3D point source
Hankel transform
Asymptotic transform
23
24. NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
ACOUSTIC MODEL
3D point source broad-band data using reflectivity method
24
100m
150m
MS
V=1500m/s
V=2200m/s
V=8000m/s
No ghosts; No free-surface multiples
26. 0
0.2
0.4
Time(s)
100 200
Trace Number
0
0.2
0.4
Time(s)
100 200
Trace Number
-5 0 5
x10-7
NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
ISS INTERNAL MULTIPLE ATTENUATOR
ASSUMING A 2D LINE SOURCE
26
0
0.2
0.4
Time(s)
100 200
Trace Number
-0.001 0 0.001
3D point source
data
×10-7
2D line source
IM prediction
(Fourier transform)
Very small scale
27. 0
0.2
0.4
Time(s)
100 200
Trace Number
27
0
0.2
0.4
Time(s)
100 200
Trace Number
-0.001 0 0.001
3D point source
data
0
0.2
0.4
Time(s)
100 200
Trace Number
-0.001 0 0.001
3D point source
IM prediction
(Hankel transform)
NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
ISS INTERNAL MULTIPLE ATTENUATOR
ASSUMING A 3D POINT SOURCE
28. 0
0.2
0.4
Time(s)
100 200
Trace Number
28
0
0.2
0.4
Time(s)
100 200
Trace Number
-0.001 0 0.001
3D point source
data
0
0.2
0.4
Time(s)
100 200
Trace Number
-0.001 0 0.001
3D point source
IM prediction
(Asymptotic transform)
NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
ISS INTERNAL MULTIPLE ATTENUATOR
ASSUMING A 3D POINT SOURCE
29. 0.37 0.38 0.39 0.40 0.41 0.42 0.43 0.44 0.45 0.46
Time (s)
-0.002
0
Amplitude NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
3D SOURCE VS. 2D SOURCE ISS INTERNAL MULTIPLE ATTENUATOR
(NEAR OFFSET TRACE COMPARISON, 100M)
29
3D point source
internal-multiple
30. 0.37 0.38 0.39 0.40 0.41 0.42 0.43 0.44 0.45 0.46
Time (s)
-0.002
0
Amplitude
30
2D line source ISS
internal-multiple
prediction
(Fourier transform)
3D point source
internal-multiple
NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
3D SOURCE VS. 2D SOURCE ISS INTERNAL MULTIPLE ATTENUATOR
(NEAR OFFSET TRACE COMPARISON, 100M)
31. 0.37 0.38 0.39 0.40 0.41 0.42 0.43 0.44 0.45 0.46
Time (s)
-0.002
0
Amplitude
31
2D line source ISS
internal-multiple
prediction
(Fourier transform)
3D point source
internal-multiple
NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
3D SOURCE VS. 2D SOURCE ISS INTERNAL MULTIPLE ATTENUATOR
(NEAR OFFSET TRACE COMPARISON, 100M)
×10-7
0.405 0.410 0.415 0.420 0.425 0.430
Time (s)
-1
0
1
x10-7
Amplitude
32. 0.37 0.38 0.39 0.40 0.41 0.42 0.43 0.44 0.45 0.46
Time (s)
-0.002
0
Amplitude
32
2D line source ISS
internal-multiple
prediction
(Fourier transform)
3D source ISS
internal-multiple
prediction
(Hankel transform)
3D point source
internal-multiple
NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
3D SOURCE VS. 2D SOURCE ISS INTERNAL MULTIPLE ATTENUATOR
(NEAR OFFSET TRACE COMPARISON, 100M)
33. 0.37 0.38 0.39 0.40 0.41 0.42 0.43 0.44 0.45 0.46
Time (s)
-0.002
0
Amplitude
33
2D line source ISS
internal-multiple
prediction
(Fourier transform)
3D source ISS
internal-multiple
prediction
(Hankel transform)
3D source ISS
internal-multiple
prediction
(Asymptotic Bessel)
3D point source
internal-multiple
NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
3D SOURCE VS. 2D SOURCE ISS INTERNAL MULTIPLE ATTENUATOR
(NEAR OFFSET TRACE COMPARISON, 100M)
34. 0.42 0.43 0.44 0.45 0.46 0.47 0.48
Time (s)
-0.004
-0.002
0
Amplitude
34
3D point source
internal-multiple
NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
3D SOURCE VS. 2D SOURCE ISS INTERNAL MULTIPLE ATTENUATOR
(FAR OFFSET TRACE COMPARISON, 500M)
35. 0.42 0.43 0.44 0.45 0.46 0.47 0.48
Time (s)
-0.004
-0.002
0
Amplitude
35
2D line source ISS
internal-multiple
prediction
(Fourier transform)
3D point source
internal-multiple
NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
3D SOURCE VS. 2D SOURCE ISS INTERNAL MULTIPLE ATTENUATOR
(FAR OFFSET TRACE COMPARISON, 500M)
36. 0.42 0.43 0.44 0.45 0.46 0.47 0.48
Time (s)
-0.004
-0.002
0
Amplitude
0.440 0.445 0.450 0.455 0.460
Time (s)
-2
0
x10-7
Amplitude
36
2D line source ISS
internal-multiple
prediction
(Fourier transform)
3D point source
internal-multiple
NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
3D SOURCE VS. 2D SOURCE ISS INTERNAL MULTIPLE ATTENUATOR
(FAR OFFSET TRACE COMPARISON, 500M)
×10-7
37. 0.42 0.43 0.44 0.45 0.46 0.47 0.48
Time (s)
-0.004
-0.002
0
Amplitude
37
2D line source ISS
internal-multiple
prediction
(Fourier transform)
3D source ISS
internal-multiple
prediction
(Hankel transform)
3D point source
internal-multiple
NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
3D SOURCE VS. 2D SOURCE ISS INTERNAL MULTIPLE ATTENUATOR
(FAR OFFSET TRACE COMPARISON, 500M)
38. 0.42 0.43 0.44 0.45 0.46 0.47 0.48
Time (s)
-0.004
-0.002
0
Amplitude
38
2D line source ISS
internal-multiple
prediction
(Fourier transform)
3D source ISS
internal-multiple
prediction
(Hankel transform)
3D source ISS
internal-multiple
prediction
(Asymptotic Bessel)
3D point source
internal-multiple
NUMERICAL TESTS ON A 3D SOURCE-1D EARTH DATA
3D SOURCE VS. 2D SOURCE ISS INTERNAL MULTIPLE ATTENUATOR
(FAR OFFSET TRACE COMPARISON, 500M)
39. ANALYSIS
When the data comes from a 3D point source, the ISS internal multiple
attenuation algorithm with a 2D line source assumption can make the prediction
result significantly less effective.
Incorporating a 3D source in the algorithm can improve its effectiveness within
the current ISS internal-multiple attenuation algorithm.
39
0.42 0.43 0.44 0.45 0.46 0.47 0.48
Time (s)
-0.004
-0.002
0
Amplitude
3D source data
2D source
prediction
3D source prediction
3D source prediction
(Asymptotic)
40. MULTIPLE REMOVAL STRATEGY
40
Internal-multiple-removal
New adaptive criterion
Pre-requisites: Onshore
(JingWu, 4:00pm, RM222)
Three-
pronged
strategy
Within the
algorithm
Beyond the
algorithm
Incorporate the
source dimension
(This presentation)
Incorporate the
radiation pattern
(Jinlong Yang, 1:55pm)
Spurious event
removal
(Chao Ma, 2:20pm)
Elimination
algorithm
(Yanglei Zou, 2:45pm)
41. KEY POINTS
41
The ISS internal-multiple prediction algorithm is the most capable method because it
does not require subsurface information.
This paper shows
its value of improving the effectiveness of internal-multiple attenuator;
it matters for the methods beyond the current ISS internal multiple attenuator.
It is always important to incorporate the 3D source in the ISS internal multiple
prediction.
Incorporate the right
source dimension