Search

Clouds are crucial in regulating the Earth's energy budget. Global cloud top heights have been easily retrieved from satellite measurements, but there are few methods for determining cloud base height (CBH) from satellite measurements. The Cloud Base Altitude Spatial Extrapolator (CBASE) algorithm was proposed to derive the height of the lower-troposphere liquid cloud base by using the Cloud-Aerosol Lidar with Orthogonal polarization cloud aerosol LiDAR (CALIOP) profiles and weather observations at airports from aviation routine and special weather report (METARs and SPECIs, called METAR) observation data in the United States. A modification to the CBASE algorithm over China (CNMETAR-CBASE) is presented in this paper. In this paper, the ability of the CBASE algorithm to calculate CBH in China is evaluated, and METAR observations over China (CNMETAR) were then used to modify the CBASE algorithm. The results including CNMETAR observation data in China can better retrieve CBH over China compared with the results using the original CBASE algorithm, and the accuracy of the global CBH results has been improved. Overestimations of CBH with the original algorithm range from 500 to 800 m in China, which have been reduced to about 300 m with an improved algorithm. The deviations calculated by the algorithm also have a significant reduction, from 480 m (CBASE) to 420 m (CNMETAR-CBASE). In conclusion, the modified CBASE algorithm not only calculates the CBH more accurately in China but also improves the results of the global CBH retrieved from satellites. [ABSTRACT FROM AUTHOR]

Oblique photography is a regional digital surface model generation technique that can be widely used for building 3D model construction. However, due to the lack of geometric and semantic information about the building, these models make it difficult to differentiate more detailed components in the building, such as roofs and balconies. This paper proposes a deep learning-based method (U-NET) for constructing 3D models of low-rise buildings that address the issues. The method ensures complete geometric and semantic information and conforms to the LOD2 level. First, digital orthophotos are used to perform building extraction based on U-NET, and then a contour optimization method based on the main direction of the building and the center of gravity of the contour is used to obtain the regular building contour. Second, the pure building point cloud model representing a single building is extracted from the whole point cloud scene based on the acquired building contour. Finally, the multi-decision RANSAC algorithm is used to segment the building detail point cloud and construct a triangular mesh of building components, followed by a triangular mesh fusion and splicing method to achieve monolithic building components. The paper presents experimental evidence that the building contour extraction algorithm can achieve a 90.3% success rate and that the resulting single building 3D model contains LOD2 building components, which contain detailed geometric and semantic information. [ABSTRACT FROM AUTHOR]

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]

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]

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]

Space non-cooperative target recognition is crucial for on-orbit servicing. Multi-satellite cooperation has great potential for broadening the observation scope and enhancing identification efficiency. However, there is currently a lack of research on recognition methods tailored for multi-satellite cooperative observation. In this paper, we propose a novel space non-cooperative target recognition method to identify satellites and debris in images from multi-satellite observations. Firstly, we design an image-stitching algorithm to generate space-wide-area images. Secondly, we propose a two-stage multi-target detection model, a lighter CNN model with distance merge threshold (LCNN-DMT). Specifically, in the first stage, we propose a novel foreground extraction model based on a minimum bounding rectangle with the threshold for distance merging (MBRT-D) to address redundant detection box extraction for satellite components. Then, in the second stage, we propose an improved SqueezeNet model by introducing separable convolution and attention mechanisms for target classification. Moreover, due to the absence of a public multi-target detection dataset containing satellites and debris, we construct two space datasets by introducing a randomized data augmentation strategy. Further experiments demonstrate that our method can achieve high-precision image stitching and superior recognition performance. Our LCNN-DMT model outperforms mainstream algorithms in target localization accuracy with only 0.928 M parameters and 0.464 GFLOPs, making it ideal for on-orbit deployment. [ABSTRACT FROM AUTHOR]

Typical satellite component detection is an application-valuable and challenging research field. Currently, there are many algorithms for detecting typical satellite components, but due to the limited storage space and computational resources in the space environment, these algorithms generally have the problem of excessive parameter count and computational load, which hinders their effective application in space environments. Furthermore, the scale of datasets used by these algorithms is not large enough to train the algorithm models well. To address the above issues, this paper first applies YOLOv8 to the detection of typical satellite components and proposes a Lightweight Typical Satellite Components Detection algorithm based on improved YOLOv8 (LTSCD-YOLO). Firstly, it adopts the lightweight network EfficientNet-B0 as the backbone network to reduce the model's parameter count and computational load; secondly, it uses a Cross-Scale Feature-Fusion Module (CCFM) at the Neck to enhance the model's adaptability to scale changes; then, it integrates Partial Convolution (PConv) into the C2f (Faster Implementation of CSP Bottleneck with two convolutions) module and Re-parameterized Convolution (RepConv) into the detection head to further achieve model lightweighting; finally, the Focal-Efficient Intersection over Union (Focal-EIoU) is used as the loss function to enhance the model's detection accuracy and detection speed. Additionally, a larger-scale Typical Satellite Components Dataset (TSC-Dataset) is also constructed. Our experimental results show that LTSCD-YOLO can maintain high detection accuracy with minimal parameter count and computational load. Compared to YOLOv8s, LTSCD-YOLO improved the mean average precision (mAP50) by 1.50% on the TSC-Dataset, reaching 94.5%. Meanwhile, the model's parameter count decreased by 78.46%, the computational load decreased by 65.97%, and the detection speed increased by 17.66%. This algorithm achieves a balance between accuracy and light weight, and its generalization ability has been validated on real images, making it effectively applicable to detection tasks of typical satellite components in space environments. [ABSTRACT FROM AUTHOR]

