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
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
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
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
remove_circle_outline

Search Results (3,390)

Search Parameters:
Keywords = false positives

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
14 pages, 4142 KiB  
Article
Comparative Analysis of Prior and Posterior Integrity Monitoring Techniques for Enhanced Global Navigation Satellite System Positioning Continuity and Accuracy
by Yuting Gao, Baoyu Liu, Yang Gao, Guanwen Huang and Qin Zhang
Remote Sens. 2025, 17(4), 723; https://doi.org/10.3390/rs17040723 - 19 Feb 2025
Abstract
GNSS integrity is an essential component for ensuring the reliability of safety-critical applications using Global Navigation Satellite Systems (GNSSs). These applications, such as use in aviation and autonomous vehicles, demand high precision and dependability. There are two major GNSS integrity monitoring techniques, namely [...] Read more.
GNSS integrity is an essential component for ensuring the reliability of safety-critical applications using Global Navigation Satellite Systems (GNSSs). These applications, such as use in aviation and autonomous vehicles, demand high precision and dependability. There are two major GNSS integrity monitoring techniques, namely prior and posterior integrity monitoring. The principles of the two approaches, however, differ significantly, each influencing the GNSS positioning system’s continuity and accuracy performance in unique ways. In this study, we conduct a thorough evaluation and comparison of these two approaches to integrity monitoring, focusing on their effects on continuity and accuracy performance. We assess the probability of false alarms and continuity risks associated with posterior integrity monitoring by defining specific geometric spheres, both inside and outside the contours of the parity set, where the integrity risk requirement is satisfied. By using these defined spheres, we determine the lower and upper bounds for the probability of false alarms and continuity risks in posterior integrity monitoring. These spheres provide a novel and effective framework for comparing the continuity performance between the Chi-squared residual-based prior and posterior integrity monitoring. Our analysis highlights that, under fault-free scenarios, posterior integrity monitoring offers superior accuracy compared with the Chi-squared residual-based prior integrity monitoring approach. This finding underscores the critical importance of selecting an appropriate integrity monitoring strategy to enhance GNSS positioning system performance, particularly in environments where safety and precision are paramount. The insights gained from this study contribute to the advancement of GNSS technologies, supporting their implementation in an increasingly wide range of safety-critical applications. Full article
Show Figures

Figure 1

