Search

Simulated data play an important role in SAR target recognition, particularly under zero-shot learning (ZSL) conditions caused by the lack of training samples. The traditional SAR simulation method is based on manually constructing target 3D models for electromagnetic simulation, which is costly and limited by the target's prior knowledge base. Also, the unavoidable discrepancy between simulated SAR and measured SAR makes the traditional simulation method more limited for target recognition. This paper proposes an innovative SAR simulation method based on a visual language model and generative diffusion model by extracting target semantic information from optical remote sensing images and transforming it into a 3D model for SAR simulation to address the challenge of SAR target recognition under ZSL conditions. Additionally, to reduce the domain shift between the simulated domain and the measured domain, we propose a domain adaptation method based on dynamic weight domain loss and classification loss. The effectiveness of semantic information-based 3D models has been validated on the MSTAR dataset and the feasibility of the proposed framework has been validated on the self-built civilian vehicle dataset. The experimental results demonstrate that the first proposed SAR simulation method based on a visual language model and generative diffusion model can effectively improve target recognition performance under ZSL conditions. [ABSTRACT FROM AUTHOR]

Utilizing hydrophone arrays for detecting underwater acoustic communication (UWAC) signals leverages spatial information to enhance detection efficiency and expand the perceptual range. This study redefines the task of UWAC signal detection as an object detection problem within the frequency–azimuth (FRAZ) spectrum. Employing Faster R-CNN as a signal detector, the proposed method facilitates the joint prediction of UWAC signals, including estimates of the number of sources, modulation type, frequency band, and direction of arrival (DOA). The proposed method extracts precise frequency and DOA features of the signals without requiring prior knowledge of the number of signals or frequency bands. Instead, it extracts these features jointly during training and applies them to perform joint predictions during testing. Numerical studies demonstrate that the proposed method consistently outperforms existing techniques across all signal-to-noise ratios (SNRs), particularly excelling in low SNRs. It achieves a detection F1 score of 0.96 at an SNR of −15 dB. We further verified its performance under varying modulation types, numbers of sources, grating lobe interference, strong signal interference, and array structure parameters. Furthermore, the practicality and robustness of our approach were evaluated in lake-based UWAC experiments, and the model trained solely on simulated signals performed competitively in the trials. [ABSTRACT FROM AUTHOR]

Change detection (CD) is the main task in the remote sensing field. Binary change detection (BCD), which only focuses on the region of change, cannot meet current needs. Semantic change detection (SCD) is pivotal for identifying regions of change in sequential remote sensing imagery, focusing on discerning "from-to" transitions in land cover. The emphasis on features within these regions of change is critical for SCD efficacy. Traditional methodologies, however, often overlook this aspect. In order to address this gap, we introduce a change-aware guided multi-task network (CGMNet). This innovative network integrates a change-aware mask branch, leveraging prior knowledge of regions of change to enhance land cover classification in dual temporal remote sensing images. This strategic focus allows for the more accurate identification of altered regions. Furthermore, to navigate the complexities of remote sensing environments, we develop a global and local attention mechanism (GLAM). This mechanism adeptly captures both overarching and fine-grained spatial details, facilitating more nuanced analysis. Our rigorous testing on two public datasets using state-of-the-art methods yielded impressive results. CGMNet achieved Overall Score metrics of 58.77% on the Landsat-SCD dataset and 37.06% on the SECOND dataset. These outcomes not only demonstrate the exceptional performance of the method but also signify its superiority over other comparative algorithms. [ABSTRACT FROM AUTHOR]

Efficiently removing clouds from remote sensing imagery presents a significant challenge, yet it is crucial for a variety of applications. This paper introduces a novel sparse function, named the tri-fiber-wise sparse function, meticulously engineered for the targeted tasks of cloud detection and removal. This function is adept at capturing cloud characteristics across three dimensions, leveraging the sparsity of mode-1, -2, and -3 fibers simultaneously to achieve precise cloud detection. By incorporating the concept of tensor multi-rank, which describes the global correlation, we have developed a tri-fiber-wise sparse-based model that excels in both detecting and eliminating clouds from images. Furthermore, to ensure that the cloud-free information accurately matches the corresponding areas in the observed data, we have enhanced our model with an extended box-constraint strategy. The experiments showcase the notable success of the proposed method in cloud removal. This highlights its potential and utility in enhancing the accuracy of remote sensing imagery. [ABSTRACT FROM AUTHOR]

