Nothing Special   »   [go: up one dir, main page]

You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (772)

Search Parameters:
Keywords = Gaussian mixture model

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
18 pages, 4085 KiB  
Article
Population-Level Cell Trajectory Inference Based on Gaussian Distributions
by Xiang Chen, Yibing Ma, Yongle Shi, Yuhan Fu, Mengdi Nan, Qing Ren and Jie Gao
Biomolecules 2024, 14(11), 1396; https://doi.org/10.3390/biom14111396 - 1 Nov 2024
Viewed by 505
Abstract
In the past decade, inferring developmental trajectories from single-cell data has become a significant challenge in bioinformatics. RNA velocity, with its incorporation of directional dynamics, has significantly advanced the study of single-cell trajectories. However, as single-cell RNA sequencing technology evolves, it generates complex, [...] Read more.
In the past decade, inferring developmental trajectories from single-cell data has become a significant challenge in bioinformatics. RNA velocity, with its incorporation of directional dynamics, has significantly advanced the study of single-cell trajectories. However, as single-cell RNA sequencing technology evolves, it generates complex, high-dimensional data with high noise levels. Existing trajectory inference methods, which overlook cell distribution characteristics, may perform inadequately under such conditions. To address this, we introduce CPvGTI, a Gaussian distribution-based trajectory inference method. CPvGTI utilizes a Gaussian mixture model, optimized by the Expectation–Maximization algorithm, to construct new cell populations in the original data space. By integrating RNA velocity, CPvGTI employs Gaussian Process Regression to analyze the differentiation trajectories of these cell populations. To evaluate the performance of CPvGTI, we assess CPvGTI’s performance against several state-of-the-art methods using four structurally diverse simulated datasets and four real datasets. The simulation studies indicate that CPvGTI excels in pseudo-time prediction and structural reconstruction compared to existing methods. Furthermore, the discovery of new branch trajectories in human forebrain and mouse hematopoiesis datasets confirms CPvGTI’s superior performance. Full article
(This article belongs to the Section Bioinformatics and Systems Biology)
Show Figures

Figure 1

Figure 1
<p>Overall workflow of the CPvGTI model: (<b>a</b>) The Input of CPvGTI, including a gene expression matrix, an unspliced mRNA count matrix, and a spliced mRNA count matrix; (<b>b</b>) Application of Gaussian Mixture Model clustering on gene expression matrix; (<b>c</b>) Refinement to segregate cells into Cell Population (CP), where RNA velocity is estimated first through the unspliced mRNA count matrix and spliced mRNA count matrix; (<b>d</b>) Gaussian Process Regression to integrate the gene expression and RNA velocity on CP level; (<b>e</b>) Construction of a K-Nearest Neighbor (KNN) graph with the directions provided by RNA velocity; (<b>f</b>) Calculation of pseudo-time for each cell. The darker the color, the earlier the inferred developmental time; (<b>g</b>) Trajectory inference, where the branches are marked with red arrows.</p>
Full article ">Figure 2
<p>The performance of CPvGTI on simulated datasets: (<b>a</b>) The ground truth of four datasets with different structures. The color is labeled as the real developmental time simulated by dyngen; (<b>b</b>) The trajectories generated by CPvGTI. The corresponding branches are labeled by the legend.</p>
Full article ">Figure 3
<p>The performance of CPvGTI in mouse pancreatic endocrinogenesis: (<b>a</b>) The ground truth of the mouse pancreatic endocrinogenesis dataset visualized through scatter plot. Different colors represent different cell types; (<b>b</b>) The velocity manifold graph of the dataset calculated by scVelo; (<b>c</b>) The five trajectories generated by CPvGTI. Arrows are added to each lineage to indicate the direction of development; (<b>d</b>) The experimental results of Sakata et al. [<a href="#B31-biomolecules-14-01396" class="html-bibr">31</a>] on <span class="html-italic">epsilon</span> cells and <span class="html-italic">alpha</span> cells during the differentiation process of endocrine progenitors; (<b>e</b>) The stacked-violin plot of the expression on different terminal states (<span class="html-italic">alpha</span>, <span class="html-italic">beta</span>, <span class="html-italic">delta</span>, and <span class="html-italic">epsilon</span>) and their related marker genes. The position of the gene highlighted in red box can be visualized in (<b>f</b>); (<b>f</b>) The scatter plot of the marker gene <span class="html-italic">Ghrl</span> in <span class="html-italic">epsilon</span> cells; (<b>g</b>) The visualization of <span class="html-italic">Ghrl</span>, including the phase diagram, the RNA velocity plot, and the gene expression plot.</p>
Full article ">Figure 4
<p>The performance of CPvGTI in the human forebrain dataset: (<b>a</b>) The ground truth of the human forebrain dataset visualized through scatter plot. Different colors represent different cell types; (<b>b</b>) The three trajectories generated by CPvGTI. The area within the red box seems to show that mature neurons show signs of reversion; (<b>c</b>) The dotplot of the expression of marker genes; (<b>d</b>) The velocity manifold graph of the dataset calculated by scVelo. The area within the circle seems to show that it exits another branch.</p>
Full article ">Figure 5
<p>The performance of CPvGTI in mouse hematopoiesis dataset: (<b>a</b>) The ground truth of the mouse hematopoiesis dataset visualized through scatter plot. Different colors represent different cell types; (<b>b</b>) The fifteen trajectories generated by CPvGTI. Arrows are added to each lineage to indicate the direction of development. The figure marked by the large red box is a detailed representation of the figure indicated by the small red box. The red circle highlights the newly parts discovered through CPvGTI; (<b>c</b>) The matrixplot of the expression of marker genes; (<b>d</b>) The scatter plot of the marker gene <span class="html-italic">Cd74</span>. The lighter the color, the stronger the expression; (<b>e</b>) The scatter plot of the marker gene <span class="html-italic">Lcn2</span>. The lighter the color, the stronger the expression. The positions of the genes highlighted in red box can be visualized in (<b>c</b>,<b>d</b>).</p>
Full article ">Figure 6
<p>The performance of CPvGTI in human cell cycle dataset: (<b>a</b>) The velocity manifold graph of the dataset calculated by scVelo, where G0 and G1 is mixed; (<b>b</b>) The ground truth of the human cell cycle dataset visualized through scatter plot which is re-annotated. Different colors represent different cell types; (<b>c</b>) The two trajectories generated by CPvGTI. Arrows are added to each lineage to indicate the direction of development; (<b>d</b>) The velocity manifold graph of the cell cycle-dependent (CCD) protein KIF20A calculated by scVelo. The lighter the color, the stronger the expression; (<b>e</b>) The scatter plot of a protein unrelated to the cell cycle, SCIN. The lighter the color, the stronger the expression; (<b>f</b>) The stacked-violin plot of the expression on the marker genes.</p>
Full article ">
12 pages, 6472 KiB  
Article
Relationship Between Aquatic Factors and Sulfide and Ferrous Iron in Black Bloom in Lakes: A Case Study of a Eutrophic Lake in Eastern China
by Liang Wang, Changlin Xu, Hao Niu, Nian Liu, Meiling Xu, Yulin Wang and Jilin Cheng
Water 2024, 16(21), 3120; https://doi.org/10.3390/w16213120 - 1 Nov 2024
Viewed by 420
Abstract
Black bloom is a very serious water pollution phenomenon in eutrophic lakes, with Fe(II) and S(−II) being the key limiting factors for this problem. In this paper, three different machine learning methods, namely, Random Forest (RF), Gaussian Mixture Model (GMM), and Bayesian Network [...] Read more.
Black bloom is a very serious water pollution phenomenon in eutrophic lakes, with Fe(II) and S(−II) being the key limiting factors for this problem. In this paper, three different machine learning methods, namely, Random Forest (RF), Gaussian Mixture Model (GMM), and Bayesian Network (BN), were used to explore the complex interactions among Fe(II), S(−II), and other aquatic factors in the estuary of Chaohu Lake to better characterize and monitor water degradation by black bloom. The results of RF showed that total nitrogen (TN), ammonia, total phosphorous (TP), suspended sediment concentration (SSC), and oxidation–reduction potential (ORP), which were chosen from 11 factors, had the most important relationships with Fe(II) and S(−II). The 69 sampling sites were divided in three groups identified as worst, worse, and bad according to the observed values of seven factors using the GMM. Then, the BN model was applied to three observation groups. The results showed that the structures of the interaction networks were different between the groups. S(−II) controlled only SSC production in the bad and worse group sites, while SSC was determined by both S(−II) and Fe(II) in the worst group. Ammonia and TN exhibited the most direct importance for S(−II) and Fe(II) production in all observation groups. According to the indications from the BNs, potential management strategies for different water pollution conditions were developed. Finally, the threshold values of Fe(II), S(−II), TP, ammonia, TN, SSC, and ORP, which were 0.80 mg/L, 0.04 mg/L, 0.45 mg/L, 3.44 mg/L, 4.15 mg/L, 55 mg/L, and 135 mv, respectively, were determined on the basis of the BN models. These values will be helpful to develop accurate strategies of oxygenation to quickly eliminate black bloom in the lake. Full article
Show Figures