Figure 1
<p>An example of the two-dimensional contours of <math display="inline"><semantics> <mrow> <mi mathvariant="sans-serif">Θ</mi> </mrow> </semantics></math> (red), <math display="inline"><semantics> <mrow> <msup> <mrow> <mi mathvariant="bold">p</mi> </mrow> <mrow> <mi mathvariant="normal">T</mi> </mrow> </msup> <mi mathvariant="bold">p</mi> <mo>=</mo> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">p</mi> <mo>,</mo> <mi mathvariant="normal">i</mi> <mi mathvariant="normal">n</mi> </mrow> </msub> </mrow> </semantics></math> (blue), <math display="inline"><semantics> <mrow> <msup> <mrow> <mi mathvariant="bold">p</mi> </mrow> <mrow> <mi mathvariant="normal">T</mi> </mrow> </msup> <mi mathvariant="bold">p</mi> <mo>=</mo> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">p</mi> <mo>,</mo> <mi mathvariant="normal">o</mi> <mi mathvariant="normal">u</mi> <mi mathvariant="normal">t</mi> </mrow> </msub> </mrow> </semantics></math> (green), and <math display="inline"><semantics> <mrow> <msup> <mrow> <mi mathvariant="bold">p</mi> </mrow> <mrow> <mi mathvariant="normal">T</mi> </mrow> </msup> <mi mathvariant="bold">p</mi> <mo>=</mo> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">t</mi> <mi mathvariant="normal">h</mi> </mrow> </msub> </mrow> </semantics></math> (yellow). (<b>a</b>) <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">p</mi> <mo>,</mo> <mi mathvariant="normal">i</mi> <mi mathvariant="normal">n</mi> </mrow> </msub> <mo>≥</mo> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">t</mi> <mi mathvariant="normal">h</mi> </mrow> </msub> </mrow> </semantics></math>. (<b>b</b>) <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">p</mi> <mo>,</mo> <mi mathvariant="normal">o</mi> <mi mathvariant="normal">u</mi> <mi mathvariant="normal">t</mi> </mrow> </msub> <mo>≤</mo> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">t</mi> <mi mathvariant="normal">h</mi> </mrow> </msub> </mrow> </semantics></math>. (<b>c</b>) Otherwise.</p>
Full article ">Figure 2
<p>An example of the two-dimensional contours of <math display="inline"><semantics> <mrow> <mi mathvariant="sans-serif">Θ</mi> </mrow> </semantics></math> (red: posterior integrity monitoring, black: Chi-squared residual-based prior integrity monitoring).</p>
Full article ">Figure 3
<p>Skyplot of visible GPS satellites.</p>
Full article ">Figure 4
<p>Monte Carlo-based estimate and the upper bound and lower bound of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">F</mi> <mi mathvariant="normal">A</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> </mrow> </msub> </mrow> </semantics></math> in the posterior integrity monitoring of case 1.</p>
Full article ">Figure 5
<p>The parity samples, contour <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">H</mi> <mi mathvariant="normal">M</mi> <mi mathvariant="normal">I</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> </mrow> </msub> <mo>=</mo> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">H</mi> <mi mathvariant="normal">M</mi> <mi mathvariant="normal">I</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> <mo>,</mo> <mi mathvariant="normal">I</mi> <mi mathvariant="normal">R</mi> </mrow> </msub> </mrow> </semantics></math>, and circle <math display="inline"><semantics> <mrow> <msup> <mrow> <mi mathvariant="bold">p</mi> </mrow> <mrow> <mi mathvariant="normal">T</mi> </mrow> </msup> <mi mathvariant="bold">p</mi> <mo>=</mo> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">t</mi> <mi mathvariant="normal">h</mi> </mrow> </msub> </mrow> </semantics></math> in the Monte Carlo simulation of case 1. (<b>a</b>) <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>P</mi> </mrow> <mrow> <mi>H</mi> <mi>M</mi> <mi>I</mi> <mo>,</mo> <mi>q</mi> <mo>,</mo> <mi>I</mi> <mi>R</mi> </mrow> </msub> <mo>=</mo> <mn>1</mn> <msup> <mrow> <mn>0</mn> </mrow> <mrow> <mo>−</mo> <mn>8</mn> </mrow> </msup> </mrow> </semantics></math>. (<b>b</b>) <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>P</mi> </mrow> <mrow> <mi>H</mi> <mi>M</mi> <mi>I</mi> <mo>,</mo> <mi>q</mi> <mo>,</mo> <mi>I</mi> <mi>R</mi> </mrow> </msub> <mo>=</mo> <mn>1</mn> <msup> <mrow> <mn>0</mn> </mrow> <mrow> <mo>−</mo> <mn>5</mn> </mrow> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>Histograms of the parity samples respectively satisfying <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">H</mi> <mi mathvariant="normal">M</mi> <mi mathvariant="normal">I</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> </mrow> </msub> <mo>&gt;</mo> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">H</mi> <mi mathvariant="normal">M</mi> <mi mathvariant="normal">I</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> <mo>,</mo> <mi mathvariant="normal">I</mi> <mi mathvariant="normal">R</mi> </mrow> </msub> <mo> </mo> <mi mathvariant="normal">a</mi> <mi mathvariant="normal">n</mi> <mi mathvariant="normal">d</mi> <mo> </mo> <msup> <mrow> <mi mathvariant="bold">p</mi> </mrow> <mrow> <mi mathvariant="normal">T</mi> </mrow> </msup> <mi mathvariant="bold">p</mi> <mo>&lt;</mo> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">t</mi> <mi mathvariant="normal">h</mi> </mrow> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">H</mi> <mi mathvariant="normal">M</mi> <mi mathvariant="normal">I</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> </mrow> </msub> <mo>&lt;</mo> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">H</mi> <mi mathvariant="normal">M</mi> <mi mathvariant="normal">I</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> <mo>,</mo> <mi mathvariant="normal">I</mi> <mi mathvariant="normal">R</mi> </mrow> </msub> <mo> </mo> <mi mathvariant="normal">a</mi> <mi mathvariant="normal">n</mi> <mi mathvariant="normal">d</mi> <mo> </mo> <msup> <mrow> <mi mathvariant="bold">p</mi> </mrow> <mrow> <mi mathvariant="normal">T</mi> </mrow> </msup> <mi mathvariant="bold">p</mi> <mo>&gt;</mo> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">t</mi> <mi mathvariant="normal">h</mi> </mrow> </msub> </mrow> </semantics></math> in the Monte Carlo simulation of case 1. (<b>a</b>) <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>P</mi> </mrow> <mrow> <mi>H</mi> <mi>M</mi> <mi>I</mi> <mo>,</mo> <mi>E</mi> <mo>,</mo> <mi>I</mi> <mi>R</mi> </mrow> </msub> <mo>=</mo> <mn>1</mn> <msup> <mrow> <mn>0</mn> </mrow> <mrow> <mo>−</mo> <mn>8</mn> </mrow> </msup> </mrow> </semantics></math>. (<b>b</b>) <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>P</mi> </mrow> <mrow> <mi>H</mi> <mi>M</mi> <mi>I</mi> <mo>,</mo> <mi>E</mi> <mo>,</mo> <mi>I</mi> <mi>R</mi> </mrow> </msub> <mo>=</mo> <mn>1</mn> <msup> <mrow> <mn>0</mn> </mrow> <mrow> <mo>−</mo> <mn>5</mn> </mrow> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>Means and standard deviations of the absolute position errors of the two sets of parity samples in the Monte Carlo simulation of case 1.</p>
Full article ">Figure 8
<p>Monte Carlo-based estimate and the upper bound and lower bound of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">F</mi> <mi mathvariant="normal">A</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> </mrow> </msub> </mrow> </semantics></math> in the posterior integrity monitoring of case 2.</p>
Full article ">Figure 9
<p>Parity samples, contour <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">H</mi> <mi mathvariant="normal">M</mi> <mi mathvariant="normal">I</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> </mrow> </msub> <mo>=</mo> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">H</mi> <mi mathvariant="normal">M</mi> <mi mathvariant="normal">I</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> <mo>,</mo> <mi mathvariant="normal">I</mi> <mi mathvariant="normal">R</mi> </mrow> </msub> </mrow> </semantics></math>, and circle <math display="inline"><semantics> <mrow> <msup> <mrow> <mi mathvariant="bold">p</mi> </mrow> <mrow> <mi mathvariant="normal">T</mi> </mrow> </msup> <mi mathvariant="bold">p</mi> <mo>=</mo> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">t</mi> <mi mathvariant="normal">h</mi> </mrow> </msub> </mrow> </semantics></math> in the Monte Carlo simulation of case 2. (<b>a</b>) <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>P</mi> </mrow> <mrow> <mi>H</mi> <mi>M</mi> <mi>I</mi> <mo>,</mo> <mi>E</mi> <mo>,</mo> <mi>I</mi> <mi>R</mi> </mrow> </msub> <mo>=</mo> <mn>1</mn> <msup> <mrow> <mn>0</mn> </mrow> <mrow> <mo>−</mo> <mn>8</mn> </mrow> </msup> </mrow> </semantics></math>. (<b>b</b>) <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>P</mi> </mrow> <mrow> <mi>H</mi> <mi>M</mi> <mi>I</mi> <mo>,</mo> <mi>E</mi> <mo>,</mo> <mi>I</mi> <mi>R</mi> </mrow> </msub> <mo>=</mo> <mn>1</mn> <msup> <mrow> <mn>0</mn> </mrow> <mrow> <mo>−</mo> <mn>5</mn> </mrow> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 10
<p>Histograms of the parity samples respectively satisfying <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">H</mi> <mi mathvariant="normal">M</mi> <mi mathvariant="normal">I</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> </mrow> </msub> <mo>&gt;</mo> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">H</mi> <mi mathvariant="normal">M</mi> <mi mathvariant="normal">I</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> <mo>,</mo> <mi mathvariant="normal">I</mi> <mi mathvariant="normal">R</mi> </mrow> </msub> <mo> </mo> <mi mathvariant="normal">a</mi> <mi mathvariant="normal">n</mi> <mi mathvariant="normal">d</mi> <mo> </mo> <msup> <mrow> <mi mathvariant="bold">p</mi> </mrow> <mrow> <mi mathvariant="normal">T</mi> </mrow> </msup> <mi mathvariant="bold">p</mi> <mo>&lt;</mo> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">t</mi> <mi mathvariant="normal">h</mi> </mrow> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">H</mi> <mi mathvariant="normal">M</mi> <mi mathvariant="normal">I</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> </mrow> </msub> <mo>&lt;</mo> <msub> <mrow> <mi mathvariant="normal">P</mi> </mrow> <mrow> <mi mathvariant="normal">H</mi> <mi mathvariant="normal">M</mi> <mi mathvariant="normal">I</mi> <mo>,</mo> <mi mathvariant="normal">q</mi> <mo>,</mo> <mi mathvariant="normal">I</mi> <mi mathvariant="normal">R</mi> </mrow> </msub> <mo> </mo> <mi mathvariant="normal">a</mi> <mi mathvariant="normal">n</mi> <mi mathvariant="normal">d</mi> <mo> </mo> <msup> <mrow> <mi mathvariant="bold">p</mi> </mrow> <mrow> <mi mathvariant="normal">T</mi> </mrow> </msup> <mi mathvariant="bold">p</mi> <mo>&gt;</mo> <msub> <mrow> <mi mathvariant="normal">T</mi> </mrow> <mrow> <mi mathvariant="normal">t</mi> <mi mathvariant="normal">h</mi> </mrow> </msub> </mrow> </semantics></math> in the Monte Carlo simulation of case 2. (<b>a</b>) <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>P</mi> </mrow> <mrow> <mi>H</mi> <mi>M</mi> <mi>I</mi> <mo>,</mo> <mi>E</mi> <mo>,</mo> <mi>I</mi> <mi>R</mi> </mrow> </msub> <mo>=</mo> <mn>1</mn> <msup> <mrow> <mn>0</mn> </mrow> <mrow> <mo>−</mo> <mn>8</mn> </mrow> </msup> </mrow> </semantics></math>. (<b>b</b>) <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>P</mi> </mrow> <mrow> <mi>H</mi> <mi>M</mi> <mi>I</mi> <mo>,</mo> <mi>E</mi> <mo>,</mo> <mi>I</mi> <mi>R</mi> </mrow> </msub> <mo>=</mo> <mn>1</mn> <msup> <mrow> <mn>0</mn> </mrow> <mrow> <mo>−</mo> <mn>5</mn> </mrow> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 11
<p>Means and standard deviations of the absolute position errors of the two sets of parity samples in the Monte Carlo simulation of case 2.</p>
Full article ">
13 pages, 2814 KiB  
Article
Physical Activity in Pre-Ambulatory Children with Cerebral Palsy: An Exploratory Validation Study to Distinguish Active vs. Sedentary Time Using Wearable Sensors
by Julie M. Orlando, Beth A. Smith, Jocelyn F. Hafer, Athylia Paremski, Matthew Amodeo, Michele A. Lobo and Laura A. Prosser
Sensors 2025, 25(4), 1261; https://doi.org/10.3390/s25041261 - 19 Feb 2025
Abstract
Wearable inertial sensor technology affords opportunities to record the physical activity of young children in their natural environments. The interpretation of these data, however, requires validation. The purpose of this study was to develop and establish the criterion validity of a method of [...] Read more.
Wearable inertial sensor technology affords opportunities to record the physical activity of young children in their natural environments. The interpretation of these data, however, requires validation. The purpose of this study was to develop and establish the criterion validity of a method of quantifying active and sedentary physical activity using an inertial sensor for pre-ambulatory children with cerebral palsy. Ten participants were video recorded during 30 min physical therapy sessions that encouraged gross motor play activities, and the video recording was behaviorally coded to identify active and sedentary time. A receiver operating characteristic curve identified the optimal threshold to maximize true positive and minimize false positive active time for eight participants in the development dataset. The threshold was 0.417 m/s2 and was then validated with the remaining two participants; the percent of true positives and true negatives was 92.2 and 89.7%, respectively. We conclude that there is potential for raw sensor data to be used to quantify active and sedentary time in pre-ambulatory children with physical disability, and raw acceleration data may be more generalizable than the sensor-specific activity counts commonly reported in the literature. Full article
Show Figures

Figure 1

