Artificial Finger for Textile Fabrics Brigitte Camillieri, Marie-Ange Bueno Laboratoire de Physique et Mécanique Textiles, Ecole Nationale Supérieure d'Ingénieurs Sud Alsace, University Haute Alsace marie-ange.bueno@uha.fr

STATEMENT OF PURPOSE

The goal is to design an artificial finger to replace the human finger during friction test on textile surfaces. In this study, four different kinds of textile fabrics are chosen because they represent a wide range of textile fabrics for clothing industry. Then alternative friction tests are carried out by humans on these fabrics. The evolution of the coefficient of friction during a displacement cycle are compared for the four fabrics. This helped to select the fabric used to develop the artificial finger. Then the artificial finger is designed by mimicry by studying the influence of the main morphological and mechanical criteria of the finger (shape, texture, Young's modulus) on the friction signal. Finally, the developed artificial finger is validated by comparing the results obtained for the four kinds of fabrics with the artificial and human fingers.

APPROACH

The four investigated fabrics are: o A plain woven fabric with a low surface pile. o A knitted polar fleece with a pile over the two sides of the fabric. The bristles have variable lengths and their orientation is random on the fabric surface. o A knitted velvet. The bristles are parallel and of equal lengths (about 2 mm). o A knitted artificial fur which bristles are parallel and of equal lengths (about 5 mm).

For pile fabrics as velvet or fur, the pile has a preferred direction for laying down as with the fur of an animal. This preferred direction is called further along pile and the other against pile main direction.

Two reciprocating linear tribometers have been used to measure the friction: a tribometer for fabrics equipped with a slider (artificial finger) and a tactile tribometer where the slider is a human finger. In both cases, the fabric sample is fixed on an oscillating table and the normal and tangential forces are measured.

A preliminary study showed that the touch exploration of textiles is carried out under a pressure of about 3 kPa with a sliding nominal speed of 20 mm/s (Breugnot). For both tribometers, the chosen sliding distance is 50 mm. For human finger, the choices are: using the index of the dominant hand with a finger tilt angle of 25 relative to the horizontal (Bueno et al.). Several cycles are performed but only the second one is exploited.

In addition, each artificial finger has an apparent contact area of 1.5 cm 2 , which corresponds to the surface of the finger in contact when the pressure is 3 kPa (Breugnot). Consequently, the nominal normal force is 0.5 N.

RESULTS AND DISCUSSION

First study

The first study with a panel of seventeen people allowed to see each fabric presents a specific evolution of the coefficient of friction (COF). From Figure 1, because of the specific and complex COF evolution, the velvet has been chosen to develop the artificial finger.

Slider design

To design the slider used as an artificial finger for textile fabrics, the chosen approach is to study in a tribological point of view the influence of different characteristics of a finger: its rounded shape, the texture of the fingertips, i.e. the dermatoglyphics and its hardness. In that purpose, different shapes of slider have been investigated (Fig. 2) and two materials. The selected slider is made of silicone and presents a grooved sole and rounded leading edges and covered with a specific fabric. Figure 3 shows the evolution of the COF for this slider.

Validation of the artificial finger

For all the fabrics investigated, the curves obtained with a human finger or with the artificial finger have very similar appearance except in the transitory slopes. Therefore, qualitatively the artificial finger has the same behaviour as a real finger. Quantitatively the artificial finger gives a value of COF that is included in the range of COF obtained by our panel of subjects. The values obtained with the artificial finger are consistently lower than those obtained by the human fingers; an explanation of this difference will be given.

DISCUSSION

There are some differences between the curves obtained by the two experiments and especially the transitory slopes. This can be explained by a different displacement of real and artificial fingers relative to the fabric in both directions.

CONCLUSION

This study shows the influence of each morphological and mechanical human finger features on the friction behavior with textile fabrics: rounded shape, finger texture and hardness. The rounded shape of the finger is not really relevant in this case but the finger texture is fundamental. In fact, the results obtained with smooth and grooved sliders allow us to bring some conclusions:

 With a smooth sole, the friction cycle depends on the length of the slider as the pile at the ends of the sliding region is not stressed in both directions.  With a grooved sole, the pile is forced in both directions because the bristles interlock into the grooves.

The grooves, that is to say the dermatoglyphics, thus play an important role in the friction behavior of the finger against pile surfaces.

The influence of finger hardness has been evaluated with the help of rigid (made of aluminum) and soft (made of silicone) sliders. With the soft slider made in silicone, the adhesion is too important with textile fabrics. Therefore it has to be covered by a chosen material. A specific fabric has been identified.

The results obtained with the grooved rigid slider and the grooved soft slider covered with a suitable fabric are closed together in qualitative and quantitative points of view. However, the artificial finger made of silicone and covered with a structured fabric gives with velvet, a friction cycle closest to that obtained with a real finger, in particular as regards the transient due to changes of fabric direction. In addition, the coefficients of friction obtained with a real finger and with this slider are of the same order of magnitude.

The artificial finger developed gives good results qualitatively and quantitatively for all the different fabrics tested representing a wide range of textile fabrics.

Figure 1 :

 1 Figure 1: Typical evolution of the COF between a human finger and the four fabrics investigated a) plain woven fabric b) polar, c) velvet fabric and d) artificial fur. For velvet and artificial fur, the COF is positive along pile and negative against pile main direction.

Figure 2 :

 2 Figure 2: Different shapes of the slider used.

Figure 3 :

 3 Figure 3: Evolution of the COF on velvet obtained with the artificial finger selected.

  Breugnot, Cécile. "Contribution À La Caractérisation Mécanique Du Toucher Des Surfaces Textiles À Partir De Critères Neurosensoriels." PhD Thesis. Université de Haute Alsace, 2005. Bueno, Marie-Ange, et al. "Costam: Tool Design for a

Table I

 I

		gathers COF values obtained between the four
	investigated fabrics and the artificial finger or a human
	finger. For fabrics with oriented pile (velvet and fur fabrics),
	the COF along and against pile main direction are
	considered separately.
	Fabric	Artificial finger	Human fingers
		COF	COF	Panel size
	plain	0.34	0.43 0.12	40
	polar	0.59	0.70 ± 0.21	40
		COF along	COF against	COF along	COF against
	velvet 0.45	0.44	0.58 ± 0.23 0.61 ± 0.16 17
	fur	0.50	0.64	0.60 ± 0.13 0.85 ± 0.24 17

Table I :

 I Values of COF for the four fabrics obtained with the artificial finger and the human fingers.