Figure 1

Figure 1
<p>The region of Chaohu Lake and the sampling sites.</p>
Full article ">Figure 2
<p>The flowchart of the procedure.</p>
Full article ">Figure 3
<p>The important factors for (<b>a</b>) Fe(II); (<b>b</b>) S(−II).</p>
Full article ">Figure 4
<p>Characteristics of the three groups of observations.</p>
Full article ">Figure 5
<p>The project data from the Gaussian Mixture Model (GMM).</p>
Full article ">Figure 6
<p>Bayesian Network (BN) model for the three groups. (<b>a</b>) Bad; (<b>b</b>) worse; (<b>c</b>) worst.</p>
Full article ">
19 pages, 19678 KiB  
Article
Optimizing Thermoplastic Starch Film with Heteroscedastic Gaussian Processes in Bayesian Experimental Design Framework
by Gracie M. White, Amanda P. Siegel and Andres Tovar
Materials 2024, 17(21), 5345; https://doi.org/10.3390/ma17215345 - 31 Oct 2024
Viewed by 607
Abstract
The development of thermoplastic starch (TPS) films is crucial for fabricating sustainable and compostable plastics with desirable mechanical properties. However, traditional design of experiments (DOE) methods used in TPS development are often inefficient. They require extensive time and resources while frequently failing to [...] Read more.
The development of thermoplastic starch (TPS) films is crucial for fabricating sustainable and compostable plastics with desirable mechanical properties. However, traditional design of experiments (DOE) methods used in TPS development are often inefficient. They require extensive time and resources while frequently failing to identify optimal material formulations. As an alternative, adaptive experimental design methods based on Bayesian optimization (BO) principles have been recently proposed to streamline material development by iteratively refining experiments based on prior results. However, most implementations are not suited to manage the heteroscedastic noise inherently present in physical experiments. This work introduces a heteroscedastic Gaussian process (HGP) model within the BO framework to account for varying levels of uncertainty in the data, improve the accuracy of the predictions, and increase the overall experimental efficiency. The aim is to find the optimal TPS film composition that maximizes its elongation at break and tensile strength. To demonstrate the effectiveness of this approach, TPS films were prepared by mixing potato starch, distilled water, glycerol as a plasticizer, and acetic acid as a catalyst. After gelation, the mixture was degassed via centrifugation and molded into films, which were dried at room temperature. Tensile tests were conducted according to ASTM D638 standards. After five iterations and 30 experiments, the films containing 4.5 wt% plasticizer and 2.0 wt% starch exhibited the highest elongation at break (M = 96.7%, SD = 5.6%), while the films with 0.5 wt% plasticizer and 7.0 wt% starch demonstrated the highest tensile strength (M = 2.77 MPa, SD = 1.54 MPa). These results demonstrate the potential of the HGP model within a BO framework to improve material development efficiency and performance in TPS film and other potential material formulations. Full article
Show Figures

Figure 1

Figure 1
<p>Gaussian process regressions of the noisy Forrester’s function. The red dots represent the random samples. The dotted line and gray-shaded area correspond to the 95% confidence interval. The black line and blue-shaded area correspond to the prediction based on the posterior distributions for the following: (<b>a</b>) The vanilla GP; (<b>b</b>) The HGP.</p>
Full article ">Figure 2
<p>BO adaptive experimental design algorithm implementing an HGP surrogate model and an exploration region.</p>
Full article ">Figure 3
<p>Bayesian optimization of the noisy Forrester’s function. Results summarize ten optimization algorithm runs. Each optimization algorithm was initialized with five random initial designs and ran for 30 iterations. The red dots represent the designs evaluated during all the optimization runs. (<b>a</b>) The black dotted line is the mean of the true function, and the gray shaded area is the 95% confidence interval. Most of the function evaluations were around the minimizer. (<b>b</b>) The algorithm usually finds the minimizer or a close design in less than five iterations. The black solid line represents the minimizer <math display="inline"><semantics> <mrow> <msup> <mi>x</mi> <mo>*</mo> </msup> <mo>≈</mo> <mn>0.7572</mn> </mrow> </semantics></math>. (<b>c</b>) Accordingly, the expected improvement also remains at a constant value after the fifth iteration.</p>
Full article ">Figure 4
<p>Three-hump camel function prior to optimization. Heteroscedastic noise and variance are to be added to the black box function to simulate physical experimental conditions. (<b>a</b>) Noiseless three-hump camel function. (<b>b</b>) Heteroscedastic noise variance of the three-hump camel function. (<b>c</b>) Noisy three-hump camel function to be optimized.</p>
Full article ">Figure 5
<p>Bayesian optimization of the noisy three-hump camel function. Results summarize ten optimization algorithm runs utilizing an exploration region for each model iteration. Each algorithm was initialized with nine random design points and ran for 30 iterations. The red dots represent the random initial designs. (<b>a</b>) The initial designs prior to noisy observations. Most of the initial function evaluations were around local minima, with only one near the minimizer. (<b>b</b>) With noisy observations in two dimensions, the algorithm usually finds the minimizer or a close design in less than ten iterations. The black solid line indicates the minimizer values, <math display="inline"><semantics> <mrow> <msubsup> <mi>x</mi> <mn>1</mn> <mo>*</mo> </msubsup> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msubsup> <mi>x</mi> <mn>2</mn> <mo>*</mo> </msubsup> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>. (<b>c</b>) The maximum expected improvement remains about constant after the tenth iteration.</p>
Full article ">Figure 6
<p>Centrifuging of TPS slurry effectively degases solution before air drying, leading to higher quality film. <b>Left</b>: 12 g of TPS slurry in a Petri dish without centrifuging. The solution is cloudy with many air bubbles. <b>Right</b>: 12 g of TPS slurry in a Petri dish after being centrifuged for two minutes at 2000 rpm. The solution is degassed and translucent.</p>
Full article ">Figure 7
<p>Results from HGP predictions from TPS DOEs for five experimental iterations. As in the numerical experiments, an initial design was evaluated, and an exploration region was initialized. BO guided the subsequent experiments until formulations yielding optimal mechanical properties were achieved. The red dots represent the design points evaluated in each iteration. HGP models were used to predict the mean and variance of EB and TS for varying compositions of plasticizer (<math display="inline"><semantics> <msub> <mi>x</mi> <mn>1</mn> </msub> </semantics></math>) and starch content (<math display="inline"><semantics> <msub> <mi>x</mi> <mn>2</mn> </msub> </semantics></math>). The far left column displays HGP predictions for EB, with the second column showing the predicted variance for EB. The next column shows the mean TS predictions, with the final column showing the predicted variance for TS.</p>
Full article ">Figure 8
<p>TPS film: Increased starch content with decreased plasticizer content to decreased starch content with increased plasticizer content. TPS film with increased and decreased starch content led to brittleness and warping. Similarly, decreased starch and increased plasticizer content also caused film warping and moisture. (<b>a</b>) The film specimen with the highest starch content and least plasticizer content. The film is warped and extremely brittle, with low mechanical properties. (<b>b</b>) The film specimen with increased plasticizer content. The film is less brittle and exhibits optimal TS. (<b>c</b>) The film specimen has roughly equal parts of plasticizer and starch content. Mechanical properties are suitable for both EB and TS. (<b>d</b>) The film specimen with slightly more plasticizer than starch. EB is increased, but subsequently, the TS begins to diminish. (<b>e</b>) Increased plasticizer leads to slight warping, films retain more moisture and exhibit optimal EB, and diminished TS. (<b>f</b>) Film specimen with the highest plasticizer concentration and the lowest starch concentration. Films are extremely deformed and moist. TS is diminished, and EB begins to decrease with worsening film quality.</p>
Full article ">Figure 9
<p>Best observed properties. The black dots represent the mean best-observed property per experimental observation. The vertical bar and blue-shaded region indicate the 95% confidence interval. (<b>a</b>) The optimal formulation for maximizing EB was found after four iterations, with increased plasticizer concentrations leading to greater EB variability. (<b>b</b>)The optimal formulation for TS was found after the first iteration, with relatively constant variability.</p>
Full article ">
23 pages, 11917 KiB  
Article
Probabilistic Prediction and Assessment of Train-Induced Vibrations Based on Mixture Density Model
by Ziyu Tao, Lingshan He, Desi Tu and Chao Zou
Buildings 2024, 14(11), 3468; https://doi.org/10.3390/buildings14113468 - 30 Oct 2024
Viewed by 285
Abstract
This study presents a probabilistic prediction method for train-induced vibrations by combining a deep neural network (DNN) with the mixture density model in a cascade fashion, referred to as the DNN-RMDN model in this paper. A benchmark example is conducted to demonstrate and [...] Read more.
This study presents a probabilistic prediction method for train-induced vibrations by combining a deep neural network (DNN) with the mixture density model in a cascade fashion, referred to as the DNN-RMDN model in this paper. A benchmark example is conducted to demonstrate and evaluate the prediction performance of the DNN-RMDN model. Subsequently, the model is applied to a case study to investigate and compare the uncertainties of train-induced vibrations in the throat area and testing line area of a metro depot. After training, the model is capable of accurately predicting the probability density function (PDF) of train-induced vibrations at different distances from the track and at different frequencies. Utilizing the predicted PDF, probabilistic assessments can be performed to ascertain the likelihood of surpassing predefined limits. By employing a mixture density model instead of a single Gaussian distribution, the DNN-RMDN model achieves more accurate prediction of the PDF for train-induced vibrations. The proposed probabilistic assessment framework can effectively assist in vibration screening during the planning phase and in selecting and designing vibration mitigation measures of appropriate levels. Full article
(This article belongs to the Special Issue Vibration Prediction and Noise Assessment of Building Structures)
Show Figures

