Search

Buildings are significant components of digital cities, and their precise extraction is essential for the three-dimensional modeling of cities. However, it is difficult to accurately extract building features effectively in complex scenes, especially where trees and buildings are tightly adhered. This paper proposes a highly accurate building point cloud extraction method based solely on the geometric information of points in two stages. The coarsely extracted building point cloud in the first stage is iteratively refined with the help of mask polygons and the region growing algorithm in the second stage. To enhance accuracy, this paper combines the Alpha Shape algorithm with the neighborhood expansion method to generate mask polygons, which help fill in missing boundary points caused by the region growing algorithm. In addition, this paper performs mask extraction on the original points rather than non-ground points to solve the problem of incorrect identification of facade points near the ground using the cloth simulation filtering algorithm. The proposed method has shown excellent extraction accuracy on the Urban-LiDAR and Vaihingen datasets. Specifically, the proposed method outperforms the PointNet network by 20.73% in precision for roof extraction of the Vaihingen dataset and achieves comparable performance with the state-of-the-art HDL-JME-GGO network. Additionally, the proposed method demonstrated high accuracy in extracting building points, even in scenes where buildings were closely adjacent to trees. [ABSTRACT FROM AUTHOR]

Underwater acoustic (UWA) channel prediction technology, as an important topic in UWA communication, has played an important role in UWA adaptive communication network and underwater target perception. Although many significant advancements have been achieved in underwater acoustic channel prediction over the years, a comprehensive summary and introduction is still lacking. As the first comprehensive overview of UWA channel prediction, this paper introduces past works and algorithm implementation methods of channel prediction from the perspective of linear, kernel-based, and deep learning approaches. Importantly, based on available at-sea experiment datasets, this paper compares the performance of current primary UWA channel prediction algorithms under a unified system framework, providing researchers with a comprehensive and objective understanding of UWA channel prediction. Finally, it discusses the directions and challenges for future research. The survey finds that linear prediction algorithms are the most widely applied, and deep learning, as the most advanced type of algorithm, has moved this field into a new stage. The experimental results show that the linear algorithms have the lowest computational complexity, and when the training samples are sufficient, deep learning algorithms have the best prediction performance. [ABSTRACT FROM AUTHOR]

To ensure the long-term stable and uninterrupted service of satellite navigation systems, the robustness and reliability of time–frequency systems are crucial. Integrity monitoring is an effective method to enhance the robustness and reliability of time–frequency systems. Time–frequency signals are fundamental for integrity monitoring, with their time differences and frequency biases serving as essential indicators. These indicators are influenced by the inherent characteristics of the time–frequency signals, as well as the links and equipment they traverse. Meanwhile, existing research primarily focuses on only monitoring the integrity of the time–frequency signals' output by the atomic clock group, neglecting the integrity monitoring of the time–frequency signals generated and distributed by the time–frequency signal generation and distribution subsystem. This paper introduces a time–frequency signal integrity monitoring algorithm based on the temperature compensation frequency bias combination model. By analyzing the characteristics of time difference measurements, constructing the temperature compensation frequency bias combination model, and extracting and monitoring noise and frequency bias features from the time difference measurements, the algorithm achieves comprehensive time–frequency signal integrity monitoring. Experimental results demonstrate that the algorithm can effectively detect, identify, and alert users to time–frequency signal faults. Additionally, the model and the integrity monitoring parameters developed in this paper exhibit high adaptability, making them directly applicable to the integrity monitoring of time–frequency signals across various links. Compared with traditional monitoring algorithms, the algorithm proposed in this paper greatly improves the effectiveness, adaptability, and real-time performance of time–frequency signal integrity monitoring. [ABSTRACT FROM AUTHOR]

