Search

We present a novel method to detect underground cavities using cross-borehole ground-penetrating radar (GPR). We model the propagation of a GPR signal across a cavity and find that the spectrum of the signal will be distorted in a specific low-pass manner. Comparing the spectra of received signals with the predicted spectrum using a hypothesis-testing approach allows us to detect cavities with high probability. The proposed method is validated on both simulated and real measurements. Our approach generally remains effective even when conventional methods fail; our method can also be combined with conventional methods to more successfully distinguish between cavities and geologic clutter. [ABSTRACT FROM AUTHOR]

Spectral unmixing expresses the mixed pixels existing in hyperspectral images as the product of endmembers and their corresponding fractional abundances, which has been widely used in hyperspectral imagery analysis. However, the endmember spectra even for pixels from the same material of an image may include variability due to the influence of lighting conditions and inherent properties of materials within different pixels. Though the in situ spectral library has been used to accommodate such variability by using multiple in situ spectra to represent each kind of material, the performance improvement may be restricted due to the limited number of endmembers for each material. Therefore, in this article, spectral variability is directly extracted from an in situ endmember library and considered to be transferable among different endmembers for the first time. Furthermore, such a spectral variability is further used to augment sparse unmixing by synchronously performing endmember-based reconstruction and spectral variability-augmented reconstruction in the sparse unmixing model. By, respectively, imposing sparse and smoothness regularization over abundances and variability coefficients, a convex optimization-based spectral variability augmented sparse unmixing (SVASU) is finally proposed, and its convergence performance is also analyzed. Experiments conducted over synthetic and real-world datasets demonstrate that the proposed SVASU method not only significantly improves the unmixing performance of conventional spectral library-based unmixing but also outperforms several state-of-the-art sparse unmixing algorithms. [ABSTRACT FROM AUTHOR]

In order to more efficiently mine the features of polarimetric synthetic aperture radar (PolSAR) and establish a more appropriate classification model, this article proposes an improved convolutional autoencoder (ICAE) based on texture feature fusion (TFF-ICAE) for PolSAR terrain classification. First, TFF-ICAE specifically designs a multi-indicator squeeze-and-excitation (MI-SE) block and incorporates it into the CAE network. MI-SE can enhance the essential feature information while suppressing the interference information as much as possible, and it can effectively increase the between-class distance while reducing the within-class distance. Then, TFF-ICAE uses gray level co-occurrence matrix (GLCM) to capture the texture features, and it optimally fuses these texture features and the deep features extracted by ICAE to complete the multilevel feature fusion, elevating the feature representation completeness of the terrain. That is, TFF-ICAE effectively enhances the feature separation capability of different categories while greatly elevating the feature representation completeness. Experiments on the datasets of San Francisco, Oberpfaffenhofen, and Flevoland show that the proposed TFF-ICAE, respectively, achieves overall accuracies of 93.44%, 97.61%, and 97.78%, which are at least 0.92%, 1.52%, and 0.97% higher than other algorithms. Undoubtedly, the superiority of TFF-ICAE is verified on these datasets. [ABSTRACT FROM AUTHOR]

For the large amount of spatial and spectral information contained in hyperspectral image (HSI), feature description of HSI has attracted widespread concern in recent years. Existing deep learning-based HSI feature description algorithms require a large number of training samples and have poor interpretability. Therefore, it is necessary to develop an efficient HSI features description algorithm with interpretability based on machine learning. Local binary pattern (LBP) is a classical descriptor used to extract the local spatial texture features of images, which has been widely applied to image feature description and matching. However, the existing LBP algorithms for HSI are based on the single-dimensional description, which leads to the limitations on the expression of spatial–spectral information. Therefore, a multidimensional LBP (MDLBP) based on Clifford algebra for HSI is proposed in this article, which is able to extract spatial–spectral feature from multiple dimensions. First, with the theory of the Clifford algebra, a new representation of HSI including spatial and spectral information is built. Second, the geometric relationship between the local geometry of HSI in Clifford algebra space is calculated to realize the local multidimensional description of the local spatial–spectral information. Finally, a novel LBP coding algorithm for HSI is implemented based on the local multidimensional description to calculate the feature descriptor of HSI. The experimental results on HSI classification show that our proposed MDLBP algorithm can achieve higher accuracy than the representative spatial–spectral features and the existing LBP algorithms, especially in the scenery of small-scale training samples. [ABSTRACT FROM AUTHOR]