Figure 1

Figure 1
<p>Structure of the DNN-RMDN model.</p>
Full article ">Figure 2
<p>Training results of DNN for predicting the deterministic component. (<b>a</b>) Predicted mean and training datasets. (<b>b</b>) Percentage error of the trained DNN.</p>
Full article ">Figure 3
<p>Training results of RMDN for predicting the random component.</p>
Full article ">Figure 4
<p>Testing results of the trained DNN-RMDN model. (<b>a</b>) Deterministic predictions. (<b>b</b>) Probabilistic predictions.</p>
Full article ">Figure 5
<p>Layout of rail lines and underground foundations in a metro depot with over-track buildings.</p>
Full article ">Figure 6
<p>Field measurement setups in the throat area.</p>
Full article ">Figure 7
<p>Measured vibration spectra of different train passages at various locations in the throat area.</p>
Full article ">Figure 8
<p>DNN model validation. (<b>a</b>) Training process; (<b>b</b>) testing results.</p>
Full article ">Figure 9
<p>Sensitivity analysis for number of hidden neurons and Gaussian kernels: (<b>a</b>) effects of numbers of neurons and Gaussian kernels on σ at 31.5 Hz; (<b>b</b>) effects of numbers of Gaussian kernels on σ at different frequencies; (<b>c</b>) training process.</p>
Full article ">Figure 10
<p>Predictions of conditional averaged vibrations using a trained DNN model: (<b>a</b>) 4 m; (<b>b</b>) 10 m; (<b>c</b>) 15 m; (<b>d</b>) 25 m; (<b>e</b>) 35 m; (<b>f</b>) relative error.</p>
Full article ">Figure 10 Cont.
<p>Predictions of conditional averaged vibrations using a trained DNN model: (<b>a</b>) 4 m; (<b>b</b>) 10 m; (<b>c</b>) 15 m; (<b>d</b>) 25 m; (<b>e</b>) 35 m; (<b>f</b>) relative error.</p>
Full article ">Figure 11
<p>Mixing coefficients and Gaussian kernels PDF with larger coefficient (31.5 Hz): (<b>a</b>) mixing coefficients; (<b>b</b>) kernels with large mixing coefficient.</p>
Full article ">Figure 12
<p>Comparisons of the PDF predicted with the RMDN model and the Gaussian distribution.</p>
Full article ">Figure 13
<p>PDFs predicted with RMDN model at different center frequencies.</p>
Full article ">Figure 14
<p>Performance test of the trained DNN-RMDN model: (<b>a</b>) 4 m; (<b>b</b>) 10 m; (<b>c</b>) 15 m; (<b>d</b>) 25 m; (<b>e</b>) 35 m.</p>
Full article ">Figure 15
<p>Field measurement setups in the testing line area.</p>
Full article ">Figure 16
<p>Measured vibration spectra of different train passages at various locations in the testing line area.</p>
Full article ">Figure 17
<p>DNN model validation: (<b>a</b>) training process; (<b>b</b>) testing results.</p>
Full article ">Figure 18
<p>Sensitivity analysis for number of hidden neurons and Gaussian kernels: (<b>a</b>) effects of numbers of neurons and Gaussian kernels on σ at 31.5 Hz; (<b>b</b>) effects of numbers of Gaussian kernels on σ at different frequencies; (<b>c</b>) training process.</p>
Full article ">Figure 19
<p>Predictions of conditional averaged vibrations using trained DNN model: (<b>a</b>) 4 m; (<b>b</b>) 7 m; (<b>c</b>) 15 m; (<b>d</b>) 20 m; (<b>e</b>) relative error.</p>
Full article ">Figure 19 Cont.
<p>Predictions of conditional averaged vibrations using trained DNN model: (<b>a</b>) 4 m; (<b>b</b>) 7 m; (<b>c</b>) 15 m; (<b>d</b>) 20 m; (<b>e</b>) relative error.</p>
Full article ">Figure 20
<p>Mixing coefficients and Gaussian kernels PDF with larger coefficient (31.5 Hz): (<b>a</b>) mixing coefficients; (<b>b</b>) kernels with large mixing coefficient.</p>
Full article ">Figure 21
<p>Comparisons of the PDF predicted with RMDN model and the Gaussian distribution.</p>
Full article ">Figure 22
<p>PDFs predicted with RMDN model at different center frequencies.</p>
Full article ">Figure 23
<p>Performance test of the trained DNN-RMDN model: (<b>a</b>) 4 m; (<b>b</b>) 7 m; (<b>c</b>) 15 m; (<b>d</b>) 20 m.</p>
Full article ">Figure 24
<p>Usage of predicted PDF for calculating exceeding probability: (<b>a</b>) 4 m, 31.5 Hz; (<b>b</b>) 4 m, 50 Hz.</p>
Full article ">Figure 25
<p>Probabilistic assessment of train-induced ground vibrations in the throat area.</p>
Full article ">
24 pages, 8204 KiB  
Article
A Comprehensive Method for Example-Based Color Transfer with Holistic–Local Balancing and Unit-Wise Riemannian Information Gradient Acceleration
by Zeyu Wang, Jialun Zhou, Song Wang and Ning Wang
Entropy 2024, 26(11), 918; https://doi.org/10.3390/e26110918 - 29 Oct 2024
Viewed by 346
Abstract
Color transfer, an essential technique in image editing, has recently received significant attention. However, achieving a balance between holistic color style transfer and local detail refinement remains a challenging task. This paper proposes an innovative color transfer method, named BHL, which stands for [...] Read more.
Color transfer, an essential technique in image editing, has recently received significant attention. However, achieving a balance between holistic color style transfer and local detail refinement remains a challenging task. This paper proposes an innovative color transfer method, named BHL, which stands for Balanced consideration of both Holistic transformation and Local refinement. The BHL method employs a statistical framework to address the challenge of achieving a balance between holistic color transfer and the preservation of fine details during the color transfer process. Holistic color transformation is achieved using optimal transport theory within the generalized Gaussian modeling framework. The local refinement module adjusts color and texture details on a per-pixel basis using a Gaussian Mixture Model (GMM). To address the high computational complexity inherent in complex statistical modeling, a parameter estimation method called the unit-wise Riemannian information gradient (uRIG) method is introduced. The uRIG method significantly reduces the computational burden through the second-order acceleration effect of the Fisher information metric. Comprehensive experiments demonstrate that the BHL method outperforms state-of-the-art techniques in both visual quality and objective evaluation criteria, even under stringent time constraints. Remarkably, the BHL method processes high-resolution images in an average of 4.874 s, achieving the fastest processing time compared to the baselines. The BHL method represents a significant advancement in the field of color transfer, offering a balanced approach that combines holistic transformation and local refinement while maintaining efficiency and high visual quality. Full article
(This article belongs to the Topic Color Image Processing: Models and Methods (CIP: MM))
Show Figures