Figure 1
<p>Schematic of sensor placement. Sensors were placed on the lateral aspect of the child’s dominant thigh. Created in BioRender. Orlando, J. (2024) <a href="https://BioRender.com/l01b058" target="_blank">https://BioRender.com/l01b058</a>.</p>
Full article ">Figure 2
<p>Data processing steps: (<b>A</b>) raw acceleration components with the x-axis in red, y-axis in green, and z-axis in blue; (<b>B</b>) raw acceleration transformed into the world frame of reference with gravity removed with the x-axis in red, y-axis in green, and z-axis in blue; (<b>C</b>) power spectral density results with the vertical blue line at 95% of the data; (<b>D</b>) filtered resultant acceleration magnitude.</p>
Full article ">Figure 3
<p>(<b>A</b>) Histogram showing the filtered resultant acceleration magnitude of the sensor data during active and sedentary time identified through the gold-standard behavioral coding of the development dataset with the x-axis limit set to 5, excluding higher accelerations with low counts. (<b>B</b>) Receiver operating characteristic curve in blue with the optimal threshold in red identified for the development dataset. The threshold was then tested with the validation dataset. (<b>C</b>) Histogram showing the filtered resultant acceleration magnitude of the sensor data for the development dataset during active and sedentary time identified by the threshold with the x-axis limit set to 5, excluding higher accelerations with low counts.</p>
Full article ">Figure 4
<p>(<b>A</b>) Time-series plot displaying the active time epochs identified by the gold-standard behavioral coding (purple) and sensor (green) methodologies for a participant in the validation dataset. (<b>B</b>) A subsection of the same time-series displaying examples of true positives [(the sum of the number of frames when the sensor method and the video coding method ± four frames (i.e., 0.125 s) were both classified as active time/total number of frames) × 100], true negatives [(the sum of the number of frames when the sensor method and the video coding method ± four frames (i.e., 0.125 s) were both classified as sedentary time/total number of frames) × 100], false positives [(the sum of the number of frames when the sensor method was classified as active and was not a true positive/total number of frames) × 100], and false negatives [(the sum of the number of frames when the sensor method was classified as sedentary and was not a true negative/total number of frames) × 100].</p>
Full article ">
13 pages, 968 KiB  
Article
Sentinel Lymph Node Detection in Cervical Cancer: Challenges in Resource-Limited Settings with High Prevalence of Large Tumours
by Szilárd Leó Kiss, Mihai Stanca, Dan Mihai Căpîlna, Tudor Emil Căpîlna, Maria Pop-Suciu, Botond Istvan Kiss, Szilárd Leó Kiss and Mihai Emil Căpîlna
J. Clin. Med. 2025, 14(4), 1381; https://doi.org/10.3390/jcm14041381 - 19 Feb 2025
Abstract
Background/Objectives: Cervical cancer primarily disseminates through the lymphatic system, with the metastatic involvement of pelvic and para-aortic lymph nodes significantly impacting prognosis and treatment decisions. Sentinel lymph node (SLN) mapping is critical in guiding surgical management. However, resource-limited settings often lack advanced [...] Read more.
Background/Objectives: Cervical cancer primarily disseminates through the lymphatic system, with the metastatic involvement of pelvic and para-aortic lymph nodes significantly impacting prognosis and treatment decisions. Sentinel lymph node (SLN) mapping is critical in guiding surgical management. However, resource-limited settings often lack advanced detection tools like indocyanine green (ICG). This study evaluated the feasibility and effectiveness of SLN biopsy using alternative techniques in a high-risk population with a high prevalence of large tumours. Methods: This prospective, observational study included 42 patients with FIGO 2018 stage IA1–IIA1 cervical cancer treated between November 2019 and April 2024. SLN mapping was performed using methylene blue alone or combined with a technetium-99m radiotracer. Detection rates, sensitivity, and false-negative rates were analysed. Additional endpoints included tracer technique comparisons, SLN localization patterns, and factors influencing detection success. Results: SLNs were identified in 78.6% of cases, with bilateral detection in 57.1%. The combined technique yielded higher detection rates (93.3% overall, 80% bilateral) compared to methylene blue alone (70.4% overall, 40.7% bilateral, p < 0.05). The sensitivity and negative predictive values were 70% and 93.87%, respectively. Larger tumours (>4 cm), deep stromal invasion, and prior conization negatively impacted detection rates. False-negative SLNs were associated with larger tumours and positive lymphovascular space invasion. Conclusions: SLN biopsy is feasible in resource-limited settings, with improved detection rates using combined tracer techniques. However, sensitivity remains suboptimal due to a steep learning curve and challenges in high-risk patients. Until a high detection accuracy is achieved, SLN mapping should complement, rather than replace, pelvic lymphadenectomy in high-risk cases. Full article
(This article belongs to the Special Issue Laparoscopy and Surgery in Gynecologic Oncology)
Show Figures

Figure 1

Figure 1
<p>Localization of the SLNs.</p>
Full article ">Figure 2
<p>Sensitivity and negative predictive value.</p>
Full article ">
18 pages, 6889 KiB  
Article
Machine Learning-Based Detection of Icebergs in Sea Ice and Open Water Using SAR Imagery
by Zahra Jafari, Pradeep Bobby, Ebrahim Karami and Rocky Taylor
Remote Sens. 2025, 17(4), 702; https://doi.org/10.3390/rs17040702 - 19 Feb 2025
Abstract
Icebergs pose significant risks to shipping, offshore oil exploration, and underwater pipelines. Detecting and monitoring icebergs in the North Atlantic Ocean, where darkness and cloud cover are frequent, is particularly challenging. Synthetic aperture radar (SAR) serves as a powerful tool to overcome these [...] Read more.
Icebergs pose significant risks to shipping, offshore oil exploration, and underwater pipelines. Detecting and monitoring icebergs in the North Atlantic Ocean, where darkness and cloud cover are frequent, is particularly challenging. Synthetic aperture radar (SAR) serves as a powerful tool to overcome these difficulties. In this paper, we propose a method for automatically detecting and classifying icebergs in various sea conditions using C-band dual-polarimetric images from the RADARSAT Constellation Mission (RCM) collected throughout 2022 and 2023 across different seasons from the east coast of Canada. This method classifies SAR imagery into four distinct classes: open water (OW), which represents areas of water free of icebergs; open water with target (OWT), where icebergs are present within open water; sea ice (SI), consisting of ice-covered regions without any icebergs; and sea ice with target (SIT), where icebergs are embedded within sea ice. Our approach integrates statistical features capturing subtle patterns in RCM imagery with high-dimensional features extracted using a pre-trained Vision Transformer (ViT), further augmented by climate parameters. These features are classified using XGBoost to achieve precise differentiation between these classes. The proposed method achieves a low false positive rate of 1% for each class and a missed detection rate ranging from 0.02% for OWT to 0.04% for SI and SIT, along with an overall accuracy of 96.5% and an area under curve (AUC) value close to 1. Additionally, when the classes were merged for target detection (combining SI with OW and SIT with OWT), the model demonstrated an even higher accuracy of 98.9%. These results highlight the robustness and reliability of our method for large-scale iceberg detection along the east coast of Canada. Full article
Show Figures

Figure 1

Figure 1
<p>Distribution of targets over date and location.</p>
Full article ">Figure 2
<p>These figures show four sample RGB images from the RCM dataset, where Red = HH, Green = HV, and Blue = (HH-HV)/2. (<b>A</b>,<b>B</b>) depict OW and SI, while (<b>C</b>,<b>D</b>) show icebergs in OW and SI. Only red circles highlight icebergs; other bright pixels represent clutter or sea ice.</p>
Full article ">Figure 3
<p>Block diagram illustrating the proposed system.</p>
Full article ">Figure 4
<p>The impact of despeckling on iceberg images in the HH channel from the SAR dataset, using mean, bilateral, and Lee filters.</p>
Full article ">Figure 5
<p>(<b>A</b>) shows that feature #780 exhibits the most overlap and is considered a weak feature. (<b>B</b>) In contrast, feature #114 is the strongest feature, displaying the least overlap.</p>
Full article ">Figure 6
<p>ROC curves for the evaluated models: (<b>A</b>) ViTFM, (<b>B</b>) StatFM, (<b>C</b>) ViTStatFM, and (<b>D</b>) ViTStatClimFM. The curves illustrate the classification performance across OW, OWT, SI, and SIT categories.</p>
Full article ">Figure 7
<p>Confusion matrices depicting the classification performance of the hybrid model with climate features: (<b>A</b>) represents the classification performance across all four classes, (<b>B</b>) highlights the model’s ability to distinguish between target-containing patches and those without targets, and (<b>C</b>) evaluates the classification of sea ice (SI and SIT) versus open water (OW and OWT).</p>
Full article ">Figure 8
<p>Application of the proposed method to a calibrated RCM image acquired on 23 June 2023. (<b>A</b>) The RCM image overlaid on the Labrador coast. (<b>B</b>) Corresponding ice chart from the Canadian Ice Service for the same region and date. (<b>C</b>) Probability map for OW. (<b>D</b>) Probability map for SI. (<b>E</b>) Probability map for OWT. (<b>F</b>) Probability map for SIT.</p>
Full article ">Figure 9
<p>An extracted section from the full RCM image captured on 23 June 2023, showing icebergs embedded in SI. Red triangles indicate ground truth points, while green circles represent model predictions.</p>
Full article ">Figure 10
<p>Missed targets located near patch borders, illustrating boundary effects. (<b>A</b>) A missed target near the top-left patch border. (<b>B</b>) A missed target within a central region affected by boundary artifacts. (<b>C</b>) A missed target near the bottom-right patch border, highlighting prediction inconsistencies at patch edges.</p>
Full article ">
18 pages, 3828 KiB  
Article
An Unsupervised Moving Object Detection Network for UAV Videos
by Xuxiang Fan, Gongjian Wen, Zhinan Gao, Junlong Chen and Haojun Jian
Drones 2025, 9(2), 150; https://doi.org/10.3390/drones9020150 - 18 Feb 2025
Abstract
UAV moving object detection focuses on identifying moving objects in images captured by UAVs, with broad applications in regional surveillance and event reconnaissance. Compared to general moving object detection scenarios, UAV videos exhibit unique characteristics, including foreground sparsity and varying target scales. The [...] Read more.
UAV moving object detection focuses on identifying moving objects in images captured by UAVs, with broad applications in regional surveillance and event reconnaissance. Compared to general moving object detection scenarios, UAV videos exhibit unique characteristics, including foreground sparsity and varying target scales. The direct application of conventional background modeling or motion segmentation methods from general settings may yield suboptimal performance in UAV contexts. This paper introduces an unsupervised UAV moving object detection network. Domain-specific knowledge, including spatiotemporal consistency and foreground sparsity, is integrated into the loss function to mitigate false positives caused by motion parallax and platform movement. Multi-scale features are fully utilized to address the variability in target sizes. Furthermore, we have collected a UAV moving object detection dataset from various typical scenarios, providing a benchmark for this task. Extensive experiments conducted on both our dataset and existing benchmarks demonstrate the superiority of the proposed algorithm. Full article
Show Figures