Danielle Dias
email: danielle.dias@ic.unicamp.br.

Member, IEEE Allan Pinto
email: al-lan.pinto@ic.unicamp.br.

Ulisses Dias
email: ulisses@ft.unicamp.br.

Rubens Lamparelli
email: lamparel@g.unicamp.br.guerricle

Guerric Le Maire
email: guerric.lemaire@cirad.fr.

Ricardo Da

Member, IEEE S Torres

A Multi-Representational Fusion of Time Series for Pixelwise Classification

Keywords: Pixelwise classification, classifier fusion, time series representation, eucalyptus

This paper addresses the pixelwise classification problem based on temporal profiles, which are encoded in twodimensional representations based on Recurrence Plots, Gramian Angular/Difference Fields, and Markov Transition Field. We propose a multi-representational fusion scheme that exploits the complementary view provided by those time series representations, and different data-driven feature extractors and classifiers. We validate our ensemble scheme in the problem related to the classification of eucalyptus plantations in remote sensing images. Achieved results demonstrate that our proposal overcomes recently proposed baselines, and now represents the new state-of-the-art classification solution for the target dataset.

I. INTRODUCTION

P IXELWISE remote sensing image classification has been established as an active research area. Proposed solutions have been validated in relevant applications, including among others ecological studies [START_REF] Menini | Tucumã: A toolbox for spatiotemporal remote sensing image analysis [software and data sets[END_REF], [START_REF] Almeida | Remote sensing image classification using genetic-programming-based time series similarity functions[END_REF], phenology analysis [START_REF] Faria | Time series-based classifier fusion for fine-grained plant species recognition[END_REF]- [START_REF] Almeida | Phenological visual rhythms: Compact representations for fine-grained plant species identification[END_REF], land-cover change monitoring [START_REF] Maus | A time-weighted dynamic time warping method for land-use and land-cover mapping[END_REF], and crop identification [9]. A promising research venue relies on the development of classification systems based on time series associated with pixels (e.g., time series associated with vegetation indices, such as normalized difference vegetation index -NDVIor enhanced vegetation index -EVI). Often, such methods assume that pixels can be categorized into different classes based on time series patterns, also refereed to as temporal profiles. Fig. 1 shows an example of the temporal profile of the NDVI of a region in Botucatu, São Paulo, Brazil. 1 The figure indicates a region of interest where a pixel is selected to compute the NDVI values in relation to time. The time series in the bottom is obtained from NDVI values.

The construction of pixelwise classification systems usually demands the definition of suitable extractors to encode temporal profiles into feature vectors; and effective classifiers, which learn from extracted features how to assign samples (pixels) to the correct category. Several approaches have been proposed to address both problems separately, and altogether.

One promising approach recently employed in the literature refers to the use of intermediary representations to encode time series properties [START_REF] Bagnall | The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances[END_REF], [START_REF] Wang | Experimental comparison of representation methods and distance measures for time series data[END_REF]. In particular, a promising family of methods relies on the use of two-dimensional representations [START_REF] Almeida | Phenological visual rhythms: Compact representations for fine-grained plant species identification[END_REF], [START_REF] Wang | Imaging time-series to improve classification and imputation[END_REF], [START_REF] Eckmann | Recurrence plots of dynamical systems[END_REF], which can be transformed into images. The goal of such approaches is to benefit from successful computer vision methods proposed for image classification, to more effectively classify time series [START_REF] Faria | Fusion of time series representations for plant recognition in phenology studies[END_REF], [START_REF] Almeida | Phenological visual rhythms: Compact representations for fine-grained plant species identification[END_REF], [START_REF] Dias | Pixelwise remote sensing image classification based on recurrence plot deep features[END_REF]- [START_REF] Menini | A soft computing framework for image classification based on recurrence plots[END_REF].

Examples of successful two-dimensional representations include Recurrence Plot (RP) [START_REF] Eckmann | Recurrence plots of dynamical systems[END_REF], Gramian Angular/Difference Fields (GASF/GADF) [START_REF] Wang | Imaging time-series to improve classification and imputation[END_REF], and Markov Transition Field (MTF) [START_REF] Wang | Imaging time-series to improve classification and imputation[END_REF]. RP has been extensively used to represent nonlinear patterns of dynamic systems, through the computation of the autocorrelation for different time scales [START_REF] Eckmann | Recurrence plots of dynamical systems[END_REF]. GASF/GADF [START_REF] Wang | Imaging time-series to improve classification and imputation[END_REF] representations encode in polar coordinates time series properties preserving temporal relations, while the MFT [START_REF] Wang | Imaging time-series to improve classification and imputation[END_REF] captures the transition probabilities among different time series states. RP, GASF/GADF, and MTF have been successfully validated in pixelwise classification and search tasks through the characterization of pixel-related time series (e.g., vegetation indices) associated with sequences of images [START_REF] Dias | Pixelwise remote sensing image classification based on recurrence plot deep features[END_REF]- [START_REF] Santos | An information retrieval approach for large-scale time series retrieval[END_REF]. In part, the success of those initiatives is due to the use of effective state-of-the-art data-driven feature extractors [START_REF] Huang | Densely connected convolutional networks[END_REF]- [START_REF] Chollet | Xception: Deep learning with depthwise separable convolutions[END_REF]. In [START_REF] Dias | Pixelwise remote sensing image classification based on recurrence plot deep features[END_REF], [START_REF] Dias | Image-based time series representations for pixelwise eucalyptus region classification: A comparative study[END_REF], for example, ten different deep-learning feature extractors were investigated in combination with RP, GASF/GADF, and MTF representations. Remarkable results were achieved in pixelwise classification problems.

Would the combination of multiple representations, datadriven feature extractors, and classifiers lead to even better pixelwise classification results? This is the question that guides the research described in this paper. We introduce a multirepresentational fusion approach for exploiting the complementary view of multiple classification systems constructed using different representations and feature extractors.

In our fusion scheme, the importance of different classifiers are assessed based on the Gini index [START_REF] Wittkowski | Classification and regression trees -l. breiman, j. h. friedman, r. a. olshen and c. j. stone[END_REF], a metric computed on the training of a random forest classifier, and on the balanced accuracy scores [START_REF] Brodersen | The balanced accuracy and its posterior distribution[END_REF] of different predictors. Classifiers are ranked, and the top-k ones are used to define lists with complementary classifiers, defined in terms of the Kappa's coefficient [START_REF] Cohen | A coefficient of agreement for nominal scales[END_REF]. Classifiers found in multiple lists are used to train an SVM-based meta classifier, producing the final prediction model. To the best of our knowledge, this is the first work dedicated to the investigation of the fusion of classifiers based on multiple time series representations.

We validate the proposed approach in the problem related to the identification of eucalyptus plantations in remote sensing images. Achieved results are consistently better than recently proposed approaches validated on the same dataset, as well as traditional ensemble approaches proposed in the literature.

This article is organized as follow. Section II introduces background concepts related to the employed time series representations. Section III provides an overview of related work. Section IV describes the proposed fusion scheme. The adopted experimental protocol is presented in Section V. Achieved results are presented and discussed in Section VI. Finally, Section VII summarizes our findings, as well as points out some possible research directions for future work.

II. BACKGROUND CONCEPTS ON IMAGE REPRESENTATIONS

In this work, we encode the temporal profile of pixels extracted from remote sensing images representing the temporal characteristics as 2D images. The values of the vegetation indices of the pixels are grouped together as time series and undergo transformations in such a way that the onedimensional series is represented as a two-dimensional matrix. That said, we can use this matrix as an input image for feature extractors. This is the rationale of our work. To achieve this goal, we investigate three approaches that encode time series as image representation.

1) Recurrence Plot: Recurrence Plot -RP [START_REF] Eckmann | Recurrence plots of dynamical systems[END_REF] is a tool for visualizing the recurrent behavior of a trajectory in the phase space in dynamic systems. Let T = (t 1 , t 2 , . . . , t n ) be a time series with n observations, the recurrence plot representation encodes every time the trajectory of T visits approximately the same area in the phase space. A graphical representation of recurrence plot is an image formed by a matrix of dimension n × n. The generated image is a direct representation of the distance matrix, that is, the information contained in the recurrence plot is the proximity value of each pair of subsequences in the trajectory of the time series [START_REF] Iwanski | Recurrence plots of experimental data: To embed or not to embed?[END_REF].