Figure 1

Figure 1
<p>Overview of the BHL method.</p>
Full article ">Figure 2
<p>Source image: purple flower; Example image: tomato.</p>
Full article ">Figure 3
<p>Source image: blue flower; Example image: mountain.</p>
Full article ">Figure 4
<p>Source image: clusters; Example image: parrot.</p>
Full article ">Figure 5
<p>Source image: pink flower; Example image: sunflower.</p>
Full article ">Figure 6
<p>Source image: bouquet; Example image: seaside.</p>
Full article ">Figure 7
<p>Comparison of details with zoomed-in images.</p>
Full article ">Figure 8
<p>Comparison of uRIG with SGD, AIG, and Adam.</p>
Full article ">
18 pages, 6936 KiB  
Article
A Calculating Method for the Height of Multi-Type Buildings Based on 3D Point Cloud
by Yuehuan Wang, Shuwen Yang, Ruixiong Kou, Zhuang Shi and Yikun Li
Buildings 2024, 14(11), 3412; https://doi.org/10.3390/buildings14113412 - 27 Oct 2024
Viewed by 394
Abstract
Building height is a critical variable in urban studies, and the automated acquisition of the precise building height is essential for intelligent construction, safety, and the sustainable development of cities. The building height is often approximated by the building’s highest point. However, the [...] Read more.
Building height is a critical variable in urban studies, and the automated acquisition of the precise building height is essential for intelligent construction, safety, and the sustainable development of cities. The building height is often approximated by the building’s highest point. However, the calculation method of the building height of the various roof types differs according to building codes, making it challenging to accurately calculate the height of buildings with complex roof structures or multiple upper appendages. Consequently, this paper utilizes point clouds to propose an automated method for calculating building heights conforming to design codes. The model considers roof types and allows for fast, automated, and highly accurate building height estimation. First, roofs are extracted from the point cloud by combining normal vector density clustering with a region-growing algorithm. Second, combined with variational Bayes, a Gaussian mixture model is employed to segment the roof surfaces. Finally, roofs are classified based on slope characteristics, achieving the automatic acquisition of building heights for various roof types over large areas. Experiments were conducted on Vaihingen and STPLS3D datasets. In the Vaihingen area, the maximum error, root-mean-square-error (RMSE), and mean absolute error (MAE) of the measured heights are 1.92 cm, 1.18 cm, and 1.13 cm, respectively. In the STPLS3D area, these values are 1.79 cm, 0.82 cm, and 0.68 cm, respectively. The results demonstrate that the proposed method is reliable and effective, which offers valuable data for the development, construction, and planning of three-dimensional (3D) cities. Full article
(This article belongs to the Section Building Energy, Physics, Environment, and Systems)
Show Figures

Figure 1

Figure 1
<p>Flowchart of building heights calculation. (In Step 3 Ridge and Eave Lines, the red color indicates the ridge line and the blue color indicates the eave line).</p>
Full article ">Figure 2
<p>Experimental data. where (<b>a</b>) denotes the study area in the Vaihingen data and (<b>b</b>) denotes the study area in the STPLS3D dataset.</p>
Full article ">Figure 3
<p>Point clouds of different types of roofs.</p>
Full article ">Figure 4
<p>Flow of density clustering algorithm based on normal vector features.</p>
Full article ">Figure 5
<p>Variational Bayesian Gaussian mixture model flow.</p>
Full article ">Figure 6
<p>Slope and direction calculation.</p>
Full article ">Figure 7
<p>Schematic diagram of slope direction.</p>
Full article ">Figure 8
<p>Building roof types.</p>
Full article ">Figure 9
<p>Roof extraction results.</p>
Full article ">Figure 10
<p>Roof segmentation results.</p>
Full article ">Figure 11
<p>Representation of building heights calculation.</p>
Full article ">Figure 12
<p>Calculation error representation of building heights in the Vaihingen experimental area.</p>
Full article ">Figure 13
<p>Calculation error representation of building height in STPLS3D experimental area.</p>
Full article ">
14 pages, 526 KiB  
Article
Entropy-Based Volatility Analysis of Financial Log-Returns Using Gaussian Mixture Models
by Luca Scrucca
Entropy 2024, 26(11), 907; https://doi.org/10.3390/e26110907 - 25 Oct 2024
Viewed by 416
Abstract
Volatility in financial markets refers to the variation in asset prices over time. High volatility indicates increased risk, making its evaluation essential for effective risk management. Various methods are used to assess volatility, with the standard deviation of log-returns being a common approach. [...] Read more.
Volatility in financial markets refers to the variation in asset prices over time. High volatility indicates increased risk, making its evaluation essential for effective risk management. Various methods are used to assess volatility, with the standard deviation of log-returns being a common approach. However, this implicitly assumes that log-returns follow a Gaussian distribution, which is not always valid. In this paper, we explore the use of (differential) entropy to evaluate the volatility of financial log-returns. Estimation of entropy is obtained using a Gaussian mixture model to approximate the underlying density of log-returns. Following this modeling approach, popular risk measures such as Value at Risk and Expected Shortfall can also be computed. By integrating Gaussian mixture modeling and entropy into the analysis of log-returns, we aim to provide a more accurate and robust framework for assessing financial volatility and risk measures. Full article
(This article belongs to the Special Issue Shannon Entropy: Mathematical View)
Show Figures

Figure 1

