nils-herrmann/clean_scirepeval huggingface dataset:
Toward a Semiautomatic Machine Learning Retrieval of Biophysical Parameters

Biophysical parameters such as leaf chlorophyll content (LCC) and leaf area index (LAI) are standard vegetation products that can be retrieved from Earth observation imagery. This paper introduces a new machine learning regression algorithms (MLRAs) toolbox into the scientific Automated Radiative Transfer Models Operator (ARTMO) software package. ARTMO facilitates retrieval of biophysical parameters from remote observations in a MATLAB graphical user interface (GUI) environment. The MLRA toolbox enables analyzing the predictive power of various MLRAs in a semiautomatic and systematic manner, and applying a selected MLRA to multispectral or hyperspectral imagery for mapping applications. It contains both linear and nonlinear state-of-the-art regression algorithms, in particular linear feature extraction via principal component regression (PCR), partial least squares regression (PLSR), decision trees (DTs), neural networks (NNs), kernel ridge regression (KRR), and Gaussian processes regression (GPR). The performance of multiple implemented regression strategies has been evaluated against the SPARC dataset (Barrax, Spain) and simulated Sentinel-2 (8 bands), CHRIS (62 bands) and HyMap (125 bands) observations. In general, nonlinear regression algorithms (NN, KRR, and GPR) outperformed linear techniques (PCR and PLSR) in terms of accuracy, bias, and robustness. Most robust results along gradients of training/validation partitioning and noise variance were obtained by KRR while GPR delivered most accurate estimations. We applied a GPR model to a hyperspectral HyMap flightline to map LCC and LAI. We exploited the associated uncertainty intervals to gain insight in the per-pixel performance of the model.
Including invariances in SVM remote sensing image classification