The two-dimensional representation of T is the matrix M , where each cell M i,j is computed by the distance function f (T i , T j )|∀i, j ∈ {1, 2, . . . , n}. The function f encodes how recurring are the time series states. In this paper, the construction of the recurrence plots is based on three implementations of the function f [START_REF] Dias | Pixelwise remote sensing image classification based on recurrence plot deep features[END_REF], [START_REF] Menini | A soft computing framework for image classification based on recurrence plots[END_REF]: difference (DIF), division (DIV), and multiplication (MULT).

f (T i , T j ) DIF = |T i -T j | (1)
f (T i , T j ) DIV = T i T j (2)
f (T i , T j ) M U LT = T i × T j (3)
Fig. 2 is an example of recurrence plots. In this example, two NDVI time series are provided. The dark green time series is associated with a pixel from an eucalyptus region, while the orange time series is from a noneucalyptus region. First, the n time series observations are used to construct the matrices DIF, DIV, and MULT, following Equations 1, 2, and 3, respectively. Then, a normalization step is performed so that the resulting values range from 0 to 255, which enables the creation of images in gray level.

We also create an additional representation using the three grayscale images as channels of an RGB image. In this representation, the MULT, DIV, and DIF matrices, in this order, are used to form the channels of the red, green, and blue bands, respectively. In the end, the representations are the recurrence plots DIF, DIV, MULT, and RGB, for each time series provided.

2) Representations GAF: Gramian Angular Field (GAF) is another approach to encode time series as images. It was proposed by Wang & Oats [START_REF] Wang | Imaging time-series to improve classification and imputation[END_REF], and it is inspired by the notion of Gramian matrices from the linear algebra field.

Let us assume we have a real vector space of finite dimension with inner product. The Grammar matrix of a set of vectors is computed by the inner product of pairs of vectors. The inner product between two vectors can be calculated by the norm of the vectors (also called modulus, magnitude or intensity) and the angle between them. From a geometric point of view, the module corresponds to the length of the vector. Let u and v be two vectors, the internal product between them is given by:

u, v = u • v • cos(φ). (4)
If u and v have norms equal to 1, then the equation can be simplified:

u, v = cos(φ).
(5) Let {v 1 , v 2 , . . . , v n } be a set of n vectors, the G Gramian matrix is a square n × n matrix such that every cell g i,j = v i , v j :

G =      v 1 , v 1 v 1 , v 2 . . . v 1 , v n v 2 , v 1 v 2 , v 2 . . . v 2 , v n . . . . . . . . . . . . v n , v 1 v n , v 2 . . . v n , v n      . (6)
Considering that all n vectors have norm 1, then the inner product is given by the cosines of the angle between the vectors (Equation 5). Therefore, the Gramian matrix is formed by:

G =      cos(φ 1,1 ) cos(φ 1,2 ) . . . cos(φ 1,n ) cos(φ 2,1 ) cos(φ 2,2 ) . . . cos(φ 2,n ) . . . . . . . . . . . . cos(φ n,1 ) cos(φ n,2 ) . . . cos(φ n,n )      (7)
where θ i,j is the angle between vectors i and j. GAF uses ideas of Gramian matrices to represent a series of observations into a matrix that contains temporal correlation between observations in different time intervals. Wang & Oats [START_REF] Wang | Imaging time-series to improve classification and imputation[END_REF] created two GAF representations: Gramian difference angular field (GADF) and Gramian summation angular field (GASF). GADF is a Gramian matrix in which each element is the trigonometric difference between each pair of time intervals, while the elements of the GASF matrix are formed by the trigonometric sum.

Let T = (t 1 , t 2 , . . . , t n ) be a time series. We need to perform trigonometric operations, that is, the n observations need to be transformed into angles. To achieve this, first the time series T is normalized in the interval [-1, 1], resulting in T = ( t1 , t2 , . . . , tn ). After that, the time series coordinate system (Cartesian coordinates) is transformed into polar coordinates system computing the angular cosine of each T value:

φ i = arccos( ti ), ti ∈ T . ( 8
)
After obtaining the angles and inspired by the idea of Gramian matrices, the trigonometric difference and the trigonometric sum between each point is considered for the creation of the GADF and GASF matrices, respectively:

GADF i,j = sin (φ i -φ j ) (9) GASF i,j = cos (φ i + φ j ) (10)
Fig. 3 illustrates the creation of the GADF and GASF representations. In this example, we consider a time series with NDVI values associated with a pixel from an eucalyptus region. First, the n observations from the time series are normalized and the time series is transformed into a polar coordinate system (Equation 8). After that, we created the GADF and GASF matrices, according to Equations 9 and 10, respectively. Then, we normalized the values between 0 and 255 to allow the creation of gray level images.

