Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (6)

Search Parameters:
Keywords = dynamic adaptive neighborhood radius

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
21 pages, 2832 KiB  
Article
A Crossover Adjustment Method Considering the Beam Incident Angle for a Multibeam Bathymetric Survey Based on USV Swarms
by Qiang Yuan, Weiming Xu, Shaohua Jin and Tong Sun
J. Mar. Sci. Eng. 2025, 13(7), 1364; https://doi.org/10.3390/jmse13071364 - 17 Jul 2025
Viewed by 257
Abstract
Multibeam echosounder systems (MBESs) are widely used in unmanned surface vehicle swarms (USVs) to perform various marine bathymetry surveys because of their excellent performance. To address the challenges of systematic error superposition and edge beam error propagation in multibeam bathymetry surveying, this study [...] Read more.
Multibeam echosounder systems (MBESs) are widely used in unmanned surface vehicle swarms (USVs) to perform various marine bathymetry surveys because of their excellent performance. To address the challenges of systematic error superposition and edge beam error propagation in multibeam bathymetry surveying, this study proposes a novel error adjustment method integrating crossover error density clustering and beam incident angle (BIA) compensation. Firstly, a bathymetry error detection model was developed based on adaptive Density-Based Spatial Clustering of Applications with Noise (DBSCAN). By optimizing the neighborhood radius and minimum sample threshold through analyzing sliding-window curvature, the method achieved the automatic identification of outliers, reducing crossover discrepancies from ±150 m to ±50 m in the deep sea at a depth of approximately 5000 m. Secondly, an asymmetric quadratic surface correction model was established by incorporating the BIA as a key parameter. A dynamic weight matrix ω = 1/(1 + 0.5θ2) was introduced to suppress edge beam errors, combined with Tikhonov regularization to resolve ill-posed matrix issues. Experimental validation in the Western Pacific demonstrated that the RMSE of crossover points decreased by about 30.4% and the MAE was reduced by 57.3%. The proposed method effectively corrects residual systematic errors while maintaining topographic authenticity, providing a reference for improving the quality of multibeam bathymetric data obtained via USVs and enhancing measurement efficiency. Full article
(This article belongs to the Special Issue Technical Applications and Latest Discoveries in Seafloor Mapping)
Show Figures

Figure 1

24 pages, 30364 KiB  
Article
Bayesian Denoising Algorithm for Low SNR Photon-Counting Lidar Data via Probabilistic Parameter Optimization Based on Signal and Noise Distribution
by Qi Liu, Jian Yang, Yue Ma, Wenbo Yu, Qijin Han, Zhibiao Zhou and Song Li
Remote Sens. 2025, 17(13), 2182; https://doi.org/10.3390/rs17132182 - 25 Jun 2025
Viewed by 318
Abstract
The Ice, Cloud, and land Elevation Satellite-2 has provided unprecedented global surface elevation measurements through photon-counting Lidar (Light detection and ranging), yet its low signal-to-noise ratio (SNR) poses significant challenges for denoising algorithms. Existing methods, relying on fixed parameters, struggle to adapt to [...] Read more.
The Ice, Cloud, and land Elevation Satellite-2 has provided unprecedented global surface elevation measurements through photon-counting Lidar (Light detection and ranging), yet its low signal-to-noise ratio (SNR) poses significant challenges for denoising algorithms. Existing methods, relying on fixed parameters, struggle to adapt to dynamic noise distribution in rugged mountain regions where signal and noise change rapidly. This study proposes an adaptive Bayesian denoising algorithm integrating minimum spanning tree (MST) -based slope estimation and probabilistic parameter optimization. First, a simulation framework based on ATL03 data generates point clouds with ground truth labels under varying SNRs, achieving correlation coefficients > 0.9 between simulated and measured distributions. The algorithm then extracts surface profiles via MST and coarse filtering, fits slopes with >0.9 correlation to reference data, and derives the probability distribution function (PDF) of neighborhood photon counts. Bayesian estimation dynamically selects optimal clustering parameters (search radius and threshold), achieving F-scores > 0.9 even at extremely low SNR (1 photon/10 MHz noise). Validation against three benchmark algorithms (OPTICS, quadtree, DRAGANN) on simulated and ATL03 datasets demonstrates superior performance in mountainous terrain, with precision and recall improvements of 10–20% under high noise conditions. This work provides a robust framework for adaptive parameter selection in low-SNR photon-counting Lidar applications. Full article
Show Figures