Figure 1

Figure 1
<p>Frameworks of typical moving object detection methods under dynamic observation platforms.</p>
Full article ">Figure 2
<p>Flowchart of the proposed method.</p>
Full article ">Figure 3
<p>An example of UAV sequence data. The first row displays the RGB images, with moving targets highlighted by red bounding boxes, while the second row presents the corresponding visualized optical flow maps.</p>
Full article ">Figure 4
<p>Samples of our UAVMD dataset.</p>
Full article ">Figure 5
<p>Qualitative comparison results of different methods. The method names are listed below the images, and the detection results are displayed on the original image in the form of weighted red masks. Key regions are emphasized using red bounding boxes.</p>
Full article ">Figure 6
<p>Illustration results on unseen sequences. Examples 1 and 2 are collected by ourselves, while No. 3 is sourced from the VIVID dataset [<a href="#B5-drones-09-00150" class="html-bibr">5</a>], Example 4 from the DAVIS sequence [<a href="#B4-drones-09-00150" class="html-bibr">4</a>], Examples 5–7 from the BMS dataset [<a href="#B48-drones-09-00150" class="html-bibr">48</a>], and Example 8 from the CDNet 2014 dataset [<a href="#B51-drones-09-00150" class="html-bibr">51</a>]. The detected moving objects are highlighted with red masks, with the target number and optical flow magnitude displayed as text. Arrows indicate the direction of the optical flow associated with the targets.</p>
Full article ">Figure A1
<p>Test results in scenes with partial occlusion. Examples from the UAVMD test set.</p>
Full article ">Figure A2
<p>Illustration of the continuous detection in time. Examples are drawn from the UAVMD test set.</p>
Full article ">
34 pages, 4483 KiB  
Article
A Fused Multi-Channel Prediction Model of Pressure Injury for Adult Hospitalized Patients—The “EADB” Model
by Eba’a Dasan Barghouthi, Amani Yousef Owda, Majdi Owda and Mohammad Asia
AI 2025, 6(2), 39; https://doi.org/10.3390/ai6020039 - 18 Feb 2025
Abstract
Background: Pressure injuries (PIs) are increasing worldwide, and there has been no significant improvement in preventing them. Traditional assessment tools are widely used to identify a patient at risk of developing a PI. This study aims to construct a novel fused multi-channel prediction [...] Read more.
Background: Pressure injuries (PIs) are increasing worldwide, and there has been no significant improvement in preventing them. Traditional assessment tools are widely used to identify a patient at risk of developing a PI. This study aims to construct a novel fused multi-channel prediction model of PIs in adult hospitalized patients using machine learning algorithms (MLAs). Methods: A multi-phase quantitative approach involving a case–control experimental design was used. A first-hand dataset was collected retrospectively between March/2022 and August/2023 from the electronic medical records of three hospitals in Palestine. Results: The total number of patients was 49,500. A balanced dataset was utilized with a total number of 1110 patients (80% training and 20% testing). The models that were developed utilized eight MLAs, including linear regression and support vector regression (SVR), logistic regression (LR), random forest (RF), gradient boosting (GB), K-nearest neighbor (KNN), decision tree (DT), and extreme gradient boosting (XG boosting) and validated with five-fold cross-validation techniques. The best model was RF, for which the accuracy was 0.962, precision was 0.942, recall was 0.922, F1 was 0.931, area under curve (AUC) was 0.922, false positive rate (FPR) was 0.155, and true positive rate (TPR) was 0.782. Conclusions: The predictive factors were age, moisture, activity, length of stay (LOS), systolic blood pressure (BP), and albumin. A novel fused multi-channel prediction model of pressure injury was developed from different datasets. Full article
(This article belongs to the Special Issue Multimodal Artificial Intelligence in Healthcare)
Show Figures

Figure 1

Figure 1
<p>Method of construction for prediction model.</p>
Full article ">Figure 2
<p>Heat map of correlations for numeric variables.</p>
Full article ">Figure 3
<p>Cramer’s V correlation for categorical variables with laboratory test results.</p>
Full article ">Figure 4
<p>Cramer’s V correlation for categorical variables with medications.</p>
Full article ">Figure 5
<p>Correlation between pressure injury and lab results.</p>
Full article ">Figure 6
<p>Model result extraction methodology.</p>
Full article ">Figure 7
<p>ML algorithms for model (A)—ROC curves.</p>
Full article ">Figure 8
<p>ML algorithms for model (B)—ROC curves.</p>
Full article ">Figure 9
<p>ML algorithms for model (C)—ROC curves.</p>
Full article ">Figure 10
<p>ML algorithms for model (D)—ROC curves.</p>
Full article ">
24 pages, 10376 KiB  
Article
Impact of Non-Landslide Sample Sampling Strategies and Model Selection on Landslide Susceptibility Mapping
by Weijun Jiang, Ling Li and Ruiqing Niu
Appl. Sci. 2025, 15(4), 2132; https://doi.org/10.3390/app15042132 - 18 Feb 2025
Abstract
This study investigated the influence of non-landslide sampling strategies on landslide susceptibility assessment (LSA) performance and explored approaches to minimizing uncertainty in model selection. Five non-landslide sampling strategies were evaluated using the random forest (RF) model to generate landslide susceptibility maps (LSMs) for [...] Read more.
This study investigated the influence of non-landslide sampling strategies on landslide susceptibility assessment (LSA) performance and explored approaches to minimizing uncertainty in model selection. Five non-landslide sampling strategies were evaluated using the random forest (RF) model to generate landslide susceptibility maps (LSMs) for each scenario. To assess the impact of these strategies, this study employed a receiver operating characteristic (ROC) curve, a confusion matrix, and various statistical indicators. Additionally, the mean susceptibility indices derived from the gradient boosting decision tree (GBDT), support vector machine (SVM), and RF models were analyzed to evaluate their effectiveness in reducing the uncertainty during model selection. The GBDT, SVM, and RF were selected for their ability to handle complex, nonlinear relationships in the data, superior generalization capability, effective mitigation of overfitting risks, high predictive performance, and robustness. The findings revealed that selecting non-landslide samples from slope units without landslides enhances accuracy and averaging across models mitigated the uncertainty associated with landslide susceptibility models. Furthermore, this study demonstrated that the non-landslide sample selection method significantly improved prediction accuracy, particularly when samples were drawn from very-low-susceptibility zones identified by pre-classified machine learning models. These results highlight the importance of refining sample selection strategies and integrating multiple machine learning models to improve the reliability and accuracy of landslide susceptibility assessments. This approach provides valuable insights for future research and practical applications in risk mitigation and disaster management by offering a more precise depiction of low-susceptibility areas, thereby reducing the occurrence of false positives in landslide prediction. Full article
(This article belongs to the Section Earth Sciences)
Show Figures

Figure 1