GADF and GASF representations preserve temporal dependencies. An observation in the time period i is compared with an observation in the time period j and the time increases when traversing the matrix from the upper left corner to the lower right corner. This creates patterns in the matrix, which also reflects in the image representation created.

3) Representation MTF: Markov Transition Field (MTF) is another representation proposed by Wang & Oats [START_REF] Wang | Imaging time-series to improve classification and imputation[END_REF] to encode time series as images. MTF captures state transition statistics and encodes these statistics as an image.

Let T = (t 1 , t 2 , . . . , t n ) be a time series with n observations. First, the set of all possible values of the time series are divided into a fixed number of states. This is accomplished by compartmentalizing the time series in Q quantile bins and assuming that each compartment is a state. Thus, we create T = ( t1 , t2 , . . . , tn ) that is, ti is the quantile to which t i is associated.

We create the intermediate matrix W Q×Q , where w i,j is the number of times that transitions from the state i to the state j occur. Then, we perform a normalization so that each row of the W matrix has sum equal to 1. Thus, W stores the probabilities of state transitions and it is considered the first order Markov transition matrix, in which the lines indicate the probability of state transitions, the columns indicate the time dependency, and the main diagonal captures the probability of staying in a given state.

Finally, we created the MTF matrix (Markov Transition Field) considering the time position of T , with dimensions n × n, where the each cell in the MTF matrix indicates the probability of undergoing transition from the state associated with T i to the state associated with T j . The MTF matrix is constructed as follows:

M T F =      W t1, t1 W t1, t2 . . . W t1, tn W t2, t1 W t2, t2 . . . W t2, tn . . . . . . . . . . . . W tn, t1 W tn, t2 . . . W tn, tn      . ( 11
)
Fig. 4 shows an example of creating the MTF representation. In this example, we receive a time series with NDVI values associated with a pixel from an eucalyptus region. First, the n observations in the time series are divided into quantiles or states. In this example, we define Q = 5 to create five states represented by colors in the time series. Then, we count how many transitions occur between states and create the preliminary W matrix. We then normalize W to make it the first order Markov transition matrix.

We build the MTF matrix according to Equation 11, then we normalize the values between 0 and 255 and finally convert the MTF matrix into an image.

An important characteristic of MTF matrices is that the transition probabilities are coded in several stages in a single representation. For example, M T F i,j such that |i -j| = 1 represents the transition process along the time axis with a unit of difference. If we make |i -j| = 2, then we have the transition process within two units of time, and so on. The main diagonal represents the probability of staying in a given state.

III. RELATED WORK

Existing literature in the area of remote sensing image classification is vast. Most of those initiatives include the the investigation of machine learning algorithms in problems related to the classification and recognition of objects. For an in-depth overview of recent initiatives, the reader may refer to [START_REF] Ma | Deep learning in remote sensing applications: A meta-analysis and review[END_REF]. In this section, we focus on describing studies related to the use of time series in classification problems.

Almeida & Torres [START_REF] Almeida | Remote sensing image classification using genetic-programming-based time series similarity functions[END_REF] used NDVI time series obtained from MODIS sensors. The authors proposed a genetic programming (GP) approach for discovering near-optimum combinations of time series similarity functions. Those functions were then used for classifying eucalyptus plantations. Menini et al. [START_REF] Menini | A soft computing framework for image classification based on recurrence plots[END_REF] also addressed the same problem. Again, a GP approach was used, now for combining similarity scores defined in terms of texture descriptors extracted from recurrence plot representations. The methods proposed in [START_REF] Almeida | Remote sensing image classification using genetic-programming-based time series similarity functions[END_REF] and [START_REF] Menini | A soft computing framework for image classification based on recurrence plots[END_REF] are considered as baselines, which do not take into account datadriven features in the time series classification task, in our work.

Hu et al. [START_REF] Hu | A phenology-based spectral and temporal feature selection method for crop mapping from satellite time series[END_REF] utilized data from MODIS sensors and time series associated with five different vegetation indices. Their work proposed a method to select automatically spatiotemporal features named Phenology-based Spectral and Temporal Feature Selection -PSTFS. PSTFS features are then submitted to a multiclass SVM classifier, used to determine to which crop a particular sample belongs. Different from our approach, that work did not exploit time series representations.

Liu et al. [START_REF] Liu | Unvi-based time series for vegetation discrimination using separability analysis and random forest classification[END_REF] exploited Landsat-8 images and the Universal Normalized Vegetation Index -UNVI [START_REF] Zhang | A new vegetation index based on the universal pattern decomposition method[END_REF], an index that encodes information from all observed bands. In their study, UNVI is compared with other vegetation indices and effective results are reported. The use of UNVI time series in combination with a random forest classifier was effective in a five-class classification problem. No time series representation was employed as well.

Another research venue concerns the proposal of approaches for combining patterns found in time series associated with vegetation indices with spectral information, as in [START_REF] Feng | Crop type identification and mapping using machine learning algorithms and sentinel-2 time series data[END_REF]. In that study, classifiers, such as random forest and SVM, were explored in problems related to the classification of multiple crops. Special time series representations were not investigated in that work.

Several studies have been proposed aiming at comparing pixelwise-and object-based classification methods. One relevant representative is the work of Belgiu et al. [START_REF] Maus | A time-weighted dynamic time warping method for land-use and land-cover mapping[END_REF]. In their work, NDVI time series were categorized based on the use of a random forest classifier and the Time-Weighted Dynamic Time Warping (TWDTW) [START_REF] Maus | A time-weighted dynamic time warping method for land-use and land-cover mapping[END_REF]. Even the combination of pixelwiseand object-based approaches have already been investigated, as in the work of Rahimizadeh et al. [START_REF] Rahimizadeh | Forest structure parameter extraction using spot-7 satellite data by objectand pixel-based classification methods[END_REF]. In their work, the forest classification problem was addressed by the combination of a time series classifier -using SVM and vegetation indices -and an object-based classification approach based on forest structural patterns. These studies suggest that the investigation of pixelwise classification approaches are an active research area, which can even be exploited in combination of objectbased approaches. We plan to address that, in the context of the use of time series representations, in future work.

