Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
 
 
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

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (299)

Search Parameters:
Keywords = sparse grids

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
30 pages, 4085 KiB  
Article
A Highly Efficient Compressive Sensing Algorithm Based on Root-Sparse Bayesian Learning for RFPA Radar
by Ju Wang, Bingqi Shan, Song Duan and Qin Zhang
Remote Sens. 2024, 16(19), 3564; https://doi.org/10.3390/rs16193564 - 25 Sep 2024
Viewed by 317
Abstract
Off-grid issues and high computational complexity are two major challenges faced by sparse Bayesian learning (SBL)-based compressive sensing (CS) algorithms used for random frequency pulse interval agile (RFPA) radar. Therefore, this paper proposes an off-grid CS algorithm for RFPA radar based on Root-SBL [...] Read more.
Off-grid issues and high computational complexity are two major challenges faced by sparse Bayesian learning (SBL)-based compressive sensing (CS) algorithms used for random frequency pulse interval agile (RFPA) radar. Therefore, this paper proposes an off-grid CS algorithm for RFPA radar based on Root-SBL to address these issues. To effectively cope with off-grid issues, this paper derives a root-solving formula inspired by the Root-SBL algorithm for velocity parameters applicable to RFPA radar, thus enabling the proposed algorithm to directly solve the velocity parameters of targets during the fine search stage. Meanwhile, to ensure computational feasibility, the proposed algorithm utilizes a simple single-level hierarchical prior distribution model and employs the derived root-solving formula to avoid the refinement of velocity grids. Moreover, during the fine search stage, the proposed algorithm combines the fixed-point strategy with the Expectation-Maximization algorithm to update the hyperparameters, further reducing computational complexity. In terms of implementation, the proposed algorithm updates hyperparameters based on the single-level prior distribution to approximate values for the range and velocity parameters during the coarse search stage. Subsequently, in the fine search stage, the proposed algorithm performs a grid search only in the range dimension and uses the derived root-solving formula to directly solve for the target velocity parameters. Simulation results demonstrate that the proposed algorithm maintains low computational complexity while exhibiting stable performance for parameter estimation in various multi-target off-grid scenarios. Full article
(This article belongs to the Topic Radar Signal and Data Processing with Applications)
Show Figures

Graphical abstract

16 pages, 34354 KiB  
Article
Autonomous Vehicles Traversability Mapping Fusing Semantic–Geometric in Off-Road Navigation
by Bo Zhang, Weili Chen, Chaoming Xu, Jinshi Qiu and Shiyu Chen
Drones 2024, 8(9), 496; https://doi.org/10.3390/drones8090496 - 18 Sep 2024
Viewed by 707
Abstract
This paper proposes an evaluating and mapping methodology of terrain traversability for off-road navigation of autonomous vehicles in unstructured environments. Terrain features are extracted from RGB images and 3D point clouds to create a traversal cost map. The cost map is then employed [...] Read more.
This paper proposes an evaluating and mapping methodology of terrain traversability for off-road navigation of autonomous vehicles in unstructured environments. Terrain features are extracted from RGB images and 3D point clouds to create a traversal cost map. The cost map is then employed to plan safe trajectories. Bayesian generalized kernel inference is employed to assess unknown grid attributes due to the sparse raw point cloud data. A Kalman filter also creates density local elevation maps in real time by fusing multiframe information. Consequently, the terrain semantic mapping procedure considers the uncertainty of semantic segmentation and the impact of sensor noise. A Bayesian filter is used to update the surface semantic information in a probabilistic manner. Ultimately, the elevation map is utilized to extract geometric characteristics, which are then integrated with the probabilistic semantic map. This combined map is then used in conjunction with the extended motion primitive planner to plan the most effective trajectory. The experimental results demonstrate that the autonomous vehicles obtain a success rate enhancement ranging from 4.4% to 13.6% and a decrease in trajectory roughness ranging from 5.1% to 35.8% when compared with the most developed outdoor navigation algorithms. Additionally, the autonomous vehicles maintain a terrain surface selection accuracy of over 85% during the navigation process. Full article
Show Figures

Figure 1

