Publication | Open Access
Downscaling of Satellite Remote Sensing Soil Moisture Products Over the Tibetan Plateau Based on the Random Forest Algorithm: Preliminary Results
43
Citations
44
References
2020
Year
Environmental MonitoringEngineeringClimate ModelingLand CoverLand DegradationTerrestrial SensingEarth ScienceVegetation-atmosphere InteractionsForest MeteorologyRandom Forest AlgorithmHydrometeorologyMeteorologyAbstract Soil MoistureGeographyRadiation MeasurementDigital Elevation ModelEarth Observation DataDeforestationLand Cover MapClimatologyHydrologic Remote SensingDroughtPreliminary ResultsRemote SensingSatellite MeteorologyLand Surface ModelingRandom ForestTibetan Plateau
Abstract Soil moisture (SM) is an important index of soil drought, and it directly controls the energy balance and water cycle of the land surface. As an indicator and amplifier of global warming, the Tibetan Plateau (TP) is becoming warmer and wetter. Because of its particular geographical environment, large‐scale measurements of SM on the TP can only be achieved by satellite remote sensing. The resolution of current SM product of the Soil Moisture Active Passive (SMAP) satellite is 36 km, which is insufficient for many practical applications. In this study, the Moderate Resolution Imaging Spectroradiometer (MODIS) and Digital Elevation Model (DEM) are applied to increase the resolution of SM down to 1 km using the Random Forest (RF) algorithm. The preliminary results of the proposed algorithm are evaluated by station observations and other reanalysis products. The downscaled results are more consistent with the in situ observations, the Land Data Assimilation System (CLDAS) from China Meteorological Administration (CMA), and the Global Land Data Assimilation System (GLDAS) from National Aeronautics and Space Administration (NASA) than the original SMAP product. The downscaling algorithm is most effective for grasslands. It is demonstrated that high‐resolution SM products can be generated by fusing various features using machine‐learning algorithms.
| Year | Citations | |
|---|---|---|
Page 1
Page 1