Another family of methods has focused on the classification of time series associated with vegetation indices extracted from images obtained from near-surface sensors [START_REF] Alberton | Using phenological cameras to track the green up in a cerrado savanna and its on-the-ground validation[END_REF], [START_REF] Alberton | Introducing digital cameras to monitor plant phenology in the tropics: applications for conservation[END_REF]. The work of Almeida et al. [START_REF] Almeida | Applying machine learning based on multiscale classifiers to detect remote phenology patterns in cerrado savanna trees[END_REF], for example, investigated the use of a multiscale classifier based on AdaBoost. In that work, time series were used as input feature vectors of the considered classifiers. In [START_REF] Almeida | Deriving vegetation indices for phenology analysis using genetic programming[END_REF], the authors also addressed a fusion problem, in that case based on the combination of time series associated with multiple vegetation indices. A GP-based approach was exploited and the focus was on the retrieval of time series, instead of their classification. In another work [START_REF] Faria | Time series-based classifier fusion for fine-grained plant species recognition[END_REF], time series associated with pixels were classified though the of an SVM meta classifier [START_REF] Faria | A framework for selection and fusion of pattern classifiers in multimedia recognition[END_REF]. Almeida et al. [START_REF] Almeida | Unsupervised distance learning for plant species identification[END_REF] also investigated the use of unsupervised fusion schemes but in the context of retrieval tasks. In none of those works, time series representations were explored.

Two-dimensional representations were investigated in time series classification and retrieval problems in [START_REF] Faria | Fusion of time series representations for plant recognition in phenology studies[END_REF], [START_REF] Almeida | Phenological visual rhythms: Compact representations for fine-grained plant species identification[END_REF]. In [START_REF] Almeida | Phenological visual rhythms: Compact representations for fine-grained plant species identification[END_REF], the phenological visual rhythm was introduced to encode vegetation phenology changes into images. Traditional color descriptors are employed in the characterization of such images.

[4], both recurrence plot and visual rhythm representations were explored in the context of a pixelwise classification fusion problem. Different from our approach, however, no data-driven features were used.

IV. PROPOSED APPROACH A. Predictors

Before discussing our fusion scheme, we describe in this section the strategy used to construct multiple representations from data. This involves some steps: (i) transformation of time series into representations of images; (ii) use of automatic feature extraction techniques, and (iii) creation of predictors.

First, the time series are encoded in representations of recurrence plot, GADF, GASF and MTF, as described in Section II. We work with individual representations and we also combine matrices in RGB channels. Therefore, we create two RGB representations: (i) an RGB representation composed of MULT, DIF and DIV; and (ii) an RGB representation composed of GADF, GASF, and MTF. These are the orders of the red, green and blue channels, respectively.

Next, we extract features from these image representations using ten deep convolutional neural networks: DenseNet121 [START_REF] Huang | Densely connected convolutional networks[END_REF], DenseNet169 [START_REF] Huang | Densely connected convolutional networks[END_REF], DenseNet201 [START_REF] Huang | Densely connected convolutional networks[END_REF], In-ceptionResNetV2 [START_REF] Szegedy | Inception-v4, inception-resnet and the impact of residual connections on learning[END_REF], InceptionV3 [START_REF] Szegedy | Rethinking the inception architecture for computer vision[END_REF], MobileNetV1 [START_REF] Howard | Mobilenets: Efficient convolutional neural networks for mobile vision applications[END_REF], ResNet50 [START_REF] He | Deep residual learning for image recognition[END_REF], VGG16 [START_REF] Simonyan | Very deep convolutional networks for large-scale image recognition[END_REF], VGG19 [START_REF] Simonyan | Very deep convolutional networks for large-scale image recognition[END_REF] e XceptionV1 [START_REF] Chollet | Xception: Deep learning with depthwise separable convolutions[END_REF]. We use the well-known transfer learning mechanism, in which the last layer of the neural network is removed and the result obtained corresponds to the feature vectors produced by the previous layers.

In addition to the feature vectors extracted from the images, and from the two RGB representations, we also analyze some vector concatenations, such as: DIF DIV, DIF MULT, DIV MULT, DIF DIV MULT (called 3RP), GADF GASF (called COMB2), and GADF GASF MTF (called COMB3).

Finally, we trained four classifiers with the feature vectors: logistic regression, multilayer perceptron (MLP), Naïve Bayes, and support vector machine (SVM). In this way, we create predictors in multi-representational way, where each predictor comes from three elements: the image representation, the deep neural and the classifier where it was trained on.

B. Fusion Approach

This section describes our methodology for pixelwise remote sensing image classification. Our methodology takes advantage of complementary information among image representations described in Section II, which were extracted from time series and designed for the remote sensing image classification purpose [START_REF] Dias | Pixelwise remote sensing image classification based on recurrence plot deep features[END_REF], [START_REF] Dias | Image-based time series representations for pixelwise eucalyptus region classification: A comparative study[END_REF].

To achieve our goal, we adopted the use of a fusion method able to find complementary information among the classifiers investigated in this work. We believe that a fusion approach can lead to gains in terms of balanced accuracy since we have several representations of time series which explore different temporal characteristics of NDVI extracted from eucalyptus pixels. Taking into account that (i) the representations of recurrence plot encode the recurrence in the time series; (ii) the GADF and GASF representations encode static information [START_REF] Wang | Imaging time-series to improve classification and imputation[END_REF]; and (iii) the MTF representation encodes dynamic information [START_REF] Wang | Imaging time-series to improve classification and imputation[END_REF]; we assessed that the classifiers that used these representations can be potentially complementary. Therefore, we hypothesize that the use of representations that explore different characteristics of time series induces a complementarity at the level of classification. The investigation of this hypothesis was conducted using a meta-fusion method, as described in Fig. 5.

In our methodology, we adopted the use of a meta-fusion approach originally proposed for the presentation attack detection problem in biometric systems [START_REF] Kuehlkamp | Ensemble of multi-view learning classifiers for cross-domain iris presentation attack detection[END_REF]. Although this method was proposed to fuse classifiers built for a different problem, we believe that the main idea of this approach fits with our problem since we also have multiple views, or representations, from the input images. In the context of this paper, the fusion method aims at building a model from classifiers built using multiple representations. to build classification methods based on extractors of deep learning characteristics, which are used in the fusion process. In summary, the proposed methodology investigated in this work fuses the results of trained classifiers with different image representations, which encode different properties of the time series, consolidating the classification into a single prediction. Fig. 5 presents a general scheme of the multi-representational meta-fusion.