Polar format algorithm (PFA) is a widely used high-resolution SAR imaging algorithm that can be implemented in advanced widefield staring synthetic aperture radar (WFS-SAR). However, existing algorithms have limited analysis in wavefront curvature error (WCE) and are challenging to apply to WFS-SAR with high-resolution and large-swath scenes. This paper proposes an extended polar format algorithm for joint envelope and phase error correction in WFS-SAR imaging with maneuvering trajectory. The impact of the WCE and residual acceleration error (RAE) are analyzed in detail by deriving the specific wavenumber domain signal based on the mapping relationship between the geometry space and wavenumber space. Subsequently, this paper improves the traditional WCE compensation function and introduces a new range cell migration (RCM) recalibration function for joint envelope and phase error correction. The 2D precisely focused SAR image is acquired based on the spatially variant inverse filtering in the final. Simulation experiments validate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Amid the conflict between the current huge data volumes and the requirement for large-compression-ratio compression in space-borne multichannel SAR, this paper proposes a data compression method that uses the adaptive bit allocation BAQ method in the Doppler domain of space-borne multichannel SAR. Specifically, 3MBAQ, which denotes multichannel, multipulse, multiweight block-adaptive quantization, performs signal reconstruction through a Krieger filter to obtain the Doppler spectrum under azimuthal multichannel and multipulse conditions and then achieves nonuniform bit allocation by using the multiple weight contributions between subband spectra. Furthermore, large-compression-ratio compression can be realized in homogeneous scenarios by using the adaptive bit allocation BAQ method together with the improved bit error control (BEC) algorithm. In this paper, the effectiveness of the 3MBAQ method is verified on GF3 measured data. Moreover, compared to the SQNR and NMSE of the BAQ, A-BAQ, A-BAQ-BEC, MCBAQ-ASQ, and MCBAQ-BEC methods under the same conditions, it is shown that there is an optimal 1.3434 dB improvement in SQNR and a 0.0241 improvement in NMSE using the 3MBAQ algorithm, and the complexity of the algorithm for 3MBAQ is O (N 2 l o g (N)) , which is within acceptable limits, clearly proving the superiority of the 3MBAQ method. [ABSTRACT FROM AUTHOR]

With the rapid development of remote sensing technology, remote sensing products have found increasingly widespread applications across various fields. Nevertheless, as the volume of remote sensing image data continues to grow, traditional data retrieval techniques have encountered several challenges such as substantial query results, data overlap, and variations in data quality. Users need to manually browse and filter a large number of remote sensing datasets, which is a cumbersome and inefficient process. In order to cope with these problems of traditional remote sensing image retrieval methods, this paper proposes a remote sensing image retrieval algorithm for dense data (DD-RSIRA). The algorithm establishes evaluation metrics based on factors like imaging time, cloud coverage, and image coverage. The algorithm utilizes the global grids to create an ensemble coverage relation between images and grids. A locally optimal initial solution is obtained by a greedy algorithm, and then a local search is performed to search for the optimal solution by combining the strategies of weighted gain-loss scheme and novel mechanism. Ultimately, it achieves an optimal coverage of remote sensing images within the region of interest. In this paper, it is shown that the method obtains a smaller number of datasets with lower redundancy and higher data utilization and ensures the data quality to a certain extent in order to accurately meet the requirements of the regional coverage of remote sensing images. [ABSTRACT FROM AUTHOR]

The algorithm proposed in this paper aims at solving the problem of star map matching in high-limiting-magnitude astronomical images, which is inspired by geometric voting star identification techniques. It is a two-step star map matching algorithm relying only on angular features, and adopts a reasonable matching strategy to overcome the problem of poor real-time performance of the geometric voting algorithm when the number of stars is large. The algorithm focuses on application scenarios where there are a large number of dense stars (limiting magnitude greater than 13, average number of stars per square degree greater than 185) in the image, which is different from the sparse star identification problem of the star tracker, which is more challenging for the robustness and real-time performance of the algorithm. The proposed algorithm can be adapted to application scenarios such as unreliable brightness information, centroid positioning error, visual axis pointing deviation, and a large number of false stars, with high accuracy, robustness, and good real-time performance. [ABSTRACT FROM AUTHOR]

Indoor localization has long been a challenging task due to the complexity and dynamism of indoor environments. This paper proposes ULG-SLAM, a novel unsupervised learning and geometric-based visual SLAM algorithm for robot localizability estimation to improve the accuracy and robustness of visual SLAM. Firstly, a dynamic feature filtering based on unsupervised learning and moving consistency checks is developed to eliminate the features of dynamic objects. Secondly, an improved line feature extraction algorithm based on LSD is proposed to optimize the effect of geometric feature extraction. Thirdly, geometric features are used to optimize localizability estimation, and an adaptive weight model and attention mechanism are built using the method of region delimitation and region growth. Finally, to verify the effectiveness and robustness of localizability estimation, multiple indoor experiments using the EuRoC dataset and TUM RGB-D dataset are conducted. Compared with ORBSLAM2, the experimental results demonstrate that absolute trajectory accuracy can be improved by 95% for equivalent processing speed in walking sequences. In fr3/walking_xyz and fr3/walking_half, ULG-SLAM tracks more trajectories than DS-SLAM, and the ATE RMSE is improved by 36% and 6%, respectively. Furthermore, the improvement in robot localizability over DynaSLAM is noteworthy, coming in at about 11% and 3%, respectively. [ABSTRACT FROM AUTHOR]

