Tree species classification at the pixel-level using deep learning and multispectral time series in an imbalanced context

• URL: http://arxiv.org/abs/2408.08887v1
• Date: Mon, 5 Aug 2024 13:44:42 GMT
• Title: Tree species classification at the pixel-level using deep learning and multispectral time series in an imbalanced context
• Authors: Florian Mouret, David Morin, Milena Planells, Cécile Vincent-Barbaroux,
• Abstract summary: This paper investigates tree species classification using Sentinel-2 multispectral satellite image time-series. It shows that the use of deep learning models can lead to a significant improvement in classification results.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper investigates tree species classification using Sentinel-2 multispectral satellite image time-series. Despite their critical importance for many applications, such maps are often unavailable, outdated, or inaccurate for large areas. The interest of using remote sensing time series to produce these maps has been highlighted in many studies. However, many methods proposed in the literature still rely on a standard classification algorithm, usually the Random Forest (RF) algorithm with vegetation indices. This study shows that the use of deep learning models can lead to a significant improvement in classification results, especially in an imbalanced context where the RF algorithm tends to predict towards the majority class. In our use case in the center of France with 10 tree species, we obtain an overall accuracy (OA) around 95% and a F1-macro score around 80% using three different benchmark deep learning architectures. In contrast, using the RF algorithm yields an OA of 93% and an F1 of 60%, indicating that the minority classes are not classified with sufficient accuracy. Therefore, the proposed framework is a strong baseline that can be easily implemented in most scenarios, even with a limited amount of reference data. Our results highlight that standard multilayer perceptron can be competitive with batch normalization and a sufficient amount of parameters. Other architectures (convolutional or attention-based) can also achieve strong results when tuned properly. Furthermore, our results show that DL models are naturally robust to imbalanced data, although similar results can be obtained using dedicated techniques.

Related papers

• Low-Resource Crop Classification from Multi-Spectral Time Series Using Lossless Compressors [6.379065975644869]
  Deep learning has significantly improved the accuracy of crop classification using multispectral temporal data. In low-resource situations with fewer labeled samples, deep learning models perform poorly due to insufficient data. We propose a non-training alternative to deep learning models, aiming to address these situations.
  arXiv  Detail & Related papers  (2024-05-28T12:28:12Z)
• Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together! [100.19080749267316]
  "Sparsity May Cry" Benchmark (SMC-Bench) is a collection of carefully-curated 4 diverse tasks with 10 datasets. SMC-Bench is designed to favor and encourage the development of more scalable and generalizable sparse algorithms.
  arXiv  Detail & Related papers  (2023-03-03T18:47:21Z)
• Compound Batch Normalization for Long-tailed Image Classification [77.42829178064807]
  We propose a compound batch normalization method based on a Gaussian mixture. It can model the feature space more comprehensively and reduce the dominance of head classes. The proposed method outperforms existing methods on long-tailed image classification.
  arXiv  Detail & Related papers  (2022-12-02T07:31:39Z)
• Scaling Structured Inference with Randomization [64.18063627155128]
  We propose a family of dynamic programming (RDP) randomized for scaling structured models to tens of thousands of latent states. Our method is widely applicable to classical DP-based inference. It is also compatible with automatic differentiation so can be integrated with neural networks seamlessly.
  arXiv  Detail & Related papers  (2021-12-07T11:26:41Z)
• Spatio-temporal Crop Classification On Volumetric Data [3.2880869992413246]
  Large-area crop classification using multi-spectral imagery is a widely studied problem for several decades. Deep convolutional neural networks (DCNN) have been proposed, but they only achieved results comparable with Random Forest. In this work, we present a novel CNN based architecture for large-area crop classification.
  arXiv  Detail & Related papers  (2021-03-18T07:13:53Z)
• Robust Pollen Imagery Classification with Generative Modeling and Mixup Training [0.0]
  We present a robust deep learning framework that can generalize well for pollen grain aerobiological imagery classification. We develop a convolutional neural network-based pollen grain classification approach and combine some of the best practices in deep learning for better generalization. The proposed approach earned a fourth-place in the final rankings in the ICPR-2020 Pollen Grain Classification Challenge.
  arXiv  Detail & Related papers  (2021-02-25T19:39:24Z)
• Classification of Polarimetric SAR Images Using Compact Convolutional Neural Networks [24.553598498985796]
  A novel and systematic classification framework is proposed for the classification of PolSAR images. It is based on a compact and adaptive implementation of CNNs using a sliding-window classification approach. The proposed approach can perform classification using smaller window sizes than deep CNNs.
  arXiv  Detail & Related papers  (2020-11-10T17:09:11Z)
• Forest R-CNN: Large-Vocabulary Long-Tailed Object Detection and Instance Segmentation [75.93960390191262]
  We exploit prior knowledge of the relations among object categories to cluster fine-grained classes into coarser parent classes. We propose a simple yet effective resampling method, NMS Resampling, to re-balance the data distribution. Our method, termed as Forest R-CNN, can serve as a plug-and-play module being applied to most object recognition models.
  arXiv  Detail & Related papers  (2020-08-13T03:52:37Z)
• MurTree: Optimal Classification Trees via Dynamic Programming and Search [61.817059565926336]
  We present a novel algorithm for learning optimal classification trees based on dynamic programming and search. Our approach uses only a fraction of the time required by the state-of-the-art and can handle datasets with tens of thousands of instances.
  arXiv  Detail & Related papers  (2020-07-24T17:06:55Z)
• Solving Long-tailed Recognition with Deep Realistic Taxonomic Classifier [68.38233199030908]
  Long-tail recognition tackles the natural non-uniformly distributed data in realworld scenarios. While moderns perform well on populated classes, its performance degrades significantly on tail classes. Deep-RTC is proposed as a new solution to the long-tail problem, combining realism with hierarchical predictions.
  arXiv  Detail & Related papers  (2020-07-20T05:57:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.