In this article, we introduce a deep learning-based technique for the linear hyperspectral unmixing problem. The proposed method contains two main steps. First, the endmembers are extracted using a geometric endmember extraction method, i.e., a simplex volume maximization in the subspace of the data set. Then, the abundances are estimated using a deep image prior. The main motivation of this work is to boost the abundance estimation and make the unmixing problem robust to noise. The proposed deep image prior uses a convolutional neural network to estimate the fractional abundances, relying on the extracted endmembers and the observed hyperspectral data set. The proposed method is evaluated on simulated and three real remote sensing data for a range of SNR values (i.e., from 20 to 50 dB). The results show considerable improvements compared to state-of-the-art methods. The proposed method was implemented in Python (3.8) using PyTorch as the platform for the deep network and is available online: https://github.com/BehnoodRasti/UnDIP. [ABSTRACT FROM AUTHOR]

Various approaches have been proposed to estimate surface ocean chlorophyll $a$ concentrations (Chl, mg m−3) from spectral reflectance measured either in the field or from space, each with its own strengths and limitations. Here, we develop a machine learning approach to reduce the impact of spectral noise and improve algorithm performance at the global scale for multiple satellite sensors. Among several candidates, the support vector regression (SVR) approach was found to yield the best algorithm performance as gauged by several statistical measures against field-measured Chl. While statistically the performance of the SVR is slightly worse than the empirical color index (CI) algorithm proposed in Hu et al. (2012) for Chl < 0.25 mg m−3, its applicability to global waters is much extended, from the CIs 0.01–0.25 mg m−3 (about 75% of the global oceans) to its 0.01–1 mg−3 [about 96% of global oceans according to Sea-viewing Wide Field-of-view Sensor (SeaWiFS) statistics]. Within this range, not only does the SVR show much improved performance over the traditional band-ratio OC x approaches, but the SVR leads to much reduced image noise and much improved cross-sensor consistency between SeaWiFS and Moderate Resolution Spectroradiometer (MODIS)/Aqua and between MODIS/Aqua and Visible Infrared Imaging Radiometer Suite (VIIRS). Furthermore, compared with the hybrid Ocean CI (OCI) algorithm currently used by the U.S. NASA as the default algorithm for all mainstream ocean color sensors, the SVR avoids the need to merge two different algorithms for intermediate Chl (band subtraction for CI and band ratio for OC x), thus may serve as an alternative approach for global data processing. [ABSTRACT FROM AUTHOR]

Spatial predictions, like other supervised learning tasks, require some criterion for a predictor’s quality. Typical data-splitting schemes, such as holdouts and k-fold cross-validation, ignore the fact that the training data are usually not available where predictions are being made. The common data-splitting schemes are thus biased estimates of a predictor’s performance, which in turn may lead to choosing suboptimal predictors. In this contribution, we borrow ideas from the domain adaptation machine-learning literature, to suggest the importance-weighted source risk (IWSR). IWSR is a principled approach for weighting the prediction risk, which allows the practitioner to explicitly state the target locations for prediction. IWSR essentially consists of down-weighting training locations and up-weighting target locations. We show that, unlike the usual (unweighted) empirical risk, IWSR is an unbiased estimator of the prediction error. Equipped with this risk estimator, we use it to learn a model in the empirical risk minimization framework and to evaluate the existing predictors. We show the superiority of this weighted risk, using both simulated data and an empirical control: air-temperature prediction in France. [ABSTRACT FROM AUTHOR]

Video synthetic aperture radar (SAR) has been found to be very valuable for detection and tracking of slow moving targets and for observing changes over short time periods. Shadows produced by target motion in sequential radar images can be used to detect targets themselves. This article presents a framework for shadow-aided moving target detection using deep neural networks (DNNs) in video SAR. The faster region-based convolutional neural network (Faster-RCNN) is first used to detect shadows in a single frame, and then all the detections in each frame are filtered by the improved density-based clustering algorithm to mitigate false alarms. The missing alarm in detection can be suppressed by using the designed bi-directional long-short-term memory (Bi-LSTM) network. The proposed approaches have been tested by both the simulated and the real data, and a comparison to classical processing is given. This article reveals that the DNN techniques are very suitable for video SAR moving target detection. [ABSTRACT FROM AUTHOR]