15 pages, 2307 KiB  
Article
Information-Theoretic Modeling of Categorical Spatiotemporal GIS Data
by David Percy and Martin Zwick
Entropy 2024, 26(9), 784; https://doi.org/10.3390/e26090784 - 13 Sep 2024
Viewed by 359
Abstract
An information-theoretic data mining method is employed to analyze categorical spatiotemporal Geographic Information System land use data. Reconstructability Analysis (RA) is a maximum-entropy-based data modeling methodology that works exclusively with discrete data such as those in the National Land Cover Database (NLCD). The [...] Read more.
An information-theoretic data mining method is employed to analyze categorical spatiotemporal Geographic Information System land use data. Reconstructability Analysis (RA) is a maximum-entropy-based data modeling methodology that works exclusively with discrete data such as those in the National Land Cover Database (NLCD). The NLCD is organized into a spatial (raster) grid and data are available in a consistent format for every five years from 2001 to 2021. An NLCD tool reports how much change occurred for each category of land use; for the study area examined, the most dynamic class is Evergreen Forest (EFO), so the presence or absence of EFO in 2021 was chosen as the dependent variable that our data modeling attempts to predict. RA predicts the outcome with approximately 80% accuracy using a sparse set of cells from a spacetime data cube consisting of neighboring lagged-time cells. When the predicting cells are all Shrubs and Grasses, there is a high probability for a 2021 state of EFO, while when the predicting cells are all EFO, there is a high probability that the 2021 state will not be EFO. These findings are interpreted as detecting forest clear-cut cycles that show up in the data and explain why this class is so dynamic. This study introduces a new approach to analyzing GIS categorical data and expands the range of applications that this entropy-based methodology can successfully model. Full article
(This article belongs to the Section Multidisciplinary Applications)
Show Figures

Figure 1

26 pages, 14062 KiB  
Article
Off-Grid Underwater Acoustic Source Direction-of-Arrival Estimation Method Based on Iterative Empirical Mode Decomposition Interval Threshold
by Chuanxi Xing, Guangzhi Tan and Saimeng Dong
Sensors 2024, 24(17), 5835; https://doi.org/10.3390/s24175835 - 8 Sep 2024
Viewed by 551
Abstract
To solve the problem that the hydrophone arrays are disturbed by ocean noise when collecting signals in shallow seas, resulting in reduced accuracy and resolution of target orientation estimation, a direction-of-arrival (DOA) estimation algorithm based on iterative EMD interval thresholding (EMD-IIT) and off-grid [...] Read more.
To solve the problem that the hydrophone arrays are disturbed by ocean noise when collecting signals in shallow seas, resulting in reduced accuracy and resolution of target orientation estimation, a direction-of-arrival (DOA) estimation algorithm based on iterative EMD interval thresholding (EMD-IIT) and off-grid sparse Bayesian learning is proposed. Firstly, the noisy signal acquired by the hydrophone array is denoised by the EMD-IIT algorithm. Secondly, the singular value decomposition is performed on the denoised signal, and then an off-grid sparse reconstruction model is established. Finally, the maximum a posteriori probability of the target signal is obtained by the Bayesian learning algorithm, and the DOA estimate of the target is derived to achieve the orientation estimation of the target. Simulation analysis and sea trial data results show that the algorithm achieves a resolution probability of 100% at an azimuthal separation of 8° between adjacent signal sources. At a low signal-to-noise ratio of −9 dB, the resolution probability reaches 100%. Compared with the conventional MUSIC-like and OGSBI-SVD algorithms, this algorithm can effectively eliminate noise interference and provides better performance in terms of localization accuracy, algorithm runtime, and algorithm robustness. Full article
(This article belongs to the Section Remote Sensors)
Show Figures

Figure 1