Figure 1
<p>Distribution of landslide disasters and geographic locations in Badong County.</p>
Full article ">Figure 2
<p>Influencing factors used: (<b>a</b>) elevation; (<b>b</b>) slope; (<b>c</b>) aspect; (<b>d</b>) curvature; (<b>e</b>) distance to fault; (<b>f</b>) EGRG; (<b>g</b>) slope structure; (<b>h</b>) distance to river; (<b>i</b>) TWI; (<b>j</b>) flow path length; (<b>k</b>) flow width; (<b>l</b>) mean annual rainfall; (<b>m</b>) land use type; and (<b>n</b>) NDVI.</p>
Full article ">Figure 3
<p>Research flowchart. LR, logistic regression model; SVM, support vector machine model; GBDT, gradient boosting decision tree model; RF, random forest model.</p>
Full article ">Figure 4
<p>Correlation coefficients between influencing factors.</p>
Full article ">Figure 5
<p>Non-landslide sample selection methods: (<b>a</b>) Slope dataset; (<b>b</b>) Buffer dataset.</p>
Full article ">Figure 6
<p>Susceptibility zoning maps generated by different machine learning models based on two sampling methods: (<b>a</b>) Buffer-LR; (<b>b</b>) Slope-LR; (<b>c</b>) Buffer-SVM; (<b>d</b>) Slope-SVM; (<b>e</b>) Buffer-GBDT; (<b>f</b>) Slope-GBDT; (<b>g</b>) Buffer-RF; and (<b>h</b>) Slope-RF.</p>
Full article ">Figure 7
<p>ROC curves and AUC values for each model based on two datasets: (<b>a</b>) Buffer dataset; (<b>b</b>) Slope dataset.</p>
Full article ">Figure 8
<p>(<b>a</b>) LSM obtained using the average method; (<b>b</b>) the corresponding ROC curve and AUC values.</p>
Full article ">Figure 9
<p>Statistics of the proportion of landslides in different susceptibility zones of the four models.</p>
Full article ">Figure 10
<p>FR of each model at different susceptibility levels.</p>
Full article ">Figure 11
<p>LSM for different sampling strategies. LSM is generated by (<b>a</b>) “Pre-LR” datasets (<b>b</b>) “Pre-SVM” datasets (<b>c</b>) “Pre-GBDT” datasets (<b>d</b>) “Buffer” datasets and (<b>e</b>) “Slope” datasets.</p>
Full article ">Figure 12
<p>Proportions of areas and landslides across different susceptibility zones under various non-landslide sample sampling strategies: (<b>a</b>) area proportions; (<b>b</b>) landslide proportions.</p>
Full article ">Figure 13
<p>ROC curves and AUC values plotted using five different datasets.</p>
Full article ">
20 pages, 7127 KiB  
Article
Cross-Attention Adaptive Feature Pyramid Network with Uncertainty Boundary Modeling for Mass Detection in Digital Breast Tomosynthesis
by Xinyu Ma, Haotian Sun, Gang Yuan, Yufei Tang, Jie Liu, Shuangqing Chen and Jian Zheng
Bioengineering 2025, 12(2), 196; https://doi.org/10.3390/bioengineering12020196 - 17 Feb 2025
Abstract
Computer-aided detection (CADe) of masses in digital breast tomosynthesis (DBT) is crucial for early breast cancer diagnosis. However, the variability in the size and morphology of breast masses and their resemblance to surrounding tissues present significant challenges. Current CNN-based CADe methods, particularly those [...] Read more.
Computer-aided detection (CADe) of masses in digital breast tomosynthesis (DBT) is crucial for early breast cancer diagnosis. However, the variability in the size and morphology of breast masses and their resemblance to surrounding tissues present significant challenges. Current CNN-based CADe methods, particularly those that use Feature Pyramid Networks (FPN), often fail to integrate multi-scale information effectively and struggle to handle dense glandular tissue with high-density or iso-density mass lesions due to the unidirectional integration and progressive attenuation of features, leading to high false positive rates. Additionally, the commonly indistinct boundaries of breast masses introduce uncertainty in boundary localization, which makes traditional Dirac boundary modeling insufficient for precise boundary regression. To address these issues, we propose the CU-Net network, which efficiently fuses multi-scale features and accurately models blurred boundaries. Specifically, the CU-Net introduces the Cross-Attention Adaptive Feature Pyramid Network (CA-FPN), which enhances the effectiveness and accuracy of feature interactions through a cross-attention mechanism to capture global correlations across multi-scale feature maps. Simultaneously, the Breast Density Perceptual Module (BDPM) incorporates breast density information to weight intermediate features, thereby improving the network’s focus on dense breast regions susceptible to false positives. For blurred mass boundaries, we introduce Uncertainty Boundary Modeling (UBM) to model the positional distribution function of predicted bounding boxes for masses with uncertain boundaries. In comparative experiments on an in-house clinical DBT dataset and the BCS-DBT dataset, the proposed method achieved sensitivities of 89.68% and 72.73% at 2 false positives per DBT volume (FPs/DBT), respectively, significantly outperforming existing state-of-the-art detection methods. This method offers clinicians rapid, accurate, and objective diagnostic assistance, demonstrating substantial potential for clinical application. Full article
(This article belongs to the Section Biosignal Processing)
Show Figures

Figure 1

Figure 1
<p>The illustration of blurred mass edges or obscured by dense glandular tissue. Blurry edges are indicated by red dashed ellipses.</p>
Full article ">Figure 2
<p>Overall architecture of proposed method. The BDPM and CAFPN are used to further integrate and collect the features extracted by the backbone. The UBM is placed in the regression branch of the detection head to predict more accurate 2D bounding boxes.</p>
Full article ">Figure 3
<p>Architecture of CA-FPN. The module directly connects deep features with shallow features, preventing the gradual attenuation of feature transmission seen in traditional FPN.</p>
Full article ">Figure 4
<p>Architecture of BDPM. The module weights the intermediate features of the network using breast density information to enhance the network’s focus on dense breast regions.</p>
Full article ">Figure 5
<p>Three-dimensional aggregation. These 2D detection results are fused along the z-axis to yield the final 3D detection results.</p>
Full article ">Figure 6
<p>The FROC curves of the comparison methods [<a href="#B25-bioengineering-12-00196" class="html-bibr">25</a>,<a href="#B27-bioengineering-12-00196" class="html-bibr">27</a>,<a href="#B35-bioengineering-12-00196" class="html-bibr">35</a>,<a href="#B36-bioengineering-12-00196" class="html-bibr">36</a>,<a href="#B37-bioengineering-12-00196" class="html-bibr">37</a>,<a href="#B38-bioengineering-12-00196" class="html-bibr">38</a>,<a href="#B39-bioengineering-12-00196" class="html-bibr">39</a>] on mass-detection task.</p>
Full article ">Figure 7
<p>The detection result visualization of different models, in which the green boxes represent ground truth, the aqua blue boxes represent true positive results, and the yellow boxes represent false positive results.</p>
Full article ">Figure 8
<p>The heatmap visualization of the detection results using Grad-CAM, in which regions highlighted in red indicate areas of the feature map that receive higher attention from the network and regions depicted in blue represent areas with lower attention from the network. The green boxes represent ground truth. The proposed method effectively focuses on the ground truth regions, thereby achieving accurate detection results.</p>
Full article ">
24 pages, 1945 KiB  
Article
Signature-Based Security Analysis and Detection of IoT Threats in Advanced Message Queuing Protocol
by Mohammad Emran Hashimyar, Mahdi Aiash, Ali Khoshkholghi and Giacomo Nalli
Network 2025, 5(1), 5; https://doi.org/10.3390/network5010005 - 17 Feb 2025
Abstract
The Advanced Message Queuing Protocol (AMQP) is a widely used communication standard in IoT systems due to its robust and reliable message delivery capabilities. However, its increasing adoption has made it a target for various cyber threats, including Distributed Denial of Service (DDoS), [...] Read more.
The Advanced Message Queuing Protocol (AMQP) is a widely used communication standard in IoT systems due to its robust and reliable message delivery capabilities. However, its increasing adoption has made it a target for various cyber threats, including Distributed Denial of Service (DDoS), Man-in-the-Middle (MitM), and brute force attacks. This study presents a comprehensive analysis of AMQP-specific vulnerabilities and introduces a statistical model for the detection and classification of malicious activities in IoT networks. Leveraging a custom-designed IoT testbed, realistic attack scenarios were simulated, and a dataset encompassing normal, malicious, and mixed traffic was generated. Unique attack signatures were identified and validated through repeated experiments, forming the foundation of a signature-based detection mechanism tailored for AMQP networks. The proposed model demonstrated high accuracy in detecting and classifying attack-specific traffic while maintaining a low false positive rate for benign traffic. Notable results include effective detection of RST packets in DDoS scenarios, precise classification of MitM attack patterns, and identification of brute force attempts on AMQP systems. This research highlights the efficacy of signature-based approaches in enhancing IoT security and offers a benchmark for future machine learning-driven detection systems. By addressing AMQP-specific challenges, the study contributes to the development of resilient and secure IoT ecosystems. Full article
Show Figures

Figure 1