Test-time adaptation (TTA) has been proven to effectively improve the adaptability of deep learning semantic segmentation models facing continuous changeable scenes. However, most of the existing TTA algorithms lack an explicit exploration of domain gaps, especially those based on visual domain prompts. To address these issues, this paper proposes a self-prompt strategy based on uncertainty, guiding the model to continuously focus on regions with high uncertainty (i.e., regions with a larger domain gap). Specifically, we still use the Mean-Teacher architecture with the predicted entropy from the teacher network serving as the input to the prompt module. The prompt module processes uncertain maps and guides the student network to focus on regions with higher entropy, enabling continuous adaptation to new scenes. This is a self-prompting strategy that requires no prior knowledge and is tested on widely used benchmarks. In terms of the average performance, our method outperformed the baseline algorithm in TTA and continual TTA settings of Cityscapes-to-ACDC by 3.3% and 3.9%, respectively. Our method also outperformed the baseline algorithm by 4.1% and 3.1% on the more difficult Cityscapes-to-(Foggy and Rainy) Cityscapes setting, which also surpasses six other current TTA methods. [ABSTRACT FROM AUTHOR]

A source depth discrimination method based on intensity striations in the frequency–depth plane with a vertical linear array in a shallow water environment is proposed and studied theoretically and experimentally. To quantify the orientation of the interference patterns, a generalized waveguide variant (GWV) η is introduced. Due to the different dominance of the mode groups, the GWV distribution in the surface source is sharply peaked, indicating the presence of striations in the interferogram and the slope associated with the source–array range, while the distribution of the submerged source is more diffuse, and its interferogram is chaotic. The existence or lack of a distinct peak is used to separate the surface and submerged source classes. The method does not demand prior knowledge of the sound speed profile or the relative movement between the source and the array. In addition, it is the presence of the striations, not the value of η , that is exploited to separate the surface and submerged source classes, which means the source–array range can be unknown. The proposed method is validated using experimental data on the towing ship in SWellEx–96 and numerical modeling. The method's performance under noise situations and for different source–array ranges is also investigated. [ABSTRACT FROM AUTHOR]

Three-dimensional semantic segmentation is the foundation for automatically creating enriched Digital Twin Cities (DTCs) and their updates. For this task, prior-level fusion approaches show more promising results than other fusion levels. This article proposes a new approach by developing and benchmarking three prior-level fusion scenarios to enhance the outcomes of point cloud-enriched semantic segmentation. The latter were compared with a baseline approach that used the point cloud only. In each scenario, specific prior knowledge (geometric features, classified images, or classified geometric information) and aerial images were fused into the neural network's learning pipeline with the point cloud data. The goal was to identify the one that most profoundly enhanced the neural network's knowledge. Two deep learning techniques, "RandLaNet" and "KPConv", were adopted, and their parameters were modified for different scenarios. Efficient feature engineering and selection for the fusion step facilitated the learning process and improved the semantic segmentation results. Our contribution provides a good solution for addressing some challenges, particularly for more accurate extraction of semantically rich objects from the urban environment. The experimental results have demonstrated that Scenario 1 has higher precision (88%) on the SensatUrban dataset compared to the baseline approach (71%), the Scenario 2 approach (85%), and the Scenario 3 approach (84%). Furthermore, the qualitative results obtained by the first scenario are close to the ground truth. Therefore, it was identified as the efficient fusion approach for point cloud-enriched semantic segmentation, which we have named the efficient prior-level fusion (Efficient-PLF) approach. [ABSTRACT FROM AUTHOR]

Hyperspectral image (HSIs) denoising is a preprocessing step that plays a crucial role in many applications used in Earth observation missions. Low-rank tensor representation can be utilized to restore mixed-noise HSIs, such as those affected by mixed Gaussian, impulse, stripe, and deadline noises. Although there is a considerable body of research on spatial and spectral prior knowledge concerning subspace, the correlation between the spectral continuity and the nonlocal sparsity of the spectral and spatial factors is not yet fully understood. To address this deficiency, in the present study, we determined the correlation between these factors using a cascaded technique, and we describe in this paper the double-factor tensor cascaded-rank (DFTCR) minimization method that was used. The information existing in the nonlocal sparsity property of the spatial factor was employed to promote a geometrical feature representation, and a tensor cascaded-rank minimization approach was introduced as a nonlocal self-similarity to promote restoration quality. The continuity between the difference and nonlocal gradient sparsity constraints of the spectral factor was also introduced to learn the basis. Furthermore, to estimate the solutions of the proposed model, we developed an algorithm based on the alternating direction method of multipliers (ADMM). The performance of the DFTCR method was tested by a comparison with eleven established denoising methods for HSIs. The results showed that the proposed DFTCR method exhibited superior performance in the removal of mixed noise from HSIs. [ABSTRACT FROM AUTHOR]