With the advancement of remote sensing technology, the demand for the accurate monitoring and tracking of various targets utilizing unmanned aerial vehicles (UAVs) is increasing. However, challenges such as object deformation, motion blur, and object occlusion during the tracking process could significantly affect tracking performance and ultimately lead to tracking drift. To address this issue, this paper introduces a high-precision target-tracking method with anomaly tracking status detection and recovery. An adaptive feature fusion strategy is proposed to improve the adaptability of the traditional sum of template and pixel-wise learners (Staple) algorithm to changes in target appearance and environmental conditions. Additionally, the Moth Flame Optimization (MFO) algorithm, known for its strong global search capability, is introduced as a re-detection algorithm in case of tracking failure. Furthermore, a trajectory-guided Gaussian initialization technique and an iteration speed update strategy are proposed based on sexual pheromone density to enhance the tracking performance of the introduced re-detection algorithm. Comparative experiments conducted on UAV123 and UAVDT datasets demonstrate the excellent stability and robustness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Mathematical algorithms relate satellite data of ocean color with the surface Chlorophyll-a concentration (Chl-a), a proxy of phytoplankton biomass. These mathematical tools work best when they are adapted to the unique bio-optical properties of a particular oceanic province. Ocean color algorithms should also consider that there are significant differences between datasets derived from different sensors. Common solutions are to provide different parameters for each sensor or use merged satellite data. In this paper, we use satellite data from the Copernicus merged product suite and in situ data from the southernmost part of the California Current System to test two widely used global algorithms, OCx and CI, and a regional algorithm, CalCOFI2. The OCx algorithm yielded the most favorable results. Consequently, we regionalized it and conducted further testing, leading to significant improvements, especially in eutrophic and oligotrophic waters. The database was then separated according to (a) dynamic boundaries in the area, (b) bio-optical properties, and (c) climatic conditions (El Niño/La Niña). Regional algorithms were obtained and tested for each partition. The Chl-a retrievals for each model were tested and compared. The best fit for the data was for the regional algorithms that considered the climatic conditions (El Niño/La Niña). These results will allow for the construction of consistent regionally adapted time series and, therefore, will demonstrate the importance of El Niño/La Niña events on the bio-optical properties of the area. [ABSTRACT FROM AUTHOR]

For airborne radar, detecting a low–slow–small (LSS) target is a hot and challenging topic, which results from the rapidly increasing number of non-cooperative flying LSS targets becoming of widespread concern, and the low signal-to-clutter ratio (SCR) of LSS targets results in the targets being particularly easily overwhelmed by the clutter. In this paper, a novel light gradient boosting machine (LightGBM)-based LSS target detection algorithm for airborne radar is proposed. The proposed method, based on the current real-time clutter environment of the range cell to be detected, firstly designs a specific real-time space-time LSS target signal repository with special dimensions and structures. Then, the proposed method creatively designs a new fast-built real-time training feature dataset specifically for the LSS target and the current clutter, together with a series of unique data transformations, sample selection, data restructuring, feature extraction, and feature processing. Finally, the proposed method develops a unique machine learning-based LSS target detection classifier model for the designed training dataset, by fully excavating and utilizing the advantages of the ensemble decision trees-based LightGBM. Consequently, the pre-processed data in the range cell of interest are classified using the proposed algorithm, which achieves LSS target detection by evaluating the output results of the designed classifier. Compared with the traditional classical target detection methods, the proposed algorithm is capable of providing markedly superior performance for LSS target detection. With an appropriate computational time, the proposed algorithm attains the highest probability of detecting LSS targets under the low SCR. The simulation outcomes and detection results with the experimental data are employed to validate the effectiveness and merits of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Loop closure detection is an important component of the Simultaneous Localization and Mapping (SLAM) algorithm, which is utilized in environmental sensing. It helps to reduce drift errors during long-term operation, improving the accuracy and robustness of localization. Such improvements are sorely needed, as conventional visual-based loop detection algorithms are greatly affected by significant changes in viewpoint and lighting conditions. In this paper, we present a semantic spatial structure-based loop detection algorithm. In place of feature points, robust semantic features are used to cope with the variation in the viewpoint. In consideration of the semantic features, which are region-based, we provide a corresponding matching algorithm. Constraints on semantic information and spatial structure are used to determine the existence of loop-back. A multi-stage pipeline framework is proposed to systematically leverage semantic information at different levels, enabling efficient filtering of potential loop closure candidates. To validate the effectiveness of our algorithm, we conducted experiments using the uHumans2 dataset. Our results demonstrate that, even when there are significant changes in viewpoint, the algorithm exhibits superior robustness compared to that of traditional loop detection methods. [ABSTRACT FROM AUTHOR]