Figure 1
<p>Normal network traffic packets for AMQP.</p>
Full article ">Figure 2
<p>Normal network data exchange traffic for AMQP.</p>
Full article ">Figure 3
<p>DoS attack TCP handshake flags.</p>
Full article ">Figure 4
<p>DoS attack data exchange packets (Experiment 1).</p>
Full article ">Figure 5
<p>DoS attack data exchange packets (Experiment 2).</p>
Full article ">Figure 6
<p>DoS attack data exchange packets (Experiment 3).</p>
Full article ">Figure 7
<p>Analysis of AMQP MiTM packets.</p>
Full article ">Figure 8
<p>Analysis of AMQP brute force attack packets.</p>
Full article ">Figure 9
<p>DoS attack signature.</p>
Full article ">Figure 10
<p>Classification results of network traces for DoS attacks (normal, malicious, and RST).</p>
Full article ">Figure 11
<p>Detection of normal packets in AMQP traffic dataset.</p>
Full article ">Figure 12
<p>Detection results for malicious packets in DoS dataset.</p>
Full article ">Figure 13
<p>MiTM attack signature.</p>
Full article ">Figure 14
<p>Detection results for MiTM attack packets in normal and malicious datasets.</p>
Full article ">Figure 15
<p>Detection results for normal packets in AMQP traffic.</p>
Full article ">Figure 16
<p>Detection results for malicious packets in MiTM dataset.</p>
Full article ">Figure 17
<p>Brute force attack signature.</p>
Full article ">Figure 18
<p>Detection results for normal and malicious packets in brute force attacks.</p>
Full article ">Figure 19
<p>Detection results for normal packets in AMQP brute force dataset.</p>
Full article ">Figure 20
<p>Detection results for malicious packets in AMQP brute force dataset.</p>
Full article ">
29 pages, 13905 KiB  
Article
A Comparative Study of Unsupervised Machine Learning Methods for Anomaly Detection in Flight Data: Case Studies from Real-World Flight Operations
by Sameer Kumar Jasra, Gianluca Valentino, Alan Muscat and Robert Camilleri
Aerospace 2025, 12(2), 151; https://doi.org/10.3390/aerospace12020151 - 17 Feb 2025
Abstract
This paper provides a comparative study of unsupervised machine learning (ML) methods for anomaly detection in flight data monitoring (FDM). The study applies various unsupervised ML techniques to real-world flight data and compares the results to the current state-of-the-art flight data analysis techniques [...] Read more.
This paper provides a comparative study of unsupervised machine learning (ML) methods for anomaly detection in flight data monitoring (FDM). The study applies various unsupervised ML techniques to real-world flight data and compares the results to the current state-of-the-art flight data analysis techniques applied in industry. The results are validated by the industrial experts. The study finds that a hybrid Local Outlier Factor (LOF) approach provides significant advantages compared to the current state of the art and other ML techniques because it requires less hyperparameter tuning, reduces the number of false positives, provides an ability to establish trends amongst the entire fleet and has an ability to investigate anomalies at each timestep within every flight. Finally, the study provides an in-depth review for some of the cases highlighted by the hybrid LOF and discusses the particular cases providing insights from an academic and flight safety/operational point of view. The analysis conducted by the human expert regarding the outcomes produced by an ML technique is predominantly absent in scholarly research, thereby offering extra value. The study presents a compelling argument for transitioning from the current approach, based on analyzing occurrences through the exceedances of a threshold value, towards an ML-based method which provides a proactive nature of data analysis. The study shows that there is an untapped opportunity to process flight data and achieve valuable information for enhancing air transport safety and improved aviation operations. Full article
(This article belongs to the Section Air Traffic and Transportation)
Show Figures

Figure 1

Figure 1
<p>K-means clustering.</p>
Full article ">Figure 2
<p>DBSCAN clustering (<span class="html-italic">minPts</span> = 3, radius = <span class="html-italic">ε</span>).</p>
Full article ">Figure 3
<p>Step-by-step implementation of FDM using hybrid LOF method [<a href="#B32-aerospace-12-00151" class="html-bibr">32</a>].</p>
Full article ">Figure 4
<p>Altitude (ALT) vs. time plot for synchronized flights based on time remaining to touchdown.</p>
Full article ">Figure 5
<p>Altitude vs. time plot for synchronized flights based on altitude.</p>
Full article ">Figure 6
<p>K-means analysis for 674 flights (Detroit Airport).</p>
Full article ">Figure 7
<p>DBSCAN analysis for 674 flights (Detroit Airport).</p>
Full article ">Figure 8
<p>LOF and hybrid LOF analysis with threshold values for 674 flights (Detroit Airport).</p>
Full article ">Figure 9
<p>Anomalous flights labeled by various techniques (qualitative comparison).</p>
Full article ">Figure 10
<p>Confusion matrix for each technique (quantitative comparison).</p>
Full article ">Figure 11
<p>Geographical representation of 5 case studies.</p>
Full article ">Figure 12
<p>All engines’ fan speeds (N1) and core speeds (N2) vs. time plot for anomalous flight 1.</p>
Full article ">Figure 13
<p>Engine 3 fan speed (N1) (<b>left</b>) vs. time plot for anomalous flight 1 and Engine 3 core speed (N2) vs. time plot for anomalous flight 1 (<b>right</b>).</p>
Full article ">Figure 14
<p>Air brake (ABRK) vs. time plot for anomalous flight 1 (<b>left</b>) and altitude (ALT) vs. time plot for anomalous flight 1 (<b>right</b>).</p>
Full article ">Figure 15
<p>Anomalous behavior score vs. time plot for anomalous flight 1.</p>
Full article ">Figure 16
<p>All 4 Power Lever Angles (PLAs) vs. time plot for anomalous flight 2.</p>
Full article ">Figure 17
<p>All engines’ fan speeds (N1) and core speeds (N2) vs. time plot for anomalous flight 2.</p>
Full article ">Figure 18
<p>Landing Gear Down setting (LGDN) vs. time plot for anomalous flight 3 (<b>left</b>) and flap settings (FLAP) vs. time plot for anomalous flight 3 (<b>right</b>).</p>
Full article ">Figure 19
<p>Altitude (ALT) vs. time plot for anomalous flight 3 (<b>left</b>) and air brake (ABRK) vs. time plot for anomalous flight 3 (<b>right</b>).</p>
Full article ">Figure 20
<p>Anomalous behavior score vs. time plot for anomalous flight 3.</p>
Full article ">Figure 21
<p>Initial Vertical Velocity (IVV) vs. time plot for anomalous flight 3 (<b>left</b>) and Ground Speed (GS) vs. time plot for the anomalous flight 3 (<b>right</b>).</p>
Full article ">Figure 22
<p>All 4 engines’ fan speeds (N1) vs. time plot for anomalous flight 3.</p>
Full article ">Figure 23
<p>All 4 Power Lever Angles (PLAs) vs. time plot for anomalous flight 3.</p>
Full article ">Figure 24
<p>Drift angle of an aircraft (adapted from Skybrary).</p>
Full article ">Figure 25
<p>Localizer Deviation (LOC) vs. time plot for anomalous flight 4 (<b>left</b>) and drift angle (DA) vs. time plot for the anomalous flight 4 (<b>right</b>).</p>
Full article ">Figure 26
<p>Wind Direction (WD) vs. time plot for anomalous flight 4 (<b>left</b>) and True Heading (TH) vs. time plot for anomalous flight 4 (<b>right</b>).</p>
Full article ">Figure 27
<p>Landing Gear Down (LGDN) vs. time plot for anomalous flight 4 (<b>left</b>) and flap settings (FLAP) vs. time plot for the anomalous flight 4 (<b>right</b>).</p>
Full article ">Figure 28
<p>Comparison of approach path for normal flights and the anomalous flight 5.</p>
Full article ">
12 pages, 966 KiB  
Article
Prospective Evaluation of Pulse Oximetry Screening for Critical Congenital Heart Disease in a Jordanian Tertiary Hospital: High Incidence and Early Detection Challenges
by Naser Aldain A. Abu Lehyah, Abeer A. Hasan, Mahmoud Y. Abbad, Razan A. Al-Jammal, Moath K. Al Tarawneh, Dima Abu Nasrieh, Haneen A. Banihani, Saif N. Aburumman, Areen G. Fraijat, Heba M. Alhawamdeh, Qasem A. Shersheer, Milad Kh. Al-Awawdeh, Scott O. Guthrie and Joseph R. Starnes
Pediatr. Rep. 2025, 17(1), 23; https://doi.org/10.3390/pediatric17010023 - 15 Feb 2025
Abstract
Background/Objectives: Critical congenital heart disease (CCHD) is among the major causes of global neonatal morbidity and mortality. While the incidence of CCHD appears to vary across populations, much of this variation may stem from differences in detection and reporting capabilities rather than true [...] Read more.
Background/Objectives: Critical congenital heart disease (CCHD) is among the major causes of global neonatal morbidity and mortality. While the incidence of CCHD appears to vary across populations, much of this variation may stem from differences in detection and reporting capabilities rather than true prevalence. In Jordan, recent data revealed a congenital cardiac disease incidence of 17.8/1000 live births, much higher than international averages. Diagnosis is largely dependent upon echocardiography, which is difficult to obtain in low-resource settings where prenatal screening modalities are limited. Screening for CCHD with pulse oximetry offers a potential method to identify patients earlier and contribute to improved outcomes. Methods: This prospective cohort study evaluated 20,482 neonates screened using pulse oximetry at Al-Bashir Hospital between January 2022 and May 2024. Demographic data, pulse oximetry measurements, and echocardiogram findings were collected during the screening process after obtaining ethical approval from the Jordanian Ministry of Health. Results: Pulse oximetry screening identified 752 neonates (3.7%) requiring further evaluation by echocardiography. An abnormality was detected in 240 neonates (31.9%), which included cardiac anomalies and pulmonary hypertension. Screening led to the identification of 138 infants with CCHD, including 80 with a previously unknown diagnosis, and an additional 247 infants with conditions requiring increased monitoring or treatment. Among those with CCHD, hypoplastic left heart syndrome and Tetralogy of Fallot were the most common conditions, 3.1%, and 2.4%, respectively. The overall false positive rate was 1.8% and was higher among those screened at less than 24 h of life compared to those screened at or after 24 h of life (2.3% [95%CI 2.1–2.6] vs. 0.8% [95%CI 0.6–1.0], p < 0.001). Conclusions: Pulse oximetry screening successfully led to the early detection of CCHD among Jordanian neonates. There was a high prevalence of CCHD compared to other reported cohorts. This highlights the importance of implementing national screening protocols to improve early diagnosis and intervention. Future studies will inform the feasibility and cost-effectiveness of national implementation in this setting. Full article
Show Figures