Polarimetric synthetic aperture radar (PolSAR) as a typical multi-channel sensor can obtain refined geometrical and geophysical information. In the PolSAR land cover classification task, feature extraction is regarded as a critical step for the final classification. It can employ multi-modal features from the original scattering data, polarimetric target decomposition, and other transformation space. Then, how to efficiently combine multi-modal polarimetric information and extract discriminant features is an important challenge for PolSAR image processing. Graph embedding methods have become a significant technique to deal with feature extraction and dimensionality reduction (DR) problems in recent years. It provides a unified linearization framework in machine learning and other pattern recognition tasks. In this article, an extended tensor embedding framework is introduced to extract the intrinsic features for PolSAR land cover classification. First, each pixel is represented by a feature cube that is constructed by groups of polarimetric scattering signals and target decomposition features in a fixed size patch. Second, an intrinsic matrix is constructed to describe the original geometrical and statistical properties of the samples, and a penalty matrix is designed to represent some constraints. Third, the vector-based algorithms are transformed into tensor space in an unified framework and based on the pair of matrices to obtain the projection matrices in each mode by an iterative optimization process. The effectiveness of the proposed methods is demonstrated on three RADARSAT2 data sets covering the regions of Xi’an, San Francisco, and Flevoland, respectively. The visualization and quantification results show that the proposed method has superiority in land cover classification. [ABSTRACT FROM AUTHOR]

The time-consuming modeling of physical remote sensing models restricts their application to parameter estimation from satellite observations. Machine learning techniques have become highly developed in recent years and show good capacity for model fitting. Based on our previously developed coupled soil–canopy–atmosphere radiative transfer model (RTM) and a multiple parameters estimation scheme, this paper evaluates the performance of four machine learning algorithms [Gaussian process regression (GPR), back-propagation neural networks (NNs), random forest regression, and general regression NN] on emulating the coupled RTM, where the traditional lookup table (LUT) algorithm is also compared. The results show that the GPR algorithm can emulate complex RTMs with excellent accuracy and efficiency. GPR emulators of photosynthetically active radiation (PAR), fraction of absorbed PAR, and incident shortwave radiation were applied to the multi-parameter estimation scheme to replace the traditional LUT algorithm, which avoids the need to integrate over the spectra while achieving an acceleration ratio of 16. A test of the updated multi-parameter estimation scheme at the Bondville site using 18 years of clear-sky observations demonstrates that replacing the computationally expensive integration processes with GPR emulators is practical. The emulators can also be used to simulate the corresponding parameters independently, and this GPR acceleration method for complex models is universal and can be easily applied to other time-consuming models. [ABSTRACT FROM AUTHOR]

In this paper, we consider the development of algorithms for the automatic detection of buried threats using ground penetrating radar (GPR) measurements. GPR is one of the most studied and successful modalities for automatic buried threat detection (BTD), and a large variety of BTD algorithms have been proposed for it. Despite this, large-scale comparisons of GPR-based BTD algorithms are rare in the literature. In this paper, we report the results of a multi-institutional effort to develop advanced BTD algorithms for a real-world GPR BTD system. The effort involved five institutions with substantial experience with the development of GPR-based BTD algorithms. In this paper, we report the technical details of the advanced algorithms submitted by each institution, representing their latest technical advances, and many state-of-the-art GPR-based BTD algorithms. We also report the results of evaluating the algorithms from each institution on the large experimental data set used for development. The experimental data set comprised 120 000 m2 of GPR data using surface area, from 13 different lanes across two U.S. test sites. The data were collected using a vehicle-mounted GPR system, the variants of which have supplied data for numerous publications. Using these results, we identify the most successful and common processing strategies among the submitted algorithms, and make recommendations for GPR-based BTD algorithm design. [ABSTRACT FROM AUTHOR]

The robustness of the supervised polarimetric synthetic aperture radar (PolSAR) image classification is severely affected by two main aspects, namely, the quantity and quality of the labeled training pixels. Specifically, limited manually labeled pixels with respect to the large scale of PolSAR image have limited the performance of the automatic classification methods, while manually labeled training pixels shall be unfaithful with the speckle and impure cell for their low qualities. In order to address the above two fundamental problems, we propose a robust semisupervised probability graphic-based classification framework. First, a semisupervised learning scheme is implemented to simultaneously exploit both labeled and unlabeled pixels for information compensation. Moreover, structural relationship among neighboring pixels inducing from the prior information is further benefit to reduce the influence of limited labeled pixels. Second, a robust classification loss function is added in the process of training classifier to enhance the robustness to the noisy labeled pixels. Third, unfaithful limited labeled data can be settled with a hybrid generative/discriminative classification framework, where labeled and unlabeled pixels are simultaneously exploited for learning high-level feature for the low-quality pixels. The effectiveness of the proposed framework on the specific aspect is validated in experiments on real PolSAR data sets, which reveal the superiority in both visual performance and classification accuracy compared with the state-of-the-art methods. Totally speaking, our model has improved the classification accuracy by at least 20% on data set Flevoland, 10% on Oberpfaffenhofen, and 5% on Weihe River than the compared ones. [ABSTRACT FROM PUBLISHER]