In Fig. 5(a) the method uses the training data of the four predictors (logistic regression, MLP, Naïve Bayes, and SVM), with the views of all the image representations investigated in this work, whose extraction of characteristics were carried out with ten different deep convolutional neural networks. We consider all predictors, since while some may provide complementary views, others can be highly correlated.

To find the most important classifiers, in Fig. 5(b) we used two indices as criteria to estimate the importance of the classifiers: (i) the Gini [START_REF] Wittkowski | Classification and regression trees -l. breiman, j. h. friedman, r. a. olshen and c. j. stone[END_REF] index, which describes the average reduction in forest impurity and is directly related to decision that random forest uses to select the best available split; and (ii) balanced accuracy of predictors. The Gini index is a measure used by the Random Forest algorithm to infer the importance of variables or nodes (in our case, the classifier). During the training of a Random Forest classifier, the decision trees that composes the Random Forest try to form nodes with a high proportion of data points form a single class, which is achieved by finding the variables that cleanly divide the training data into classes. For this, the Random Forest can use the Gini index as metric to evaluate the level of impurity for a given node. This value is then used to decide if a node should be split, or not.

In the selection with the Gini index, the training predictors are sent to the random forest algorithm, which randomly generates multiple decision trees from different subsets of the provided predictors. At the end of the random forest training process, the method sorts the classifiers according to their respective importance in the construction of the meta-classification model. At the end of the most relevant selection phase, the meta-classification model is discarded and an ordered list with the top-k classifiers is used in the next step.

To find the most complementary classifiers, in Fig. 5(c) the top-k most relevant classifiers are compared with the other predicted classifiers using Kappa's concordance coefficient as suggested by Cohen [START_REF] Cohen | A coefficient of agreement for nominal scales[END_REF]. Cohen's Kappa is a statistical tool to measure the inter-rate agreement between two raters. This method has been applied in several works as toward inferring a confident measure of concordance between two raters. In the context of this work, the Cohen's Kappa is used to measure the concordance between pairs of classifiers, which can be determined following the reliability reference values: 0.2 < k ≤ 0.4 as fair; 0.4 < k ≤ 0.6 as moderate; 0.6 < k ≤ 0.8 as substantial; and k > 0.8 as almost perfect [START_REF] Landis | The measurement of observer agreement for categorical data[END_REF]. Thus, we have k lists containing the classifiers most complementary to the most relevant k classifiers. Finally, classifiers that appear on two or more lists are selected as candidate classifiers, which are used to build a meta-classifier.

To carry out the training of the meta-classification, in Fig. 5(d) we use the SVM algorithm. With the result of the meta-fusion, we make the inference with the test set. All parameters of the fusion method are estimated during training with grid search.

V. EXPERIMENTAL SETUP

This section described the evaluation protocol adopted.

A. Dataset of Areas with Eucalyptus

The eucalyptus dataset has the MODIS sensor as its source of information, with a combination of the Aqua and Terra satellites in order to reduce the temporal gap and achieve high temporal resolution. We obtained 385 images from Terra (MOD13Q1.005) and 330 images from Aqua (MYD13Q1.005), from February 2000 to November 2016. Both products already provide the computation of the NDVI. MODIS products have 250m spatial resolution, and are produced with 16 days of composition. MODIS have daily records, but only products with a best quality are selected to represent the composition period. Another filtering is performed to select only pixels with the same classification label.

We used a modified subset of the collection used in le Maire et al. [9]. The selected pixels belong to the eucalyptus and noneucalyptus classes. This dataset is composed of 250 eucalyptus pixels and 1000 noneucalyptus pixels randomly selected. To investigate the impact of noneucalyptus sample unbalancing, we divided the dataset into three sample sizes: 250, 500 and 1000. These values correspond to the number of pixels labeled as noneucalyptus. In each sample we add the 250 eucalyptus pixels.

B. Baselines

This section presents a brief description of the baseline algorithms for fusing classifiers.

1) Majority Vote: The majority vote is the simplest strategy for fusing information from different sources. This approach assumes that all classifiers have equals importance, and the final decision is determined by the most frequent class (or label output) taking into consideration the classifiers' output. Given a (n × c) binary matrix L, as follow:

L =      d (1,1) d (1,2) . . . d (1,c) d (2,1) d (2,2) . . . d (2,c) . . . . . . . . . . . . d (n,1) d (n,2) . . . d (n,c)      ∈ {0, 1} (12)
where n is the number of inputs, c is the number of classifiers, and d (n,c) is the label output of the c-th classifier for the n-th input. Thus, the ensemble decision

Ψ = [ω 1 , • • • , ω n ]
for the n input samples are determined as follow:

Ψ = max j∈{0,1} c k=1 δ(d (n,k) , j) (13)
where δ(i, j) is defined as 1 if i = j and 0 if i = j.

2) AdaBoost: Adaptive Boosting (AdaBoost) [START_REF] Freund | A decision-theoretic generalization of on-line learning and an application to boosting[END_REF] aims to combine multiple 'bases' classifiers to produce an ensemble decision with a performance better than any of the bases classifiers. Boosting approaches perform the training phase of base classifiers in and using a weighted scheme of the data whose weighting coefficient of each data point depends on the performance of the previous classifiers [START_REF] Bishop | Pattern Recognition and Machine Learning (Information Science and Statistics)[END_REF]. In particular, the AdaBoost algorithm initially set an equal weight for the data point as 1/n, where n is the size of the data, and at each stage of the algorithm the weighting coefficients are increased for those data points that was misclassified by the previously trained classifier. After the bases classifiers have been trained, they are combined to produce an ensemble decision using coefficients that give different weight to different base classifiers.

3) Gradient Boosting: Gradient Boosting is an extension of AdaBoost to regression problem [START_REF] Friedman | Greedy function approximation: A gradient boosting machine[END_REF]. Different from Ad-aBoost algorithm, the Gradient Boosting learns via residual errors, instead of using the weighting coefficients computed for each data point. While the AdaBoost algorithm mines the hard data samples by updating the weighting coefficients according to bases classifiers' response, the Gradient Boosting algorithm does the same thing by using gradients computed upon the loss function. Thus, the loss function is used to infer how good the model's coefficients are at fitting the data. In this work, we adopted the use of negative binomial log-likelihood loss function, which provides probability estimates, and decision trees as base classifiers.