22 pages, 12863 KiB  
Article
Remote and Proximal Sensors Data Fusion: Digital Twins in Irrigation Management Zoning
by Hugo Rodrigues, Marcos B. Ceddia, Wagner Tassinari, Gustavo M. Vasques, Ziany N. Brandão, João P. S. Morais, Ronaldo P. Oliveira, Matheus L. Neves and Sílvio R. L. Tavares
Sensors 2024, 24(17), 5742; https://doi.org/10.3390/s24175742 - 4 Sep 2024
Viewed by 392
Abstract
The scientific field of precision agriculture employs increasingly innovative techniques to optimize inputs, maximize profitability, and reduce environmental impact. However, obtaining a high number of soil samples is challenging in order to make precision agriculture viable. There is a trade-off between the amount [...] Read more.
The scientific field of precision agriculture employs increasingly innovative techniques to optimize inputs, maximize profitability, and reduce environmental impact. However, obtaining a high number of soil samples is challenging in order to make precision agriculture viable. There is a trade-off between the amount of data needed and the time and resources spent to obtain these data compared to the accuracy of the maps produced with more or fewer points. In the present study, the research was based on an exhaustive dataset of apparent electrical conductivity (aEC) containing 3906 points distributed along 26 transects with spacing between each of up to 40 m, measured by the proximal soil sensor EM38-MK2, for a grain-producing area of 72 ha in São Paulo, Brazil. A second sparse dataset was simulated, showing only four transects with a 400 m distance and, in the end, only 162 aEC points. The aEC map via ordinary kriging (OK) from the grid with 26 transects was considered the reference, and two other mapping approaches were used to map aEC via sparse grid: kriging with external drift (KED) and geographically weighted regression (GWR). These last two methods allow the increment of auxiliary variables, such as those obtained by remote sensors that present spatial resolution compatible with the pivot scale, such as data from the Landsat-8, Aster, and Sentinel-2 satellites, as well as ten terrain covariates derived from the Alos Palsar digital elevation model. The KED method, when used with the sparse dataset, showed a relatively good fit to the aEC data (R2 = 0.78), with moderate prediction accuracy (MAE = 1.26, RMSE = 1.62) and reasonable predictability (RPD = 1.76), outperforming the GWR method, which had the weakest performance (R2 = 0.57, MAE = 1.78, RMSE = 2.30, RPD = 0.81). The reference aEC map using the exhaustive dataset and OK showed the highest accuracy with an R2 of 0.97, no systematic bias (ME = 0), and excellent precision (RMSE = 0.56, RPD = 5.86). Management zones (MZs) derived from these maps were validated using soil texture data from clay samples measured at 0–10 cm depth in a grid of 72 points. The KED method demonstrated the highest potential for accurately defining MZs for irrigation, producing a map that closely resembled the reference MZ map, thereby providing reliable guidance for irrigation management. Full article
(This article belongs to the Special Issue Sensors and Artificial Intelligence in Smart Agriculture)
Show Figures

Figure 1

18 pages, 7128 KiB  
Article
RGBTSDF: An Efficient and Simple Method for Color Truncated Signed Distance Field (TSDF) Volume Fusion Based on RGB-D Images
by Yunqiang Li, Shuowen Huang, Ying Chen, Yong Ding, Pengcheng Zhao, Qingwu Hu and Xujie Zhang
Remote Sens. 2024, 16(17), 3188; https://doi.org/10.3390/rs16173188 - 29 Aug 2024
Viewed by 588
Abstract
RGB-D image mapping is an important tool in applications such as robotics, 3D reconstruction, autonomous navigation, and augmented reality (AR). Efficient and reliable mapping methods can improve the accuracy, real-time performance, and flexibility of sensors in various fields. However, the currently widely used [...] Read more.
RGB-D image mapping is an important tool in applications such as robotics, 3D reconstruction, autonomous navigation, and augmented reality (AR). Efficient and reliable mapping methods can improve the accuracy, real-time performance, and flexibility of sensors in various fields. However, the currently widely used Truncated Signed Distance Field (TSDF) still suffers from the problem of inefficient memory management, making it difficult to directly use it for large-scale 3D reconstruction. In order to address this problem, this paper proposes a highly efficient and accurate TSDF voxel fusion method, RGBTSDF. First, based on the sparse characteristics of the volume, an improved grid octree is used to manage the whole scene, and a hard coding method is proposed for indexing. Second, during the depth map fusion process, the depth map is interpolated to achieve a more accurate voxel fusion effect. Finally, a mesh extraction method with texture constraints is proposed to overcome the effects of noise and holes and improve the smoothness and refinement of the extracted surface. We comprehensively evaluate RGBTSDF and similar methods through experiments on public datasets and the datasets collected by commercial scanning devices. Experimental results show that RGBTSDF requires less memory and can achieve real-time performance experience using only the CPU. It also improves fusion accuracy and achieves finer grid details. Full article
(This article belongs to the Special Issue New Insight into Point Cloud Data Processing)
Show Figures

Figure 1