Figure 1

Figure 1
<p>Pulse oximetry protocol. All infants were screened at 24 h of life or earlier if being discharged. Infants who failed screening were referred for echocardiogram and additional evaluation [<a href="#B23-pediatrrep-17-00023" class="html-bibr">23</a>,<a href="#B24-pediatrrep-17-00023" class="html-bibr">24</a>].</p>
Full article ">Figure 2
<p>Results of screening. A total of 752 (3.7%) infants failed the screening protocol. Among these infants, echocardiography identified an abnormality in 240 (31.9%). Additional non-cardiac abnormalities, including sepsis and pneumonia, were identified in 145 (19.3%) infants.</p>
Full article ">
26 pages, 27528 KiB  
Article
A Stereo Visual-Inertial SLAM Algorithm with Point-Line Fusion and Semantic Optimization for Forest Environments
by Bo Liu, Hongwei Liu, Yanqiu Xing, Weishu Gong, Shuhang Yang, Hong Yang, Kai Pan, Yuanxin Li, Yifei Hou and Shiqing Jia
Forests 2025, 16(2), 335; https://doi.org/10.3390/f16020335 - 13 Feb 2025
Abstract
Accurately localizing individual trees and identifying species distribution are critical tasks in forestry remote sensing. Visual Simultaneous Localization and Mapping (visual SLAM) algorithms serve as important tools for outdoor spatial positioning and mapping, mitigating signal loss caused by tree canopy obstructions. To address [...] Read more.
Accurately localizing individual trees and identifying species distribution are critical tasks in forestry remote sensing. Visual Simultaneous Localization and Mapping (visual SLAM) algorithms serve as important tools for outdoor spatial positioning and mapping, mitigating signal loss caused by tree canopy obstructions. To address these challenges, a semantic SLAM algorithm called LPD-SLAM (Line-Point-Distance Semantic SLAM) is proposed, which integrates stereo cameras with an inertial measurement unit (IMU), with contributions including dynamic feature removal, an individual tree data structure, and semantic point distance constraints. LPD-SLAM is capable of performing individual tree localization and tree species discrimination tasks in forest environments. In mapping, LPD-SLAM reduces false species detection and filters dynamic objects by leveraging a deep learning model and a novel individual tree data structure. In optimization, LPD-SLAM incorporates point and line feature reprojection error constraints along with semantic point distance constraints, which improve robustness and accuracy by introducing additional geometric constraints. Due to the lack of publicly available forest datasets, we choose to validate the proposed algorithm on eight experimental plots, which are selected to cover different seasons, various tree species, and different data collection paths, ensuring the dataset’s diversity and representativeness. The experimental results indicate that the average root mean square error (RMSE) of the trajectories of LPD-SLAM is reduced by up to 81.2% compared with leading algorithms. Meanwhile, the mean absolute error (MAE) of LPD-SLAM in tree localization is 0.24 m, which verifies its excellent performance in forest environments. Full article
(This article belongs to the Section Forest Inventory, Modeling and Remote Sensing)
Show Figures

Figure 1

Figure 1
<p>System framework.</p>
Full article ">Figure 2
<p>Example of real-time system operation.</p>
Full article ">Figure 3
<p>Data collection equipment.</p>
Full article ">Figure 4
<p>Generation of the semantic segmentation mask.</p>
Full article ">Figure 5
<p>Semantic feature extraction.</p>
Full article ">Figure 6
<p>Stereo vision geometry.</p>
Full article ">Figure 7
<p>Extraction of stereo point and line features.</p>
Full article ">Figure 8
<p>Establishment of global individual tree database.</p>
Full article ">Figure 9
<p>Postex multi-functional tree measurement system.</p>
Full article ">Figure 10
<p>TSI acquisition of ground truth trajectory data.</p>
Full article ">Figure 11
<p>Experimental data.</p>
Full article ">Figure 12
<p>Individual tree localization coordinate comparison on 8 experimental plots.</p>
Full article ">Figure 12 Cont.
<p>Individual tree localization coordinate comparison on 8 experimental plots.</p>
Full article ">Figure 13
<p>Trajectory comparison of different algorithms on 8 experimental plots.</p>
Full article ">Figure 13 Cont.
<p>Trajectory comparison of different algorithms on 8 experimental plots.</p>
Full article ">Figure 13 Cont.
<p>Trajectory comparison of different algorithms on 8 experimental plots.</p>
Full article ">
16 pages, 12755 KiB  
Article
Improved Algorithm to Detect Clandestine Airstrips in Amazon RainForest
by Gabriel R. Pardini, Paulo M. Tasinaffo, Elcio H. Shiguemori, Tahisa N. Kuck, Marcos R. O. A. Maximo and William R. Gyotoku
Algorithms 2025, 18(2), 102; https://doi.org/10.3390/a18020102 - 13 Feb 2025
Abstract
The Amazon biome is frequently targeted by illegal activities, with clandestine mining being one of the most prominent. Due to the dense forest cover, criminals often rely on covert aviation as a logistical tool to supply remote locations and sustain these activities. This [...] Read more.
The Amazon biome is frequently targeted by illegal activities, with clandestine mining being one of the most prominent. Due to the dense forest cover, criminals often rely on covert aviation as a logistical tool to supply remote locations and sustain these activities. This work presents an enhancement to a previously developed landing strip detection algorithm tailored for the Amazon biome. The initial algorithm utilized satellite images combined with the use of Convolutional Neural Networks (CNNs) to find the targets’ spatial locations (latitude and longitude). By addressing the limitations identified in the initial approach, this refined algorithm aims to improve detection accuracy and operational efficiency in complex rainforest environments. Tests in a selected area of the Amazon showed that the modified algorithm resulted in a recall drop of approximately 1% while reducing false positives by 26.6%. The recall drop means there was a decrease in the detection of true positives, which is balanced by the reduction in false positives. When applied across the entire biome, the recall decreased by 1.7%, but the total predictions dropped by 17.88%. These results suggest that, despite a slight reduction in recall, the modifications significantly improved the original algorithm by minimizing its limitations. Additionally, the improved solution demonstrates a 25.55% faster inference time, contributing to more rapid target identification. This advancement represents a meaningful step toward more effective detection of clandestine airstrips, supporting ongoing efforts to combat illegal activities in the region. Full article
(This article belongs to the Special Issue Visual Attributes in Computer Vision Applications)
Show Figures

Figure 1

Figure 1
<p>Map of the Brazilian Amazon with the airstrip mapping conducted by [<a href="#B3-algorithms-18-00102" class="html-bibr">3</a>].</p>
Full article ">Figure 2
<p>Representation of the visible region bands of the same airstrip in the Planet and Sentinel-2 sensors.</p>
Full article ">Figure 3
<p>Samples of images that comprise the representative set of non-airstrips.</p>
Full article ">Figure 4
<p>Representation of the chosen region for analysis, with purple points indicating previously mapped landing strips.</p>
Full article ">Figure 5
<p>Result of the modified algorithm for the proposed area.</p>
Full article ">Figure 6
<p>Result of the original algorithm for the proposed area.</p>
Full article ">
27 pages, 24868 KiB  
Article
Improved Detection of Multiple Faint Streak-like Space Targets from a Single Star Image
by Yong Han, Desheng Wen, Jie Li and Zhangchi Qiao
Remote Sens. 2025, 17(4), 631; https://doi.org/10.3390/rs17040631 - 12 Feb 2025
Abstract
With the increasing number of human space activities, space surveillance systems need to be developed to reduce the risk of collisions between space assets and space debris. In this context, optical surveillance systems have gradually become a significant means of space surveillance due [...] Read more.
With the increasing number of human space activities, space surveillance systems need to be developed to reduce the risk of collisions between space assets and space debris. In this context, optical surveillance systems have gradually become a significant means of space surveillance due to their various advantages. Generally, the sidereal tracking mode is used to search for unknown moving targets, which appear as streaks in the star image generated by the optical surveillance system. Typical matched filtering can detect faint streak-like targets in star images, but it generates more false alarms and must traverse all potential filters. In this paper, the layering approach is used to improve the environment for detecting faint targets, in which dual-threshold segmentation is proposed to separate bright objects while maintaining the completeness of faint targets. Second, a streak-like matched filter unit and a dual-step search approach are recommended to lower the computational cost of matched filtering. Finally, perpendicular cross filtering is provided to further eliminate false positives. Experiments performed with both simulated and real data demonstrate that the proposed method has excellent detection performance for detecting multiple faint streak-like targets in a single star image. Full article
Show Figures

Figure 1