Object detection via remote sensing encounters significant challenges due to factors such as small target sizes, uneven target distribution, and complex backgrounds. This paper introduces the K-CBST YOLO algorithm, which is designed to address these challenges. It features a novel architecture that integrates the Convolutional Block Attention Module (CBAM) and Swin-Transformer to enhance global semantic understanding of feature maps and maximize the utilization of contextual information. Such integration significantly improves the accuracy with which small targets are detected against complex backgrounds. Additionally, we propose an improved detection network that combines the improved K-Means algorithm with a smooth Non-Maximum Suppression (NMS) algorithm. This network employs an adaptive dynamic K-Means clustering algorithm to pinpoint target areas of concentration in remote sensing images that feature varied distributions and uses a smooth NMS algorithm to suppress the confidence of overlapping candidate boxes, thereby minimizing their interference with subsequent detection results. The enhanced algorithm substantially bolsters the model's robustness in handling multi-scale target distributions, preserves more potentially valid information, and diminishes the likelihood of missed detections. This study involved experiments performed on the publicly available DIOR remote sensing image dataset and the DOTA aerial image dataset. Our experimental results demonstrate that, compared with other advanced detection algorithms, K-CBST YOLO outperforms all its counterparts in handling both datasets. It achieved a 68.3% mean Average Precision (mAP) on the DIOR dataset and a 78.4% mAP on the DOTA dataset. [ABSTRACT FROM AUTHOR]

This paper investigates null control within the transmit–receive beampattern of Frequency Diverse Array-Multiple-Input and Multiple-Output (FDA-MIMO) systems, presenting a novel phase-only optimization approach for achieving null control in FDA-MIMO. We employ an alternating multiplier framework, which transforms the intricate and inherent constant modulus constraint and numerous amplitude constraints in optimization into more manageable projection problems. By employing a phase-only optimization strategy, the intricate hardware and computational burdens associated with null control in FDA-MIMO are effectively alleviated. The simulation results indicate that the algorithm proposed in this paper exhibits excellent null control ability while precisely maintaining constant modulus constraints, and it possesses an extremely high computational efficiency. [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]

The extensive deployment of wind farms has significantly impacted the detection capabilities of space–air bistatic radar (SABR) systems. Although space–time adaptive processing techniques are available, their performance is significantly degraded, and even unable to suppress clutter. This paper explores the geometric configuration of the SABR system and the selection of detection areas, establishing a space–time clutter model that addresses the effects of wind turbine clutter (WTC). Expressions for spatial and Doppler frequencies have been derived to deeply analyze the characteristics of clutter spreading. Building on this, the paper extends two-dimensional space–time data to three-dimensional azimuth–elevation–Doppler data. It proposes a three-dimensional space–time multi-beam (STMB) strategy incorporating the Ordering Points to Identify the Clustering Structure (OPTICS) clustering algorithm to suppress WTC effectively. This algorithm selects WTC samples and applies OPTICS clustering to the clutter-suppressed data to achieve this effect. Simulation experiments further verify the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

This paper focuses on detecting and tracking maneuvering weak targets in the range–Doppler (RD) plane with the track-before-detect (TBD) algorithm based on dynamic programming (DP). Traditional DP-TBD algorithms integrate target detection and tracking in their framework while searching the paths provided by a predefined model of the kinematic properties within the constraints allowed. However, both the approximate motion model used in the RD plane and the model mismatch caused when the target undergoes a maneuver can degrade the TBD performance sharply. To address these issues, this paper accurately describes the evolution of the RD equation based on Constant Acceleration (CA) and Coordinated Turn (CT) motion models with the process noise in the Cartesian coordinate system, and it also employs a recursive method to estimate the parameters in the equations for efficient energy accumulation and path searches. Facing the situation that targets energy accumulation during the DP iteration process will lead to an expansion of the target energy accumulation process. This paper designs a more efficient Optimization Function (OF) to inhibit the expansion effect, improve the resolution of the nearby targets, and increase the detection probability of the weak targets simultaneously. In addition, to search the trajectory more efficiently and accurately, we improved the process of DP multi-frame accumulation, thus reducing the computation amount of large-scale searches. Finally, the effectiveness of the proposed method for CA and CT motion target detection and tracking is verified by many of the simulation experiments that were conducted in this paper. [ABSTRACT FROM AUTHOR]