21 pages, 4390 KiB  
Article
Mapping Shrub Biomass at 10 m Resolution by Integrating Field Measurements, Unmanned Aerial Vehicles, and Multi-Source Satellite Observations
by Wenchao Liu, Jie Wang, Yang Hu, Taiyong Ma, Munkhdulam Otgonbayar, Chunbo Li, You Li and Jilin Yang
Remote Sens. 2024, 16(16), 3095; https://doi.org/10.3390/rs16163095 - 22 Aug 2024
Viewed by 791
Abstract
Accurately estimating shrub biomass in arid and semi-arid regions is critical for understanding ecosystem productivity and carbon stocks at both local and global scales. Due to the short and sparse features of shrubs, capturing the shrub biomass accurately by satellite observations is challenging. [...] Read more.
Accurately estimating shrub biomass in arid and semi-arid regions is critical for understanding ecosystem productivity and carbon stocks at both local and global scales. Due to the short and sparse features of shrubs, capturing the shrub biomass accurately by satellite observations is challenging. Previous studies mostly used ground samples and satellite observations to estimate shrub biomass by establishing a direct connection, which was often hindered by the limited number of ground samples and spatial scale mismatch between samples and observations. Unmanned aerial vehicles (UAVs) provide opportunities to obtain more samples that are in line with the aspects of satellite observations (i.e., scale) for regional-scale shrub biomass estimations accurately with low costs. However, few studies have been conducted based on the air-space-ground-scale connection assisted by UAVs. Here we developed a framework for estimating 10 m shrub biomass at a regional scale by integrating ground measurements, UAV, Landsat, and Sentinel-1/2 observations. First, the spatial distribution map of shrublands and non-shrublands was generated in 2023 in the Helan Mountains of Ningxia province, China. This map had an F1 score of 0.92. Subsequently, the UAV-based shrub biomass map was estimated using an empirical model between the biomass and the crown area of shrubs, which was aggregated at a 10 m × 10 m grid to match the spatial resolution of Sentinel-1/2 images. Then, a regional-scale estimation model of shrub biomass was developed with a random forest regression (RFR) approach driven by ground biomass measurements, UAV-based biomass, and the optimal satellite metrics. Finally, the developed model was used to produce the biomass map of shrublands over the study area in 2023. The uncertainty of the resultant biomass map was characterized by the pixel-level standard deviation (SD) using the leave-one-out cross-validation (LOOCV) method. The results suggested that the integration of multi-scale observations from the ground, UAVs, and satellites provided a promising approach to obtaining the regional shrub biomass accurately. Our developed model, which integrates satellite spectral bands and vegetation indices (R2 = 0.62), outperformed models driven solely by spectral bands (R2 = 0.33) or vegetation indices (R2 = 0.55). In addition, our estimated biomass has an average uncertainty of less than 4%, with the lowest values (<2%) occurring in regions with high shrub coverage (>30%) and biomass production (>300 g/m2). This study provides a methodology to accurately monitor the shrub biomass from satellite images assisted by near-ground UAV observations as well as ground measurements. Full article
(This article belongs to the Special Issue Crops and Vegetation Monitoring with Remote/Proximal Sensing II)
Show Figures

Figure 1

27 pages, 8277 KiB  
Article
High-Resolution Identification of Sound Sources Based on Sparse Bayesian Learning with Grid Adaptive Split Refinement
by Wei Pan, Daofang Feng, Youtai Shi, Yan Chen and Min Li
Appl. Sci. 2024, 14(16), 7374; https://doi.org/10.3390/app14167374 - 21 Aug 2024
Viewed by 431
Abstract
Sound source identification technology based on a microphone array has many application scenarios. The compressive beamforming method has attracted much attention due to its high accuracy and high-resolution performance. However, for the far-field measurement problem of large microphone arrays, existing methods based on [...] Read more.
Sound source identification technology based on a microphone array has many application scenarios. The compressive beamforming method has attracted much attention due to its high accuracy and high-resolution performance. However, for the far-field measurement problem of large microphone arrays, existing methods based on fixed grids have the defect of basis mismatch. Due to the large number of grid points representing potential sound source locations, the identification accuracy of traditional grid adjustment methods also needs to be improved. To solve this problem, this paper proposes a sound source identification method based on adaptive grid splitting and refinement. First, the initial source locations are obtained through a sparse Bayesian learning framework. Then, higher-weight candidate grids are retained, and local regions near them are split and updated. During the iteration process, Green’s function and the source strength obtained in the previous iteration are multiplied to get the sound pressure matrix. The robust principal component analysis model of the Gaussian mixture separates and replaces the sound pressure matrix with a low-rank matrix. The actual sound source locations are gradually approximated through the dynamically adjusted sound pressure low-rank matrix and optimized grid transfer matrix. The performance of the method is verified through numerical simulations. In addition, experiments on a standard aircraft model are conducted in a wind tunnel and speakers are installed on the model, proving that the proposed method can achieve fast, high-precision imaging of low-frequency sound sources in an extensive dynamic range at long distances. Full article
(This article belongs to the Special Issue Noise Measurement, Acoustic Signal Processing and Noise Control)
Show Figures

