Miracle-dz/UniFAR-FTUs huggingface dataset:
Radiometric Cross-Calibration of Tiangong-2 MWI Visible/NIR Channels over Aquatic Environments using MODIS

The Moderate-Resolution Wide-Wavelength Imager (MWI), onboard the Tiangong-2 (TG-2) Space Lab, is an experimental satellite sensor designed for the next-generation Chinese ocean color satellites. The MWI imagery is not sufficiently radiometrically calibrated, and therefore, the cross-calibration is urgently needed to provide high quality ocean color products for MWI observations. We proposed a simple and effective cross-calibration scheme for MWI data using well calibrated Moderate Resolution Imaging Spectroradiometer (MODIS) imagery over aquatic environments. The path radiance of the MWI was estimated using the quasi-synchronized MODIS images as well as the MODIS Rayleigh and aerosol look up tables (LUTs) from SeaWiFS Data Analysis System 7.4 (SeaDAS 7.4). The results showed that the coefficients of determination (R2) of the calibration coefficients were larger than 0.97, with sufficient matched areas to perform cross-calibration for MWI. Compared with the simulated Top of Atmosphere (TOA) radiance using synchronized MODIS images, all errors calculated with the calibration coefficients retrieved in this paper were less than 5.2%, and lower than the lab calibrated coefficients. The Rayleigh-corrected reflectance (ρrc), remote sensing reflectance (Rrs) and total suspended matter (TSM) products of MWI, MODIS and the Geostationary Ocean Color Imager (GOCI) images for Taihu Lake in China were compared. The distribution of ρrc of MWI, MODIS and GOCI agreed well, except for band 667 nm of MODIS, which might have been saturated in relatively turbid waters. Besides, the Rrs used to retrieve TSM among MWI, MODIS and GOCI was also consistent. The root mean square errors (RMSE), mean biases (MB) and mean ratios (MR) between MWI Rrs and MODIS Rrs (or GOCI Rrs) were less than 0.20 sr−1, 5.52% and within 1 ± 0.023, respectively. In addition, the derived TSM from MWI and GOCI also agreed with a R2 of 0.90, MB of 13.75%, MR of 0.97 and RMSE of 9.43 mg/L. Cross-calibration coefficients retrieved in this paper will contribute to quantitative applications of MWI. This method can be extended easily to other similar ocean color satellite missions.
A Two-Branch CNN Architecture for Land Cover Classification of PAN and MS Imagery

The use of Very High Spatial Resolution (VHSR) imagery in remote sensing applications is nowadays a current practice whenever fine-scale monitoring of the earth’s surface is concerned. VHSR Land Cover classification, in particular, is currently a well-established tool to support decisions in several domains, including urban monitoring, agriculture, biodiversity, and environmental assessment. Additionally, land cover classification can be employed to annotate VHSR imagery with the aim of retrieving spatial statistics or areas with similar land cover. Modern VHSR sensors provide data at multiple spatial and spectral resolutions, most commonly as a couple of a higher-resolution single-band panchromatic (PAN) and a coarser multispectral (MS) imagery. In the typical land cover classification workflow, the multi-resolution input is preprocessed to generate a single multispectral image at the highest resolution available by means of a pan-sharpening process. Recently, deep learning approaches have shown the advantages of avoiding data preprocessing by letting machine learning algorithms automatically transform input data to best fit the classification task. Following this rationale, we here propose a new deep learning architecture to jointly use PAN and MS imagery for a direct classification without any prior image sharpening or resampling process. Our method, namely M u l t i R e s o L C C , consists of a two-branch end-to-end network which extracts features from each source at their native resolution and lately combine them to perform land cover classification at the PAN resolution. Experiments are carried out on two real-world scenarios over large areas with contrasted land cover characteristics. The experimental results underline the quality of our method while the characteristics of the proposed scenarios underline the applicability and the generality of our strategy in operational settings.
The AQUI Soil Moisture Network for Satellite Microwave Remote Sensing Validation in South-Western France