Image-to-image translation (I2IT) is an important visual task that aims to learn a mapping of images from one domain to another while preserving the representation of the content. The phenomenon known as mode collapse makes this task challenging. Most existing methods usually learn the relationship between the data and latent distributions to train more robust latent models. However, these methods often ignore the structural information among latent variables, leading to patterns in the data being obscured during the process. In addition, the inflexibility of data modes caused by ignoring the latent mapping of two domains is also one of the factors affecting the performance of existing methods. To make the data schema stable, this paper develops a novel binary noise guidance learning (BnGLGAN) framework for image translation to solve these problems. Specifically, to eliminate uncertainty of domain distribution, a noise prior inference learning (NPIL) module is designed to infer an estimated distribution from a certain domain. In addition, to improve the authenticity of reconstructed images, a distribution-guided noise reconstruction learning (DgNRL) module is introduced to reconstruct the noise from the source domain, which can provide source semantic information to guide the GAN's generation. Extensive experiments fully prove the efficiency of our proposed framework and its advantages over comparable methods. [ABSTRACT FROM AUTHOR]

The extraction of photovoltaic (PV) panels from remote sensing images is of great significance for estimating the power generation of solar photovoltaic systems and informing government decisions. The implementation of existing methods often struggles with complex background interference and confusion between the background and the PV panels. As a result, the completeness and edge clarity of PV panel extraction results are compromised. Moreover, most previous studies have overlooked the unique color characteristics of PV panels. To alleviate these deficiencies and limitations, a method for extracting photovoltaic panels from high-resolution optical remote sensing images guided by prior knowledge (PKGPVN) is proposed. Firstly, aiming to address the problems related to missed extractions and background misjudgments, a Photovoltaic Index (PVI) based on visible images in the three-band is constructed to serve as prior knowledge to differentiate between PV panels and non-PV panels. Secondly, in order to strengthen information interaction between shallow features and deep features and enhance the accuracy and integrity of results, a Residual Convolution Hybrid Attention Module (RCHAM) is introduced into the skip-connection of the encoding–decoding structure. Finally, for the purpose of reducing the phenomenon of blurred edges, a multilevel Feature Loss (FL) function is designed to monitor the prediction results at different scales. Comparative experiments are conducted with seven methods, including U-Net, on publicly available datasets. The experimental results show that our PKGPVN achieves superior performance in terms of evaluation metrics such as IoU (above 82%), Precision (above 91%), Recall (above 89%), and F1-score (above 90%) on the AIR-PV dataset. Additionally, the ablation experiments illustrate the effectiveness of our key parts. The proposed method reduces the phenomena of missed extractions and background misjudgments effectively while producing highly accurate results with clear boundaries. [ABSTRACT FROM AUTHOR]

The annotations used during the training process are crucial for the inference results of remote sensing images (RSIs) based on a deep learning framework. Unlabeled RSIs can be obtained relatively easily. However, pixel-level annotation is a process that necessitates a high level of expertise and experience. Consequently, the use of small sample training methods has attracted widespread attention as they help alleviate reliance on large amounts of high-quality labeled data and current deep learning methods. Moreover, research on small sample learning is still in its infancy owing to the unique challenges faced when completing semantic segmentation tasks with RSI. To better understand and stimulate future research that utilizes semantic segmentation tasks with small data, we summarized the supervised learning methods and challenges they face. We also reviewed the supervised approaches with data that are currently popular to help elucidate how to efficiently utilize a limited number of samples to address issues with semantic segmentation in RSI. The main methods discussed are self-supervised learning, semi-supervised learning, weakly supervised learning and few-shot methods. The solution of cross-domain challenges has also been discussed. Furthermore, multi-modal methods, prior knowledge constrained methods, and future research required to help optimize deep learning models for various downstream tasks in relation to RSI have been identified. [ABSTRACT FROM AUTHOR]

