nils-herrmann/clean_scirepeval huggingface dataset:
Biophysical Parameter Estimation With a Semisupervised Support Vector Machine

This letter presents two kernel-based methods for semisupervised regression. The methods rely on building a graph or hypergraph Laplacian with both the available labeled and unlabeled data, which is further used to deform the training kernel matrix. The deformed kernel is then used for support vector regression (SVR). Given the high computational burden involved, we present two alternative formulations based on the Nystrom method and the incomplete Cholesky factorization to achieve operational processing times. The semisupervised SVR algorithms are successfully tested in multiplatform leaf area index estimation and oceanic chlorophyll concentration prediction. Experiments are carried out with both multispectral and hyperspectral data, demonstrating good generalization capabilities when a low number of labeled samples are available, which is usually the case in biophysical parameter retrieval.
Combination of one-class remote sensing image classifiers

This paper presents simple but powerful combination methods of dedicated one-class classifiers (OCCs) for efficient remote sensing image classification. The mean and product combination rules are applied to the probabilistic outputs generated by OCCs, and the performance is illustrated in a urban monitoring application in which multi-sensor (optical and SAR) data and multi-source (spectral and contextual) features are available. Two OCCs are used as core parts: the classical mixture of Gaussians (MoG) and the support vector domain description (SVDD) classifier. The obtained results by combining SVDD classifier outputs show a clear improvement in the accuracy, and more robustness to high dimensional samples compared to both MoG and stacked approaches.
Structured output SVM for remote sensing image classification

In the recent years, kernel methods have revealed very powerful tools in many application domains in general and in remote sensing image classification in particular. The special characteristics of remote sensing images (high dimension, few labeled samples and different noise sources) are efficiently dealt with kernel machines. In this paper, we propose the use of structured output learning to improve remote sensing image classification based on kernels. structured output learning is concerned with the design of machine learning algorithms that not only implement input-output mapping, but also take into account the relations between output labels, thus generalizing unstructured kernel methods. We analyze the framework and introduce it to the remote sensing community. Output similarity is here encoded into SVM classifiers by modifying the model loss function and the kernel function either independently or jointly. Experiments on a very high resolution (VHR) image classification problem shows promising results and opens a wide field of research with structured output kernel methods.
Remote Sensing Image Processing