Graphical abstract

16 pages, 5600 KiB  
Article
Cultural Dissemination on Evolving Networks: A Modified Axelrod Model Based on a Rewiring Process
by Yuri Perez, Fabio Henrique Pereira and Pedro Henrique Triguis Schimit
Games 2025, 16(2), 18; https://doi.org/10.3390/g16020018 - 17 Apr 2025
Viewed by 1154
Abstract
In this paper, we investigate the classical Axelrod model of cultural dissemination under an adaptive network framework. Unlike the original model, we place agents on a complex network, where they cut connections with any agent that does not share at least one cultural [...] Read more.
In this paper, we investigate the classical Axelrod model of cultural dissemination under an adaptive network framework. Unlike the original model, we place agents on a complex network, where they cut connections with any agent that does not share at least one cultural trait. This rewiring process alters the network topology, and key parameters—such as the number of traits, the neighborhood search range, and the degree-based preferential attachment exponent—also influence the distribution of cultural traits. Unlike conventional Axelrod models, our approach introduces a dynamic network structure where the rewiring mechanism allows agents to actively modify their social connections based on cultural similarity. This adaptation leads to network fragmentation or consolidation depending on the interaction among model parameters, offering a framework to study cultural homogeneity and diversity. The results show that, while long-range reconnections can promote more homogeneous clusters in certain conditions, variations in the local search radius and preferential attachment can lead to rich and sometimes counterintuitive dynamics. Extensive simulations demonstrate that this adaptive mechanism can either increase or decrease cultural diversity, depending on the interplay of network structure and cultural dissemination parameters. These findings have practical implications for understanding opinion dynamics and cultural polarization in social networks, particularly in digital environments where rewiring mechanisms are analogous to recommendation systems or user-driven connection adjustments. Full article
(This article belongs to the Section Learning and Evolution in Games)
Show Figures

Figure 1

32 pages, 8796 KiB  
Article
A Direction-Adaptive DBSCAN-Based Method for Denoising ICESat-2 Photon Point Clouds in Forested Environments
by Congying Zhang, Ruirui Wang, Banghui Yang, Le Yang, Yaoyao Yang, Fei Liu and Kaiwei Xiong
Forests 2025, 16(3), 524; https://doi.org/10.3390/f16030524 - 16 Mar 2025
Cited by 2 | Viewed by 521
Abstract
With the launch of the ICESat-2 satellite, global-scale forest parameter monitoring has entered a new phase. However, the background noise in ICESat-2 lidar data significantly impairs the accuracy of signal photon extraction. This study introduces a direction-adaptive DBSCAN method for denoising ICESat-2 photon [...] Read more.
With the launch of the ICESat-2 satellite, global-scale forest parameter monitoring has entered a new phase. However, the background noise in ICESat-2 lidar data significantly impairs the accuracy of signal photon extraction. This study introduces a direction-adaptive DBSCAN method for denoising ICESat-2 photon point clouds, integrating elevation histogram-based coarse denoising with adaptive clustering for fine denoising. The method is applied to data from the Gongbella River Nature Reserve. An innovative aspect of this approach is the introduction of elliptical tilt angle adaptation, which dynamically adjusts the elliptical orientation of the photon point cloud to determine the optimal tilt angle, thus optimizing the denoising effect and reducing computational and memory demands. The direction-adaptive DBSCAN algorithm improves denoising accuracy by dynamically adjusting the neighborhood radius based on the elliptic tilt angle and the distribution of the point cloud. Additionally, the density threshold selection is optimized using the Otsu method, enhancing the accuracy of distinguishing noise photons from signal photons. The method was validated using data from the Gongbella River Nature Reserve, showing significant improvements in denoising accuracy. Compared to existing methods, recall (R) increased by 6.91%, precision (P) improved by 8.82%, and both the F1-score and accuracy rose by 9.52%. The photon point cloud denoising algorithm demonstrated substantial accuracy improvements across multiple data strips, making it particularly effective for processing complex data from ICESat-2, with broad application potential. Both quantitative and qualitative analyses confirm that the algorithm outperforms traditional methods in signal-to-noise ratio and denoising performance, providing reliable technical support for extracting photon point cloud elevation data from forest surfaces and canopies. Full article
(This article belongs to the Section Forest Inventory, Modeling and Remote Sensing)
Show Figures