The sparse direct position determination (DPD) method requires reconstructing the emitter position with prior knowledge. However, in non-cooperative localization scenarios, it is difficult to reconstruct the transmitted signal with the unknown signal form and propagation model. In this paper, a sparse DPD method based on time-difference-of-arrival (TDOA) information in correlation-domain is proposed. Different from the traditional sparse DPD method, the received signal is converted into correlation-domain, and the proposed dictionary matrix is generated by the quantized delay difference, which solves the pseudo-positioning problem. Compared to the conventional multi-signal classification (MUSIC) method, multi-frequency fusion (MFF) method, and two-step positioning algorithm, the proposed algorithm achieves higher positioning accuracy. The feasibility of the algorithm has been verified by both simulation and real-world measured tests. [ABSTRACT FROM AUTHOR]

The performance of traditional direction of arrival (DOA) estimation methods always deteriorates at a low signal-to-noise ratio (SNR) or without sufficient observations. This paper investigates the Bayesian DOA estimation problem aided by the prior knowledge from the target tracker. The Bayesian Cramér–Rao lower bounds (CRLB) and the expected CRLB are first derived to evaluate the theoretical performance of Bayesian DOA estimation. Based on the maximum a posterior (MAP) estimator in the Bayesian framework, two methods are proposed. One is a two-step grid search method for a single target DOA case. The other is a gradient-based iterative solution for multiple targets DOA case, which extends the traditional Newton method by incorporating the prior knowledge. We also propose a minimum mean square error (MMSE) estimator using a Monte Carlo method, which requires trading off accuracy against computational complexity. By comparing with the maximum likelihood (ML) estimators and the MUSIC algorithm, the proposed three Bayesian estimators improve the DOA estimation performance in low SNR or with limited snapshots. Moreover, the performance is not affected by the correlation between sources. [ABSTRACT FROM AUTHOR]

The scale and severity of forest disturbances across the globe are increasing due to climate change and human activities. Remote sensing analysis using time series data is a powerful approach for detecting large-scale forest disturbances and describing detailed forest dynamics. Various large-scale forest disturbance detection algorithms have been proposed, but most of them are only suitable for detecting high-magnitude forest disturbances (e.g., fire, harvest). Conversely, more continuous, subtle, and gradual lower-magnitude forest disturbances (e.g., thinning, pests, and diseases) have been subject to less focus. Deep learning (DL) can distinguish subtle differences in information within time series data, offering new opportunities to capture forest disturbances in a complete and detailed way. This study proposes an approach for analyzing forest dynamics across large areas and long time periods by combining DL time series classification and prior knowledge constraint. The approach consists of two stages: (1) an improved self-attention model used for time series classification to identify sequences with forest disturbance characteristics; (2) developed skip-disturbance recovery index (S-DRI) characterizing the temporal context, using prior knowledge constraint to identify forest disturbance years in time series with disturbance characteristics. In this study, the year of forest disturbances in five study areas located in the United States, Canada, and Poland from 2001 to 2020 was mapped. A total of 3082 manually interpreted test data with different disturbance causal agents (such as fire, harvest, conversion, hurricane, and pests) were sampled from five research areas for validation. Our approach was also evaluated against two forest disturbance benchmark datasets derived from LandTrendr and the Global Forest Change (GFC) dataset. The results demonstrate that our approach achieved an overall accuracy of 87.8%, surpassing the accuracy of LandTrendr (84.6%) and the Global Forest Change dataset (81.4%). Furthermore, our approach demonstrated lower omission rates (ranging from 10.0% to 67.4%) in detecting subtle to severe causal agents of forest disturbance, in comparison to LandTrendr (with a range of 18.0% to 81.6%) and GFC (with a range of 15.0% to 88.8%). This study, which involved mapping large-scale and long-term forest disturbance in multiple regions, revealed that our approach can be applied to new areas without a requirement for complex parameter adjustments. These results demonstrate the potential of our approach in generating comprehensive and detailed forest disturbance data, thus providing a new and effective method in this domain. [ABSTRACT FROM AUTHOR]