The imaging of high-speed high-squint synthetic aperture radar (HSHS-SAR), which is mounted on maneuvering platforms with curved trajectory, is a challenging task due to the existence of 3-D acceleration and the azimuth spatial variability of range migration and Doppler parameters. Although existing imaging algorithms based on linear range walk correction (LRWC) and nonlinear chirp scaling (NCS) can reduce the range–azimuth coupling of the frequency spectrum (FS) and the spatial variability of the Doppler parameter to some extent, they become invalid as the squint angle, speed, and resolution increase. Additionally, most of them ignore the effect of acceleration phase calibration (APC) on NCS, which should not be neglected as resolution increases. For these issues, a modified frequency nonlinear chirp scaling (MFNCS) algorithm is proposed in this paper. The proposed MFNCS algorithm mainly includes the following aspects. First, a more accurate approximation of range model (MAARM) is established to improve the accuracy of the instantaneous slant range history. Second, a preprocessing of the proposed algorithm based on the first range compression, LRWC, and a spatial-invariant APC (SIVAPC) is implemented to eliminate most of the effects of high-squint angle and 3-D acceleration on the FS. Third, a spatial-variant APC (SVAPC) is performed to remove azimuth spatial variability introduced by 3-D acceleration, and the range focusing is accomplished by the bulk range cell migration correction (BRCMC) and extended secondary range compression (ESRC). Fourth, the azimuth-dependent characteristics evaluation based on LRWC, SIVAPC, and SVAPC is completed to derive the MFNCS algorithm with fifth-order chirp scaling function for azimuth compression. Consequently, the final image is focused on the range time and azimuth frequency domain. The experimental simulation results verify the effectiveness of the proposed algorithm. With a curved trajectory, HSHS-SAR imaging is carried out at a 50° geometric squint angle and 500 m × 500 m imaging width. The integrated sidelobe ratio and peak sidelobe ratio of the point targets at the scenario edges approach the theoretical values, and the range-azimuth resolution is 1.5 m × 3.0 m. [ABSTRACT FROM AUTHOR]

Inverse synthetic-aperture radar (ISAR) can achieve precise imaging of targets, which enables precise perception of battlefield information, and it has become one of the most important tasks for radar systems. In multi-target scenarios, a resource scheduling method is required to improve the sensing ability and the overall efficiency of a radar system due to the limited resources. Considering the motion state of the target will change as the observation distance increases and image defocusing can occur due to the prolonged coherence accumulation time and significant changes in the target's motion state, the optimal observation period should be an important consideration factor in the resource scheduling method to further improve the imaging efficiency of radar system, which has not yet been involved in existing research. In this paper, we first derive the expressions of the target's effective rotation angle and the equivalent rotation angular velocity and then define the target's optimal observation period. Then, for multi-target imaging scenarios, we allocate pulse resources within a given time period based on sparse-aperture ISAR imaging technology. An adaptive radar resource scheduling algorithm for multi-target ISAR imaging is proposed, which prioritizes allocating resources based on the optimal observation periods for the targets. In the algorithm, a radar resource scheduling model for multi-target ISAR imaging is established, and a feedback-based closed-loop search optimization method is proposed to solve the model. Finally, the best scheduling strategy can be obtained, which includes imaging task duration and the pulse allocation sequence for each target. Simulation results validate the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a one-dimensional (1-D) range profile of the hypersonic target enveloped by a plasma sheath is investigated. Firstly, the non-uniform property of the plasma sheath is studied and its impact on the wideband electromagnetic (EM) wave is analyzed. A wideband radar echo model for the plasma-sheath-enveloped hypersonic target is constructed. Then, by exploiting the relationship among the incident depth, reflection intensity, and plasma velocity, it reveals that distinct scatter points in various areas of the target will suffer from varying reflection intensity and coupled velocity, leading to severe defocusing in the range profile. To tackle this issue, a novel focusing algorithm combing the Fractional Fourier Transform (FRFT) with the CLEAN technique is developed, which independently calculates the coupled plasma velocity and compensates for the phase error via a series of iterative procedures. Finally, the influence of the plasma sheath on the 1-D range profile and the effectiveness of the proposed focusing algorithm are validated through simulations. [ABSTRACT FROM AUTHOR]

Mineral mapping from satellite images provides valuable insights into subsurface mineral alteration for geothermal exploration. In previous studies, eight fundamental algorithms were used for mineral mapping utilizing USGS spectra, a collection of reflectance spectra containing samples of minerals, rocks, and soils created by the USGS. We used an ASD FieldSpec 4 Hi-RES NG portable spectrometer to collect spectra for analyzing ASTER images of the Coso Geothermal Field. Then, we established the ground-truth information and the spectral library by analyzing 97 samples. Samples collected from the field were analyzed using the CSIRO TSG (The Spectral Geologist of the Commonwealth Scientific and Industrial Research Organization). Based on the mineralogy study, multiple high-purity spectra of geothermal alteration minerals were selected from collected data, including alunite, chalcedony, hematite, kaolinite, and opal. Eight mineral spectral target detection algorithms were applied to the preprocessed satellite data with a proposed local spectral library. We measured the highest overall accuracy of 87% for alunite, 95% for opal, 83% for chalcedony, 60% for hematite, and 96% for kaolinite out of these eight algorithms. Three, four, five, and eight algorithms were fused to extract mineral alteration with the obtained target detection results. The results prove that the fusion of algorithms gives better results than using individual ones. In conclusion, this paper discusses the significance of evaluating different mapping algorithms. It proposes a robust fusion approach to extract mineral maps as an indicator for geothermal exploration. [ABSTRACT FROM AUTHOR]