Figure 1

17 pages, 7933 KiB  
Article
Short-Term Wind Power Prediction Based on a Variational Mode Decomposition–BiTCN–Psformer Hybrid Model
by Wu Xu, Wenjing Dai, Dongyang Li and Qingchang Wu
Energies 2024, 17(16), 4089; https://doi.org/10.3390/en17164089 - 17 Aug 2024
Viewed by 516
Abstract
Precise wind power forecasting is essential for the successful integration of wind power into the power grid and for mitigating the potential effects of wind power on the power system. To enhance the precision of predictions, a hybrid VMD-BiTCN-Psformer model was devised. Firstly, [...] Read more.
Precise wind power forecasting is essential for the successful integration of wind power into the power grid and for mitigating the potential effects of wind power on the power system. To enhance the precision of predictions, a hybrid VMD-BiTCN-Psformer model was devised. Firstly, VMD divided the original sequence into several data components with varying time scales. Furthermore, the BiTCN network was utilized to extract the sequence features. These features, along with the climate features, were then input into the positional encoding and ProbSparse self-attention improved Transformer model. The outputs of these models were combined to obtain the ultimate wind power prediction results. For the prediction of the wind power in Fujian Province on April 26, four additional models were developed for comparison with the VMD-BiTCN-Psformer model. The VMD-BiTCN-Psformer model demonstrated the greatest level of forecast accuracy among all the models. The R2 increased by 22.27%, 12.38%, 8.93%, and 2.59%, respectively. Full article
(This article belongs to the Special Issue Advances in AI Methods for Wind Power Forecasting and Monitoring)
Show Figures

Figure 1

25 pages, 7836 KiB  
Article
Efficient Numerical Implementation of the Time-Fractional Stochastic Stokes–Darcy Model
by Zharasbek Baishemirov, Abdumauvlen Berdyshev, Dossan Baigereyev and Kulzhamila Boranbek
Fractal Fract. 2024, 8(8), 476; https://doi.org/10.3390/fractalfract8080476 - 14 Aug 2024
Viewed by 453
Abstract
This paper presents an efficient numerical method for the fractional-order generalization of the stochastic Stokes–Darcy model, which finds application in various engineering, biomedical and environmental problems involving interaction between free fluid flow and flows in porous media. Unlike the classical model, this model [...] Read more.
This paper presents an efficient numerical method for the fractional-order generalization of the stochastic Stokes–Darcy model, which finds application in various engineering, biomedical and environmental problems involving interaction between free fluid flow and flows in porous media. Unlike the classical model, this model allows taking into account the hereditary properties of the process under uncertainty conditions. The proposed numerical method is based on the combined use of the sparse grid stochastic collocation method, finite element/finite difference discretization, a fast numerical algorithm for computing the Caputo fractional derivative, and a cost-effective ensemble strategy. The hydraulic conductivity tensor is assumed to be uncertain in this problem, which is modeled by the reduced Karhunen–Loève expansion. The stability and convergence of the deterministic numerical method have been rigorously proved and validated by numerical tests. Utilizing the ensemble strategy allowed us to solve the deterministic problem once for all samples of the hydraulic conductivity tensor, rather than solving it separately for each sample. The use of the algorithm for computing the fractional derivatives significantly reduced both computational cost and memory usage. This study also analyzes the influence of fractional derivatives on the fluid flow process within the fractional-order Stokes–Darcy model under uncertainty conditions. Full article
(This article belongs to the Section Numerical and Computational Methods)
Show Figures

Figure 1