In recent years, deep learning has found widespread application in SAR image object detection. However, when detecting multi-scale targets against complex backgrounds, these models often struggle to strike a balance between accuracy and speed. Furthermore, there is a continuous need to enhance the performance of current models. Hence, this paper proposes LRMSNet, a new multi-scale target detection model designed specifically for SAR images in complex backgrounds. Firstly, the paper introduces an attention module designed to enhance contextual information aggregation and capture global features, which is integrated into a backbone network with an expanded receptive field for improving SAR image feature extraction. Secondly, this paper develops an information aggregation module to effectively fuse different feature layers of the backbone network. Lastly, to better integrate feature information at various levels, this paper designs a multi-scale aggregation network. We validate the effectiveness of our method on three different SAR object detection datasets (MSAR-1.0, SSDD, and HRSID). Experimental results demonstrate that LRMSNet achieves outstanding performance with a mean average accuracy (mAP) of 95.2%, 98.9%, and 93.3% on the MSAR-1.0, SSDD, and HRSID datasets, respectively, with only 3.46 M parameters and 12.6 G floating-point operation cost (FLOPs). When compared with existing SAR object detection models on the MSAR-1.0 dataset, LRMSNet achieves state-of-the-art (SOTA) performance, showcasing its superiority in addressing SAR detection challenges in large-scale complex environments and across various object scales. [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]

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]

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]

Recently, synthetic aperture radar (SAR) target detection algorithms based on Convolutional Neural Networks (CNN) have received increasing attention. However, the large amount of computation required burdens the real-time detection of SAR ship targets on resource-limited and power-constrained satellite-based platforms. In this paper, we propose a hardware-aware model speed-up method for single-stage SAR ship targets detection tasks, oriented towards the most widely used hardware for neural network computing—Graphic Processing Unit (GPU). We first analyze the process by which the task of detection is executed on GPUs and propose two strategies according to this process. Firstly, in order to speed up the execution of the model on a GPU, we propose SAR-aware model quantification to allow the original model to be stored and computed in a low-precision format. Next, to ensure the loss of accuracy is negligible after the acceleration and compression process, precision-aware scheduling is used to filter out layers that are not suitable for quantification and store and execute them in a high-precision mode. Trained on the dataset HRSID, the effectiveness of this model speed-up algorithm was demonstrated by compressing four different sizes of models (yolov5n, yolov5s, yolov5m, yolov5l). The experimental results show that the detection speeds of yolov5n, yolov5s, yolov5m, and yolov5l can reach 234.7785 fps, 212.8341 fps, 165.6523 fps, and 139.8758 fps on the NVIDIA AGX Xavier development board with negligible loss of accuracy, which is 1.230 times, 1.469 times, 1.955 times, and 2.448 times faster than the original before the use of this method, respectively. [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]

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]

Millimeter wave (MMW) radar simultaneous localization and mapping (SLAM) technology is an emerging technology in a tunnel vehicle accident rescue scene. It is a powerful tool for statistic-trapped vehicle detection with limited vision caused by darkness, heat, and smoke. A variety of SLAM frameworks have been proven to be able to obtain 3-degree-of-freedom (3-dof) pose estimation results using 2-dimention (2D) MMW radar in open space. In the application of millimeter wave radar for pose estimation and mapping in a closed environment, closed space structures and artificial targets together constitute high-intensity multi-path scattering measurement data, leading to radar false detections. Radar false detections caused by multi-path scattering are generally considered to be detrimental to radar applications, such as multi-target tracking. However, few studies analyze the mechanism of multi-path effects on radar SLAM, especially in closed spaces. In order to address the problem, this paper first presents a radar multi-path scattering theory to study the generation mechanism difference of false and radar true detection and their influences on radar SLAM 2D pose estimation and mapping in tunnel. According to the scattering mechanism differences on SLAM, a radar azimuth scattering angle signature is proposed, which allows distinguishing radar false detections from real ones. This is useful in avoiding using unreliable radar false detections to solve a radar SLAM problem. In addition, two different radar false detection revising methods combined with the CSM (correlative scan matching) algorithm are proposed in this paper. The HTMR-CSM (hard-threshold-multi-path-revised correlative scan matching) algorithm only depends on a hard threshold of radar azimuth scattering angle signature to eliminate all radar false detections as much as possible before CSM. Another idea is the STMR-CSM (soft-threshold-multi-path-revised correlative scan matching) algorithm. All the radar false detections are classified according to the distribution model of radar azimuth accuracy, and part of more reliable radar false detections are retained to estimate a more accurate pose. All the ideas in this paper are validated by using an MMW 2D radar mounted on a rail-guided robot in a tunnel. Two cars on fire were set as the targets. The experimental results show that the STMR-CSM algorithm that keeps the reliable radar false detections improves the positioning accuracy by 20% compared with CSM. [ABSTRACT FROM AUTHOR]