This paper introduces a simple method to include invariances in support vector machine (SVM) for remote sensing image classification. We rely on the concept of virtual support vectors, by which the SVM is trained with both the selected support vectors and synthetic examples encoding the invariance of interest. The algorithm is very simple and effective, as demonstrated in two particularly interesting examples: invariance to the presence of shadows and to rotations in patchbased image segmentation. The improved accuracy (around +6% both in OA and Cohen's κ statistic), along with the simplicity of the approach encourage its use and extension to encode other invariances and other remote sensing data analysis applications.
Feature selection of hyperspectral data through local correlation and SFFS for crop classification

In this paper, we propose a procedure to reduce dimensionality of hyperspectral data while preserving relevant information for posterior crop cover classification. One of the main problems with hyperspectral image processing is the huge amount of data involved. In addition, pattern recognition methods are sensitive to problems associated to high dimensionality feature spaces (referred to as Hughes phenomenon of curse of dimensionality). We propose a dimensionality reduction strategy that eliminates redundant information by means of local correlation criterion between contiguous spectral bands; and a subsequent selection of the most discriminative features based on a Sequential Float Feature Selection algorithm. This method is tested with a crop cover recognition application of six hyperspectral images from the same area acquired with the 128-bands HyMap spectrometer during the DAISEX99 campaign. In the experiments, we analyze the dependence on the dimension and employed metrics. The results obtained using the Gaussian Maximum Likelihood improve the classification accuracy and confirm the validity of the proposed approach. Finally, we analyze the selected bands of the input space on order to gain knowledge on the problem and to give a physical interpretation of the results.
Large scale semi-supervised image segmentation with active queries

A semiautomatic procedure to generate classification maps of remote sensing images is proposed. Starting from a hierarchical unsupervised classification, the algorithm exploits the few available labeled pixels to assign each cluster to the most probable class. For a given amount of labeled pixels, the algorithm returns a classified segmentation map, along with confidence levels of class membership for each pixel. Active learning methods are used to select the most informative samples to increase confidence in the class membership. Experiments on a AVIRIS hyperspectral image confirm the effectiveness of the method, especially when used with active learning query functions and spatial regularization.
Multisource Composite Kernels for Urban-Image Classification

This letter presents advanced classification methods for very high resolution images. Efficient multisource information, both spectral and spatial, is exploited through the use of composite kernels in support vector machines. Weighted summations of kernels accounting for separate sources of spectral and spatial information are analyzed and compared to classical approaches such as pure spectral classification or stacked approaches using all the features in a single vector. Model selection problems are addressed, as well as the importance of the different kernels in the weighted summation.
Cloud-Screening Algorithm for ENVISAT/MERIS Multispectral Images

This paper presents a methodology for cloud screening of multispectral images acquired with the Medium Resolution Imaging Spectrometer (MERIS) instrument on-board the Environmental Satellite (ENVISAT). The method yields both a discrete cloud mask and a cloud-abundance product from MERIS level-1b data on a per-pixel basis. The cloud-screening method relies on the extraction of meaningful physical features (e.g., brightness and whiteness), which are combined with atmospheric-absorption features at specific MERIS-band locations (oxygen and water-vapor absorptions) to increase the cloud-detection accuracy. All these features are inputs to an unsupervised classification algorithm; the cloud-probability output is then combined with a spectral unmixing procedure to provide a cloud-abundance product instead of binary flags. The method is conceived to be robust and applicable to a broad range of actual situations with high variability of cloud types, presence of ground covers with bright and white spectra, and changing illumination conditions or observation geometry. The presented method has been shown to outperform the MERIS level-2 cloud flag in critical cloud-screening situations, such as over ice/snow covers and around cloud borders. The proposed modular methodology constitutes a general framework that can be applied to multispectral images acquired by spaceborne sensors working in the visible and near-infrared spectral range with proper spectral information to characterize atmospheric-oxygen and water-vapor absorptions.
Dosage individualization of erythropoietin using a profile-dependent support vector regression

The external administration of recombinant human erythropoietin is the chosen treatment for those patients with secondary anemia due to chronic renal failure in periodic hemodialysis. The objective of this paper is to carry out an individualized prediction of the EPO dosage to be administered to those patients. The high cost of this medication, its side-effects and the phenomenon of potential resistance which some individuals suffer all justify the need for a model which is capable of optimizing dosage individualization. A group of 110 patients and several patient factors were used to develop the models. The support vector regressor (SVR) is benchmarked with the classical multilayer perceptron (MLP) and the Autoregressive Conditional Heteroskedasticity (ARCH) model. We introduce a priori knowledge by relaxing or tightening the /spl epsiv/-insensitive region and the penalization parameter depending on the time period of the patients' follow-up. The so-called profile-dependent SVR (PD-SVR) improves results of the standard SVR method and the MLP. We perform sensitivity analysis on the MLP and inspect the distribution of the support vectors in the input and feature spaces in order to gain knowledge about the problem.
Enhancing feature extraction for VF detection using data mining techniques

Previous studies developed by the authors proposed VF detection algorithms, including VT discrimination, based on time-frequency distributions. However due to the large number of parameters extracted from the distributions, efficient schemes for parameter selection and significance estimation are needed. This study proposes a combined strategy of classical and modern techniques for the selection of parameters to develop improved VF detection algorithms. We show how exhaustive exploration of the input space using data mining techniques simplifies and improves the solution and reduces the computational cost of detection algorithms. Jointly with classical selection techniques (correlation, Wilks' Lambda, statistical significance), other approaches are used (PCA, SOM-Ward and CART). We show that better results are achieved using less number of parameters than previous VF detection algorithms.
Enhancing genetic feature selection through restricted search and Walsh analysis

In this paper, a twofold approach to improve the performance of genetic algorithms (GAs) in the feature selection problem (FSP) is presented. First, a novel genetic operator is introduced to solve the FSP. This operator fixes in each iteration the number of features to be selected among the available ones and consequently reduces the size of the search space. This approach yields two main advantages: a) training the learning machine becomes faster and b) a higher performance is achieved by using the selected subset. Second, we propose using the Walsh expansion of the FSP fitness function in order to perform ranking on the problem features. Ranking features have been traditionally considered to be a challenging problem, especially significant in health sciences where the number of available and potentially noisy signals is high. Three real biological datasets are used to test the behavior of the two approaches proposed.
Therapeutic Drug Monitoring of Kidney Transplant Recipients Using Profiled Support Vector Machines

This paper proposes a twofold approach for therapeutic drug monitoring (TDM) of kidney recipients using support vector machines (SVMs), for both predicting and detecting Cyclosporine A (CyA) blood concentrations. The final goal is to build useful, robust, and ultimately understandable models for individualizing the dosage of CyA. We compare SVMs with several neural network models, such as the multilayer perceptron (MLP), the Elman recurrent network, finite/infinite impulse response networks, and neural network ARMAX approaches. In addition, we present a profile-dependent SVM (PD-SVM), which incorporates a priori knowledge in both tasks. Models are compared numerically, statistically, and in the presence of additive noise. Data from 57 renal allograft recipients were used to develop the models. Patients followed a standard triple therapy, and CyA trough concentration was the dependent variable. The best results for the CyA blood concentration prediction were obtained using the PD-SVM (mean error of 0.36 ng/mL and root-mean-square error of 52.01 ng/mL in the validation set) and appeared to be more robust in the presence of additive noise. The proposed PD-SVM improved results from the standard SVM and MLP, specially significant (both numerical and statistically) in the one-against-all scheme. Finally, some clinical conclusions were obtained from sensitivity rankings of the models and distribution of support vectors. We conclude that the PD-SVM approach produces more accurate and robust models than do neural networks. Finally, a software tool for aiding medical decision-making including the prediction models is presented
Mean Map Kernel Methods for Semisupervised Cloud Classification