24 pages, 7108 KiB  
Article
Multilevel Quasi-Interpolation on Chebyshev Sparse Grids
by Faisal Alsharif
Computation 2024, 12(7), 149; https://doi.org/10.3390/computation12070149 - 18 Jul 2024
Viewed by 467
Abstract
This paper investigates the potential of utilising multilevel quasi-interpolation techniques on Chebyshev sparse grids for complex numerical computations. The paper starts by laying down the motivations for choosing Chebyshev sparse grids and quasi-interpolation methods with Gaussian kernels. It delves into the practical aspects [...] Read more.
This paper investigates the potential of utilising multilevel quasi-interpolation techniques on Chebyshev sparse grids for complex numerical computations. The paper starts by laying down the motivations for choosing Chebyshev sparse grids and quasi-interpolation methods with Gaussian kernels. It delves into the practical aspects of implementing these techniques. Various numerical experiments are performed to evaluate the efficiency and limitations of the multilevel quasi-sparse interpolation methods with dimensions two dimension and three dimension. The work ultimately aims to provide a comprehensive understanding of the computational efficiency and accuracy achievable through this approach, comparing its performance with traditional methods. Full article
Show Figures

Figure 1

18 pages, 1434 KiB  
Article
Scalable and Interpretable Forecasting of Hydrological Time Series Based on Variational Gaussian Processes
by Julián David Pastrana-Cortés, Julian Gil-Gonzalez, Andrés Marino Álvarez-Meza, David Augusto Cárdenas-Peña and Álvaro Angel Orozco-Gutiérrez
Water 2024, 16(14), 2006; https://doi.org/10.3390/w16142006 - 15 Jul 2024
Viewed by 596
Abstract
Accurate streamflow forecasting is crucial for effectively managing water resources, particularly in countries like Colombia, where hydroelectric power generation significantly contributes to the national energy grid. Although highly interpretable, traditional deterministic, physically-driven models often suffer from complexity and require extensive parameterization. Data-driven models [...] Read more.
Accurate streamflow forecasting is crucial for effectively managing water resources, particularly in countries like Colombia, where hydroelectric power generation significantly contributes to the national energy grid. Although highly interpretable, traditional deterministic, physically-driven models often suffer from complexity and require extensive parameterization. Data-driven models like Linear Autoregressive (LAR) and Long Short-Term Memory (LSTM) networks offer simplicity and performance but cannot quantify uncertainty. This work introduces Sparse Variational Gaussian Processes (SVGPs) for forecasting streamflow contributions. The proposed SVGP model reduces computational complexity compared to traditional Gaussian Processes, making it highly scalable for large datasets. The methodology employs optimal hyperparameters and shared inducing points to capture short-term and long-term relationships among reservoirs. Training, validation, and analysis of the proposed approach consider the streamflow dataset from 23 geographically dispersed reservoirs recorded during twelve years in Colombia. Performance assessment reveals that the proposal outperforms baseline Linear Autoregressive (LAR) and Long Short-Term Memory (LSTM) models in three key aspects: adaptability to changing dynamics, provision of informative confidence intervals through Bayesian inference, and enhanced forecasting accuracy. Therefore, the SVGP-based forecasting methodology offers a scalable and interpretable solution for multi-output streamflow forecasting, thereby contributing to more effective water resource management and hydroelectric planning. Full article
Show Figures

Figure 1

28 pages, 6703 KiB  
Article
An Efficient Sparse Recovery STAP Algorithm for Airborne Bistatic Radars Based on Atomic Selection under the Bayesian Framework
by Kun Liu, Tong Wang and Weijun Huang
Remote Sens. 2024, 16(14), 2534; https://doi.org/10.3390/rs16142534 - 10 Jul 2024
Viewed by 677
Abstract
The traditional sparse recovery (SR) space-time adaptive processing (STAP) algorithms are greatly affected by grid mismatch, leading to poor performance in airborne bistatic radar clutter suppression. In order to address this issue, this paper proposes an SR STAP algorithm for airborne bistatic radars [...] Read more.
The traditional sparse recovery (SR) space-time adaptive processing (STAP) algorithms are greatly affected by grid mismatch, leading to poor performance in airborne bistatic radar clutter suppression. In order to address this issue, this paper proposes an SR STAP algorithm for airborne bistatic radars based on atomic selection under the Bayesian framework. This method adopts the idea of atomic selection for the process of Bayesian inference, continuously evaluating the contribution of atoms to the likelihood function to add or remove atoms, and then using the selected atoms to estimate the clutter support subspace and perform sparse recovery in the clutter support subspace. Due to the inherent sparsity of clutter signals, performing sparse recovery in the clutter support subspace avoids using a massive number of atoms from an overcomplete space-time dictionary, thereby greatly improving computational efficiency. In airborne bistatic radar scenarios where significant grid mismatch exists, this method can mitigate the performance degradation caused by grid mismatch by encrypting grid points. Since the sparse recovery is performed in the clutter support subspace, encrypting grid points does not lead to excessive computational burden. Additionally, this method integrates out the noise term under a new hierarchical Bayesian model, preventing the adverse effects caused by inaccurate noise power estimation during iterations in the traditional SR STAP algorithms, further enhancing its performance. Our simulation results demonstrate the high efficiency and superior clutter suppression performance and target detection performance of this method. Full article
Show Figures