Computers are widely utilized in today’s weather forecasting as a powerful tool to leverage an enormous amount of data. Yet, despite the availability of such data, current techniques often fall short of producing reliable detailed storm forecasts. Each year severe thunderstorms cause significant damage and loss of life, some of which could be avoided if better forecasts were available. We propose a computer algorithm that analyzes satellite images from historical archives to locate visual signatures of severe thunderstorms for short-term predictions. While computers are involved in weather forecasts to solve numerical models based on sensory data, they are less competent in forecasting based on visual patterns from both current and past satellite images. In our system, we extract and summarize important visual storm evidence from satellite image sequences in the way that meteorologists interpret the images. In particular, the algorithm extracts and fits local cloud motion from image sequences to model the storm-related cloud patches. Image data from the year 2008 have been adopted to train the model, and historical severe thunderstorm reports in continental U.S. from 2000 to 2013 have been used as the ground truth and priors in the modeling process. Experiments demonstrate the usefulness and potential of the algorithm for producing more accurate severe thunderstorm forecasts. [ABSTRACT FROM PUBLISHER]

The problem of automatically recognizing and fitting hyperbolae from ground-penetrating radar (GPR) images is addressed, and a novel technique computationally suitable for real-time on-site application is proposed. After preprocessing of the input GPR images, a novel thresholding method is applied to separate the regions of interest from background. A novel column-connection clustering (C3) algorithm is then applied to separate the regions of interest from each other. Subsequently, a machine learnt model is applied to identify hyperbolic signatures from outputs of the C3 algorithm, and a hyperbola is fitted to each such signature with an orthogonal-distance hyperbola fitting algorithm. The novel clustering algorithm C3 is a central component of the proposed system, which enables the identification of hyperbolic signatures and hyperbola fitting. Only two features are used in the machine learning algorithm, which is easy to train using a small set of training data. An orthogonal-distance hyperbola fitting algorithm for “south-opening” hyperbolae is introduced in this work, which is more robust and accurate than algebraic hyperbola fitting algorithms. The proposed method can successfully recognize and fit hyperbolic signatures with intersections with others, hyperbolic signatures with distortions, and incomplete hyperbolic signatures with one leg fully or largely missed. As an additional novel contribution, formulas to compute an initial “south-opening” hyperbola directly from a set of given points are derived, which make the system more efficient. The parameters obtained by fitting hyperbolae to hyperbolic signatures are very important features; they can be used to estimate the location and size of the related target objects and the average propagation velocity of the electromagnetic wave in the medium. The effectiveness of the proposed system is tested on both synthetic and real GPR data. [ABSTRACT FROM PUBLISHER]

We designed and jointly optimized an integrated signal processing chain for detection and classification of long-range passive-acoustic underwater signals recorded by the global geophysical monitoring network of the Comprehensive Nuclear-Test-Ban Treaty Organization. Starting at the level of raw waveform data, a processing chain of signal detection, feature extraction, and signal classification was designed and jointly optimized to the task. Relevant waveform segments were in a first step identified by a generic, flexibly parameterized detection algorithm on a long- to short-term averages' ratio of the spectral energy. For representation, general-purpose sound processing features, with an added focus on spectral and cepstral features, were extracted from the detected segments. As classifiers, support vector machines with different kernel functions were employed alongside other baseline learning algorithms. The free parameters of the overall toolchain (i.e., trigger algorithm parameters and classifier hyperparameters) were jointly optimized in a cross-validation setting, either according to the cross-validation classification error or the cross-validation area under the receiver operating characteristic curve. Experiments demonstrate that our method outperforms machine learning algorithms task-tailored to a previous, human-expert-designed preprocessing chain. The presented approach can be adapted to a wide range of problems that can benefit from jointly optimizing parameters of preprocessing and classification algorithm. [ABSTRACT FROM AUTHOR]