Remote sensing image classification constitutes a challenging problem since very few labeled pixels are typically available from the analyzed scene. In such situations, labeled data extracted from other images modeling similar problems might be used to improve the classification accuracy. However, when training and test samples follow even slightly different distributions, classification is very difficult. This problem is known as sample selection bias. In this paper, we propose a new method to combine labeled and unlabeled pixels to increase classification reliability and accuracy. A semisupervised support vector machine classifier based on the combination of clustering and the mean map kernel is proposed. The method reinforces samples in the same cluster belonging to the same class by combining sample and cluster similarities implicitly in the kernel space. A soft version of the method is also proposed where only the most reliable training samples, in terms of likelihood of the image data distribution, are used. Capabilities of the proposed method are illustrated in a cloud screening application using data from the MEdium Resolution Imaging Spectrometer (MERIS) instrument onboard the European Space Agency ENVISAT satellite. Cloud screening constitutes a clear example of sample selection bias since cloud features change to a great extent depending on the cloud type, thickness, transparency, height, and background. Good results are obtained and show that the method is particularly well suited for situations where the available labeled information does not adequately describe the classes in the test data.
Learning with the kernel signal to noise ratio

This paper presents the application of the kernel signal to noise ratio (KSNR) in the context of feature extraction to general machine learning and signal processing domains. The proposed approach maximizes the signal variance while minimizes the estimated noise variance in a reproducing kernel Hilbert space (RKHS). The KSNR can be used in any kernel method to deal with correlated (possibly non-Gaussian) noise. We illustrate the method in nonlinear regression examples, dependence estimation and causal inference, nonlinear channel equalization, and nonlinear feature extraction from high-dimensional satellite images. Results show that the proposed KSNR yields more fitted solutions and extracts more noise-free features when confronted with standard approaches.
Semisupervised Remote Sensing Image Classification With Cluster Kernels

A semisupervised support vector machine is presented for the classification of remote sensing images. The method exploits the wealth of unlabeled samples for regularizing the training kernel representation locally by means of cluster kernels. The method learns a suitable kernel directly from the image and thus avoids assuming a priori signal relations by using a predefined kernel structure. Good results are obtained in image classification examples when few labeled samples are available. The method scales almost linearly with the number of unlabeled samples and provides out-of-sample predictions.
Explicit recursivity into reproducing kernel Hilbert spaces

This paper presents a methodology to develop recursive filters in reproducing kernel Hilbert spaces (RKHS). Unlike previous approaches that exploit the kernel trick on filtered and then mapped samples, we explicitly define model recursivity in the Hilbert space. The method exploits some properties of functional analysis and recursive computation of dot products without the need of pre-imaging. We illustrate the feasibility of the methodology in the particular case of the gamma-filter, an infinite impulse response (IIR) filter with controlled stability and memory depth. Different algorithmic formulations emerge from the signal model. Experiments in chaotic and electroencephalographic time series prediction scenarios demonstrate the potentiality of the approach.
Kernel-Based Framework for Multitemporal and Multisource Remote Sensing Data Classification and Change Detection

The multitemporal classification of remote sensing images is a challenging problem, in which the efficient combination of different sources of information (e.g., temporal, contextual, or multisensor) can improve the results. In this paper, we present a general framework based on kernel methods for the integration of heterogeneous sources of information. Using the theoretical principles in this framework, three main contributions are presented. First, a novel family of kernel-based methods for multitemporal classification of remote sensing images is presented. The second contribution is the development of nonlinear kernel classifiers for the well-known difference and ratioing change detection methods by formulating them in an adequate high-dimensional feature space. Finally, the presented methodology allows the integration of contextual information and multisensor images with different levels of nonlinear sophistication. The binary support vector (SV) classifier and the one-class SV domain description classifier are evaluated by using both linear and nonlinear kernel functions. Good performance on synthetic and real multitemporal classification scenarios illustrates the generalization of the framework and the capabilities of the proposed algorithms.
Semi-supervised cloud screening with Laplacian SVM