Figure 1
<p>Entropy behavior for a mixed-Gaussian distribution derived from a single-Gaussian model and a two-component GMM as the component means <math display="inline"><semantics> <mi>μ</mi> </semantics></math> diverge while the variance is held constant. Entropy values in the standard deviation scale are computed using Equation (<a href="#FD7-entropy-26-00907" class="html-disp-formula">7</a>).</p>
Full article ">Figure 2
<p>(<b>left</b>) Distribution of the 2023 daily gold price log-returns’ BIC trace for the selection of the GMM; (<b>right</b>) histogram of empirical distribution of log-returns with Gaussian density (red line) and two-component GMM density (blue line).</p>
Full article ">Figure 3
<p>Distributions of S&amp;P 500 daily log-returns from 2016 to early October of 2024, with histograms and corresponding GMM density estimates on the right side. The bottom graph presents yearly entropy estimates obtained using the GMM-based approach, alongside those implied by a single Gaussian component.</p>
Full article ">Figure 4
<p>Distributions of FTSE daily log-returns from 2016 to early-October 2024, with histograms and corresponding GMM density estimates on the right side. The bottom graph presents yearly entropy estimates obtained using the GMM-based approach, alongside those implied by a single Gaussian component.</p>
Full article ">Figure 5
<p>Distributions of MIB daily log-returns from 2016 to early-October 2024, with histograms and corresponding GMM density estimates on the right side. The bottom graph presents yearly entropy estimates obtained using the GMM-based approach, alongside those implied by a single Gaussian component.</p>
Full article ">
26 pages, 2707 KiB  
Article
Machine Learning Clustering Techniques to Support Structural Monitoring of the Valgadena Bridge Viaduct (Italy)
by Andrea Masiero, Alberto Guarnieri, Valerio Baiocchi, Domenico Visintini and Francesco Pirotti
Remote Sens. 2024, 16(21), 3971; https://doi.org/10.3390/rs16213971 - 25 Oct 2024
Viewed by 556
Abstract
The lack of precise and comprehensive information about the health of bridges, and in particular long span ones, can lead to incorrect decisions regarding maintenance, repair, modernization, and reinforcement of the structure itself. While the consequences of inadequate interventions are quite apparent, incorrect [...] Read more.
The lack of precise and comprehensive information about the health of bridges, and in particular long span ones, can lead to incorrect decisions regarding maintenance, repair, modernization, and reinforcement of the structure itself. While the consequences of inadequate interventions are quite apparent, incorrect decisions can also result in unnecessary or misdirected actions. For example, an inadequate assessment of the structural health can lead to the modernization and replacement of some components that are still sound. Structural Health Monitoring (SHM) involves the use of time series derived from periodic measurements of the structure’s behavior, considered in its operational and load environment. The goal is to determine its response to various solicitations and, in particular, to highlight any critical issue in the structure’s behavior that may affect its reliability and safety due to anomalies and deterioration. This paper proposes an SHM method applied to the Valgadena bridge, one of the tallest viaducts in Italy and Europe (maximum height 160 m), located on the Altopiano dei Sette Comuni in the Province of Vicenza. Despite the fact that the viaduct itself had already been monitored during its construction using classical geometric leveling techniques, the methodology proposed here is based instead on the use of affordable dual-frequency GNSS (Global Navigation Satellite System) receivers to determine static and dynamic components of the bridge movements. Specifically, an effective combination of time series analysis methods and machine learning techniques is proposed in order to determine the vibration modes of the monitored viaduct. Monitoring is performed in regular operation conditions of the bridge (operational modal analysis (OMA)), and the use of certain machine learning methods aims at supporting the development of an effective automatic OMA procedure. To be more specific, the random decrements technique is used in order to make the vibration characteristics of the collected signals more apparent. Time-domain-based subspace identification is applied in order to determine a proper model of the collected measurements. Then, clustering methods, namely DBSCAN (Density-Based Spatial Clustering of Applications with Noise) and GMMs (Gaussian Mixture Models), are used in order to reliably estimate the system poles, and hence the corresponding vibration characteristics. The performance of the considered methods is compared on the Valgadena bridge case study, showing that the use of GMM clustering reduces, with respect to DBSCAN, the impact of the choice of certain parameter values in the considered case. Full article
Show Figures

Figure 1

Figure 1
<p>(<b>a</b>) Location of the Valgadena bridge viaduct (WGS84 coordinates). (<b>b</b>) Orthophoto of the bridge: red, blue, and green disks identify locations of GNSS station 1 and 2, and of the base station.</p>
Full article ">Figure 2
<p>Scheme of the leveling network.</p>
Full article ">Figure 3
<p>Proposed workflow.</p>
Full article ">Figure 4
<p>Details on the procedure to determine the system modes from random decrement signatures.</p>
Full article ">Figure 5
<p>Up coordinate of the projected GNSS measurements of St2 on a 200 s interval: (<b>a</b>) displacements along the up direction with respect to its average value in the collected dataset (dotted blue) and its semi-static component (solid black); (<b>b</b>) dynamic component of the up displacements.</p>
Full article ">Figure 6
<p>Normalized random decrements of the up coordinate of the projected GNSS measurements of St2 on a 4000 s (<b>a</b>), and on a 200 s interval, including random decrements along the bridge’s longitudinal and transverse directions as well (<b>b</b>).</p>
Full article ">Figure 7
<p>(<b>a</b>) Frequency, damping, and model order of all poles after HVC, obtained using data from both St1 and St2. (<b>b</b>) Colored x-marks show the clusters computed by DBSCAN once applied on the pole coordinate domain (case 1A), where each color identifies a different cluster.</p>
Full article ">Figure 8
<p>Estimated number of clusters in case 1A, varying the value of <math display="inline"><semantics> <mrow> <mi>m</mi> <mi>i</mi> <mi>n</mi> <mi>P</mi> <mi>t</mi> <mi>s</mi> </mrow> </semantics></math> (<b>a</b>) and <math display="inline"><semantics> <mi>ϵ</mi> </semantics></math> (<b>b</b>).</p>
Full article ">Figure 9
<p>Variability in <math display="inline"><semantics> <msub> <mi>σ</mi> <mi>f</mi> </msub> </semantics></math>, in (<b>a</b>), and <math display="inline"><semantics> <msub> <mi>σ</mi> <mi>ξ</mi> </msub> </semantics></math>, in (<b>b</b>), with respect to <math display="inline"><semantics> <mi>ϵ</mi> </semantics></math> in case 1A.</p>
Full article ">Figure 10
<p>Pole frequencies and damping ratios of the poles in <math display="inline"><semantics> <mi mathvariant="script">L</mi> </semantics></math> are shown as black x-marks. Colored x-marks show the clusters computed by DBSCAN once applied on the normalized and centered pole frequencies and damping ratios, where each color identifies a different cluster.</p>
Full article ">Figure 11
<p>Estimated number of clusters in case 1B, varying the value of <math display="inline"><semantics> <mrow> <mi>m</mi> <mi>i</mi> <mi>n</mi> <mi>P</mi> <mi>t</mi> <mi>s</mi> </mrow> </semantics></math> (<b>a</b>) and <math display="inline"><semantics> <mi>ϵ</mi> </semantics></math> (<b>b</b>).</p>
Full article ">Figure 12
<p>Variability in <math display="inline"><semantics> <msub> <mi>σ</mi> <mi>f</mi> </msub> </semantics></math>, in (<b>a</b>), and <math display="inline"><semantics> <msub> <mi>σ</mi> <mi>ξ</mi> </msub> </semantics></math>, in (<b>b</b>), with respect to <math display="inline"><semantics> <mi>ϵ</mi> </semantics></math> in case 1B.</p>
Full article ">Figure 13
<p>Pole frequencies and damping ratios of the poles in <math display="inline"><semantics> <mi mathvariant="script">L</mi> </semantics></math> are shown as black x-marks. Colored x-marks show the clusters computed by GMM once applied on the pole coordinates (case 2A), where each color identifies a different cluster.</p>
Full article ">Figure 14
<p>Pole frequencies and damping ratios of the poles in <math display="inline"><semantics> <mi mathvariant="script">L</mi> </semantics></math> are shown as black x-marks. Colored x-marks show the clusters computed by GMM once applied on the pole frequencies and damping ratios (case 2B), where each color identifies a different cluster.</p>
Full article ">Figure 15
<p>Variability in <math display="inline"><semantics> <msub> <mi>σ</mi> <mi>f</mi> </msub> </semantics></math>, in (<b>a</b>), and <math display="inline"><semantics> <msub> <mi>σ</mi> <mi>ξ</mi> </msub> </semantics></math>, in (<b>b</b>), with respect to <math display="inline"><semantics> <msub> <mi>n</mi> <mi>G</mi> </msub> </semantics></math> in case 2A.</p>
Full article ">Figure 16
<p>Variability in <math display="inline"><semantics> <msub> <mi>σ</mi> <mi>f</mi> </msub> </semantics></math>, in (<b>a</b>), and <math display="inline"><semantics> <msub> <mi>σ</mi> <mi>ξ</mi> </msub> </semantics></math>, in (<b>b</b>), with respect to <math display="inline"><semantics> <msub> <mi>n</mi> <mi>G</mi> </msub> </semantics></math> in case 2B.</p>
Full article ">
16 pages, 5373 KiB  
Communication
Joint Beamforming Design and User Clustering Algorithm in NOMA-Assisted ISAC Systems
by Qingqing Yang, Runpeng Tang and Yi Peng
Sensors 2024, 24(20), 6633; https://doi.org/10.3390/s24206633 - 15 Oct 2024
Viewed by 447
Abstract
To enhance the performance of non-orthogonal multiple access (NOMA)-assisted integrated sensing and communication (ISAC) systems in multi-user distributed scenarios, an improved Gaussian Mixture Model (GMM)-based user clustering algorithm is proposed. This algorithm is tailored for ISAC systems, significantly improving bandwidth reuse gains and [...] Read more.
To enhance the performance of non-orthogonal multiple access (NOMA)-assisted integrated sensing and communication (ISAC) systems in multi-user distributed scenarios, an improved Gaussian Mixture Model (GMM)-based user clustering algorithm is proposed. This algorithm is tailored for ISAC systems, significantly improving bandwidth reuse gains and reducing serial interference. First, using the Sum of Squared Errors (SSE), the algorithm reduces sensitivity to the initial cluster center locations, improving clustering accuracy. Then, direction weight factors are introduced based on the base station position and a penalty function involving users’ Euclidean distances and sensing power. Modifications to the EM algorithm in calculating posterior probabilities and updating the covariance matrix help align user clusters with the characteristics of NOMAISAC systems. This improves users’ interference resistance, lowers decoding difficulty, and optimizes the system’s sensing capabilities. Finally, a fractional programming (FP) approach addresses the non-convex joint beamforming design problem, enhancing power and channel gains and achieving co-optimizing sensing and communication signals. The simulation results show that, under the improved GMM user clustering algorithm and FP optimization, the NOMA-ISAC system improves user spectral efficiency by 4.3% and base station beam intensity by 5.4% compared to traditional ISAC systems. Full article
(This article belongs to the Section Communications)
Show Figures