Global soil moisture (SM) products are currently available thanks to microwave remote sensing techniques. Validation of these satellite-based SM products over different vegetation and climate conditions is a crucial step. INRA (National Institute of Agricultural Research) has set up the AQUI SM and soil temperature in situ network (composed of three main sites Bouron, Bilos, and Hermitage), over a flat area of dense pine forests, in South-Western France (the Bordeaux–Aquitaine region) to validate the Soil Moisture and Ocean salinity (SMOS) satellite SM products. SMOS was launched in 2009 by the European Space Agency (ESA). The aims of this study are to present the AQUI network and to evaluate the SMOS SM product (in the new SMOS-IC version) along with other microwave SM products such as the active ASCAT (Advanced Scatterometer) and the ESA combined (passive and active) CCI (Climate Change Initiative) SM retrievals. A first comparison, using Pearson correlation, Bias, RMSE (Root Mean Square Error), and Un biased RMSE (ubRMSE) scores, between the 0–5 cm AQUI network and ASCAT, CCI, and SMOS SM products was conducted. In general all the three products were able to reproduce the annual cycle of the AQUI in situ observations. CCI and ASCAT had best and similar correlations (R~0.72) over the Bouron and Bilos sites. All had comparable correlations over the Hermitage sites with overall average values of 0.74, 0.68, and 0.69 for CCI, SMOS-IC, and ASCAT, respectively. Considering anomalies, correlation values decreased for all products with best ability to capture day to day variations obtained by ASCAT. CCI (followed by SMOS-IC) had the best ubRMSE values (mostly < 0.04 m3/m3) over most of the stations. Although the region is highly impacted by radio frequency interferences, SMOS-IC followed correctly the in situ SM dynamics. All the three remotely-sensed SM products (except SMOS-IC over some stations) overestimated the AQUI in situ SM observations. These results demonstrate that the AQUI network is likely to be well-suited for satellite microwave remote sensing evaluations/validations.
Deep Learning with Unsupervised Data Labeling for Weed Detection in Line Crops in UAV Images

In recent years, weeds have been responsible for most agricultural yield losses. To deal with this threat, farmers resort to spraying the fields uniformly with herbicides. This method not only requires huge quantities of herbicides but impacts the environment and human health. One way to reduce the cost and environmental impact is to allocate the right doses of herbicide to the right place and at the right time (precision agriculture). Nowadays, unmanned aerial vehicles (UAVs) are becoming an interesting acquisition system for weed localization and management due to their ability to obtain images of the entire agricultural field with a very high spatial resolution and at a low cost. However, despite significant advances in UAV acquisition systems, the automatic detection of weeds remains a challenging problem because of their strong similarity to the crops. Recently, a deep learning approach has shown impressive results in different complex classification problems. However, this approach needs a certain amount of training data, and creating large agricultural datasets with pixel-level annotations by an expert is an extremely time-consuming task. In this paper, we propose a novel fully automatic learning method using convolutional neuronal networks (CNNs) with an unsupervised training dataset collection for weed detection from UAV images. The proposed method comprises three main phases. First, we automatically detect the crop rows and use them to identify the inter-row weeds. In the second phase, inter-row weeds are used to constitute the training dataset. Finally, we perform CNNs on this dataset to build a model able to detect the crop and the weeds in the images. The results obtained are comparable to those of traditional supervised training data labeling, with differences in accuracy of 1.5% in the spinach field and 6% in the bean field.
Forest Cover and Vegetation Degradation Detection in the Kavango Zambezi Transfrontier Conservation Area Using BFAST Monitor