Graphical abstract

24 pages, 8534 KiB  
Article
A Data and Model-Driven Clutter Suppression Method for Airborne Bistatic Radar Based on Deep Unfolding
by Weijun Huang, Tong Wang and Kun Liu
Remote Sens. 2024, 16(14), 2516; https://doi.org/10.3390/rs16142516 - 9 Jul 2024
Viewed by 502
Abstract
Space–time adaptive processing (STAP) based on sparse recovery achieves excellent clutter suppression and target detection performance, even with a limited number of available training samples. However, most of these methods face performance degradation due to grid mismatch, which impedes their application in bistatic [...] Read more.
Space–time adaptive processing (STAP) based on sparse recovery achieves excellent clutter suppression and target detection performance, even with a limited number of available training samples. However, most of these methods face performance degradation due to grid mismatch, which impedes their application in bistatic clutter suppression. Some gridless methods, such as atomic norm minimization (ANM), can effectively address grid mismatch issues, yet they are sensitive to parameter settings and array errors. In this article, the authors propose a data and model-driven algorithm that unfolds the iterative process of atomic norm minimization into a deep network. This approach establishes a concrete and systematic link between iterative algorithms, extensively utilized in signal processing, and deep neural networks. This methodology not only addresses the challenges associated with parameter settings in traditional optimization algorithms, but also mitigates the lack of interpretability issues commonly found in deep neural networks. Moreover, due to more rational parameter settings, the proposed algorithm achieves effective clutter suppression with fewer iterations, thereby reducing computational time. Finally, extensive simulation experiments demonstrate the effectiveness of the proposed algorithm in clutter suppression for airborne bistatic radar. Full article
Show Figures

Figure 1

17 pages, 9818 KiB  
Article
Constraining the Geometry of NeRFs for Accurate DSM Generation from Multi-View Satellite Images
by Qifeng Wan, Yuzheng Guan, Qiang Zhao, Xiang Wen and Jiangfeng She
ISPRS Int. J. Geo-Inf. 2024, 13(7), 243; https://doi.org/10.3390/ijgi13070243 - 8 Jul 2024
Viewed by 992
Abstract
Neural Radiance Fields (NeRFs) are an emerging approach to 3D reconstruction that use neural networks to reconstruct scenes. However, its applications for multi-view satellite photogrammetry, which aim to reconstruct the Earth’s surface, struggle to acquire accurate digital surface models (DSMs). To address this [...] Read more.
Neural Radiance Fields (NeRFs) are an emerging approach to 3D reconstruction that use neural networks to reconstruct scenes. However, its applications for multi-view satellite photogrammetry, which aim to reconstruct the Earth’s surface, struggle to acquire accurate digital surface models (DSMs). To address this issue, a novel framework, Geometric Constrained Neural Radiance Field (GC-NeRF) tailored for multi-view satellite photogrammetry, is proposed. GC-NeRF achieves higher DSM accuracy from multi-view satellite images. The key point of this approach is a geometric loss term, which constrains the scene geometry by making the scene surface thinner. The geometric loss term alongside z-axis scene stretching and multi-view DSM fusion strategies greatly improve the accuracy of generated DSMs. During training, bundle-adjustment-refined satellite camera models are used to cast rays through the scene. To avoid the additional input of altitude bounds described in previous works, the sparse point cloud resulting from the bundle adjustment is converted to an occupancy grid to guide the ray sampling. Experiments on WorldView-3 images indicate GC-NeRF’s superiority in accurate DSM generation from multi-view satellite images. Full article
Show Figures

Figure 1

Back to TopTop