Figure 1

Figure 1
<p>Integrated sensing and communication system model.</p>
Full article ">Figure 2
<p>Flowchart of GMM algorithm.</p>
Full article ">Figure 3
<p>Clustering results of the K-means algorithm.</p>
Full article ">Figure 4
<p>Clustering results of the traditional GMM algorithm.</p>
Full article ">Figure 5
<p>Clustering results of the improved GMM algorithm.</p>
Full article ">Figure 6
<p>Convergence curves of objective values under different <math display="inline"><semantics> <mi>ρ</mi> </semantics></math> values.</p>
Full article ">Figure 7
<p>Spectral efficiency vs. transmission power for different clustering algorithms.</p>
Full article ">Figure 8
<p>Performance trade-off comparison under different mechanisms.</p>
Full article ">Figure 9
<p>Beam strength curves in different coordinate systems.</p>
Full article ">
21 pages, 408 KiB  
Article
A Robust Trajectory Multi-Bernoulli Filter for Superpositional Sensors
by Huaguo Zhang, Wenting Luo, Xu Zhou, Hao Mu, Lin Gao and Xiaodong Wang
Electronics 2024, 13(20), 4001; https://doi.org/10.3390/electronics13204001 - 11 Oct 2024
Viewed by 440
Abstract
This paper proposes a trajectory multi-Bernoulli filter applied to the superpositional sensor model for multi-target tracking in the presence of unknown measurement noise. This filter can provide a Multi-Bernoulli approximation of the posterior density on a set of alive trajectories at the current [...] Read more.
This paper proposes a trajectory multi-Bernoulli filter applied to the superpositional sensor model for multi-target tracking in the presence of unknown measurement noise. This filter can provide a Multi-Bernoulli approximation of the posterior density on a set of alive trajectories at the current time step. We also provide a Gaussian mixture (GM) implementation of this filter, employing a mixture of Gaussian and inverse Wishart distributions to represent the combined state of measurement noise and target information. Subsequently, the variational Bayesian (VB) method is employed to approximate the posterior distribution, ensuring its form remains consistent with the prior distribution. This method is capable of directly generating trajectory estimates and can jointly estimate both multi-object tracking and measurement noise covariance. The performance of this algorithm is verified through simulation. Finally, a computationally more efficient L-scan approximation is provided. The simulation results indicate that the filter can achieve robust tracking performance, adapting to unknown measurement noise. Full article
Show Figures

Figure 1

Figure 1
<p>The values of the measurement noise covariance parameters.</p>
Full article ">Figure 2
<p>The actual trajectories of multiple radiation sources and the estimated trajectories using the robust VB-TMB algorithm.</p>
Full article ">Figure 3
<p>GOSPA error of VB-TMB algorithm and GM-TMB algorithm under different parameters.</p>
Full article ">Figure 4
<p>The GOSPA distances for the VB-TMB algorithm under different L-scan lengths.</p>
Full article ">Figure 5
<p>Covariance estimation of the VB-TMB algorithm under low noise time-varying rates.</p>
Full article ">Figure 6
<p>Covariance estimation of the VB-TMB algorithm under high noise time-varying rates.</p>
Full article ">Figure 7
<p>GOSPA error of VB-HMB-CPHD algorithm, VB-TPHD algorithm, and VB-TMB algorithm.</p>
Full article ">Figure 8
<p>Covariance estimation errors of VB-HMB-CPHD algorithm, VB-TPHD algorithm, and VB-TMB algorithm.</p>
Full article ">
14 pages, 13034 KiB  
Article
Learning Underwater Intervention Skills Based on Dynamic Movement Primitives
by Xuejiao Yang, Yunxiu Zhang, Rongrong Li, Xinhui Zheng and Qifeng Zhang
Electronics 2024, 13(19), 3860; https://doi.org/10.3390/electronics13193860 - 29 Sep 2024
Viewed by 450
Abstract
Improving the autonomy of underwater interventions by remotely operated vehicles (ROVs) can help mitigate the impact of communication delays on operational efficiency. Currently, underwater interventions for ROVs usually rely on real-time teleoperation or preprogramming by operators, which is not only time-consuming and increases [...] Read more.
Improving the autonomy of underwater interventions by remotely operated vehicles (ROVs) can help mitigate the impact of communication delays on operational efficiency. Currently, underwater interventions for ROVs usually rely on real-time teleoperation or preprogramming by operators, which is not only time-consuming and increases the cognitive burden on operators but also requires extensive specialized programming. Instead, this paper uses the intuitive learning from demonstrations (LfD) approach that uses operator demonstrations as inputs and models the trajectory characteristics of the task through the dynamic movement primitive (DMP) approach for task reproduction as well as the generalization of knowledge to new environments. Unlike existing applications of DMP-based robot trajectory learning methods, we propose the underwater DMP (UDMP) method to address the problem that the complexity and stochasticity of underwater operational environments (e.g., current perturbations and floating operations) diminish the representativeness of the demonstrated trajectories. First, the Gaussian mixture model (GMM) and Gaussian mixture regression (GMR) are used for feature extraction of multiple demonstration trajectories to obtain typical trajectories as inputs to the DMP method. The UDMP method is more suitable for the LfD of underwater interventions than the method that directly learns the nonlinear terms of the DMP. In addition, we improve the commonly used homomorphic-based teleoperation mode to heteromorphic mode, which allows the operator to focus more on the end-operation task. Finally, the effectiveness of the developed method is verified by simulation experiments. Full article
Show Figures

Figure 1