Figure 1

20 pages, 4010 KiB  
Article
A Novel Discrete Group Teaching Optimization Algorithm for TSP Path Planning with Unmanned Surface Vehicles
by Shaolong Yang, Jin Huang, Weichao Li and Xianbo Xiang
J. Mar. Sci. Eng. 2022, 10(9), 1305; https://doi.org/10.3390/jmse10091305 - 15 Sep 2022
Cited by 11 | Viewed by 2625
Abstract
A growing number of researchers are interested in deploying unmanned surface vehicles (USVs) in support of ocean environmental monitoring. To accomplish these missions efficiently, multiple-waypoint path planning strategies for survey USVs are still a key challenge. The multiple-waypoint path planning problem, mathematically equivalent [...] Read more.
A growing number of researchers are interested in deploying unmanned surface vehicles (USVs) in support of ocean environmental monitoring. To accomplish these missions efficiently, multiple-waypoint path planning strategies for survey USVs are still a key challenge. The multiple-waypoint path planning problem, mathematically equivalent to the traveling salesman problem (TSP), is addressed in this paper using a discrete group teaching optimization algorithm (DGTOA). Generally, the algorithm consists of three phases. In the initialization phase, the DGTOA generates the initial sequence for students through greedy initialization. In the crossover phase, a new greedy crossover algorithm is introduced to increase diversity. In the mutation phase, to balance the exploration and exploitation, this paper proposes a dynamic adaptive neighborhood radius based on triangular probability selection to apply in the shift mutation algorithm, the inversion mutation algorithm, and the 3-opt mutation algorithm. To verify the performance of the DGTOA, fifteen benchmark cases from TSPLIB are implemented to compare the DGTOA with the discrete tree seed algorithm, discrete Jaya algorithm, artificial bee colony optimization, particle swarm optimization-ant colony optimization, and discrete shuffled frog-leaping algorithm. The results demonstrate that the DGTOA is a robust and competitive algorithm, especially for large-scale TSP problems. Meanwhile, the USV simulation results indicate that the DGTOA performs well in terms of exploration and exploitation. Full article
(This article belongs to the Section Marine Environmental Science)
Show Figures

Figure 1

21 pages, 8574 KiB  
Article
Adaptive Polar-Grid Gaussian-Mixture Model for Foreground Segmentation Using Roadside LiDAR
by Luyang Wang and Jinhui Lan
Remote Sens. 2022, 14(11), 2522; https://doi.org/10.3390/rs14112522 - 25 May 2022
Cited by 6 | Viewed by 2978
Abstract
Roadside LiDAR has become an important sensor for the detection of objects in cities, such as vehicles and pedestrians, which is due to its advantages of all-weather operation and high-ranging accuracy. In order to serve an intelligent transportation system, the efficient and accurate [...] Read more.
Roadside LiDAR has become an important sensor for the detection of objects in cities, such as vehicles and pedestrians, which is due to its advantages of all-weather operation and high-ranging accuracy. In order to serve an intelligent transportation system, the efficient and accurate segmentation of vehicles and pedestrians is needed in the coverage area of the LiDAR. In this study, a roadside LiDAR was fixed on brackets on both sides of the road to obtain the point-cloud information on the urban road and the surrounding environment. A segmentation method that is based on a scanning LiDAR sensor is proposed. First, a polar grid that is based on polar coordinates is constructed to count the LiDAR rotations to obtain the original information of the angle and the distance of the point cloud, and the background point-cloud image is dynamically updated over time. By aiming at the complex urban road environment and the interference of trees and light poles in the background, an adaptive polar-grid Gaussian-mixture model (APG-GMM) that uses a point-cloud method is proposed to improve the accuracy of the foreground and background segmentation. A density-adaptive DBSCAN target-clustering algorithm is proposed, as well as a dynamic adaptive neighborhood radius, to solve the problem of the low clustering accuracy that is caused by the uneven density of point clouds that are collected by LiDAR, and to divide the point clouds in the foreground into vehicles and pedestrians. Finally, the method was tested at intersections and urban roads with dense traffic flows. The experimental results show that the proposed algorithm can segment the foreground and background well and can cluster vehicles and pedestrians while reducing the number of calculations and the time complexity. Full article
(This article belongs to the Special Issue Laser Scanning and Point Cloud Processing in Urban Environments)
Show Figures

Graphical abstract

Back to TopTop