The advent of satellite-borne machine learning hardware accelerators has enabled the onboard processing of payload data using machine learning techniques such as convolutional neural networks (CNNs). A notable example is using a CNN to detect the presence of clouds in the multispectral data captured on Earth observation (EO) missions, whereby only clear sky data are downlinked to conserve bandwidth. However, prior to deployment, new missions that employ new sensors will not have enough representative datasets to train a CNN model, while a model trained solely on data from previous missions will underperform when deployed to process the data on the new missions. This underperformance stems from the domain gap, i.e., differences in the underlying distributions of the data generated by the different sensors in previous and future missions. In this paper, we address the domain gap problem in the context of onboard multispectral cloud detection. Our main contributions lie in formulating new domain adaptation tasks that are motivated by a concrete EO mission, developing a novel algorithm for bandwidth-efficient supervised domain adaptation, and demonstrating test-time adaptation algorithms on space deployable neural network accelerators. Our contributions enable minimal data transmission to be invoked (e.g., only 1% of the weights in ResNet50) to achieve domain adaptation, thereby allowing more sophisticated CNN models to be deployed and updated on satellites without being hampered by domain gap and bandwidth limitations. [ABSTRACT FROM AUTHOR]

Since the non-time-synchronized lightning positioning method does not rely on the time synchronization of the stations in the positioning system, it eliminates the errors arising from the pursuit of time synchronization and potentially achieves higher positioning accuracy. This paper provides a comprehensive overview of the errors present in the three-dimensional lightning positioning system. It compares the results of traditional positioning methods with those of non-time-synchronized lightning positioning algorithms. Subsequently, a simulation analysis of the positioning errors is conducted specifically for the non-time-synchronized lightning positioning method. The results show that (1) the non-time-synchronized lightning positioning method exhibits greater errors when utilizing two randomly positioned radiation sources for location determination. Consequently, the resulting positioning outcomes only provide a general overview of the lightning discharge. (2) The positioning outcomes resemble those of the traditional method when employing a fixed-coordinate beacon point. However, the errors in the three-dimensional positional coordinates of these fixed-coordinate beacon points significantly impact the deviations in the positioning results. This impact is positively correlated with the positional error of the beacon point, considering both the orientation and magnitude. (3) Similarly to the traditional method, the farther away from the center of the positioning network, the larger the radial error. (4) The spatial position of the selected fixed-coordinate beacon point has little influence on the error. [ABSTRACT FROM AUTHOR]

As an extremely efficient preprocessing tool, superpixels have become more and more popular in various computer vision tasks. Nevertheless, there are still several drawbacks in the application of hyperspectral image (HSl) processing. Firstly, it is difficult to directly apply superpixels because of the high dimension of HSl information. Secondly, existing superpixel algorithms cannot accurately classify the HSl objects due to multi-scale feature categorization. For the processing of high-dimensional problems, we use the principle of PCA to extract three principal components from numerous bands to form three-channel images. In this paper, a novel superpixel algorithm called Seed Extend by Entropy Density (SEED) is proposed to alleviate the seed point redundancy caused by the diversified content of HSl. It also focuses on breaking the dilemma of manually setting the number of superpixels to overcome the difficulty of classification imprecision caused by multi-scale targets. Next, a space–spectrum constraint model, termed Hyperspectral Image Classification via superpixels and manifold learning (SMALE), is designed, which integrates the proposed SEED to generate a dimensionality reduction framework. By making full use of spatial context information in the process of unsupervised dimension reduction, it could effectively improve the performance of HSl classification. Experimental results show that the proposed SEED could effectively promote the classification accuracy of HSI. Meanwhile, the integrated SMALE model outperforms existing algorithms on public datasets in terms of several quantitative metrics. [ABSTRACT FROM AUTHOR]

Demodulation and decoding are pivotal for the eLoran system's timing and information transmission capabilities. This paper proposes a novel demodulation algorithm leveraging a multiclass support vector machine (MSVM) for pulse position modulation (PPM) of eLoran signals. Firstly, the existing demodulation method based on envelope phase detection (EPD) technology is reviewed, highlighting its limitations. Secondly, a detailed exposition of the MSVM algorithm is presented, demonstrating its theoretical foundations and comparative advantages over the traditional method and several other methods proposed in this study. Subsequently, through comprehensive experiments, the algorithm parameters are optimized, and the parallel comparison of different demodulation methods is carried out in various complex environments. The test results show that the MSVM algorithm is significantly superior to traditional methods and other kinds of machine learning algorithms in demodulation accuracy and stability, particularly in high-noise and -interference scenarios. This innovative algorithm not only broadens the design approach for eLoran receivers but also fully meets the high-precision timing service requirements of the eLoran system. [ABSTRACT FROM AUTHOR]

The technology for object detection in remote sensing images finds extensive applications in production and people's lives, and improving the accuracy of image detection is a pressing need. With that goal, this paper proposes a range of improvements, rooted in the widely used YOLOv7 algorithm, after analyzing the requirements and difficulties in the detection of remote sensing images. Specifically, we strategically remove some standard convolution and pooling modules from the bottom of the network, adopting stride-free convolution to minimize the loss of information for small objects in the transmission. Simultaneously, we introduce a new, more efficient attention mechanism module for feature extraction, significantly enhancing the network's semantic extraction capabilities. Furthermore, by adding multiple cross-layer connections in the network, we more effectively utilize the feature information of each layer in the backbone network, thereby enhancing the network's overall feature extraction capability. During the training phase, we introduce an auxiliary network to intensify the training of the underlying network and adopt a new activation function and a more efficient loss function to ensure more effective gradient feedback, thereby elevating the network performance. In the experimental results, our improved network achieves impressive mAP scores of 91.2% and 80.8% on the DIOR and DOTA version 1.0 remote sensing datasets, respectively. These represent notable improvements of 4.5% and 7.0% over the original YOLOv7 network, significantly enhancing the efficiency of detecting small objects in particular. [ABSTRACT FROM AUTHOR]