Figure 1
<p>Components of an underwater teleoperation system.</p>
Full article ">Figure 2
<p>Overview of the learning framework.</p>
Full article ">Figure 3
<p>The composition of the experimental system.</p>
Full article ">Figure 4
<p>The position of the demonstration trajectories.</p>
Full article ">Figure 5
<p>The orientation of the demonstration trajectories.</p>
Full article ">Figure 6
<p>GMM–GMR preprocessed demonstration trajectories used to obtain the <span class="html-italic">t</span>-<math display="inline"><semantics> <mrow> <mi>a</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math> of the position.</p>
Full article ">Figure 7
<p>GMM–GMR preprocessed demonstration trajectories used to obtain the <span class="html-italic">t</span>-<math display="inline"><semantics> <mrow> <mi>a</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math> of the orientation.</p>
Full article ">Figure 8
<p>Nonlinear term <span class="html-italic">s</span>-<math display="inline"><semantics> <mrow> <mi>f</mi> <mo>(</mo> <mi>s</mi> <mo>)</mo> </mrow> </semantics></math> in DMP modeling [<a href="#B12-electronics-13-03860" class="html-bibr">12</a>] of demonstration trajectories (position).</p>
Full article ">Figure 9
<p>Nonlinear term <span class="html-italic">s</span>-<math display="inline"><semantics> <mrow> <mi>f</mi> <mo>(</mo> <mi>s</mi> <mo>)</mo> </mrow> </semantics></math> in DMP modeling [<a href="#B12-electronics-13-03860" class="html-bibr">12</a>] of demonstration trajectories (orientation).</p>
Full article ">Figure 10
<p>Position trajectories and errors reproduced by DMP and UDMP methods.</p>
Full article ">Figure 11
<p>Orientation trajectories and errors reproduced by DMP and UDMP methods (expressed as RPY).</p>
Full article ">Figure 12
<p>DMP and UDMP methods for generalizing new target position.</p>
Full article ">
20 pages, 4404 KiB  
Article
Robust and Accurate Recognition of Carriage Linear Array Images for Train Fault Detection
by Zhenzhou Fu and Xiao Pan
Appl. Sci. 2024, 14(18), 8525; https://doi.org/10.3390/app14188525 - 22 Sep 2024
Viewed by 447
Abstract
Train fault detection often relies on comparing collected images with reference images, making accurate image type recognition crucial. Current systems use Automatic Equipment Identification (AEI) devices to recognize carriage numbers while capturing images, but damaged Radio Frequency (RF) tags or blurred characters can [...] Read more.
Train fault detection often relies on comparing collected images with reference images, making accurate image type recognition crucial. Current systems use Automatic Equipment Identification (AEI) devices to recognize carriage numbers while capturing images, but damaged Radio Frequency (RF) tags or blurred characters can hinder this process. Carriage linear array images, with their high resolution, extreme aspect ratios, and local nonlinear distortions, present challenges for recognition algorithms. This paper proposes a method tailored for recognizing such images. We apply an object detection algorithm to locate key components, simplifying image recognition into a sparse point set alignment task. To handle local distortions, we introduce a weighted radial basis function (RBF) and maximize the similarity between Gaussian mixtures of point sets to determine RBF weights. Experiments show 100% recognition accuracy under nonlinear distortions up to 15%. The algorithm also performs robustly with detection errors and identifies categories from 79 image classes in 24 ms on an i7 CPU without GPU support. This method significantly reduces system costs and advances automatic exterior fault detection for trains. Full article
(This article belongs to the Special Issue Current Advances in Railway and Transportation Technology)
Show Figures

Figure 1

Figure 1
<p>Train fault detection system. (<b>a</b>) Train line-scan image acquisition system; (<b>b</b>) the reference image library contains standard images of all carriage types without scale distortion, each annotated with key component information for subsequent fault analysis; (<b>c</b>) acquired line-scan images may have nonlinear scale distortions in the horizontal direction; (<b>d</b>) correspondence between horizontal pixel coordinates in (<b>c</b>) and standard reference image coordinates; (<b>e</b>) main processing steps in train fault detection.</p>
Full article ">Figure 2
<p>Carriage identification equipment. (<b>a</b>) Carriage identification equipment based on microwave communication; (<b>b</b>) carriage identification equipment based on visual character recognition.</p>
Full article ">Figure 3
<p>Line-scan images of different types of carriages and their corresponding key component detection results.</p>
Full article ">Figure 4
<p>Framework of the image recognition algorithm. (<b>a</b>) Shows four different types of images corresponding to the same carriage model. (<b>b</b>) Illustrates the transformation from the image to a point set. (<b>c</b>) Depicts the process of retrieving the matching image category from the template image library.</p>
Full article ">Figure 5
<p>Comparison of point sets and their GMM probability densities before and after RBF transformation with optimized weights. (<b>a</b>,<b>d</b>) show the intra-category transformation within 1-LRAB. (<b>b</b>,<b>e</b>) highlight the transformation from 1-LRBA to 1-LRAB. (<b>c</b>,<b>f</b>) present the transformation from 1-RLAB to 1-LRAB.</p>
Full article ">Figure 6
<p>Recognition accuracy under different distortion scales.</p>
Full article ">Figure 7
<p>Recognition accuracy under different false detection rates.</p>
Full article ">Figure 8
<p>Recognition accuracy under different missed detection rates.</p>
Full article ">
19 pages, 644 KiB  
Article
SMS Scam Detection Application Based on Optical Character Recognition for Image Data Using Unsupervised and Deep Semi-Supervised Learning
by Anjali Shinde, Essa Q. Shahra, Shadi Basurra, Faisal Saeed, Abdulrahman A. AlSewari and Waheb A. Jabbar
Sensors 2024, 24(18), 6084; https://doi.org/10.3390/s24186084 - 20 Sep 2024
Viewed by 1054
Abstract
The growing problem of unsolicited text messages (smishing) and data irregularities necessitates stronger spam detection solutions. This paper explores the development of a sophisticated model designed to identify smishing messages by understanding the complex relationships among words, images, and context-specific factors, areas that [...] Read more.
The growing problem of unsolicited text messages (smishing) and data irregularities necessitates stronger spam detection solutions. This paper explores the development of a sophisticated model designed to identify smishing messages by understanding the complex relationships among words, images, and context-specific factors, areas that remain underexplored in existing research. To address this, we merge a UCI spam dataset of regular text messages with real-world spam data, leveraging OCR technology for comprehensive analysis. The study employs a combination of traditional machine learning models, including K-means, Non-Negative Matrix Factorization, and Gaussian Mixture Models, along with feature extraction techniques such as TF-IDF and PCA. Additionally, deep learning models like RNN-Flatten, LSTM, and Bi-LSTM are utilized. The selection of these models is driven by their complementary strengths in capturing both the linear and non-linear relationships inherent in smishing messages. Machine learning models are chosen for their efficiency in handling structured text data, while deep learning models are selected for their superior ability to capture sequential dependencies and contextual nuances. The performance of these models is rigorously evaluated using metrics like accuracy, precision, recall, and F1 score, enabling a comparative analysis between the machine learning and deep learning approaches. Notably, the K-means feature extraction with vectorizer achieved 91.01% accuracy, and the KNN-Flatten model reached 94.13% accuracy, emerging as the top performer. The rationale behind highlighting these models is their potential to significantly improve smishing detection rates. For instance, the high accuracy of the KNN-Flatten model suggests its applicability in real-time spam detection systems, but its computational complexity might limit scalability in large-scale deployments. Similarly, while K-means with vectorizer excels in accuracy, it may struggle with the dynamic and evolving nature of smishing attacks, necessitating continual retraining. Full article
Show Figures

Figure 1