Figure 1
<p>Different definitions of the object’s SNR. (<b>a</b>) Ideal SNR; (<b>b</b>) peak SNR; (<b>c</b>) average SNR; (<b>d</b>) average SNR of half-height PSF.</p>
Full article ">Figure 2
<p>The influence of bright objects on faint target detection based on matched filtering. (<b>a</b>) Bright stars cause false positives in their surroundings. (<b>b</b>) Bright targets cause false positives in their surroundings. (<b>c</b>) Bright stars around the streak-like target generate higher responses in the incorrect direction.</p>
Full article ">Figure 3
<p>The saturated layer is separated from the star image. (<b>Left</b>) Initial saturated star image. (<b>Middle</b>) Connecting area of saturated pixels. (<b>Right</b>) Saturated objects are separated.</p>
Full article ">Figure 4
<p>Separate bright and dark layers. (<b>a</b>) Initial star image including multiple objects. (<b>b</b>) Bright objects separated by TTS (objects separated by DTS with the high threshold). (<b>c</b>) Objects separated by DTS with the low threshold. (<b>d</b>) Bright objects separated by DTS.</p>
Full article ">Figure 5
<p>The distribution and filtering response of a streak-like matched filter unit: (<b>a</b>) A streak-like matched filter with a length of 21 pixels. (<b>b</b>) A streak-like matched filter with a length of 41 pixels. (<b>c</b>) The responses of a streak-like matched filter unit of 21-pixel length filtering the same SNR streak-like targets with various lengths.</p>
Full article ">Figure 6
<p>The dual-step search for the matched direction.</p>
Full article ">Figure 7
<p>The PCF is used for the stars and the streak-like targets.</p>
Full article ">Figure 8
<p>The workflow of detecting multiple targets in a single star image. The targets detected in the bright layer are shown by green-line rectangles. The false positives removed in the dark layer are shown by blue-dash rectangles. The targets detected in the dark layer are shown by yellow-dot rectangles.</p>
Full article ">Figure 9
<p>Separating the saturated layer from the raw star image: (<b>a</b>) the raw star image; (<b>b</b>) the saturated layer.</p>
Full article ">Figure 10
<p>Star image preprocessing: (<b>a</b>) background estimation; (<b>b</b>) spike noise; (<b>c</b>) star image after removing background and spike noise.</p>
Full article ">Figure 11
<p>Principle of spike noise removal.</p>
Full article ">Figure 12
<p>Separate the bright and dark layers: (<b>a</b>) separation of bright and dark layers by TTS; (<b>b</b>) separation of bright and dark layers by DTS.</p>
Full article ">Figure 13
<p>Comparison of <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>s</mi> <mi>e</mi> </mrow> </msub> </semantics></math> between TTS and DTS. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>s</mi> <mi>e</mi> </mrow> </msub> </semantics></math> with different star SNR; (<b>b</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>s</mi> <mi>e</mi> </mrow> </msub> </semantics></math> with different target lengths; (<b>c</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>s</mi> <mi>e</mi> </mrow> </msub> </semantics></math> with different target SNR.</p>
Full article ">Figure 14
<p>Comparison of <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>r</mi> </mrow> </msub> </semantics></math> between TTS and DTS. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>r</mi> </mrow> </msub> </semantics></math> with different star SNR; (<b>b</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>r</mi> </mrow> </msub> </semantics></math> with different target lengths; (<b>c</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>r</mi> </mrow> </msub> </semantics></math> with different target SNR.</p>
Full article ">Figure 15
<p>Comparison of <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>d</mi> </mrow> </msub> </semantics></math> between TTS and DTS. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>d</mi> </mrow> </msub> </semantics></math> with different star SNR; (<b>b</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>d</mi> </mrow> </msub> </semantics></math> with different target lengths; (<b>c</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>d</mi> </mrow> </msub> </semantics></math> with different target SNR.</p>
Full article ">Figure 16
<p>Dual-step search with different large-step sizes for the direction search of streak-like matched filter units.</p>
Full article ">Figure 17
<p><math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>f</mi> <mi>a</mi> <mi>r</mi> </mrow> </msub> </semantics></math> of the perpendicular-cross filtering. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>f</mi> <mi>a</mi> <mi>r</mi> </mrow> </msub> </semantics></math> with different star SNR; (<b>b</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>f</mi> <mi>a</mi> <mi>r</mi> </mrow> </msub> </semantics></math> with different target lengths; (<b>c</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>f</mi> <mi>a</mi> <mi>r</mi> </mrow> </msub> </semantics></math> with different target SNR.</p>
Full article ">Figure 18
<p><math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>t</mi> <mi>r</mi> </mrow> </msub> </semantics></math> of the perpendicular-cross filtering. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>t</mi> <mi>r</mi> </mrow> </msub> </semantics></math> with different star SNR; (<b>b</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>t</mi> <mi>r</mi> </mrow> </msub> </semantics></math> with different target lengths; (<b>c</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>t</mi> <mi>r</mi> </mrow> </msub> </semantics></math> with different target SNR.</p>
Full article ">Figure 19
<p>Comparison of experimental results on target recognition probability. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>r</mi> </mrow> </msub> </semantics></math> with different star SNR; (<b>b</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>r</mi> </mrow> </msub> </semantics></math> with different target lengths; (<b>c</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>t</mi> <mi>r</mi> </mrow> </msub> </semantics></math> with different target SNR.</p>
Full article ">Figure 20
<p>Comparison of experimental results on false alarm probability. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>f</mi> <mi>a</mi> </mrow> </msub> </semantics></math> with different star SNR; (<b>b</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>f</mi> <mi>a</mi> </mrow> </msub> </semantics></math> with different target lengths; (<b>c</b>) <math display="inline"><semantics> <msub> <mi>P</mi> <mrow> <mi>f</mi> <mi>a</mi> </mrow> </msub> </semantics></math> with different target SNR.</p>
Full article ">Figure 21
<p>Raw real star image.</p>
Full article ">Figure 22
<p>The detection results of the real star image by the baseline and proposed methods. (<b>a</b>) saturated layer. (<b>b</b>) Background estimation. (<b>c</b>) Spike noise. (<b>d</b>) Bright layer by the baseline method. (<b>e</b>) Dark layer by the baseline method. (<b>f</b>) Detection results by the baseline method. (<b>g</b>) Bright layer by the proposed method. (<b>h</b>) Dark layer by the proposed method. (<b>i</b>) Detection results by the proposed method.</p>
Full article ">
19 pages, 2519 KiB  
Article
Deep Learning vs. Machine Learning for Intrusion Detection in Computer Networks: A Comparative Study
by Md Liakat Ali, Kutub Thakur, Suzanna Schmeelk, Joan Debello and Denise Dragos
Appl. Sci. 2025, 15(4), 1903; https://doi.org/10.3390/app15041903 - 12 Feb 2025
Abstract
In response to the increasing volume of network traffic and the growing sophistication of cyber threats, this study examines the use of deep learning-based intrusion detection systems (IDSs) in large-scale network environments. Traditional IDS face challenges such as high false positive rates, complex [...] Read more.
In response to the increasing volume of network traffic and the growing sophistication of cyber threats, this study examines the use of deep learning-based intrusion detection systems (IDSs) in large-scale network environments. Traditional IDS face challenges such as high false positive rates, complex feature engineering, and class imbalances in datasets, all of which impede accurate threat detection. To overcome these limitations, we implement various deep learning models, including multilayer perceptron (MLP), convolutional neural network (CNN), and long short-term memory (LSTM), alongside traditional machine learning algorithms such as logistic regression, naive Bayes, random forest, K-nearest neighbors, and decision trees. A significant contribution of this study is the application of the synthetic minority over-sampling technique (SMOTE) to address class imbalance, enhancing the representativeness of the learning process. Additionally, we conduct a comprehensive performance comparison of the models, incorporating correlation-based feature selection and hyperparameter tuning to maximize detection accuracy. Our results indicate that deep learning models, particularly CNN and LSTM, outperform traditional machine learning approaches in cyber threat detection, achieving accuracy rates of 98%. However, random forest achieves the highest accuracy at 99.9%, demonstrating its effectiveness in structured intrusion detection tasks. Moreover, we evaluate computational efficiency and practical deployment considerations, discussing trade-offs between accuracy and resource consumption. These findings highlight the potential of deep learning-based IDS for large-scale network security applications while addressing key challenges such as interpretability and computational overhead. The study provides actionable insights for selecting the most suitable IDS models based on specific network environments and security requirements. Full article
(This article belongs to the Special Issue Advances in Machine Learning and Big Data Analytics)
Show Figures

Figure 1

Figure 1
<p>Data distribution before applying any data balancing mechanism.</p>
Full article ">Figure 2
<p>Data distribution after applying SMOTE balancing mechanism.</p>
Full article ">Figure 3
<p>Correlation heatmap showing the relationships between features after feature engineering, highlighting significant correlations among variables.</p>
Full article ">Figure 4
<p>Confusion matrices showing the performance of logistic regression (LR), naive Bayes (NB), decision trees (DTs), random forest (RF), K-nearest neighbors (KNNs), and support vector machines (SVMs) models in classifying network intrusions.</p>
Full article ">Figure 5
<p>Confusion matrices for MLP, CNN, and LSTM models to assess classification performance, including true positive, true negative, false positive, and false negative rates.</p>
Full article ">Figure 6
<p>Training and validation accuracy comparison of MLP, CNN, and LSTM models across epochs to evaluate model performance and generalization.</p>
Full article ">
Back to TopTop