Migration flocks have different forms, including single individuals, formations, and irregular clusters. The shape of a flock can change swiftly over time. The real-time clustering of multiple groups with different characteristics is crucial for the monitoring of dynamically changing migratory flocks. Traditional clustering algorithms need to set various prior parameters, including the number of groups, the number of nearest neighbors, or the minimum number of individuals. However, flocks may display complex group behaviors (splitting, combination, etc.), which complicate the choice and adjustment of the parameters. This paper uses a real-time clustering-based method that utilizes concepts from the algebraic graph theory. The connected graph is used to describe the spatial relationship between the targets. The similarity matrix is calculated, and the problem of group clustering is equivalent to the extraction of the partitioned matrices within. This method needs only one prior parameter (the similarity distance) and is adaptive to the group's splitting and combination. Two modifications are proposed to reduce the computation burden. First, the similarity distance can be broadened to reduce the exponent of the similarity matrix. Second, the omni-directional measurements are divided into multiple sectors to reduce the dimension of the similarity matrix. Finally, the effectiveness of the proposed method is verified using the experimental results using real radar data. [ABSTRACT FROM AUTHOR]

Geosynchronous spaceborne–airborne (GEO-SA) ultra-high-frequency ultra-wideband bistatic synthetic aperture radar (UHF UWB BiSAR) provides high-precision images for marine and polar environments, which are pivotal in glacier monitoring and sea ice thickness measurement for polar ocean mapping and navigation. Contrasting with traditional high-frequency BiSAR, it faces unique challenges, such as the considerable spatial variability, significant range–azimuth coupling, and vast volumes of echo data, which impede high-resolution image reconstruction. This paper presents an improved bistatic nonlinear chirp scaling (NLCS) algorithm for imaging oceanic scenes with GEO-SA UHF UWB BiSAR. This methodology extends the two-dimensional (2-D) spectrum up to the sixth order via the method of series reversion (MSR) to meet accuracy demands and then employs an elliptical model to elucidate the alterations in the azimuth frequency modulation (FM) rate mismatch. Initially, the imaging geometry and signal model are introduced, and then a separation of bistatic slant ranges based on the configuration is proposed. In addition, during range processing, after eliminating linear range cell migration (RCM), the derivation process for the sixth-order 2-D spectrum is detailed and an improved filter is applied to correct the high-order RCM. Finally, during azimuth processing, the causes of the FM rate mismatch are analyzed, a cubic perturbation function derived from the elliptical model is used for FM rate equalization, and a unified sixth-order filter is applied to complete the azimuth compression. Experimental results with point targets and natural oceanic scenes validate the outstanding efficacy of the proposed NLCS algorithm, particularly in imaging quality enhancements for GEO-SA UHF UWB BiSAR. [ABSTRACT FROM AUTHOR]

Non-side-looking airborne radar provides important applications on account of its all-round multi-angle airspace coverage. However, it suffers clutter range dependence that makes the samples fail to satisfy the condition of being independent and identically distributed (IID), and it severely degrades traditional approaches to clutter suppression and target detection. In this paper, a novel reweighted extreme learning machine (ELM)-based clutter suppression and range compensation algorithm is proposed for non-side-looking airborne radar. The proposed method involves first designing the pre-processing stage, the special reweighted complex-valued activation function containing an unknown range compensation matrix, and two new objective outputs for constructing an initial reweighted ELM-based network with its training. Then, two other objective outputs, a new loss function, and a reverse feedback framework driven by the specifically designed objectives are proposed for the unknown range compensation matrix. Finally, aiming to estimate and reconstruct the unknown compensation matrix, special processes of the complex-valued structures and the theoretical derivations are designed and analyzed in detail. Consequently, with the updated and compensated samples, further processing including space–time adaptive processing (STAP) can be performed for clutter suppression and target detection. Compared with the classic relevant methods, the proposed algorithm achieves significantly superior performance with reasonable computation time. It provides an obviously higher detection probability and better improvement factor (IF). The simulation results verify that the proposed algorithm is effective and has many advantages. [ABSTRACT FROM AUTHOR]