Figure 1
<p>A Hierarchical framework for feature generation in the context of the proposed SMS fraud detection system.</p>
Full article ">Figure 2
<p>Illustrative example of a simulated SMS containing an email address, hyperlink, and contact number.</p>
Full article ">Figure 3
<p>Classification framework for unsupervised methodological approaches.</p>
Full article ">Figure 4
<p>Performance metrics for unsupervised model accuracy.</p>
Full article ">Figure 5
<p>Hierarchical classification of deep semi-supervised methodological approaches.</p>
Full article ">Figure 6
<p>Performance evaluation of accuracy metrics for semi-Supervised models.</p>
Full article ">Figure 7
<p>Accuracy score of unsupervised and deep semi-supervised models.</p>
Full article ">Figure 8
<p>Real-Time detection and classification of SMS messages.</p>
Full article ">Figure 9
<p>Selection of input files (image SMS).</p>
Full article ">Figure 10
<p>Choice of preferred model for classification.</p>
Full article ">Figure 11
<p>Results from both selected models.</p>
Full article ">
26 pages, 3418 KiB  
Article
Enhanced YOLOv8-Based System for Automatic Number Plate Recognition
by Tamim Mahmud Al-Hasan, Victor Bonnefille and Faycal Bensaali
Technologies 2024, 12(9), 164; https://doi.org/10.3390/technologies12090164 - 13 Sep 2024
Viewed by 1556
Abstract
This paper presents an advanced automatic number plate recognition (ANPR) system designed specifically for Qatar’s diverse license plate landscape and challenging environmental conditions. Leveraging the YOLOv8 deep learning model, particularly the YOLOv8s variant, we achieve state-of-the-art accuracy in both license plate detection and [...] Read more.
This paper presents an advanced automatic number plate recognition (ANPR) system designed specifically for Qatar’s diverse license plate landscape and challenging environmental conditions. Leveraging the YOLOv8 deep learning model, particularly the YOLOv8s variant, we achieve state-of-the-art accuracy in both license plate detection and number recognition. Our innovative approach includes a comprehensive dataset enhancement technique that simulates adverse conditions, significantly improving the model’s robustness in real-world scenarios. We integrate edge computing using a Raspberry Pi with server-side processing, demonstrating an efficient solution for real-time ANPR applications. The system maintains greater than 93% overall performance across various environmental conditions, including night-time and rainy scenarios. We also explore the impact of various pre-processing techniques, including edge detection, k-mean thresholding, DBSCAN, and Gaussian mixture models, on the ANPR system’s performance. Our findings indicate that modern deep learning models like YOLOv8 are sufficiently robust to handle raw input images and do not significantly benefit from additional pre-processing. With its high accuracy and real-time processing capability, the proposed system represents a significant advancement in ANPR technology and is particularly suited for Qatar’s unique traffic management needs and smart city initiatives. Full article
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Overview of the proposed ANPR-based solution’s block diagram [<a href="#B1-technologies-12-00164" class="html-bibr">1</a>].</p>
Full article ">Figure 2
<p>Various categories of Qatari LPs showing (<b>a</b>) Commercial (<b>b</b>) Heavy equipment (<b>c</b>) Export (<b>d</b>) Governmental service (<b>e</b>) Internal Security Force (“Lekhwiya” in Arabic) (<b>f</b>) Limousine (<b>g</b>) Police (<b>h</b>) Perosnal or commercial truck/pick-up (<b>i</b>) Private/generic (<b>j</b>) Public transport (<b>k</b>) Taxi (<b>l</b>) Temporary Transit (<b>m</b>) Heavy and long trailers (<b>n</b>) Under experiment (<b>o</b>) United Nations and (<b>p</b>) Diplomat vehicles.</p>
Full article ">Figure 3
<p>Simplified architecture of YOLOv8 neural network (revised and adapted from [<a href="#B50-technologies-12-00164" class="html-bibr">50</a>]).</p>
Full article ">Figure 4
<p>Flowchart of the ANPR script process.</p>
Full article ">Figure 5
<p>Block diagram with visualization overview of the system’s operation and workflow [<a href="#B1-technologies-12-00164" class="html-bibr">1</a>].</p>
Full article ">Figure 6
<p>Overall process flowchart for this work.</p>
Full article ">Figure 7
<p>Training metrics for a YOLOv8 model.</p>
Full article ">Figure 8
<p>F1 curve for a YOLOv8 model.</p>
Full article ">Figure 9
<p>Precision curve for a YOLOv8 model.</p>
Full article ">Figure 10
<p>Precision–recall curve for a YOLOv8 model.</p>
Full article ">Figure 11
<p>Recall curve for a YOLOv8 model.</p>
Full article ">Figure 12
<p>Confusion matrix of classes for a YOLOv8 model.</p>
Full article ">Figure 13
<p>Performance comparison of YOLOv8 variants for LP detection.</p>
Full article ">Figure 14
<p>Performance comparison of YOLOv8 variants for number recognition.</p>
Full article ">Figure 15
<p>Selected simulated functions applied to LPs for the enhanced dataset.</p>
Full article ">Figure 16
<p>Effect of GMM pre-processing on LP recognition.</p>
Full article ">
13 pages, 3260 KiB  
Article
Diagnosis of Mechanical Rotor Faults in Drones Using Functional Gaussian Mixture Classifier
by Bartosz Bartoszewski, Kacper Jarzyna and Jerzy Baranowski
Aerospace 2024, 11(9), 743; https://doi.org/10.3390/aerospace11090743 - 11 Sep 2024
Viewed by 553
Abstract
The article presents the topic of propeller damage detection on unmanned multirotor drones. Propeller damage is dangerous as it can negatively affect the flight of a drone or lead to hazardous situations. The article proposes a non-invasive method for detecting damage within the [...] Read more.
The article presents the topic of propeller damage detection on unmanned multirotor drones. Propeller damage is dangerous as it can negatively affect the flight of a drone or lead to hazardous situations. The article proposes a non-invasive method for detecting damage within the drone’s hardware, which utilizes existing sensors in the Internal Measuring Unit (IMU) to classify propeller damage. The classification is performed by using the Bayesian Gaussian Mixture Model (BGMM). In the field of drone propeller damage detection, there is a significant issue of data scarcity due to traditional methods often involving invasive and destructive testing, which can lead to the loss of valuable equipment and high costs. Bayesian methods, such as BGMM, are particularly well-suited to address this issue by effectively handling limited data through incorporating prior knowledge and probabilistic reasoning. Moreover, using the IMU for damage detection is highly advantageous as it eliminates the need for additional sensors, reducing overall costs and preventing added weight that could compromise the drone’s performance. IMUs do not require specific environmental conditions to function properly, making them more versatile and practical for real-world applications. Full article
(This article belongs to the Section Aeronautics)
Show Figures

Figure 1

Figure 1
<p>Complex drone.</p>
Full article ">Figure 2
<p>Defined Flight Path for an Octocopter.</p>
Full article ">Figure 3
<p>Cutting the propeller, from the top: intact and healthy propeller, propeller with 15 mm cavity, propeller with 35 mm cavity.</p>
Full article ">Figure 4
<p>Comparison of data collected from gyroscope. Each signal was trimmed of roughly 2 s on both ends to ensure start-off and landing are not included in analysis. Due to technical issues, the mission with a 15 mm cavity was a bit shorter than the others. We can clearly see that damaged propellers are influenced by much bigger noise.</p>
Full article ">Figure 5
<p>Bayesian network representing mixture model that can be used for classification of faulty signals. Each mixture component <span class="html-italic">m</span> is pre-informed with labeled data <math display="inline"><semantics> <msup> <mi>Y</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msup> </semantics></math>, which consists of a total of <math display="inline"><semantics> <mrow> <mi>I</mi> <mi>L</mi> </mrow> </semantics></math> responses.</p>
Full article ">Figure 6
<p>Figure represents chosen basis for binary classifier, after the best experimental results were achieved for 15 evenly spaced splines. For three-class classifier, the basis was extended to 20 evenly spaced splines.</p>
Full article ">Figure 7
<p>Posterior predictive distribution of each class of modeled signal from accelerometer samples generated with sliding windows using spline representation. To represent uncertainties of our measurements, each point of the spectrum had uncertainty represented as a normal distribution. In the figure, there are ribbon plots for each quantile with a median in the middle. As a comparison, an example of real signal as a black plot is provided.</p>
Full article ">Figure 8
<p>In the figure, we can see an example of classification. Each plot shows the probability distribution of each sample belonging to its respective class. The blue dot represents the mean values, when the blue bar presents 95% confidence interval, the mean value equal or above 0.5 is considered as a success. The model has high confidence in its predictions with two wrong classifications in the healthy class and a perfect result in the damaged class.</p>
Full article ">Figure 9
<p>In the figure, we can see an example of correct classification using three-class classifier presented on a ternary plot with an enlarged top part. Each corner represents the probability of belonging to different class. All the samples are concentrated in the correct corner, showing high confidence.</p>
Full article ">Figure 10
<p>In the figure, we can see an example of incorrect classification using three-class classifier presented on ternary plot. Each corner represents the probability of belonging to a different class. All the samples are scattered between the 15 mm and 35 mm damage class. The model predicted the 15 mm cavity, which can be seen with a higher concentration in the respective corner, while the correct class was the 35 mm cavity.</p>
Full article ">
Back to TopTop