Efficient object detection and tracking from remote sensing video data acquired by unmanned aerial vehicles (UAVs) has significant implications in various domains, such as scene understanding, traffic surveillance, and military operations. Although the modern transformer-based trackers have demonstrated superior tracking accuracy, they often require extensive training time to achieve convergence, and the information from templates is not fully utilized in and integrated into tracking. To accelerate convergence and further improve tracking accuracy, we propose an end-to-end tracker named ParallelTracker that extracts prior knowledge from templates for better convergence and enriches template features in a parallel manner. Our core design incorporates spatial prior knowledge into the tracking process through three modules: a prior knowledge extractor module (PEM), a template features parallel enhancing module (TPM), and a template prior knowledge merge module (TPKM). These modules enable rich and discriminative feature extraction as well as integration of target information. We employ multiple PEM, TPM and TPKM modules along with a localization head to enhance accuracy and convergence speed in object tracking. To enable efficient online tracking, we also design an efficient parallel scoring prediction head (PSH) for selecting high-quality online templates. Our ParallelTracker achieves state-of-the-art performance on the UAV tracking benchmark UAV123, with an AUC score of 69.29%, surpassing the latest OSTrack and STARK methods. Ablation studies further demonstrate the positive impact of our designed modules on both convergence and accuracy. [ABSTRACT FROM AUTHOR]

Three dimensional (3D) object detection with an optical camera and light detection and ranging (LiDAR) is an essential task in the field of mobile robot and autonomous driving. The current 3D object detection method is based on deep learning and is data-hungry. Recently, semi-supervised 3D object detection (SSOD-3D) has emerged as a technique to alleviate the shortage of labeled samples. However, it is still a challenging problem for SSOD-3D to learn 3D object detection from noisy pseudo labels. In this paper, to dynamically filter the unreliable pseudo labels, we first introduce a self-paced SSOD-3D method SPSL-3D. It exploits self-paced learning to automatically adjust the reliability weight of the pseudo label based on its 3D object detection loss. To evaluate the reliability of the pseudo label in accuracy, we present prior knowledge based SPSL-3D (named as PSPSL-3D) to enhance the SPSL-3D with the semantic and structure information provided by a LiDAR-camera system. Extensive experimental results in the public KITTI dataset demonstrate the efficiency of the proposed SPSL-3D and PSPSL-3D. [ABSTRACT FROM AUTHOR]

To meet the demand for the aerosol detection of single-angle and multi-band polarization instrument containing short-wave infrared bands, an inversion algorithm that makes full use of multi-band intensity and polarization information is proposed based on optimal estimation theory. This method uses the polarization information in the short-wave infrared band to perform surface and atmosphere decoupling without a prior information on the surface. This obtains the initial value of the aerosol, and then it uses the scalar information to obtain the final result. Moreover, the multi-band information of the instrument is used for decoupling the surface and atmospheric information, which avoids the inversion error caused by the untimely update of the surface reflectance database and the error of spatio-temporal matching. The measured data of the Particulate Observing Scanning Polarimeter (POSP) are used to test the proposed algorithm. Firstly, to verify the effectiveness of the algorithm under different surface conditions, four regions with large geographical differences (Beijing, Hefei, Baotou, and Taiwan) are selected for aerosol optical depth (AOD) inversion, and they are compared with the aerosol robotic network (AERONET) products of the nearby stations. The validation against the AERONET products produces high correlation coefficients of 0.982, 0.986, 0.718, and 0.989, respectively, which verifies the effectiveness of the algorithm in different regions. Further, we analyzed the effectiveness of the proposed algorithm under different pollution conditions. Regions with AOD >0.7 and AOD < 0.7 are screened by using the AOD products of the Moderate-Resolution Imaging Spectroradiomete (MODIS), and the AOD of the corresponding region is inverted using POSP data. It was found to be spatially consistent with the MODIS products. The correlation coefficient and root mean square error (RMSE) in the AOD high region were 0.802 and 0.217, respectively, and 0.944 and 0.022 in the AOD low region, respectively, which verified the effectiveness of the proposed algorithm under different pollution conditions. [ABSTRACT FROM AUTHOR]

Hyperspectral Unmixing is the process of decomposing a mixed pixel into its pure materials (endmembers) and estimating their corresponding proportions (abundances). Although linear unmixing models are more common due to their simplicity and flexibility, they suffer from many limitations in real world scenes where interactions between pure materials exist, which paved the way for nonlinear methods to emerge. However, existing methods for nonlinear unmixing require prior knowledge or an assumption about the type of nonlinearity, which can affect the results. This paper introduces a nonlinear method with a novel deep convolutional autoencoder for blind unmixing. The proposed framework consists of a deep encoder of successive small size convolutional filters along with max pooling layers, and a decoder composed of successive 2D and 1D convolutional filters. The output of the decoder is formed of a linear part and an additive non-linear one. The network is trained using the mean squared error loss function. Several experiments were conducted to evaluate the performance of the proposed method using synthetic and real airborne data. Results show a better performance in terms of abundance and endmembers estimation compared to several existing methods. [ABSTRACT FROM AUTHOR]

