You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This rationale for this improvement has been pointed out by @charlotte-pel:
The foundational PSE-TAE algorithm paper by @VSainteuf (Vivien Garnot) and colleagues uses polygons as its assumed input data structure. The data are farm boundaries in France, and the algorithm aims to classify agricultural cultivation types. Garnot's algorithm has two steps. See section 3.1 and Figures 1 and 2 of the original paper (‘Satellite Image Time Series Classification with Pixel-Set Encoders and Temporal Self-Attention’). First, an MLP (multi-layer perceptron) combines the points within a polygon, and positional encoding organizes the result. Garnot calls this phase PSE (pixel-set encoder). In the second phase, the PSE result is input to an attention model called TAE (temporal attention encoder). See how Garnot describes the first part in section 3.1 of the original paper.
In the sits implementation of PSE-TAE and LTAE, we classify each time series individually. In most sits applications, training data is available as individual locations and not as polygons. For this reason, we did not implement the PSE part of Garnot's method. The temporal attention encoder receives individual points.
Segmentation with sits_segment() results in post-segmentation objects. In this case, we could have used the same strategy as Garnot, implementing a pixel-set encoder. However, currently we use the same pixel-based logic to train and classify the points within a polygon. Strictly speaking, our implementation of OBIA in sits does not correspond to the PSE-TAE algorithm and its LTAE derivative.
It would be very interesting to compare our implementation with Garnot's original algorithm. To do this, we would have to include a new algorithm and new training methods, namely:
(a) make a segmentation.
(b) classify the points inside polygons using a similar strategy as the one by Garnot.
(c) implement PSE-TAE in the form proposed by Garnot.
We will be able to make comparative statements between the pixel-based version of LTAE and the original object-based version of LTAE.
Associated sits API function sits_tae() and sits_ltae() will have to be modified to include the polygon-based PSE part of Garnot's proposal.
The text was updated successfully, but these errors were encountered:
Describe the requested improvement
This rationale for this improvement has been pointed out by @charlotte-pel:
The foundational PSE-TAE algorithm paper by @VSainteuf (Vivien Garnot) and colleagues uses polygons as its assumed input data structure. The data are farm boundaries in France, and the algorithm aims to classify agricultural cultivation types. Garnot's algorithm has two steps. See section 3.1 and Figures 1 and 2 of the original paper (‘Satellite Image Time Series Classification with Pixel-Set Encoders and Temporal Self-Attention’). First, an MLP (multi-layer perceptron) combines the points within a polygon, and positional encoding organizes the result. Garnot calls this phase PSE (pixel-set encoder). In the second phase, the PSE result is input to an attention model called TAE (temporal attention encoder). See how Garnot describes the first part in section 3.1 of the original paper.
In the
sits
implementation of PSE-TAE and LTAE, we classify each time series individually. In mostsits
applications, training data is available as individual locations and not as polygons. For this reason, we did not implement the PSE part of Garnot's method. The temporal attention encoder receives individual points.Segmentation with
sits_segment()
results in post-segmentation objects. In this case, we could have used the same strategy as Garnot, implementing a pixel-set encoder. However, currently we use the same pixel-based logic to train and classify the points within a polygon. Strictly speaking, our implementation of OBIA insits
does not correspond to the PSE-TAE algorithm and its LTAE derivative.It would be very interesting to compare our implementation with Garnot's original algorithm. To do this, we would have to include a new algorithm and new training methods, namely:
(a) make a segmentation.
(b) classify the points inside polygons using a similar strategy as the one by Garnot.
(c) implement PSE-TAE in the form proposed by Garnot.
We will be able to make comparative statements between the pixel-based version of LTAE and the original object-based version of LTAE.
Associated sits API function
sits_tae()
andsits_ltae()
will have to be modified to include the polygon-based PSE part of Garnot's proposal.The text was updated successfully, but these errors were encountered: