2020
DOI: 10.3390/atmos11121369
|View full text |Cite
|
Sign up to set email alerts
|

The Use of Gaussian Mixture Models with Atmospheric Lagrangian Particle Dispersion Models for Density Estimation and Feature Identification

Abstract: Atmospheric Lagrangian particle dispersion models, LPDM, simulate the dispersion of passive tracers in the atmosphere. At the most basic level, model output consists of the position of computational particles and the amount of mass they represent. In order to obtain concentration values, this information is then converted to a mass distribution via density estimation. To date, density estimation is performed with a nonparametric method so that output consists of gridded concentration data. Here we introduce th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(9 citation statements)
references
References 35 publications
0
8
0
Order By: Relevance
“…GMMs may be able to detect these heterogeneous relationships and appropriately cluster model components so they can be represented by normal distributions. GMMs have been successfully implemented in a variety of fields including speech recognition and robotic learning. , Recently, GMMs have also been used in geophysical data analysis to accompany atmospheric Lagrangian particle dispersion models …”
Section: Introductionmentioning
confidence: 99%
“…GMMs may be able to detect these heterogeneous relationships and appropriately cluster model components so they can be represented by normal distributions. GMMs have been successfully implemented in a variety of fields including speech recognition and robotic learning. , Recently, GMMs have also been used in geophysical data analysis to accompany atmospheric Lagrangian particle dispersion models …”
Section: Introductionmentioning
confidence: 99%
“…The smaller C d (K), the closer MISE{ p(t, •; h * )} is to zero for a low amount of particles. Therefore, C d (K) is also referred to as the efficiency of the kernel K. One can show that the kernel smoother K * that minimizes (10) is the so-called Epanechnikov kernel ( [18], Section 6.1, pp. 82-83), i.e.,…”
Section: Mise{ P(t •;mentioning
confidence: 99%
“…Here, β 1 is related to the efficiency of the used estimator, e.g., for (6), β 1 estimates the quantity (10). The coefficients β 0 and β 1 can be estimated via a least-squares approximation of log 10 (MISE{ p(t, •; h)}).…”
Section: Convergence Studymentioning
confidence: 99%
See 1 more Smart Citation
“…This work presents an approach based on a Gaussian Mixture Model (GMM) [18,40]. GMMs are used for many different problems, e.g., background subtraction in images [30], superpixel segmentation [5], image denoising [59], or density estimation in atmospheric Lagrangian particle dispersion models [10]. In this work, a modified GMM is introduced as a probabilistic model to describe the movement of a particle.…”
Section: Introductionmentioning
confidence: 99%