Forest cover and vegetation degradation was monitored across the Kavango-Zambezi Transfrontier Conservation Area (KAZA) in southern Africa and the performance of three different methods in detecting degradation was assessed using reference data. Breaks for Additive Season and Trend (BFAST) Monitor was used to identify potential forest cover and vegetation degradation using Landsat Normalized Difference Moisture Index (NDMI) time series data. Parametric probability-based magnitude thresholds, non-parametric random forest in conjunction with Soil-Adjusted Vegetation Index (SAVI) time series, and the combination of both methods were evaluated for their suitability to detect degradation for six land cover classes ranging from closed canopy forest to open grassland. The performance of degradation detection was largely dependent on tree cover and vegetation density. Satisfactory accuracies were obtained for closed woodland (user’s accuracy 87%, producer’s accuracy 71%) and closed forest (user’s accuracy 92%, producer’s accuracy 90%), with lower accuracies for open canopies. The performance of the three methods was more similar for closed canopies and differed for land cover classes with open canopies. Highest user’s accuracy was achieved when methods were combined, and the best performance for producer’s accuracy was obtained when random forest was used.
Algorithmic Theory of ODEs and Sampling from Well-conditioned Logconcave Densities

Sampling logconcave functions arising in statistics and machine learning has been a subject of intensive study. Recent developments include analyses for Langevin dynamics and Hamiltonian Monte Carlo (HMC). While both approaches have dimension-independent bounds for the underlying $\mathit{continuous}$ processes under sufficiently strong smoothness conditions, the resulting discrete algorithms have complexity and number of function evaluations growing with the dimension. Motivated by this problem, in this paper, we give a general algorithm for solving multivariate ordinary differential equations whose solution is close to the span of a known basis of functions (e.g., polynomials or piecewise polynomials). The resulting algorithm has polylogarithmic depth and essentially tight runtime - it is nearly linear in the size of the representation of the solution. We apply this to the sampling problem to obtain a nearly linear implementation of HMC for a broad class of smooth, strongly logconcave densities, with the number of iterations (parallel depth) and gradient evaluations being $\mathit{polylogarithmic}$ in the dimension (rather than polynomial as in previous work). This class includes the widely-used loss function for logistic regression with incoherent weight matrices and has been subject of much study recently. We also give a faster algorithm with $ \mathit{polylogarithmic~depth}$ for the more general and standard class of strongly convex functions with Lipschitz gradient. These results are based on (1) an improved contraction bound for the exact HMC process and (2) logarithmic bounds on the degree of polynomials that approximate solutions of the differential equations arising in implementing HMC.
Survey on Unmanned Aerial Vehicle Networks: A Cyber Physical System Perspective

Unmanned aerial vehicle (UAV) networks are playing an important role in various areas due to their agility and versatility, which have attracted significant attentions from both the academia and industry in recent years. As an integration of embedded systems with communication devices, computation capabilities and control modules, the UAV network could build a closed loop from data perceiving, information exchanging, decision making to the final execution, which tightly integrates cyber processes into physical devices. Therefore, the UAV network could be considered as a cyber physical system (CPS). Revealing coupling effects among the three interacted CPS components, i.e., communication, computation and control, is envisioned as the key to properly utilize all available resources and hence improve the performance of the UAV network. In this paper, we present a comprehensive survey on UAV networks from a CPS perspective. Firstly, we review the basics and advances of the three CPS components in UAV networks. Then we look inside to investigate how these components contribute to the system performance by classifying UAV networks into three hierarchies, i.e., cell level, system level, and system of system level. Furthermore, the coupling effects among these CPS components are explicitly illustrated, which could be enlightening to deal with the challenges in each individual aspect. New research directions and open issues are discussed at the end of this survey. With this intensive literature review, we intend to provide a novel insight into the state of the art in UAV networks.
Embedding cardinality constraints in neural link predictors