Due to the inadequacy in utilizing complementary information from different modalities and the biased estimation of degraded parameters, the unsupervised hyperspectral super-resolution algorithm suffers from low precision and limited applicability. To address this issue, this paper proposes an approach for hyperspectral image super-resolution, namely, the Unsupervised Multimodal Multilevel Feature Fusion network (UMMFF). The proposed approach employs a gated cross-retention module to learn shared patterns among different modalities. This module effectively eliminates the intermodal differences while preserving spatial–spectral correlations, thereby facilitating information interaction. A multilevel spatial–channel attention and parallel fusion decoder are constructed to extract features at three levels (low, medium, and high), enriching the information of the multimodal images. Additionally, an independent prior-based implicit neural representation blind estimation network is designed to accurately estimate the degraded parameters. The utilization of UMMFF on the "Washington DC", Salinas, and Botswana datasets exhibited a superior performance compared to existing state-of-the-art methods in terms of primary performance metrics such as PSNR and ERGAS, and the PSNR values improved by 18.03%, 8.55%, and 5.70%, respectively, while the ERGAS values decreased by 50.00%, 75.39%, and 53.27%, respectively. The experimental results indicate that UMMFF demonstrates excellent algorithm adaptability, resulting in high-precision reconstruction outcomes. [ABSTRACT FROM AUTHOR]

The standard Kalman filter and most of its enhancements are typically designed based on the criterion that minimizes the mean squared error, with little discussion of multiple criteria in the positioning and navigation fields. Therefore, a novel data fusion method that takes into account weighted multiple criteria is proposed in this paper, implementing a filtering algorithm based on integrated criteria with different weights determined by a weight adjustment factor. The proposed algorithm and conventional filtering algorithms were utilized for data fusion in GNSS/INS integration. Experiments were conducted using actual data collected from an urban environment. Comparative analysis revealed that, when utilizing the proposed algorithm, the precision of the position, velocity, and attitude of the tested land vehicle could be improved by approximately 24%, 48%, and 35%, respectively. Furthermore, a series of filtering algorithms with different weight adjustment factors was performed to test their influence on the filtering. The application of the proposed algorithm should be accompanied by an appropriate weight adjustment factor. [ABSTRACT FROM AUTHOR]

With the advancement of radar technology toward multifunctionality and cognitive capabilities, traditional radar countermeasures are no longer sufficient to meet the demands of countering the advanced multifunctional radar (MFR) systems. Rapid and accurate generation of the optimal jamming strategy is one of the key technologies for efficiently completing radar countermeasures. To enhance the efficiency and accuracy of jamming policy generation, an efficient jamming policy generation method based on multi-timescale ensemble Q-learning (MTEQL) is proposed in this paper. First, the task of generating jamming strategies is framed as a Markov decision process (MDP) by constructing a countermeasure scenario between the jammer and radar, while analyzing the principle radar operation mode transitions. Then, multiple structure-dependent Markov environments are created based on the real-world adversarial interactions between jammers and radars. Q-learning algorithms are executed concurrently in these environments, and their results are merged through an adaptive weighting mechanism that utilizes the Jensen–Shannon divergence (JSD). Ultimately, a low-complexity and near-optimal jamming policy is derived. Simulation results indicate that the proposed method has superior jamming policy generation performance compared with the Q-learning algorithm, in terms of the short jamming decision-making time and low average strategy error rate. [ABSTRACT FROM AUTHOR]

When the near-field and far-field information of a target is uncertain, it is necessary to choose a suitable localization method. The modified polar representation (MPR) method integrates the two scenarios and achieves a unified localization with direction of arrival (DOA) estimation in the far field and position estimation in the near field. Previous studies have only proposed solutions for stationary environments and have not considered the motion factor. Therefore, this paper proposes a new unified positioning algorithm using multi-sensor time difference of arrival (TDOA) and frequency difference of arrival (FDOA) measurements without prior target source information. The method represents the position of the target source using MPR and describes the localization problem as a weighted least squares (WLS) problem with two constraints. We first obtain the initial estimates by WLS without considering the constraints and then investigate a two-step error correction method based on the constraints. The first step corrects the initial estimate using the Taylor series expansion technique, and the second step corrects the DOA estimate in the previous step using the direct error compensation technique based on the properties of the second constraint. Simulation experiments show that the method is effective for the unified positioning of moving targets and can achieve the Cramer–Rao lower bound (CRLB). [ABSTRACT FROM AUTHOR]