4) Random Forest: Random forest is a machine learning algorithm composed of multiple decision trees built on different random subsets of the training data. The training strategy adopted by this algorithm is known as boost strapping (or bagging) which aims to reduce the variance of the bagged model and to help avoiding over-fitting. Given a set of decision tree classifiers (base classifiers), the bagging strategy splits the data randomly, with replacement, which are used to fit the base classifiers in an independent manner. After training, the bagged model is computed by taking the majority vote of base classifiers. To estimate the performance of the individual trees, a subset of the training data, called out-of-bag (OOB) samples, is separated from the training data and used to estimate the generalization error of the bagged model. The OOB samples is also used to compute the error rate of all variables infer the feature importance.

5) Fusion of Classifiers via Support Vector Machine: Support Vector Machine (SVM) algorithm has been successfully employed for fusing information for the different classification problems due to strong generalization capability when its parameter values were chosen accordingly. The training stage of an SVM classifier in the context of fusion of classifiers is given as follows. Given a (n × c) binary matrix L that gathers the label outputs of c classifiers for the n input samples from the training set, the ensemble decision of a set of classifiers c is performed by feeding an SVM algorithm with L matrices to fit a classification model or ensemble model. During the training stage, we applied a grid search and k-fold cross-validation protocol to estimate the parameters C and γ since we use the radial basis function (RBF) as a kernel. After estimating an SVM-based ensemble model, the testing phase is performed by running c classifiers on the p testing samples, whose labels outputs are gathered to build a (n × p) binary matrix H. Next, the H matrix is used to feed the SVM-based ensemble model that produces the final label output for each testing sample p.

C. Evaluation Protocol

We conducted the experiments and evaluation of the proposed method using the MODIS sensor images with eucalyptus pixel samples (see Section V-A). We adopted the same evaluation protocol as Menini et al. [START_REF] Menini | A soft computing framework for image classification based on recurrence plots[END_REF] to have a fair comparison with our baseline methods. Thus, we divided the dataset into two sets, training set (80%) to train and validate the classification models and the testing set (20%) used only to report the final results of our proposed methods and baselines.

We validate classification models by using the k-fold cross validation protocol, with k = 5, and ten replications. The replications is necessary to avoid a biased result since we split the original dataset in a 80%-20% ratio. Finally, the evaluation metric used to measure the performance results of the classifiers was the average of balanced accuracy of ten replications.

VI. EXPERIMENTAL RESULTS

This section presents and discusses obtained results.

A. Evaluation of Individual Classifiers trained Using Deep Representations

This section presents the preliminary results of the predictors. Our approach to build predictors considers 4 classification algorithms trained using several representations, which were built by using 10 pre-trained deep learning methods as feature extractors upon 14 two-dimensional representations used to encode the time series (see Section IV). Thus, we came up with 560 classifiers (4 classifier × 10 feature extractors × 14 twodimensional representations). Since we are considering the 5-fold cross-validation evaluation protocol, the total number of models produced during training phase reaches 28,000 classifiers (560 × 5 models × 10 runs). Due to the volume of results, we show in Table I only the best results for the noneucalyptus samples with sizes 250, 500, and 1000, considering all the predictors.

With the motivation that these predictors potentially provide different views about the classified instances, we have extended previous work [START_REF] Dias | Pixelwise remote sensing image classification based on recurrence plot deep features[END_REF], [START_REF] Dias | Image-based time series representations for pixelwise eucalyptus region classification: A comparative study[END_REF] investigating a fusion method for the 28,000 predictors.

B. Are the RP, GAF, and MTF Representations Complementary to each other?

This section presents the performance results of the method used to ensemble multi-representational learning classifiers designed to detect eucalyptus and non-eucalyptus areas. Table II shows the obtained results considering the fusion of classifiers described in Section IV-A. Furthermore, the values correspond to average and standard deviation of balanced accuracy, computed for ten rounds of experiments.

The first two rows in Table II presents the performance results of the baseline methods that do not rely on the use of deep neural networks for feature extraction. In turn, the third and fourth rows present the baseline methods whose approaches take advantage of deep learning methods for extracting deep representations. Finally, the last three rows show the performance results of the meta-fusion approach investigated in this study, which consider: (i) recurrence plot representation only; (ii) all representations of recurrence plot, GAF and MTF; and using the Gini index as a criterion to estimate the importance of classifiers; (iii) all representations of recurrence plot, GAF and MTF; using the accuracy values to estimate the importance of the classifiers.

From these experiments, we could observe that the fusion approach improved the classification results, in terms of balanced accuracy, in comparison to the baseline methods. These results suggest that learned classifiers using the RP, GAF, and MTF representations encode complementary features useful to our problem. This was evidenced when we fuse the classifiers using only the RP representations. In this case, the fusion approach could not bring significant improvements, in comparison to method presented in [START_REF] Dias | Pixelwise remote sensing image classification based on recurrence plot deep features[END_REF] that also uses RP representations. We believe that this modest results could be explained by the fusion of a set of classifiers that did not share to much complementary information. On the other hand, the fusion of classifiers built with RP, GAF, and MTF methods presented better results than all baseline methods. These results suggest that multi-representational learning classifiers built with the two-dimensional representations of time series investigated in this work complement each other.

C. Comparison with other Fusion Approaches

This section presents a comparison of performance results among different methods for fusing classifiers. In this work, we [START_REF] Dias | Image-based time series representations for pixelwise eucalyptus region classification: A comparative study[END_REF] 0.978 ± 0.013 0.964 ± 0.014 0.954 ± 0.012 Meta-Fusion using RP, GAF and MTF representations (accuracy) 0.982 ± 0.005 0.977 ± 0.007 0.958 ± 0.007 evaluated different approaches for fusion information available in the literature such as Bagging, Boosting, and Meta-fusion approaches: AdaBoost and Gradient Boosting are two fusion strategies that can be classified as Boosting approaches, while the Random Forest is a bagging approach by itself since several decision tree classifiers are training using the bagging approach. On the other, the Random Forest alongside with SVM algorithm can also be considered as a meta-fusion approach when they are used to have a second decision layer upon base classifiers.

Table III shows the performance results for the fusion methods investigated in this work. We could observe that baseline methods for fusion could not surpass the best result considering the individual performance of classifiers built in this work. On the other hand, the meta-fusion approach adopted in this work (see Section IV) achieved the best results, in terms of balanced accuracy, in comparison with the baseline methods for fusing classifiers.