High-resolution leaf area index (LAI) maps from remote sensing data largely depend on empirical models, which link field LAI measurements to the vegetation index. The existing empirical methods often require the field measurements to be sufficient for constructing a reliable model. However, in many regions of the world, there are limited field measurements available. This paper presents a prior knowledge-based (PKB) method to derivate LAI with limited field measurements, in an effort to improve the accuracy of empirical model. Based on the assumption that the experimental sites with the same vegetation type can be represented by similar models, a priori knowledge for crops was extracted from the published models in various cropland sites. The knowledge, composed of an initial guess of each model parameter with the associated uncertainty, was then combined with the local field measurements to determine a semi-empirical model using the Bayesian inversion method. The proposed method was evaluated at a cropland site in the Huailai region of Hebei Province, China. Compared with the regression method, the proposed PKB method can effectively improve the accuracy of empirical model and LAI estimation, when the field measurements were limited. The results demonstrate that a priori knowledge extracted from the universal sites can provide important auxiliary information to improve the representativeness of the empirical model in a given study area. [ABSTRACT FROM AUTHOR]

Platform vibration introduces sinusoidal modulation in inverse synthetic aperture lidar (ISAL) imaging, which causes paired echoes in ISAL imaging. In this paper, a varying amplitude vibration phase suppression algorithm is proposed. Working without prior knowledge, the proposed algorithm can suppress paired echoes under the condition of varying vibration amplitude and will not introduce new phase errors. Furthermore, the method is suitable for the imaging scene without isolated points. Both the simulated and real experiment results of ISAL turntable data demonstrate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Recently, unmixing methods based on nonnegative tensor factorization have played an important role in the decomposition of hyperspectral mixed pixels. According to the spatial prior knowledge, there are many regularizations designed to improve the performance of unmixing algorithms, such as the total variation (TV) regularization. However, these methods mostly ignore the similar characteristics among different spectral bands. To solve this problem, this paper proposes a group sparse regularization that uses the weighted constraint of the L 2 , 1 norm, which can not only explore the similar characteristics of the hyperspectral image in the spectral dimension, but also keep the data smooth characteristics in the spatial dimension. In summary, a non-negative tensor factorization framework based on weighted group sparsity constraint is proposed for hyperspectral images. In addition, an effective alternating direction method of multipliers (ADMM) algorithm is used to solve the algorithm proposed in this paper. Compared with the existing popular methods, experiments conducted on three real datasets fully demonstrate the effectiveness and advancement of the proposed method. [ABSTRACT FROM AUTHOR]

Precise Point Positioning (PPP), as a global precise positioning technique, suffers from relatively long convergence times, hindering its ability to be the default precise positioning technique. Reducing the PPP convergence time is a must to reach global precise positions, and doing so in a few minutes to seconds can be achieved thanks to the additional frequencies that are being broadcast by the modernized GNSS constellations. Due to discrepancies in the number of signals broadcast by each satellite/constellation, it is necessary to have a model that can process a mix of signals, depending on availability, and perform ambiguity resolution (AR), a technique that proved necessary for rapid convergence. This manuscript does so by expanding the uncombined Decoupled Clock Model to process and fix ambiguities on up to three frequencies depending on availability for GPS, Galileo, and BeiDou. GLONASS is included as well, without carrier-phase ambiguity fixing. Results show the possibility of consistent quasi-instantaneous global precise positioning through an assessment of the algorithm on a network of global stations, as the 67th percentile solution converges below 10 cm horizontal error within 2 min, compared to 8 min with a triple-frequency solution, showing the importance of having a flexible PPP-AR model frequency-wise. In terms of individual datasets, 14% of datasets converge instantaneously when mixing dual- and triple-frequency measurements, compared to just 0.1% in that of dual-frequency mode without ambiguity resolution. Two kinematic car datasets were also processed, and it was shown that instantaneous centimetre-level positioning with a moving receiver is possible. These results are promising as they only rely on ultra-rapid global satellite products, allowing for instantaneous real-time precise positioning without the need for any local infrastructure or prior knowledge of the receiver's environment. [ABSTRACT FROM AUTHOR]