A pulse-Doppler (PD) radar has the advantage of strong anti-interference ability, and it is often used as a solution for maneuvering target tracking. In the application of target monitoring and tracking in PD radars, the interacting multiple model algorithm (IMM) has become the main and preferred choice due to its flexibility and high accuracy. However, the probability transfer matrix in classical IMM algorithms generally depends on constant prior knowledge, and if a PD radar is tracking a strong maneuvering target, it is inevitable to encounter some limitations, such as the possibility of target tracking trajectory deviation, and even a loss of the target. The Markov probability transfer matrix is proposed with an adaptive modification ability in real time to overcome the above problems in this paper. Additionally, for improving the speed of switching between the models, the fuzzy control system for secondary updating of model probability is adopted. By this means, the tracking accuracy of maneuvering targets is enhanced. Compared with the classical IMM algorithm, the corresponding simulation results for the PD radar indicate that the overall tracking accuracy of the proposed adaptive IMM algorithm is improved by 19.6%. In conclusion, the continuity and accuracy of the target trajectory can be effectively improved with the proposed adaptive IMM algorithm in PD radar cases. [ABSTRACT FROM AUTHOR]

Polarimetric target decomposition algorithms have played an important role in extracting the scattering characteristics of buildings, crops, and other fields. However, there is limited research on the scattering characteristics of grasslands and a lack of volume scattering models established for grasslands. To improve the accuracy of the polarimetric target decomposition algorithm applicable to grassland environments, this paper proposes an adaptive polarimetric target decomposition algorithm (APD) based on the anisotropy degree (A). The adaptive volume scattering model is used in APD to model volume scattering in forest and grassland regions separately by adjusting the value of A. When A > 1, the particle shape becomes a disk, and the grassland canopy is approximated as a cloud layer composed of randomly oriented disk particles; when A < 1, the particle shape is a needle, simulating the scattering mechanism of forests. APD is applied to an L-band AirSAR dataset from San Francisco, a C-band AirSAR dataset from Hunshandak grassland in Inner Mongolia Autonomous Region, and an X-band COSMO-SkyMed dataset from Xiwuqi grassland in Inner Mongolia Autonomous Region to verify the effectiveness of this method. Comparison studies are carried out to test the performance of APD over several target decomposition algorithms. The experimental results show that APD outperforms the algorithms tested in terms of this study in decomposition accuracy for grasslands and forests on different bands of data. [ABSTRACT FROM AUTHOR]

Researchers have explored various methods to fully exploit the all-weather characteristics of Synthetic aperture radar (SAR) images to achieve high-precision, real-time, computationally efficient, and easily deployable ship target detection models. These methods include Constant False Alarm Rate (CFAR) algorithms and deep learning approaches such as RCNN, YOLO, and SSD, among others. While these methods outperform traditional algorithms in SAR ship detection, challenges still exist in handling the arbitrary ship distributions and small target features in SAR remote sensing images. Existing models are complex, with a large number of parameters, hindering effective deployment. This paper introduces a YOLOv7 oriented bounding box SAR ship detection model (YOLOv7oSAR). The model employs a rotation box detection mechanism, uses the KLD loss function to enhance accuracy, and introduces a Bi-former attention mechanism to improve small target detection. By redesigning the network's width and depth and incorporating a lightweight P-ELAN structure, the model effectively reduces its size and computational requirements. The proposed model achieves high-precision detection results on the public RSDD dataset (94.8% offshore, 66.6% nearshore), and its generalization ability is validated on a custom dataset (94.2% overall detection accuracy). [ABSTRACT FROM AUTHOR]

Due to the issues of remote sensing object detection algorithms based on deep learning, such as a high number of network parameters, large model size, and high computational requirements, it is challenging to deploy them on small mobile devices. This paper proposes an extremely lightweight remote sensing aircraft object detection network based on the improved YOLOv5n. This network combines Shufflenet v2 and YOLOv5n, significantly reducing the network size while ensuring high detection accuracy. It substitutes the original CIoU and convolution with EIoU and deformable convolution, optimizing for the small-scale characteristics of aircraft objects and further accelerating convergence and improving regression accuracy. Additionally, a coordinate attention (CA) mechanism is introduced at the end of the backbone to focus on orientation perception and positional information. We conducted a series of experiments, comparing our method with networks like GhostNet, PP-LCNet, MobileNetV3, and MobileNetV3s, and performed detailed ablation studies. The experimental results on the Mar20 public dataset indicate that, compared to the original YOLOv5n network, our lightweight network has only about one-fifth of its parameter count, with only a slight decrease of 2.7% in mAP@0.5. At the same time, compared with other lightweight networks of the same magnitude, our network achieves an effective balance between detection accuracy and resource consumption such as memory and computing power, providing a novel solution for the implementation and hardware deployment of lightweight remote sensing object detection networks. [ABSTRACT FROM AUTHOR]

