2
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Eucalyptus Plantation Area Extraction Based on SLPSO-RFE Feature Selection and Multi-Temporal Sentinel-1/2 Data

      , , , , ,
      Forests
      MDPI AG

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          An accurate and efficient estimation of eucalyptus plantation areas is of paramount significance for forestry resource management and ecological environment monitoring. Currently, combining multidimensional optical and SAR images with machine learning has become an important method for eucalyptus plantation classification, but there are still some challenges in feature selection. This study proposes a feature selection method that combines multi-temporal Sentinel-1 and Sentinel-2 data with SLPSO (social learning particle swarm optimization) and RFE (Recursive Feature Elimination), which reduces the impact of information redundancy and improves classification accuracy. Specifically, this paper first fuses multi-temporal Sentinel-1 and Sentinel-2 data, and then carries out feature selection by combining SLPSO and RFE to mitigate the effects of information redundancy. Next, based on features such as the spectrum, red-edge indices, texture characteristics, vegetation indices, and backscatter coefficients, the study employs the Simple Non-Iterative Clustering (SNIC) object-oriented method and three different types of machine-learning models: Random Forest (RF), Classification and Regression Trees (CART), and Support Vector Machines (SVM) for the extraction of eucalyptus plantation areas. Each model uses a supervised-learning method, with labeled training data guiding the classification of eucalyptus plantation regions. Lastly, to validate the efficacy of selecting multi-temporal data and the performance of the SLPSO–RFE model in classification, a comparative analysis is undertaken against the classification results derived from single-temporal data and the ReliefF–RFE feature selection scheme. The findings reveal that employing SLPSO–RFE for feature selection significantly elevates the classification precision of eucalyptus plantations across all three classifiers. The overall accuracy rates were noted at 95.48% for SVM, 96% for CART, and 97.97% for RF. When contrasted with classification outcomes from multi-temporal data and ReliefF–RFE, the overall accuracy for the trio of models saw an increase of 10%, 8%, and 8.54%, respectively. The accuracy enhancement was even more pronounced when juxtaposed with results from single-temporal data and ReliefF-RFE, at increments of 15.25%, 13.58%, and 14.54% respectively. The insights from this research carry profound theoretical implications and practical applications, particularly in identifying and extracting eucalyptus plantations leveraging multi-temporal data and feature selection.

          Related collections

          Most cited references83

          • Record: found
          • Abstract: not found
          • Article: not found

          A survey on feature selection methods

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Gene selection for cancer classification using support vector machines

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              SLIC superpixels compared to state-of-the-art superpixel methods.

              Computer vision applications have come to rely increasingly on superpixels in recent years, but it is not always clear what constitutes a good superpixel algorithm. In an effort to understand the benefits and drawbacks of existing methods, we empirically compare five state-of-the-art superpixel algorithms for their ability to adhere to image boundaries, speed, memory efficiency, and their impact on segmentation performance. We then introduce a new superpixel algorithm, simple linear iterative clustering (SLIC), which adapts a k-means clustering approach to efficiently generate superpixels. Despite its simplicity, SLIC adheres to boundaries as well as or better than previous methods. At the same time, it is faster and more memory efficient, improves segmentation performance, and is straightforward to extend to supervoxel generation.
                Bookmark

                Author and article information

                Contributors
                Journal
                FOREGK
                Forests
                Forests
                MDPI AG
                1999-4907
                September 2023
                September 13 2023
                : 14
                : 9
                : 1864
                Article
                10.3390/f14091864
                40b51b84-52a3-4bba-b506-2a8ce6bb04ae
                © 2023

                https://creativecommons.org/licenses/by/4.0/

                History

                Comments

                Comment on this article