Pansharpening refers to the process of fusing multispectral (MS) images with panchromatic (PAN) images to obtain high-resolution multispectral (HRMS) images. However, due to the low correlation and similarity between MS and PAN images, as well as inaccuracies in spatial information injection, HRMS images often suffer from significant spectral and spatial distortions. To address these issues, a pansharpening method based on multimodal texture correction and adaptive edge detail fusion is proposed in this paper. To obtain a texture-corrected ( T C ) image that is highly correlated and similar to the MS image, the target-adaptive CNN-based pansharpening (A-PNN) method is introduced. By constructing a multimodal texture correction model, intensity, gradient, and A-PNN-based deep plug-and-play correction constraints are established between the T C and source images. Additionally, an adaptive degradation filter algorithm is proposed to ensure the accuracy of these constraints. Since the T C image obtained can effectively replace the PAN image and considering that the MS image contains valuable spatial information, an adaptive edge detail fusion algorithm is also proposed. This algorithm adaptively extracts detailed information from the T C and MS images to apply edge protection. Given the limited spatial information in the MS image, its spatial information is proportionally enhanced before the adaptive fusion. The fused spatial information is then injected into the upsampled multispectral (UPMS) image to produce the final HRMS image. Extensive experimental results demonstrated that compared with other methods, the proposed algorithm achieved superior results in terms of both subjective visual effects and objective evaluation metrics. [ABSTRACT FROM AUTHOR]

Addressing the formidable challenges in spatial infrared dim target detection, this paper introduces an advanced detection approach based on the refinement of the YOLOv8 algorithm. In contrast to the conventional YOLOv8, our method achieves remarkable improvements in detection accuracy through several novel strategies. Notably, by incorporating a deformable convolutional module into the YOLOv8 backbone network, our method effectively captures more intricate image features, laying a solid foundation for subsequent feature fusion and detection head predictions. Furthermore, a dedicated small target detection layer, built upon the original model, significantly enhances the model's capability in recognizing infrared small targets, thereby boosting overall detection performance. Additionally, we utilize the WIoU-v3 as the localization regression loss function, effectively reducing sensitivity to positional errors and leveraging the advantages of multi-attention mechanisms. To enrich the quantity and quality of the spatial infrared dim target dataset, we employ image enhancement techniques to augment the original dataset. Extensive experiments demonstrate the exceptional performance of our method. Specifically, our approach achieves a precision of 95.6%, a recall rate of 94.7%, and a mean average precision (mAP) exceeding 97.4%, representing substantial improvements over the traditional YOLOv8 algorithm. Moreover, our detection speed reaches 59 frames/s, satisfying the requirements for real-time detection. This achievement not only validates the efficacy and superiority of our algorithm in spatial infrared dim target detection, but also offers novel insights and methodologies for research and applications in related fields, holding immense potential for future applications. [ABSTRACT FROM AUTHOR]

Land-cover segmentation, a fundamental task within the domain of remote sensing, boasts a broad spectrum of application potential. We address the challenges in land-cover segmentation of remote-sensing imagery and complete the following work. Firstly, to tackle the issues of foreground–background imbalance and scale variation, a module based on multi-dilated rate convolution fusion was integrated into a decoder. This module extended the receptive field through multi-dilated convolution, enhancing the model's capability to capture global features. Secondly, to address the diversity of scenes and background interference, a hybrid attention module based on large-kernel convolution was employed to improve the performance of the decoder. This module, based on a combination of spatial and channel attention mechanisms, enhanced the extraction of contextual information through large-kernel convolution. A convolution kernel selection mechanism was also introduced to dynamically select the convolution kernel of the appropriate receptive field, suppress irrelevant background information, and improve segmentation accuracy. Ablation studies on the Vaihingen and Potsdam datasets demonstrate that our decoder significantly outperforms the baseline in terms of mean intersection over union and mean F1 score, achieving an increase of up to 1.73% and 1.17%, respectively, compared with the baseline. In quantitative comparisons, the accuracy of our improved decoder also surpasses other algorithms in the majority of categories. The results of this paper indicate that our improved decoder achieves significant performance improvement compared with the old decoder in remote-sensing image-segmentation tasks, which verifies its application potential in the field of land-cover segmentation. [ABSTRACT FROM AUTHOR]

Real-Time (RT) Precise Point Positioning (PPP) uses precise satellite orbits and clock corrections, and employs a separate receiver for positioning. With the growing demand, RT PPP is becoming an increasingly popular research topic. The ambiguity resolution (AR) can significantly improve the positioning accuracy and convergence time of PPP, so it is essential to study PPPAR in RT mode. In this paper, 37 MGEX stations from around the world are chosen, and the RT orbit, clock, and phase biases products broadcast by the Centre National d'Etudes Spatiales (CNES) are applied to PPPAR. Additionally, the residuals of the RT phase biases products, convergence time, and positioning accuracy are investigated. The results indicate that GPS products have the best quality of AR, with wide-lane (WL) and narrow-lane (NL) residuals of 98.9% and 95.3%, respectively, within ±0.25 cycles. Within ±0.25 cycles, the WL and NL residuals of the Galileo are 98.2% and 94.3%, respectively. Within ±0.25 cycles, the (Beidou Navigation Satellite System) BDS has a poor quality of AR, with WL and NL residuals of 97.3% and 73.1%, respectively. Due to the poor quality of the BDS AR, the convergence time of the BDS is not calculated in this paper. The convergence time of other systems is significantly reduced after AR processing, and the convergence time of the GPS/Galileo combination is the fastest, being 17.14 min in kinematic mode and only 11.85 min in static mode. The positioning accuracy of the GPS, Galileo, GPS/Galileo, and GPS/Galileo/BDS in the E and U directions is significantly improved after PPPAR. [ABSTRACT FROM AUTHOR]