Neural link predictors learn distributed representations of entities and relations in a knowledge graph. They are remarkably powerful in the link prediction and knowledge base completion tasks, mainly due to the learned representations that capture important statistical dependencies in the data. Recent works in the area have focused on either designing new scoring functions or incorporating extra information into the learning process to improve the representations. Yet the representations are mostly learned from the observed links between entities, ignoring commonsense or schema knowledge associated with the relations in the graph. A fundamental aspect of the topology of relational data is the cardinality information, which bounds the number of predictions given for a relation between a minimum and maximum frequency. In this paper, we propose a new regularisation approach to incorporate relation cardinality constraints to any existing neural link predictor without affecting their efficiency or scalability. Our regularisation term aims to impose boundaries on the number of predictions with high probability, thus, structuring the embeddings space to respect commonsense cardinality assumptions resulting in better representations. Experimental results on Freebase, WordNet and YAGO show that, given suitable prior knowledge, the proposed method positively impacts the predictive accuracy of downstream link prediction tasks.
Proper Generalized Decomposition of Parameterized Electrothermal Problems Discretized by the Finite Integration Technique

We apply the proper generalized decomposition (PGD) to a static electrothermal model subject to uncertainties. The quadratic electrothermal coupling term is non-standard and requires the introduction of a trilinear form. We use an existing finite integration technique (FIT)-based solver to demonstrate the opportunities of integrating the PGD in existing codes. The obtained reduced model approximates the temperature distribution in a voltage-excited microelectronic chip package that exhibits 12 wires of uncertain length.
Discriminant Patch Representation for RGB-D Face Recognition Using Convolutional Neural Networks

This paper focuses on designing data-driven models to learn a discriminant representation space for face recognition using RGB-D data. Unlike hand-crafted representations, learned models can extract and organize the discriminant information from the data, and can automatically adapt to build new compute vision applications faster. We proposed an effective way to train Convolutional Neural Networks to learn face patch discriminant features. The proposed solution was tested and validated on state-of-the-art RGB-D datasets and showed competitive and promising results relatively to standard hand-crafted feature extractors.
Multi-task learning to improve natural language understanding

Recently advancements in sequence-to-sequence neural network architectures have led to an improved natural language understanding. When building a neural network-based Natural Language Understanding component, one main challenge is to collect enough training data. The generation of a synthetic dataset is an inexpensive and quick way to collect data. Since this data often has less variety than real natural language, neural networks often have problems to generalize to unseen utterances during testing. In this work, we address this challenge by using multi-task learning. We train out-of-domain real data alongside in-domain synthetic data to improve natural language understanding. We evaluate this approach in the domain of airline travel information with two synthetic datasets. As out-of-domain real data, we test two datasets based on the subtitles of movies and series. By using an attention-based encoder-decoder model, we were able to improve the F1-score over strong baselines from 80.76 % to 84.98 % in the smaller synthetic dataset.
XY Network for Nuclear Segmentation in Multi-Tissue Histology Images

Nuclear segmentation within Haematoxylin & Eosin stained histology images is a fundamental prerequisite in the digital pathology work-flow, due to the ability for nuclear features to act as key diagnostic markers. The development of automated methods for nuclear segmentation enables the quantitative analysis of tens of thousands of nuclei within a whole-slide pathology image, opening up possibilities of further analysis of large-scale nuclear morphometry. However, automated nuclear segmentation is faced with a major challenge in that there are several different types of nuclei, some of them exhibiting large intra-class variability such as the tumour cells. Additionally, some of the nuclei are often clustered together. To address these challenges, we present a novel convolutional neural network for automated nuclear segmentation that leverages the instance-rich information encoded within the vertical and horizontal distances of nuclear pixels to their centres of mass. These distances are then utilised to separate clustered nuclei, resulting in an accurate segmentation, particularly in areas with overlapping instances. We demonstrate state-of-the-art performance compared to other methods on four independent multi-tissue histology image datasets. Furthermore, we propose an interpretable and reliable evaluation framework that effectively quantifies nuclear segmentation performance and overcomes the limitations of existing performance measures.
Analysis of Political Party Twitter Accounts' Retweeters during Japan's 2017 Election