The pixel-based semantic segmentation methods take pixels as recognitions units, and are restricted by the limited range of receptive fields, so they cannot carry richer and higher-level semantics. These reduce the accuracy of remote sensing (RS) semantic segmentation to a certain extent. Comparing with the pixel-based methods, the graph neural networks (GNNs) usually use objects as input nodes, so they not only have relatively small computational complexity, but also can carry richer semantic information. However, the traditional GNNs are more rely on the context information of the individual samples and lack geographic prior knowledge that reflects the overall situation of the research area. Therefore, these methods may be disturbed by the confusion of "different objects with the same spectrum" or "violating the first law of geography" in some areas. To address the above problems, we propose a remote sensing semantic segmentation model called knowledge and spatial pyramid distance-based gated graph attention network (KSPGAT), which is based on prior knowledge, spatial pyramid distance and a graph attention network (GAT) with gating mechanism. The model first uses superpixels (geographical objects) to form the nodes of a graph neural network and then uses a novel spatial pyramid distance recognition algorithm to recognize the spatial relationships. Finally, based on the integration of feature similarity and the spatial relationships of geographic objects, a multi-source attention mechanism and gating mechanism are designed to control the process of node aggregation, as a result, the high-level semantics, spatial relationships and prior knowledge can be introduced into a remote sensing semantic segmentation network. The experimental results show that our model improves the overall accuracy by 4.43% compared with the U-Net Network, and 3.80% compared with the baseline GAT network. [ABSTRACT FROM AUTHOR]

The broadened first-order sea clutter in shipborne high frequency surface wave radar (HFSWR), which will mask the targets with low radial velocity, is a kind of classical space–time coupled clutter. Space–time adaptive processing (STAP) has been proven to be an effective clutter suppression algorithm for space-time coupled clutter. To further improve the efficiency of clutter suppression, a STAP method based on a generalized sidelobe canceller (GSC) structure, named as the auxiliary channel STAP, was introduced into shipborne HFSWR. To obtain precise clutter information for the clutter covariance matrix (CCM) estimation, an approach based on the prior knowledge to auxiliary channel selection is proposed. Auxiliary channels are selected along the clutter ridge of the first-order sea clutter, whose distribution can be determined by the system parameters and regarded as pre-knowledge. To deal with the heterogeneity of the spreading first-order sea clutter, an innovative training samples selection approach according to the Riemannian distance is presented. The range cells that had shorter Riemannian distances to the cell under test (CUT) were chosen as training samples. Experimental results with measured data verified the effectiveness of the proposed algorithm, and the comparison with the existing clutter suppression algorithms showed the superiority of the algorithm. [ABSTRACT FROM AUTHOR]

Spectral unmixing (SU) aims at decomposing the mixed pixel into basic components, called endmembers with corresponding abundance fractions. Linear mixing model (LMM) and nonlinear mixing models (NLMMs) are two main classes to solve the SU. This paper proposes a new nonlinear unmixing method base on general bilinear model, which is one of the NLMMs. Since retrieving the endmembers' abundances represents an ill-posed inverse problem, prior knowledge of abundances has been investigated by conceiving regularizations techniques (e.g., sparsity, total variation, group sparsity, and low rankness), so to enhance the ability to restrict the solution space and thus to achieve reliable estimates. All the regularizations mentioned above can be interpreted as denoising of abundance maps. In this paper, instead of investing effort in designing more powerful regularizations of abundances, we use plug-and-play prior technique, that is to use directly a state-of-the-art denoiser, which is conceived to exploit the spatial correlation of abundance maps and nonlinear interaction maps. The numerical results in simulated data and real hyperspectral dataset show that the proposed method can improve the estimation of abundances dramatically compared with state-of-the-art nonlinear unmixing methods. [ABSTRACT FROM AUTHOR]