Deep learning, which is a dominating technique in artificial intelligence, has completely changed image understanding over the past decade. As a consequence, the sea ice extraction (SIE) problem has reached a new era. We present a comprehensive review of four important aspects of SIE, including algorithms, datasets, applications and future trends. Our review focuses on research published from 2016 to the present, with a specific focus on deep-learning-based approaches in the last five years. We divided all related algorithms into three categories, including the conventional image classification approach, the machine learning-based approach and deep-learning-based methods. We reviewed the accessible ice datasets including SAR-based datasets, the optical-based datasets and others. The applications are presented in four aspects including climate research, navigation, geographic information systems (GIS) production and others. This paper also provides insightful observations and inspiring future research directions. [ABSTRACT FROM AUTHOR]

A novel compressive sensing (CS) synthetic-aperture radar (SAR) called AgileSAR has been proposed to increase swath width for sparse scenes while preserving azimuthal resolution. AgileSAR overcomes the limitation of the Nyquist sampling theorem so that it has a small amount of data and low system complexity. However, traditional CS optimization-based algorithms suffer from manual tuning and pre-definition of optimization parameters, and they generally involve high time and computational complexity for AgileSAR imaging. To address these issues, a pseudo- L 0 -norm fast iterative shrinkage algorithm network (pseudo- L 0 -norm FISTA-net) is proposed for AgileSAR imaging via the deep unfolding network in this paper. Firstly, a pseudo- L 0 -norm regularization model is built by taking an approximately fair penalization rule based on Bayesian estimation. Then, we unfold the operation process of FISTA into a data-driven deep network to solve the pseudo- L 0 -norm regularization model. The network's parameters are automatically learned, and the learned network significantly increases imaging speed, so that it can improve the accuracy and efficiency of AgileSAR imaging. In addition, the nonlinearly sparsifying transform can learn more target details than the traditional sparsifying transform. Finally, the simulated and data experiments demonstrate the superiority and efficiency of the pseudo- L 0 -norm FISTA-net for AgileSAR imaging. [ABSTRACT FROM AUTHOR]

Spatiotemporally mapping winter wheat is imperative for informing and shaping global food security policies. Traditional mapping methods heavily rely on sufficient and reliable samples obtained through labor-intensive fieldwork and manual sample collection. However, these methods are time-consuming, costly, and lack timely and continuous data collection. To address these challenges and fully leverage remote sensing big data and cloud computing platforms like Google Earth Engine (GEE), this paper developed an algorithm for Auto-Generating Winter Wheat Samples for mapping (AGWWS). The AGWWS utilizes historical samples to determine the optimal migration threshold by measuring Spectral Angle Distance (SAD), Euclidean Distance (ED), and Near-Infrared band Difference Index (NIRDI). This facilitates the auto-generation of winter wheat sample sets for the years 2000, 2005, 2010, 2015, and 2021. Approximately two-thirds of the samples were allocated for training, with the remaining one-third used for validating the mapping method, employing the One-Class Support Vector Machine (OCSVM). The Huang–Huai–Hai (HHH) Plain, a major winter wheat production region, was selected to perform the algorithm and subsequent analysis on. Different combinations of the hyper-parameters, gamma and nu, of the OCSVM based on the Gaussian Radial Basis Function Kernel were tested for each year. Following correlation analysis between the winter wheat area derived from the generated maps and the national statistical dataset at the city level, the map with the highest corresponding R2 was chosen as the AGWWS map for each year (0.77, 0.77, 0.80, 0.86, and 0.87 for 2000, 2005, 2010, 2015, and 2021, respectively). The AGWWS maps ultimately achieved an average Overall Accuracy of 81.65%. The study then explores the Non-Grain Production of Winter Wheat (NGPOWW) by analyzing winter wheat change maps from 2000–2005, 2005–2010, 2005–2010, and 2015–2021 in the HHH Plain. Despite an overall increase in the total planted area of winter wheat, the NGPOWW phenomena has led to concerning winter wheat planting marginalization. Compensatory winter wheat areas are notably situated in mountainous and suburban cultivated lands with low qualities. Consequently, despite the apparent expansion in planted areas, winter wheat production is anticipated to be adversely affected. The findings highlight the necessity for improved cultivated land protection policies monitoring the land quality of the compensation and setting strict quota limits on occupations. [ABSTRACT FROM AUTHOR]