This work evaluates a new semi-supervised classification framework based on kernel methods and graph theory. In particular, the support vector machine (SVM) is further regularized with the un-normalized graph Laplacian, thus leading to the proposed Laplacian SVM. The method is tested in the challenging problem of cloud screening where the objective is to identify clouds in multispectral images acquired by space-borne sensors working in the visible and near-infrared spectral range. Preliminary results obtained using MERIS/ENVISAT data show the potential of the proposed Laplacian SVM in several scenarios.
Regularized Multiresolution Spatial Unmixing for ENVISAT/MERIS and Landsat/TM Image Fusion

Earth observation satellites currently provide a large volume of images at different scales. Most of these satellites provide global coverage with a revisit time that usually depends on the instrument characteristics and performance. Typically, medium-spatial-resolution instruments provide better spectral and temporal resolutions than mapping-oriented high-spatial-resolution multispectral sensors. However, in order to monitor a given area of interest, users demand images with the best resolution available, which cannot be reached using a single sensor. In this context, image fusion may be effective to merge information from different data sources. In this letter, an image fusion approach based on multiresolution and multisource spatial unmixing is used to obtain a composite image with the spectral and temporal characteristics of medium-spatial-resolution instrument along with the spatial resolution of high-spatial-resolution image. A time series of Landsat/TM and ENVISAT/MERIS Full Resolution images acquired in the 2004 European Space Agency (ESA) Spectra Barrax Campaign illustrates the method's capabilities. The qualitative and quantitative assessments of the product images are given. The proposed methodology is general enough to be applied to similar sensors, such as the multispectral instruments which will fly on board the ESA GMES Sentinel-2 and Sentinel-3 upcoming satellite series.
On the Impact of Lossy Compression on Hyperspectral Image Classification and Unmixing

Hyperspectral data lossy compression has not yet achieved global acceptance in the remote sensing community, mainly because it is generally perceived that using compressed images may affect the results of posterior processing stages. This possible negative effect, however, has not been accurately characterized so far. In this letter, we quantify the impact of lossy compression on two standard approaches for hyperspectral data exploitation: spectral unmixing, and supervised classification using support vector machines. Our experimental assessment reveals that different stages of the linear spectral unmixing chain exhibit different sensitivities to lossy data compression. We have also observed that, for certain compression techniques, a higher compression ratio may lead to more accurate classification results. Even though these results may seem counterintuitive, this work explains these observations in light of the spatial regularization and/or whitening that most compression techniques perform and further provides recommendations on best practices when applying lossy compression prior to hyperspectral data classification and/or unmixing.
New Cloud Detection Algorithm for Multispectral and Hyperspectral Images: Application to ENVISAT/MERIS and PROBA/CHRIS Sensors

This work presents a new methodology that faces the problem of accurate identification of location and abundance of clouds in multispectral images acquired by space-borne sensors working in the visible and near-infrared (VNIR) spectral range. The amount of images acquired over the globe every day by the instruments on board Earth Observation satellites makes inevitable that many of these images present cloud covers. The objective of this work is to develop and validate a method that takes advantage of the high spectral and radiometric resolution, and the specific band locations (e.g. the oxygen band) of present multispectral sensors to increase the cloud detection accuracy. Moreover, the method provides probability and cloud abundance rather than flags, which can be used to describe detected clouds (subpixel coverage, cloud type, height, etc) more accurately.
Learning the relevant image features with multiple kernels

This paper proposes to learn the relevant features of remote sensing images for automatic spatio-spectral classification with the automatic optimization of multiple kernels. The method consists of building dedicated kernels for different sets of bands, contextual or textural features. The optimal linear combination of kernels is optimized through gradient descent on the support vector machine (SVM) objective function. Since a na¨ıve implementation is computationally demanding, we propose an efficient model selection procedure based on kernel alignment. The result is a weight — learned from the data — for each kernel where both relevant and meaningless image features emerge after training. Excellent results are observed in both multi and hyperspec-tral image classification, improving standard SVM and other spatio-spectral formulations.
A soft approach to ERA algorithm for hyperspectral image classification

This work presents a novel supervised algorithm to solve the problem of crop classification using Hymap hyperspectral images acquired under controlled conditions in the Barrax area (Spain). We considered a multilayer perceptron (MLP) trained with the expanded range approximation (ERA) algorithm where the training set was varied in order to avoid local minima on the function error, which is an important drawback of the classical backpropagation (BP) algorithm. Soft modifications to ERA are proposed in order to improve its performance and robustness by tailoring smooth homotopy functions of the training set expansion. Our proposal is benchmarked with MLP trained by the BP and ERA algorithms and with other classical techniques, such as the radial basis function (RBF) network and the maximum-likelihood Gaussian classifier (MLGC).