Hyperspectral imaging techniques are becoming one of the most important tools to remotely acquire fine spectral information on different objects. However, hyperspectral images (HSIs) require dedicated processing for most applications. Therefore, several machine learning techniques were proposed in the last decades. Among the proposed machine learning techniques, unsupervised learning techniques have become popular as they do not need any prior knowledge. Specifically, sparse subspace-based clustering algorithms have drawn special attention to cluster the HSI into meaningful groups since such algorithms are able to handle high dimensional and highly mixed data, as is the case in real-world applications. Nonetheless, sparse subspace-based clustering algorithms usually tend to demand high computational power and can be time-consuming. In addition, the number of clusters is usually predefined. In this paper, we propose a new hierarchical sparse subspace-based clustering algorithm (HESSC), which handles the aforementioned problems in a robust and fast manner and estimates the number of clusters automatically. In the experiment, HESSC is applied to three real drill-core samples and one well-known rural benchmark (i.e., Trento) HSI datasets. In order to evaluate the performance of HESSC, the performance of the new proposed algorithm is quantitatively and qualitatively compared to the state-of-the-art sparse subspace-based algorithms. In addition, in order to have a comparison with conventional clustering algorithms, HESSC's performance is compared with K-means and FCM. The obtained clustering results demonstrate that HESSC performs well when clustering HSIs compared to the other applied clustering algorithms. [ABSTRACT FROM AUTHOR]

Hyperspectral images (HSIs) denoising aims at recovering noise-free images from noisy counterparts to improve image visualization. Recently, various prior knowledge has attracted much attention in HSI denoising, e.g., total variation (TV), low-rank, sparse representation, and so on. However, the computational cost of most existing algorithms increases exponentially with increasing spectral bands. In this paper, we fully take advantage of the global spectral correlation of HSI and design a unified framework named subspace-based Moreau-enhanced total variation and sparse factorization (SMTVSF) for multispectral image denoising. Specifically, SMTVSF decomposes an HSI image into the product of a projection matrix and abundance maps, followed by a 'Moreau-enhanced' TV (MTV) denoising step, i.e., a nonconvex regularizer involving the Moreau envelope mechnisam, to reconstruct all the abundance maps. Furthermore, the schemes of subspace representation penalizing the low-rank characteristic and ℓ 2 , 1 -norm modelling the structured sparse noise are embedded into our denoising framework to refine the abundance maps and projection matrix. We use the augmented Lagrange multiplier (ALM) algorithm to solve the resulting optimization problem. Extensive results under various noise levels of simulated and real hypspectral images demonstrate our superiority against other competing HSI recovery approaches in terms of quality metrics and visual effects. In addition, our method has a huge advantage in computational efficiency over many competitors, benefiting from its removal of most spectral dimensions during iterations. [ABSTRACT FROM AUTHOR]

Bundle adjustment of multi-view satellite images is a powerful tool to align the orientations of all the images in a unified framework. However, the traditional bundle adjustment process faces a problem in detecting mismatches and evaluating low/medium/high-accuracy matches, which limits the final bundle adjustment accuracy, especially when the mismatches are several times more than the correct matches. To achieve more accurate bundle adjustment results, this paper formulates the prior knowledge of matching accuracy as matching confidences and proposes a matching confidence based bundle adjustment method. The core algorithm firstly selects several highest-confidence matches to initially correct orientations of all images, then detects and eliminates the mismatches under the initial orientation guesses and finally formulates both the matching confidences and the forward-backward projection errors as weights in an iterative bundle adjustment process for more accurate orientation results. We compared our proposed method with the famous RANSAC strategy as well as a state-of-the-art bundle adjustment method on the high-resolution multi-view satellite images. The experimental comparisons are evaluated by image checking points and ground control points, which shows that our proposed method is able to obtain more robust and more accurate mismatch detection results than the RANSAC strategy, even though the mismatches are four times more than the correct matches and it can also achieve more accurate orientation results than the state-of-the-art bundle adjustment method. [ABSTRACT FROM AUTHOR]

Accurate crop type identification and crop area estimation from remote sensing data in tropical regions are still considered challenging tasks. The more favorable weather conditions, in comparison to the characteristic conditions of temperate regions, permit higher flexibility in land use, planning, and management, which implies complex crop dynamics. Moreover, the frequent cloud cover prevents the use of optical data during large periods of the year, making SAR data an attractive alternative for crop mapping in tropical regions. This paper evaluates the effectiveness of Deep Learning (DL) techniques for crop recognition from multi-date SAR images from tropical regions. Three DL strategies are investigated: autoencoders, convolutional neural networks, and fully-convolutional networks. The paper further proposes a post-classification technique to enforce prior knowledge about crop dynamics in the target area. Experiments conducted on a Sentinel-1 multitemporal sequence of a tropical region in Brazil reveal the pros and cons of the tested methods. In our experiments, the proposed crop dynamics model was able to correct up to 16.5% of classification errors and managed to improve the performance up to 3.2% and 8.7% in terms of overall accuracy and average F1-score, respectively. [ABSTRACT FROM AUTHOR]