Earth observation is the field of science concerned with the problem of monitoring and modeling the processes on the Earth surface and their interaction with the atmosphere. The Earth is continuously monitored with advanced optical and radar sensors. The images are analyzed and processed to deliver useful products to individual users, agencies and public administrations. To deal with these problems, remote sensing image processing is nowadays a mature research area, and the techniques developed in the field allow many real-life applications with great societal value. For instance, urban monitoring, fire detection or flood prediction can have a great impact on economical and environmental issues. To attain such objectives, the remote sensing community has turned into a multidisciplinary field of science that embraces physics, signal theory, computer science, electronics and communications. From a machine learning and signal/image processing point of view, all the applications are tackled under specific formalisms, such as classification and clustering, regression and function approximation, data coding, restoration and enhancement, source unmixing, data fusion or feature selection and extraction. This book covers some of the fields in a comprehensive way. Table of Contents: Remote Sensing from Earth Observation Satellites / The Statistics of Remote Sensing Images / Remote Sensing Feature Selection and Extraction / {Classification / Spectral Mixture Analysis / Estimation of Physical Parameters
Gaussian Process Retrieval of Chlorophyll Content From Imaging Spectroscopy Data

Precise and spatially-explicit knowledge of leaf chlorophyll content (Chl) is crucial to adequately interpret the chlorophyll fluorescence (ChF) signal from space. Accompanying information about the reliability of the Chl estimation becomes more important than ever. Recently, a new statistical method was proposed within the family of nonparametric Bayesian statistics, namely Gaussian Processes regression (GPR). GPR is simpler and more robust than their machine learning family members while maintaining very good numerical performance and stability. Other features include: (i) GPR requires a relatively small training data set and can adopt very flexible kernels, (ii) GPR identifies the relevant bands and observations in establishing relationships with a variable, and finally (iii) along with pixelwise estimations GPR provides accompanying confidence intervals. We used GPR to retrieve Chl from hyperspectral reflectance data and evaluated the portability of the regression model to other images. Based on field Chl measurements from the SPARC dataset and corresponding spaceborne CHRIS spectra (acquired in 2003, Barrax, Spain), GPR developed a regression model that was excellently validated (r2: 0.96, RMSE: 3.82 μg/cm2). The SPARC-trained GPR model was subsequently applied to CHRIS images (Barrax, 2003, 2009) and airborne CASI flightlines (Barrax 2009) to generate Chl maps. The accompanying confidence maps provided insight in the robustness of the retrievals. Similar confidences were achieved by both sensors, which is encouraging for upscaling Chl estimates from field to landscape scale. Because of its robustness and ability to deliver confidence intervals, GPR is evaluated as a promising candidate for implementation into ChF processing chains.
Discovering single classes in remote sensing images with active learning

When dealing with supervised target detection, the acquisition of labeled samples is one of the most critical phases: the samples must be yet representative of the class of interest, but must also be found among a vast majority of non-target examples. Moreover, the efficiency of the search is also an issue, since the samples labeled as background are not used by target detectors such as the support vector data description (SVDD). In this work we propose a competitive and effective approach to identify the most relevant training samples for one-class classification based on the use of an active learning strategy. The SVDD classifier is first trained with insufficient target examples. It is then used to detect the most informative samples to be labeled by a user through active learning techniques. By selecting unlabeled samples in a smart way and by adopting a diversity criterion, it is possible to obtain an accurate description of the class of interest with a relatively small number of training samples. The performance of the proposed method is illustrated in a change detection scenario and is validated by comparison with state-of-art active learning techniques originally developed for multiclass problems.
Unsupervised change detection in the feature space using kernels

In this paper we propose an unsupervised approach to change detection by computing the difference image directly in the feature spaces. The resulting difference kernel, that is a combination of kernels computed on the coregistered and radiometrically matched input images, is used to train a nonlinear partitioning algorithm. In order to apply the kernel k-means, issues related to the initialization and to the tuning of parameters (e.g. the Gaussian RBF bandwidth) are considered. To validate the proposed unsupervised algorithm, two multitemporal VHR remote sensing images are used.
Efficient Kernel Orthonormalized PLS for Remote Sensing Applications

This paper studies the performance and applicability of a novel kernel partial least squares (KPLS) algorithm for nonlinear feature extraction in the context of remote sensing applications. The so-called kernel orthonormalized PLS algorithm with reduced complexity (rKOPLS) has the following two core parts: (1) a kernel version of OPLS (called KOPLS) and (2) a sparse approximation for large-scale data sets, which ultimately leads to the rKOPLS algorithm. The method is theoretically analyzed in terms of computational burden and memory requirements and is tested in common remote sensing applications: multi- and hyperspectral image classification and biophysical parameter estimation problems. The proposed method largely outperforms the traditional (linear) PLS algorithm and demonstrates good capabilities in terms of expressive power of the extracted nonlinear features, accuracy, and scalability as compared to the standard KPLS.
Semi-Supervised Remote Sensing Image Classification based on Clustering and the Mean Map Kernel

This paper presents a semi-supervised classifier based on the combination of the expectation-maximization (EM) algorithm for Gaussian mixture models (GMM) and the mean map kernel. The proposed method uses the most reliable samples in terms of maximum likelihood to compute a kernel function that accurately reflects the similarity between clusters in the kernel space. The proposed method improves classification accuracy in situations where the available labeled information does not properly describe the classes in the test image.
Kernel Multivariate Analysis Framework for Supervised Subspace Learning: A Tutorial on Linear and Kernel Multivariate Methods

Feature extraction and dimensionality reduction are important tasks in many fields of science dealing with signal processing and analysis. The relevance of these techniques is increasing as current sensory devices are developed with ever higher resolution, and problems involving multimodal data sources become more common. A plethora of feature extraction methods are available in the literature collectively grouped under the field of multivariate analysis (MVA). This article provides a uniform treatment of several methods: principal component analysis (PCA), partial least squares (PLS), canonical correlation analysis (CCA), and orthonormalized PLS (OPLS), as well as their nonlinear extensions derived by means of the theory of reproducing kernel Hilbert spaces (RKHSs). We also review their connections to other methods for classification and statistical dependence estimation and introduce some recent developments to deal with the extreme cases of large-scale and low-sized problems. To illustrate the wide applicability of these methods in both classification and regression problems, we analyze their performance in a benchmark of publicly available data sets and pay special attention to specific real applications involving audio processing for music genre prediction and hyperspectral satellite image processing for Earth and climate monitoring.
Kernel Antenna Array Processing

We introduce two support vector machine (SVM)-based approaches for solving antenna problems such as beamforming, sidelobe suppression, and maximization of the signal-to-noise ratio. A basic introduction to SVM optimization is provided and a complex nonlinear SVM formulation developed to handle antenna array processing in space and time. The new optimization formulation is compared with both the minimum mean square error and the minimum variance distortionless response methods. Several examples are included to show the performance of the new approaches
Semisupervised Classification of Remote Sensing Images With Active Queries

We propose a semiautomatic procedure to generate land cover maps from remote sensing images. The proposed algorithm starts by building a hierarchical clustering tree, and exploits the most coherent pixels with respect to the available class information. For a given amount of labeled pixels, the algorithm returns both classification and confidence maps. Since the quality of the map depends of the number and informativeness of the labeled pixels, active learning methods are used to select the most informative samples to increase confidence in class membership. Experiments on four different data sets, accounting for hyperspectral and multispectral images at different spatial resolutions, confirm the effectiveness of the proposed approach, and how active learning techniques reduce the uncertainty of the classification maps. Specifically, more accurate results with fewer labeled samples are obtained. Inclusion of spatial information in the classifiers drastically improves the classification accuracy, leading to faster convergence curves and tighter confidence intervals. In conclusion, the presented algorithm provides efficient image classification and, at the same time, yields a confidence map that may be very useful in many Earth observation applications.
Semi-Supervised Kernel Orthogonal Subspace Projection

The Orthogonal Subspace Projection (OSP) algorithm is substantially a kind of matched filter that requires the evaluation of a prototype for each class to be detected. The kernel OSP (KOSP) has recently demonstrated improved results for target detection in hyperspectral images. The use of kernel helps to combat the high dimensionality problem and makes the method robust to noise. This paper presents a semi-supervised graph-based approach to improve KOSP. The proposed algorithm deforms the kernel by approximating the marginal distribution using the unlabeled samples. The good performance of the proposed method is illustrated in a toy dataset and an hyperspectral image target detection problem.
Semisupervised Kernel Feature Extraction for Remote Sensing Image Analysis

This paper presents a novel semisupervised kernel partial least squares (KPLS) algorithm for nonlinear feature extraction to tackle both land-cover classification and biophysical parameter retrieval problems. The proposed method finds projections of the original input data that align with the target variable (labels) and incorporates the wealth of unlabeled information to deal with low-sized or underrepresented data sets. The method relies on combining two kernel functions: the standard radial-basis-function kernel based on labeled information and a generative, i.e., probabilistic, kernel directly learned by clustering the data many times and at different scales across the data manifold. The construction of the kernel is very simple and intuitive: Two samples should belong to the same class if they consistently belong to the same clusters at different scales. The effectiveness of the proposed method is successfully illustrated in multi- and hyperspectral remote sensing image classification and biophysical parameter estimation problems. Accuracy improvements in the range between +5% and 15% over standard principal component analysis (PCA), +4% and 15% over kernel PCA, and +3% and 10% over KPLS are obtained on several images. The average gain in the root-mean-square error of +5% and reductions in bias estimates of +3% are obtained for biophysical parameter retrieval compared to standard PCA feature extraction.
Remote Sensing Feature Selection by Kernel Dependence Measures

This letter introduces a nonlinear measure of independence between random variables for remote sensing supervised feature selection. The so-called Hilbert-Schmidt independence criterion (HSIC) is a kernel method for evaluating statistical dependence and it is based on computing the Hilbert-Schmidt norm of the cross-covariance operator of mapped samples in the corresponding Hilbert spaces. The HSIC empirical estimator is easy to compute and has good theoretical and practical properties. Rather than using this estimate for maximizing the dependence between the selected features and the class labels, we propose the more sensitive criterion of minimizing the associated HSIC p-value. Results in multispectral, hyperspectral, and SAR data feature selection for classification show the good performance of the proposed approach.
Learning Relevant Image Features With Multiple-Kernel Classification

The increase in spatial and spectral resolution of the satellite sensors, along with the shortening of the time-revisiting periods, has provided high-quality data for remote sensing image classification. However, the high-dimensional feature space induced by using many heterogeneous information sources precludes the use of simple classifiers: thus, a proper feature selection is required for discarding irrelevant features and adapting the model to the specific problem. This paper proposes to classify the images and simultaneously to learn the relevant features in such high-dimensional scenarios. The proposed method is based on the automatic optimization of a linear combination of kernels dedicated to different meaningful sets of features. Such sets can be groups of bands, contextual or textural features, or bands acquired by different sensors. The combination of kernels is optimized through gradient descent on the support vector machine objective function. Even though the combination is linear, the ranked relevance takes into account the intrinsic nonlinearity of the data through kernels. Since a naive selection of the free parameters of the multiple-kernel method is computationally demanding, we propose an efficient model selection procedure based on the kernel alignment. The result is a weight (learned from the data) for each kernel where both relevant and meaningless image features automatically emerge after training the model. Experiments carried out in multi- and hyperspectral, contextual, and multisource remote sensing data classification confirm the capability of the method in ranking the relevant features and show the computational efficience of the proposed strategy.
Prediction of cyclosporine dosage in patients after kidney transplantation using neural networks

Proposes the use of neural networks for individualizing the dosage of cyclosporine A (CyA) in patients who have undergone kidney transplantation. Since the dosing of CyA usually requires intensive therapeutic drug monitoring, the accurate prediction of CyA blood concentrations would decrease the monitoring frequency and, thus, improve clinical outcomes. Thirty-two patients and different factors were studied to obtain the models. Three kinds of networks (multilayer perceptron, finite impulse response (FIR) network, and Elman recurrent network) and the formation of neural-network ensembles are used in a scheme of two chained models where the blood concentration predicted by the first model constitutes an input to the dosage prediction model. This approach is designed to aid in the process of clinical decision making. The FIR network, yielding root-mean-square errors (RMSEs) of 52.80 ng/mL and mean errors (MEs) of 0.18 ng/mL in validation (10 patients) showed the best blood concentration predictions and a committee of trained networks improved the results (RMSE=46.97 ng/mL, ME=0.091 ng/mL). The Elman network was the selected model for dosage prediction (RMSE=0.27 mg/Kg/d, ME=0.07 mg/Kg/d). However, in both cases, no statistical differences on the accuracy of neural methods were found. The models' robustness is also analyzed by evaluating their performance when noise is introduced at input nodes, and it results in a helpful test for models' selection. We conclude that neural networks can be used to predict both dose and blood concentrations of cyclosporine in steady-state. This novel approach has produced accurate and validated models to be used as decision-aid tools.
Advanced processing of hyperspectral images

Hyperspectral imaging offers the possibility of characterizing materials and objects in the air, land and water on the basis of the unique reflectance patterns that result from the interaction of solar energy with the molecular structure of the material. In this paper, we provide a seminal view on recent advances in techniques for hyperspectral data processing. Our main focus is on the development of approaches able to naturally integrate the spatial and spectral information available from the data. Special attention is paid to techniques that circumvent the curse of dimensionality introduced by high-dimensional data spaces. Experimental results, focused in this work on a specific case-study of urban data analysis, demonstrate the success of the considered techniques. This paper represents a first step towards the development of a quantitative and comparative assessment of advances in hyperspectral data processing techniques.
Composite kernels for hyperspectral image classification

This letter presents a framework of composite kernel machines for enhanced classification of hyperspectral images. This novel method exploits the properties of Mercer's kernels to construct a family of composite kernels that easily combine spatial and spectral information. This framework of composite kernels demonstrates: 1) enhanced classification accuracy as compared to traditional approaches that take into account the spectral information only: 2) flexibility to balance between the spatial and spectral information in the classifier; and 3) computational efficiency. In addition, the proposed family of kernel classifiers opens a wide field for future developments in which spatial and spectral information can be easily integrated.
Kernel-based methods for hyperspectral image classification

This paper presents the framework of kernel-based methods in the context of hyperspectral image classification, illustrating from a general viewpoint the main characteristics of different kernel-based approaches and analyzing their properties in the hyperspectral domain. In particular, we assess performance of regularized radial basis function neural networks (Reg-RBFNN), standard support vector machines (SVMs), kernel Fisher discriminant (KFD) analysis, and regularized AdaBoost (Reg-AB). The novelty of this work consists in: 1) introducing Reg-RBFNN and Reg-AB for hyperspectral image classification; 2) comparing kernel-based methods by taking into account the peculiarities of hyperspectral images; and 3) clarifying their theoretical relationships. To these purposes, we focus on the accuracy of methods when working in noisy environments, high input dimension, and limited training sets. In addition, some other important issues are discussed, such as the sparsity of the solutions, the computational burden, and the capability of the methods to provide outputs that can be directly interpreted as probabilities.
Kernel image similarity criterion

This paper presents a family of metrics for assessing image similarity. The methods use the Hilbert-Schmidt Independence Criterion (HSIC) to estimate nonlinear statistical dependence between multidimensional images. The proposed methods have very good theoretical and practical properties. We illustrate the performance in evaluating the quality of natural photographic images, hyperspectral images under different noise levels, in synthetic multiresolution problems, and real pansharpening products.