Finally, it is important to notice that although our fusion approach needs to handle a high number of classification models in the training phase, the testing phase uses only the 60 classifiers selected during the training phase to produce the final decision. Of course, this number could be limited depending on the efficiency aspects required by a target application. Remote sensing image classification is an active research field, and several real-time remote sensing applications have been addressed recently (e.g., applications that aim to predict natural disasters [44]). We believe that the investigation of the tradeoff between effectiveness and efficiency of fusion approaches that handle a high number of pixelwise classification systems is an interesting research venue and could benefit applications that require fast decision-making with minimum latency.

VII. CONCLUSION

This paper addressed the pixelwise remote sensing image classification problem based on patterns found in time series associated with pixels. In particular, we investigated the complementary view provided by different classification systems created based on the combination of time series representations, data-driven feature extractors, and classifiers. Experiments were conducted aiming at addressing the problem of classifying eucalyptus plantations in remote sensing images, based on vegetation index time series. Achieved results demonstrated that proposed ensemble exploits properly the complementarity of different classification systems. In fact, state-of-the-art results were observed for the target dataset.

Future work focuses on improving our ensemble by exploiting the effectiveness of end-to-end classifiers based on datadriven learning approaches. We also plan to investigate the use of the proposed ensemble in spatiotemporal classification problems, and efficiency and yet effective strategies for building multi-representational learning approaches that require fast decision-making with minimum latency.

Fig. 1 .

 1 Fig. 1. Example of the NDVI time profile for a coordinate selected as a region of interest in satellite images.

Fig. 2 .

 2 Fig. 2. Example illustrating the creation of recurrence plot matrices for distance functions DIF, DIV, and MULT.

Fig. 3 .

 3 Fig. 3. Example illustrating the creation of the GADF and GASF representations.

Fig. 4 .

 4 Fig. 4. Example of creating the MTF representation.

Fig. 5 .

 5 Fig. 5. Overview of the fusion method.

  These multiple representations, in turn, are devised from representations of intermediate images that encode different properties of the time series, such as (i) recurrence information; (ii) trigonometric difference between each pair of time intervals; and (iii) probability of state transition. Finally, these intermediate representations are used

	P1 P P2 . . . P . . . Pn Training Set	Selection of Most Relevant Classifiers
	0 0 . . . 1 1 0 . . . 0 0 1 . . . 1	(Gini Importance or Balanced Accuracy)
	. . .	. . .	. . .
	1 1 . . . 1
				Top-k Most Relevant Classifiers
	Selection of Most Complementary Classifiers
	(Cohen's Kappa)

TABLE I COMPARISON

 I OF PERFORMANCE RESULTS, IN TERMS OF MEAN AND STANDARD DEVIATION OF BALANCED ACCURACY, BETWEEN THE BEST CLASSIFIER, FOR EACH NUMBER OF NONEUCALYPTUS EXAMPLES, TRAINED WITH DEEP REPRESENTATIONS (FIRST THREE ROWS) AND BASELINE METHODS FORDETECTING EUCALYPTUS AREA (LAST TWO ROWS).

		Noneucalyptus Sample Size
	Deep Features	250	500	1000
	SVM ResNet50 COMB3	0.978 ± 0.013	0.958 ± 0.012	0.938 ± 0.021
	SVM DenseNet201 COMB3	0.974 ± 0.011	0.964 ± 0.014	0.939 ± 0.020
	Naïve Bayes InceptionV3 COMB3	0.961 ± 0.020	0.960 ± 0.020	0.954 ± 0.012
	Menini et al. [16]	0.952 ± 0.005	0.943 ± 0.007	0.921 ± 0.005
	Almeida et al. [2]	0.936 ± 0.009	0.938 ± 0.010	0.916 ± 0.016
		TABLE II
	COMPARISON OF PERFORMANCE RESULTS, IN TERMS OF MEAN AND STANDARD DEVIATION OF BALANCED ACCURACY, BETWEEN THE BASELINE
	METHODS (FIRST FOUR ROWS) AND OUR PROPOSED METHOD (LAST THREE ROWS).
			Number of noneucalyptus examples
	Methods		250	500	1000
	Almeida et al. [2]		0.936 ± 0.009	0.938 ± 0.010	0.916 ± 0.016
	Menini et al. [16]		0.952 ± 0.005	0.943 ± 0.007	0.921 ± 0.005
	Dias et al. [14]		0.969 ± 0.016	0.961 ± 0.016	0.941 ± 0.017
	Dias et al. [15]		0.978 ± 0.013	0.964 ± 0.014	0.954 ± 0.012
	Meta-Fusion using RP representation		0.968 ± 0.018	0.947 ± 0.016	0.944 ± 0.026
	Meta-Fusion using RP, GAF and MTF representations (Gini impurity index)	0.981 ± 0.006	0.976 ± 0.006	0.955 ± 0.009
	Meta-Fusion using RP, GAF and MTF representations (accuracy)	0.982 ± 0.005 0.977 ± 0.007 0.958 ± 0.007

TABLE III COMPARISON

 III OF PERFORMANCE RESULTS, IN TERMS OF MEAN AND STANDARD DEVIATION OF BALANCED ACCURACY, AMONG THE BASELINE METHODS FOR FUSING CLASSIFIERS (FIRST FOUR ROWS), THE TOP-1 CLASSIFIER THAT PRESENTED THE BEST RESULTS (PENULTIMATE ROW), AND THEFUSION APPROACH ADOPTED FOR FUSING CLASSIFIERS (LAST ROW).

		Number of non-eucalyptus examples
	Methods	250	500	1000
	AdaBoost	0.942 ± 0.011	0.935 ± 0.014	0.912 ± 0.019
	Gradient Boosting	0.961 ± 0.012	0.950 ± 0.011	0.928 ± 0.017
	Random Forest	0.959 ± 0.013	0.954 ± 0.008	0.943 ± 0.013
	SVM	0.960 ± 0.009	0.951 ± 0.011	0.943 ± 0.014
	Top-1 Classifier (Ref.)

Source: SATVeg system, Embrapa, Brazil -https://www.satveg.cnptia. embrapa.br/satveg/login.html (As of March

2020).

Authors are grateful to CNPq (grant #307560/2016-3), São Paulo Research Foundation -FAPESP (grants #2014/12236-1, #2015/24494-8, #2016/50250-1, #2017/20945-0, and #2019/16253-1) and the FAPESP-Microsoft Virtual Institute (grants #2013/50155-0, and #2014/50715-9). This study was financed in part by the Coordenac ¸ão de Aperfeic ¸oamento de Pessoal de Nível Superior -Brasil (CAPES) -Finance Code 001.