In this paper, we present an innovative inertial navigation system (INS)/celestial navigation system (CNS)/scene-matching navigation (SMN) adaptive integrated navigation algorithm designed to achieve prolonged and highly precise navigation in sea areas. The algorithm establishes the structure of the INS/CNS/SMN integrated navigation system. To ensure the availability of CNS in the Nanhai Sea (South China Sea) area, a cloud and fog model is meticulously constructed. Three distinct types of sea area landmarks are defined, and an automated classification model for sea area landmarks, employing support vector machines (SVM), is developed. Corresponding matching methods and strategies for these landmarks are also delineated. Concurrently, the observable probability of each landmark is computed to generate a probability cloud, representing the usability of sea area landmarks. The proposed INS/CNS/SMN adaptive integrated navigation algorithm is simulated and validated across varied altitudes and trajectories in the sea area. The results show that CNS and SMN can dynamically assist INS in achieving prolonged and highly precise navigation. [ABSTRACT FROM AUTHOR]

A trend in the development of spaceborne Synthetic Aperture Radar (SAR) technology is the shift from a single-satellite repeated observation mode to a multi-satellite collaborative observation mode. However, current multi-satellite collaborative geolocation algorithms face challenges, such as geometric model mismatch and poor baseline estimation accuracy, arising from highly dynamic changes among multi-satellites. This paper introduces a high-precision and efficient geolocation algorithm for a spaceborne bistatic interferometric SAR (BiInSAR) system based on an improved range–Doppler (IRD) model. The proposed algorithm encompasses three key contributions. Firstly, a comprehensive description of the spatial baseline geometric model unique to the bistatic configuration is provided, with a specific focus on deriving the perpendicular baseline expression. Secondly, IRD geolocation functions are established to meet the specific requirements of the bistatic configuration. Then, a novel BiInSAR geolocation algorithm based on the IRD's functions is proposed, which can significantly improve the target geolocation accuracy by modifying the range–Doppler equation to suit the bistatic configuration. Meanwhile, a low-coupling parallel calculation method is proposed, which can improve the calculation speed by two to three times. Finally, the accuracy and efficiency of the algorithm are demonstrated using experimental data acquired by the TH-2 satellite, which is China's first spaceborne BiInSAR system. The experimental results prove that the IRD algorithm exhibits geolocation accuracy with an average error of less than 1 m and a standard deviation of less than 2.5 m while maintaining computational efficiency at a calculation speed of 1,429,678 pixels per second. [ABSTRACT FROM AUTHOR]

In the application of Compressive Sensing (CS) theory for sidelobe suppression in Random Frequency and Pulse Repetition Interval Agile (RFPA) radar, the off−grid issues affect the performance of target parameter estimation in RFPA radar. Therefore, to address this issue, this paper presents an off−grid CS algorithm named Refinement and Generalized Double Pareto (GDP) distribution based on Sparse Bayesian Learning (RGDP−SBL) for RFPA radar that utilizes a coarse−to−fine grid refinement approach, allowing precise and cost−effective signal recovery while mitigating the impact of off−grid issues on target parameter estimation. To obtain a high-precision signal recovery, especially in scenarios involving closely spaced targets, the RGDP−SBL algorithm makes use of a three−level hierarchical prior model. Furthermore, the RGDP−SBL algorithm efficiently utilizes diagonal elements during the coarse search and exploits the convexity of the grid energy curve during the fine search, therefore significantly reducing computational complexity. Simulation results demonstrate that the RGDP−SBL algorithm significantly improves signal recovery performance while maintaining low computational complexity in multiple scenarios for RFPA radar. [ABSTRACT FROM AUTHOR]

As one of the most important techniques for hyperspectral image dimensionality reduction, band selection has received considerable attention, whereas self-representation subspace clustering-based band selection algorithms have received quite a lot of attention with good effect. However, many of them lack the self-supervision of representations and ignore the multi-level spectral–spatial information of HSI and the connectivity of subspaces. To this end, this paper proposes a novel self-supervised multi-level representation learning fusion-based maximum entropy subspace clustering (MLRLFMESC) method for hyperspectral band selection. Firstly, to learn multi-level spectral–spatial information, self-representation subspace clustering is embedded between the encoder layers of the deep-stacked convolutional autoencoder and its corresponding decoder layers, respectively, as multiple fully connected layers to achieve multi-level representation learning (MLRL). A new auxiliary task is constructed for multi-level representation learning and multi-level self-supervised training to improve its capability of representation. Then, a fusion model is designed to fuse the multi-level spectral–spatial information to obtain a more distinctive coefficient matrix for self-expression, where the maximum entropy regularization (MER) method is employed to promote connectivity and the uniform dense distribution of band elements in each subspace. Finally, subspace clustering is conducted to obtain the final band subset. Experiments have been conducted on three hyperspectral datasets, and the corresponding results show that the proposed MLRLFMESC algorithm significantly outperforms several other band selection methods in classification performance. [ABSTRACT FROM AUTHOR]