Recently, deep learning techniques have been extensively used to detect ships in synthetic aperture radar (SAR) images. The majority of modern algorithms can achieve successful ship detection outcomes when working with multiple-scale ships on a large sea surface. However, there are still issues, such as missed detection and incorrect identification when performing multi-scale ship object detection operations in SAR images of complex scenes. To solve these problems, this paper proposes a complex scenes multi-scale ship detection model, according to YOLOv7, called CSD-YOLO. First, this paper suggests an SAS-FPN module that combines atrous spatial pyramid pooling and shuffle attention, allowing the model to focus on important information and ignore irrelevant information, reduce the feature loss of small ships, and simultaneously fuse the feature maps of ship targets on various SAR image scales, thereby improving detection accuracy and the model's capacity to detect objects at several scales. The model's optimization is then improved with the aid of the SIoU loss function. Finally, thorough tests on the HRSID and SSDD datasets are presented to support our methodology. CSD-YOLO achieves better detection performance than the baseline YOLOv7, with a 98.01% detection accuracy, a 96.18% recall, and a mean average precision (mAP) of 98.60% on SSDD. In addition, in comparative experiments with other deep learning-based methods, in terms of overall performance, CSD-YOLO still performs better. [ABSTRACT FROM AUTHOR]

The construction of transport facilities plays a pivotal role in enhancing people's living standards, stimulating economic growth, maintaining social stability and bolstering national security. During the construction of transport facilities, it is essential to identify the distinctive features of a construction area to anticipate the construction process and evaluate the potential risks associated with the project. This paper presents a multi-objective semantic segmentation algorithm based on an improved U-Net network, which can improve the recognition efficiency of various types of features in the construction zone of transportation facilities. The main contributions of this paper are as follows: A multi-class target sample dataset based on UAV remote sensing and construction areas is established. A new virtual data augmentation method based on semantic segmentation of transport facility construction areas is proposed. A semantic segmentation model for the construction regions based on data augmentation and transfer learning is developed and future research directions are given. The results of the study show that the validity of the virtual data augmentation approach has been verified; the semantic segmentation of the transport facility model can semantically segment a wide range of target features. The highest semantic segmentation accuracy of the feature type was 97.56%. [ABSTRACT FROM AUTHOR]

The structure from motion (SfM) method has achieved great success in 3D sparse reconstruction, but it still faces serious challenges in large-scale scenes. Existing hybrid SfM methods usually do not fully consider the compactness between images and the connectivity between subclusters, resulting in a loose spatial distribution of images within subclusters, unbalanced connectivity between subclusters, and poor robustness in the merging stage. In this paper, an efficient and robust hybrid SfM method is proposed. First, the multifactor joint scene partition measure and the preassignment balanced image expansion algorithm among subclusters are constructed, which effectively solves the loose spatial distribution of images in subclusters problem and improves the degree of connection among subclusters. Second, the global GlobalACSfM method is used to complete the local sparse reconstruction of the subclusters under the cluster parallel framework. Then, a decentralized dynamic merging rule considering the connectivity of subclusters is proposed to realize robust merging among subclusters. Finally, public datasets and oblique photography datasets are used for experimental verification. The results show that the method proposed in this paper is superior to the state-of-the-art methods in terms of accuracy and robustness and has good feasibility and advancement prospects. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Providing higher precision Direction of Arrival (DOA) estimation has become a hot topic in the field of array signal processing for parameter estimation in recent years. However, when the physical aperture of the actual array is small, its aperture limitation means that even with super-resolution estimation algorithms, the achievable estimation precision is limited. This paper takes a novel approach by constructing an optimization algorithm using the covariance fitting criterion based on the array output's covariance matrix to fit and obtain the covariance matrix of a large aperture virtual array, thereby providing high-precision angular resolution through virtual aperture expansion. The covariance fitting expansion analysis and discussion are unfolded for both uniform linear arrays (ULAs) and sparse linear arrays (SLAs) under four different scenarios. Theoretical analysis and simulation experiments demonstrate that these methods can enhance the effective performance of angle estimation, especially in low signal-to-noise ratios (SNRs) and at small angular intervals by fitting virtual extended aperture data. [ABSTRACT FROM AUTHOR]