In modern election campaigns, political parties utilize social media to advertise their policies and candidates and to communicate to the electorate. In Japan's latest general election in 2017, the 48th general election for the Lower House, social media, especially Twitter, was actively used. In this paper, we analyze the users who retweeted tweets of political parties on Twitter during the election. Our aim is to clarify what kinds of users are diffusing (retweeting) tweets of political parties. The results indicate that the characteristics of retweeters of the largest ruling party (Liberal Democratic Party of Japan) and the largest opposition party (The Constitutional Democratic Party of Japan) were similar, even though the retweeters did not overlap each other. We also found that a particular opposition party (Japanese Communist Party) had quite different characteristics from other political parties.
Bernstein approximation of optimal control problems

Bernstein polynomial approximation to a continuous function has a slower rate of convergence as compared to other approximation methods. "The fact seems to have precluded any numerical application of Bernstein polynomials from having been made. Perhaps they will find application when the properties of the approximant in the large are of more importance than the closeness of the approximation. " -- has remarked P.J. Davis in his 1963 book Interpolation and Approximation. This paper presents a direct approximation method for nonlinear optimal control problems with mixed input and state constraints based on Bernstein polynomial approximation. We provide a rigorous analysis showing that the proposed method yields consistent approximations of time continuous optimal control problems. Furthermore, we demonstrate that the proposed method can also be used for costate estimation of the optimal control problems. This latter result leads to the formulation of the Covector Mapping Theorem for Bernstein polynomial approximation. Finally, we explore the numerical and geometric properties of Bernstein polynomials, and illustrate the advantages of the proposed approximation method through several numerical examples.
Learning to Generate Music with BachProp

As deep learning advances, algorithms of music composition increase in performance. However, most of the successful models are designed for specific musical structures. Here, we present BachProp, an algorithmic composer that can generate music scores in many styles given sufficient training data. To adapt BachProp to a broad range of musical styles, we propose a novel representation of music and train a deep network to predict the note transition probabilities of a given music corpus. In this paper, new music scores generated by BachProp are compared with the original corpora as well as with different network architectures and other related models. We show that BachProp captures important features of the original datasets better than other models and invite the reader to a qualitative comparison on a large collection of generated songs.
Embedding Push and Pull Search in the Framework of Differential Evolution for Solving Constrained Single-objective Optimization Problems

This paper proposes a push and pull search method in the framework of differential evolution (PPS-DE) to solve constrained single-objective optimization problems (CSOPs). More specifically, two sub-populations, including the top and bottom sub-populations, are collaborated with each other to search global optimal solutions efficiently. The top sub-population adopts the pull and pull search (PPS) mechanism to deal with constraints, while the bottom sub-population use the superiority of feasible solutions (SF) technique to deal with constraints. In the top sub-population, the search process is divided into two different stages --- push and pull stages.An adaptive DE variant with three trial vector generation strategies is employed in the proposed PPS-DE. In the top sub-population, all the three trial vector generation strategies are used to generate offsprings, just like in CoDE. In the bottom sub-population, a strategy adaptation, in which the trial vector generation strategies are periodically self-adapted by learning from their experiences in generating promising solutions in the top sub-population, is used to choose a suitable trial vector generation strategy to generate one offspring. Furthermore, a parameter adaptation strategy from LSHADE44 is employed in both sup-populations to generate scale factor $F$ and crossover rate $CR$ for each trial vector generation strategy. Twenty-eight CSOPs with 10-, 30-, and 50-dimensional decision variables provided in the CEC2018 competition on real parameter single objective optimization are optimized by the proposed PPS-DE. The experimental results demonstrate that the proposed PPS-DE has the best performance compared with the other seven state-of-the-art algorithms, including AGA-PPS, LSHADE44, LSHADE44+IDE, UDE, IUDE, $\epsilon$MAg-ES and C$^2$oDE.