In the increasingly complex electromagnetic environment, main lobe jamming significantly degrades the performance of a wideband radar system. To mitigate this issue, this paper developed a wideband main lobe jamming suppression algorithm based on a distributed array radar. Firstly, this algorithm utilizes eigen-projection matrix processing in the main array to cancel out the main lobe jamming for main lobe maintenance, and then suppresses side lobe jamming through null constraint beamforming. Subsequently, the large aperture of the full array is leveraged to form a narrow beam directed toward the main lobe interference. Finally, joint beamforming using the minimum mean square error criterion is employed. In scenarios where both main lobe jamming and side lobe jamming exist, this algorithm can adaptively cancel main lobe wideband jamming, suppress side lobe wideband jamming, and effectively control the significant loss of the desired wideband signals caused by main lobe jamming within a smaller angular range. Simulation results validate the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

Ensemble Kalman filters are an efficient class of algorithms for large-scale ensemble data assimilation, but their performance is limited by their underlying Gaussian approximation. A two-step framework for ensemble data assimilation allows this approximation to be relaxed: The first step updates the ensemble in observation space, while the second step regresses the observation state update back to the state variables. This paper develops a new quantile-conserving ensemble filter based on kernel-density estimation and quadrature for the scalar first step of the two-step framework. It is shown to perform well in idealized non-Gaussian problems, as well as in an idealized model of assimilating observations of sea-ice concentration. [ABSTRACT FROM AUTHOR]

In the passive bistatic radar (PBR) system, methods exist to address the issue of detecting weak targets without being influenced by non-ideal factors from adjacent strong targets. These methods utilize the sparsity in the delay-Doppler domain of the cross ambiguity function (CAF) to detect weak targets. However, the modeling and solving of this method involve substantial memory consumption and computational complexity. To address these challenges, this paper establishes a target detection model for PBR based on batch processing of sparse representation and recovery. This model partitions the CAF into blocks, identifies blocks requiring processing based on the presence of targets, and improves the construction and utilization of the measurement matrix. This results in a reduction in the computational complexity and memory resource requirements for sparse representation and recovery, and provides favorable conditions for parallel execution of the algorithm. Experimental results indicate that the proposed approach increases the number of blocks by a factor of four, and reduces the number of real multiplications by approximately an order of magnitude. Hence, compared with the traditional approach, the proposed approach enables fast and stable detection of weak targets. [ABSTRACT FROM AUTHOR]

Decision-level information fusion methods using radar and vision usually suffer from low target matching success rates and imprecise multi-target detection accuracy. Therefore, a robust target detection algorithm based on the fusion of frequency-modulated continuous wave (FMCW) radar and a monocular camera is proposed to address these issues in this paper. Firstly, a lane detection algorithm is used to process the image to obtain lane information. Then, two-dimensional fast Fourier transform (2D-FFT), constant false alarm rate (CFAR), and density-based spatial clustering of applications with noise (DBSCAN) are used to process the radar data. Furthermore, the YOLOv5 algorithm is used to process the image. In addition, the lane lines are utilized to filter out the interference targets from outside lanes. Finally, multi-sensor information fusion is performed for targets in the same lane. Experiments show that the balanced score of the proposed algorithm can reach 0.98, which indicates that it has low false and missed detections. Additionally, the balanced score is almost unchanged in different environments, proving that the algorithm is robust. [ABSTRACT FROM AUTHOR]

A doppler radar holds promising prospects in the field of indoor target localization. However, traditional Doppler radar systems suffer from high power consumption, large size, and noticeable radio frequency interference issues when transmitting carriers of different frequencies. Therefore, an ISABO-based (improved subtraction-average-based optimizer) target localization algorithm for a single-frequency Doppler radar is proposed in this paper. Firstly, a mathematical model for target localization is established according to the spatial geometric relationships during the target movement and the Doppler frequency-shift information in the single-frequency echo signal. Then, the optimization function is constructed with the target motion error as the optimization goal. Finally, an improved subtraction-average-based optimizer algorithm is proposed to solve the optimal parameters and realize the target positioning. The experimental results show that the proposed method can achieve centimeter-level localization accuracy with a cost-effective system structure. [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]

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]

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]

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]

InSAR (Interferometric Synthetic Aperture Radar) is widely recognized as a crucial remote sensing tool for monitoring various geological disasters because it provides all-day and all-weather monitoring. Nevertheless, the current interpretation methods for InSAR heavily depend on the interpreter's experience, which hinders efficiency and fails to meet the requirements for the timely detection of geologic hazards. Furthermore, the results obtained through current InSAR processing carry inherent noise interference, further complicating the interpretation process. To address those issues, this paper proposes an approach that enables automatic and rapid identification of deformation zones. The proposed method leverages IPTA (Interferometric Point Target Analysis) technology for SAR data processing. It combines the power of HNSW (Hierarchical Navigable Small Word) and DBSCAN (Density-Based Spatial Clustering of Applications with Noise) algorithms to cluster deformation results. Compared with traditional methods, the computational efficiency of the proposed method is improved by 11.26 times, and spatial noise is suppressed. Additionally, the clustering results are fused with slope units determined using DEM (Digital Elevation Model), which facilitates the automatic identification of slopes experiencing deformation. The experimental verification in the western mountainous area of Beijing has identified 716 hidden danger areas, and this method is superior to the traditional technology in speed and automation. [ABSTRACT FROM AUTHOR]