<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Energy Res.</journal-id>
<journal-title>Frontiers in Energy Research</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Energy Res.</abbrev-journal-title>
<issn pub-type="epub">2296-598X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">852317</article-id>
<article-id pub-id-type="doi">10.3389/fenrg.2022.852317</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Energy Research</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Spatial Electric Load Forecasting Method Based on High-Level Encoding of High-Resolution Remote Sensing Images</article-title>
<alt-title alt-title-type="left-running-head">Wang and Sun</alt-title>
<alt-title alt-title-type="right-running-head">Spatial Electric Load Forecasting</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Wang</surname>
<given-names>Bowen</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1630962/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Sun</surname>
<given-names>Hongbin</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1709747/overview"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>School of Electrical Engineering</institution>, <institution>Northeast Electric Power University</institution>, <addr-line>Jilin</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>School of Computer Technology and Engineering</institution>, <institution>Changchun Institute of Technology</institution>, <addr-line>Changchun</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/993080/overview">Hao Yu</ext-link>, Tianjin University, China</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1634172/overview">Xiandong Xu</ext-link>, Tianjin University, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/993357/overview">Yue Zhou</ext-link>, Cardiff University, United&#x20;Kingdom</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Bowen Wang, <email>1201900011@neepu.edu.cn</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Smart Grids, a section of the journal Frontiers in Energy Research</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>16</day>
<month>03</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="collection">
<year>2022</year>
</pub-date>
<volume>10</volume>
<elocation-id>852317</elocation-id>
<history>
<date date-type="received">
<day>11</day>
<month>01</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>09</day>
<month>02</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2022 Wang and Sun.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Wang and Sun</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these&#x20;terms.</p>
</license>
</permissions>
<abstract>
<p>Spatial load forecasting (SLF) is important for regional power infrastructure construction planning and power grid management. However, for rapidly developing urban regions, SLF is generally inaccurate due to insufficient historical data. Hence, it is important to introduce the spatial load density (SLD) from similar regions to improve the accuracy of SLF. To select similar regions appropriately and acquire SLDs with limited available auxiliary data, this study proposes a spatial electric load forecasting method based on the high-level encoding of high-resolution remote sensing images called SELF-HE. In particular, SELF-HE introduces high-level ground object features as a key index to describe the characteristics of electric loads in a region and can establish connections between the remote sensing image features and SLD similarity. Based on this functionality, SELF-HE achieves more accurate SLF in regions with insufficient historical data. In the experiments, SELF-HE was compared with four traditional methods, and the results revealed that SELF-HE achieved improved SLF accuracy. Given that the high-resolution remote sensing images fully covered urban areas and were readily obtained, the proposed method can improve the accuracy of SLF with extremely low data collection costs and is applicable to rapidly developing urban regions.</p>
</abstract>
<kwd-group>
<kwd>SLF</kwd>
<kwd>remote sensing</kwd>
<kwd>forecasting</kwd>
<kwd>high-level encoding</kwd>
<kwd>SLD</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>Introduction</title>
<p>Efficient electric load forecasting methods can be employed to determine the electric load within a given period and provide considerable support for power grid management (<xref ref-type="bibr" rid="B5">Evangelopoulos et&#x20;al., 2020</xref>; <xref ref-type="bibr" rid="B18">Moreno-Carbonell et&#x20;al., 2020</xref>). Spatial load forecasting (SLF) indicates the extent to which the load will increase within a geographical region, which is necessary for determining the capacity or distribution of the equipment within a certain service zone (<xref ref-type="bibr" rid="B30">Willis and Tram, 1983</xref>; <xref ref-type="bibr" rid="B29">Willis, 2002</xref>). SLF can identify subzones with the highest anticipated load growth and support advanced preparations for distribution network expansion planning (<xref ref-type="bibr" rid="B2">Carreno et&#x20;al., 2010</xref>; <xref ref-type="bibr" rid="B15">Melo et&#x20;al., 2014</xref>; <xref ref-type="bibr" rid="B7">Han et&#x20;al., 2020</xref>). Therefore, it is necessary to obtain high-quality SLF results.</p>
<p>To perform SLF, one of the following two conditions is required: 1) a long-term study based on multiple years of historical data to reflect the characteristics of load changes during various time periods during festivals and under different weather conditions, which requires a sufficiently long time series of data to construct a high-performance regression model (<xref ref-type="bibr" rid="B6">Georgilakis and Hatziargyriou, 2015</xref>; <xref ref-type="bibr" rid="B31">Xie et&#x20;al., 2018</xref>), or 2) the ability to obtain directly the upcoming electric consumption plans of enterprises in the region and/or information pertaining to the regional economic growth or employment level to be used to assist in forecasting (<xref ref-type="bibr" rid="B4">Chow et&#x20;al., 2005</xref>). The two above-mentioned conditions can be met in relatively stable and established urban areas. However, for rapidly developing cities, especially areas of new development, this information is difficult to obtain. Moreover, various regions were developed recently (especially within the past year), enabling the accumulation of sufficient time series data to develop regression models. Furthermore, electric consumption plans are difficult to obtain due to large changes in population or the unwillingness of companies to disclose their production plans (<xref ref-type="bibr" rid="B9">Wu and Lu, 2002</xref>; <xref ref-type="bibr" rid="B23">Salv&#xf3; and Piacquadio, 2017</xref>).</p>
<p>With regard to the research on performing SLF via spatial load density (SLD), the implementation of SLF for areas of new development in cities for the analysis of the SLD is a feasible solution (<xref ref-type="bibr" rid="B8">He et&#x20;al., 2015</xref>). For a newly developed plot <italic>p</italic>
<sub>
<italic>x</italic>
</sub>, if an existing plot <italic>p</italic> can be established with an electric load trend that is similar to that of <italic>p</italic>
<sub>
<italic>x</italic>
</sub>, the SLD of <italic>p</italic> can be obtained by normalizing the historical electric load data, which can be used in combination with the range of <italic>p</italic>
<sub>
<italic>x</italic>
</sub> to simulate a long time series of data to train a forecasting model. This strategy is effective for plots with insufficient historical load data (<xref ref-type="bibr" rid="B32">Yao et&#x20;al., 2015</xref>; <xref ref-type="bibr" rid="B33">Ye et&#x20;al., 2019</xref>). The advantage of using such SLD methods is the ability to identify &#x201c;similar&#x201d; plots. Given that a plot load is closely related to the objects/buildings on the ground, the optional source of information for determining &#x201c;similar&#x201d; plots is geospatial information.</p>
<p>Spatial feature information has a significant influence on the accuracy of SLF, and using a geographic information system (GIS) to describe and distinguish different SLD patterns is an effective means of obtaining spatial&#x2013;temporal forecasting models (<xref ref-type="bibr" rid="B17">Monteiro et&#x20;al., 2005</xref>; <xref ref-type="bibr" rid="B1">Brunoro et&#x20;al., 2009</xref>; <xref ref-type="bibr" rid="B25">Shin et&#x20;al., 2011</xref>). Based on the introduction of geospatial features, the SLF accuracies achieved with fuzzy clustering, spatial correlation, cellular automaton, and multiagent methods can all be effectively improved (<xref ref-type="bibr" rid="B34">Ying and Pan, 2008</xref>; <xref ref-type="bibr" rid="B14">Melo et&#x20;al., 2010</xref>; <xref ref-type="bibr" rid="B13">Melo et&#x20;al., 2012</xref>). However, most existing geographic information is not directly suitable for SLF or SLD processing, and this information is relatively neutral (<xref ref-type="bibr" rid="B28">Vasquez-Arnez et&#x20;al., 2008</xref>). Therefore, most SLD-based methods adopt one of the following strategies: 1) the nearest plot is directly considered a similar source or 2) a plot in the same land use category is selected. For areas with a single industry and homogeneous structure, these two strategies are effective. However, for areas with highly diverse content, neighbor relationships or land use categories are not sufficient for identifying similar plots (<xref ref-type="bibr" rid="B16">Melo et&#x20;al., 2015</xref>; <xref ref-type="bibr" rid="B24">Shi et&#x20;al., 2016</xref>). For example, machinery manufacturing and biopharmaceutical companies belong to the economic development category (same land-use type); however, they exhibit completely different electricity consumption characteristics. Moreover, in areas of new urban development, this heterogeneity is severe (<xref ref-type="bibr" rid="B33">Ye et&#x20;al., 2019</xref>). Therefore, it is necessary to study methods of achieving relatively accurate SLF with insufficient electric load time series data and approximate geographic information&#x20;data.</p>
<p>For geographic information data to support SLF and SLD processing specifically, high-resolution remote sensing images constitute an appropriate source. With the advances in satellite sensor technology, high-resolution remote sensing images are becoming available, which can provide detailed ground object information (<xref ref-type="bibr" rid="B19">Pan et&#x20;al., 2021</xref>). High-resolution remote sensing images can be used to obtain the structural and spatial details of the objects in urban areas rapidly and efficiently and provide decision-making support for critical information related to the status, planning, population, and environment of these areas (<xref ref-type="bibr" rid="B11">Li et&#x20;al., 2016</xref>; <xref ref-type="bibr" rid="B27">Su et&#x20;al., 2021</xref>; <xref ref-type="bibr" rid="B21">Plant et&#x20;al., 2022</xref>). The specific characteristics of objects in a certain region can be extracted from remote sensing images (<xref ref-type="bibr" rid="B26">Srivastava et&#x20;al., 2019</xref>; <xref ref-type="bibr" rid="B3">Chakraborty et&#x20;al., 2021</xref>; <xref ref-type="bibr" rid="B22">Pristeri et&#x20;al., 2021</xref>). At present, shallow models such as support vector machines (SVMs), decision trees, k-nearest neighbor (k-NN) models, and deep models, including convolutional neural networks (CNNs) and long short-term memory (LSTM) networks, can all be used to describe the characteristics of the contents of remote sensing images; adequate application results have been obtained in various fields (<xref ref-type="bibr" rid="B35">Yuan et&#x20;al., 2017</xref>; <xref ref-type="bibr" rid="B20">Park et&#x20;al., 2018</xref>; <xref ref-type="bibr" rid="B12">Li et&#x20;al., 2019</xref>; <xref ref-type="bibr" rid="B36">Zhang et&#x20;al., 2019</xref>; <xref ref-type="bibr" rid="B10">Kang et&#x20;al., 2020</xref>). Similarly, the information required for SLF and SLD processing can be extracted from remote sensing images.</p>
<p>To address the difficulties in realizing SLF for rapidly developing regions, this study proposes a spatial electric load forecasting method based on the high-level encoding of high-resolution remote sensing images called SELF-HE. In SELF-HE, deep neural networks are established to obtain the features of ground objects from remote sensing images, an unsupervised clustering process is applied to establish connections between the image features and SLD, and a high-level encoding model is constructed to extract load characteristics from images. Using this model, data-rich plots that are similar to a given plot can be identified based on the features of the corresponding remote sensing images, enabling the use of the SLDs of similar plots to solve the problem of insufficient historical data. In the experiments, we tested the use of the proposed SELF-HE method for SLF in the northern part of Changchun, China. The results revealed that, compared with traditional methods, SELF-HE can achieve more accurate SLF. Moreover, SELF-HE uses only remotely sensed high-level feature data as the basis for identifying similar plots; hence, this method is beneficial for large-scale and low-cost&#x20;SLF.</p>
</sec>
<sec sec-type="methods" id="s2">
<title>Methodology</title>
<sec id="s2-1">
<title>Basic Principle of Using SLD for SLF</title>
<p>To achieve load forecasting for plots with insufficient historical electric load data, the proposed method applies the principle illustrated in <xref ref-type="fig" rid="F1">Figure&#x20;1</xref>.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Basic principle of using SLD for SLF.</p>
</caption>
<graphic xlink:href="fenrg-10-852317-g001.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="F1">Figure&#x20;1</xref>, there are plots in a large zone <italic>Z</italic>: {<italic>p</italic>
<sub>
<italic>1</italic>
</sub>, <italic>p</italic>
<sub>
<italic>2</italic>
</sub>, &#x2026; , <italic>p</italic>
<sub>n</sub>}. For each <italic>p</italic>
<sub>
<italic>i</italic>
</sub> &#x3d; (<italic>area</italic>, <italic>history</italic>, <italic>sld</italic>), <italic>area</italic> is the spatial area corresponding to <italic>p</italic>
<sub>
<italic>i</italic>
</sub>, <italic>history</italic> is the time series data of the historical electric loads, and <italic>sld</italic> is the SLD vector calculated based on <italic>history</italic>. Elements in <italic>Z</italic> can be further separated into two types: <italic>P</italic>
<sub>
<italic>known</italic>
</sub> and <italic>P</italic>
<sub>
<italic>unknown</italic>
</sub>. The difference between <italic>P</italic>
<sub>
<italic>known</italic>
</sub> and <italic>P</italic>
<sub>
<italic>unknown</italic>
</sub> is that the elements of <italic>known</italic> originate from areas that were developed a sufficiently long time ago, where rich historical load data are available; by contrast, the elements of <italic>P</italic>
<sub>
<italic>unknown</italic>
</sub> correspond to newly developed urban areas, for which sufficient historical data have not been accumulated. Owing to the insufficiency of historical data, a sufficiently accurate forecasting model cannot be constructed. However, we can identify plots in <italic>P</italic>
<sub>
<italic>known</italic>
</sub> that are highly similar to those in <italic>P</italic>
<sub>
<italic>unknown</italic>
</sub> and use the SLDs of these plots to construct a forecasting model jointly based on the SLD information and a small amount of historical&#x20;data.</p>
</sec>
<sec id="s2-2">
<title>Overall Process of the Proposed Method</title>
<p>The core problem in <xref ref-type="fig" rid="F1">Figure&#x20;1</xref> is to obtain the SLD information for a given plot <italic>p</italic>
<sub>
<italic>x</italic>
</sub> based on a set of plots similar to <italic>p</italic>
<sub>
<italic>x</italic>
</sub> in <italic>P</italic>
<sub>
<italic>known</italic>
</sub>. The spatial structure and style of buildings in high-resolution remote sensing images can provide information to solve this problem. Thus, we can use the high-level features of ground objects to perform an approximate search and obtain the target SLD. Hence, this study proposes the SELF-HE method. The overall process of SELF-HE is depicted in <xref ref-type="fig" rid="F2">Figure&#x20;2</xref>.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Overall process of SELF-HE.</p>
</caption>
<graphic xlink:href="fenrg-10-852317-g002.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="F2">Figure&#x20;2</xref>, for Zone <italic>Z</italic> containing plots belonging to <italic>known</italic> and <italic>unknown</italic>, the objective is to develop an SLF model for plot <italic>p</italic>
<sub>
<italic>x</italic>
</sub> in <italic>P</italic>
<sub>
<italic>unknown</italic>
</sub>. The SELF-HE consists of three steps:</p>
<sec id="s2-2-1">
<title>Compressed Representation of Image Patches</title>
<p>Suppose that <italic>Z</italic> is depicted in one or more high-resolution remote sensing images <italic>IMG</italic>
<sub>
<italic>zone</italic>
</sub> &#x3d; {<italic>img</italic>
<sub>1</sub>, <italic>img</italic>
<sub>2</sub>, &#x2026; , <italic>img</italic>
<sub>n</sub>}. Based on the plots in <italic>P</italic>
<sub>
<italic>known</italic>
</sub>, the corresponding image patches are cut from <italic>IMG</italic>
<sub>
<italic>zone</italic>
</sub> to obtain the image patch set <italic>I</italic>
<sub>
<italic>known</italic>
</sub> &#x3d; {<italic>i</italic>
<sub>1</sub>, <italic>i</italic>
<sub>
<italic>2</italic>
</sub>, &#x2026; , <italic>i</italic>
<sub>
<italic>n</italic>
</sub>}. All data in <italic>I</italic>
<sub>
<italic>known</italic>
</sub> are then used to train a compressed representation model, namely, <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub>. Using <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub>, an image patch can be converted into a compressed representation vector, <italic>v</italic>
<sub>
<italic>cmp</italic>
</sub>. This step is described in detail in <italic>Compressed Representation of Image Patches</italic>.</p>
</sec>
<sec id="s2-2-2">
<title>Construction of a Distance Encoding Model and Group Assignment Model</title>
<p>Using <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub>, <italic>I</italic>
<sub>
<italic>known</italic>
</sub> can be transformed into a set of compressed representation vectors. A distance encoding model <italic>M</italic>
<sub>
<italic>distance</italic>
</sub> is then constructed based on the locations of the plots. Using <italic>M</italic>
<sub>
<italic>distance</italic>
</sub>, each plot can be associated with a distance vector <italic>v</italic>
<sub>
<italic>dis</italic>
</sub>. Based on <italic>v</italic>
<sub>
<italic>dis</italic>
</sub> and SLD, the plots can be clustered, and the plots in <italic>P</italic>
<sub>
<italic>known</italic>
</sub> can be further encoded based on the clustering result <italic>T</italic>
<sub>
<italic>cluster</italic>
</sub>. Thereafter, a group assignment model <italic>M</italic>
<sub>
<italic>group</italic>
</sub> is constructed and trained based on <italic>v</italic>
<sub>
<italic>dis</italic>
</sub>, <italic>v</italic>
<sub>
<italic>cmp</italic>
</sub>, and <italic>T</italic>
<sub>
<italic>cluster</italic>
</sub>. The output of <italic>M</italic>
<sub>
<italic>group</italic>
</sub> is high-level encoding, which serves as the basis for SELF-HE to determine the degree of similarity between the plots. This step is described in detail in <italic>Construction of a Distance Encoding Model and Group Assignment Model</italic>.</p>
</sec>
<sec id="s2-2-3">
<title>High-Level Encoding and SLF</title>
<p>It should be noted that SELF-HE integrates <italic>M</italic>
<sub>
<italic>distance</italic>
</sub>, <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub>, and <italic>M</italic>
<sub>
<italic>group</italic>
</sub> to construct a high-level encoding model, namely, <italic>M</italic>
<sub>
<italic>encode</italic>
</sub>. In particular, <italic>M</italic>
<sub>
<italic>encode</italic>
</sub> can realize an end-to-end plot encoding function, as it accepts the corresponding image patch and features of a plot as inputs and outputs the encoding result. For <italic>P</italic>
<sub>
<italic>known</italic>
</sub>, <italic>M</italic>
<sub>
<italic>encode</italic>
</sub> is used to obtain encoding result <italic>V</italic>
<sub>
<italic>encode</italic>
</sub> for each plot. For <italic>p</italic>
<sub>
<italic>x</italic>
</sub>, <italic>M</italic>
<sub>
<italic>encode</italic>
</sub> is used to obtain encoding result <italic>v</italic>
<sub>
<italic>x</italic>
</sub>. Thereafter, using the vector distances between <italic>v</italic>
<sub>
<italic>x</italic>
</sub> and the elements in <italic>V</italic>
<sub>
<italic>encode</italic>
</sub>, SELF-HE can identify <italic>P</italic>
<sub>
<italic>similar</italic>
</sub> plots in <italic>P</italic>
<sub>
<italic>known</italic>
</sub> that are the most similar to <italic>p</italic>
<sub>
<italic>x</italic>
</sub>. Based on <italic>P</italic>
<sub>
<italic>similar</italic>
</sub> and the historical data for <italic>p</italic>
<sub>
<italic>x</italic>
</sub>, an SLF model <italic>M</italic>
<sub>
<italic>forecast</italic>
</sub> for <italic>p</italic>
<sub>
<italic>x</italic>
</sub> can be obtained. This step is described in detail in <italic>High-Level Encoding and&#x20;SLF</italic>.</p>
<p>Using the three steps above, although the plot corresponding to <italic>p</italic>
<sub>
<italic>x</italic>
</sub> is a newly established area in the city in which historical electric load data are scarce; based on the characteristics of the high-level encoding, an approximately similar area in the city can be identified, for which a large amount of historical data is available to facilitate the construction of <italic>M</italic>
<sub>
<italic>forecast</italic>
</sub>. Thereafter, <italic>M</italic>
<sub>
<italic>forecast</italic>
</sub> can be used to perform SLF for the area corresponding to&#x20;<italic>p</italic>
<sub>
<italic>x</italic>
</sub>.</p>
</sec>
</sec>
<sec id="s2-3">
<title>Compressed Representation of Image Patches</title>
<p>This section details the development of a compressed image patch representation model <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub>, through which the high-level information in an image patch can be extracted. The structure of <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub> is shown in <xref ref-type="fig" rid="F3">Figure&#x20;3</xref>.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Structure of <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub>.</p>
</caption>
<graphic xlink:href="fenrg-10-852317-g003.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="F3">Figure&#x20;3</xref>, <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub> consists of three components:</p>
<sec id="s2-3-1">
<title>Resize and Grayscale Transform Layer</title>
<p>As the first component of <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub>, we introduce a layer that converts the input image into a grayscale image and then scales it to a specified size <italic>Param</italic>
<sub>
<italic>size</italic>
</sub>. The default value of <italic>Param</italic>
<sub>
<italic>size</italic>
</sub> is 256&#x20;&#xd7; 256. There are two reasons for using this layer in <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub>. First, with increasing resolution of a remote sensing image, the coverage area decreases; therefore, to cover all areas in <italic>Z</italic>, it may be necessary to use multiple images. In this case, even if these images are collected from the same satellite sensor, it is difficult to ensure that the images are consistent with respect to the acquisition time or season. To overcome this challenge, grayscale images can reduce the influence of vegetation growth on the color (certain band values) in an image, avoiding the case in which the subsequent neural network focuses on the color instead of the structure of the ground objects. Second, using a fixed output size in this layer can significantly reduce the difficulty of subsequent training. This layer can be realized using a color-to-grayscale conversion function [mapping the value range to (0, 1)] and an image resizing function, and the output is the feature map <italic>i</italic>
<sub>
<italic>gray</italic>
</sub>.</p>
</sec>
<sec id="s2-3-2">
<title>VGG16 Feature Extractor</title>
<p>The main objective of the second component of <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub> is to extract high-level features from the input image. We directly use the pretrained VGG16 neural network to achieve this goal. This neural network contains five groups of feature extraction layers, each consisting of convolution &#x2b; rectified linear unit (ReLU) and max pooling layers. One group of layers reduces the size of the input feature map by half. The pretrained VGG16 neural network does not require training. The standard pretrained weights obtained based on the ImageNet training samples are directly used as weights. At the end of the VGG16 network, we add a flattened layer to convert the output feature maps into one-dimensional vectors.</p>
<p>Vector <italic>v</italic>
<sub>
<italic>flatten</italic>
</sub> represents the representation result for the image patch. However, this vector comprises thousands of dimensions. With such high dimensionality, there is considerable redundant content that is not useful for distinguishing the differences between object structures in image patches, and an excessively high number of dimensions can readily cause overfitting in subsequent processing. Therefore, an additional compression process is required.</p>
</sec>
<sec id="s2-3-3">
<title>Compressed Encoder</title>
<p>In SELF-HE, an unsupervised approach is adopted to compress&#x20;the output of the VGG16 feature extractor. First, we developed an&#x20;autoencoder model. This model consists of an encoder <italic>M</italic>
<sub>
<italic>encoder</italic>
</sub> and a decoder <italic>M</italic>
<sub>
<italic>decoder</italic>
</sub>, which performs the following transformations:<disp-formula id="e1">
<mml:math id="m1">
<mml:mrow>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>&#x3d5;</mml:mi>
<mml:mo>:</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2192;</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>&#x3c6;</mml:mi>
<mml:mo>:</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>e</mml:mi>
<mml:mo>&#x2192;</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
</p>
<p>The autoencoder model is expected to achieve the following via <italic>M</italic>
<sub>
<italic>encoder</italic>
</sub> and <italic>M</italic>
<sub>
<italic>decoder</italic>
</sub>:<disp-formula id="e2">
<mml:math id="m2">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mi>&#x3d5;</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>&#x3c6;</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2016;</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>&#x3d5;</mml:mi>
<mml:mo>&#x2218;</mml:mo>
<mml:mi>&#x3c6;</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>&#x2016;</mml:mo>
</mml:math>
<label>(2)</label>
</disp-formula>
</p>
<p>The <italic>encoder</italic> consists of three layers: a ReLU layer with a number of neurons equal to the dimensionality of <italic>v</italic>
<sub>
<italic>flatten</italic>
</sub>, a ReLU layer with 256 neurons, and a ReLU layer with <italic>Param</italic>
<sub>
<italic>code</italic>
</sub> neurons. Similarly, the <italic>decoder</italic> consists of three layers: a ReLU layer with <italic>Param</italic>
<sub>
<italic>code</italic>
</sub> neurons, a ReLU layer with 256 neurons, and a sigmoid layer with a number of neurons equal to the dimensionality of <italic>v</italic>
<sub>
<italic>flatten</italic>
</sub>. Using <italic>M</italic>
<sub>
<italic>encoder</italic>
</sub>, <italic>v</italic>
<sub>
<italic>flatten</italic>
</sub> is compressed into <italic>encoding</italic> with <italic>Param</italic>
<sub>
<italic>code</italic>
</sub> dimensions, whereas <italic>M</italic>
<sub>
<italic>decoder</italic>
</sub> attempts to restore <italic>encode</italic> to <italic>v</italic>
<sub>
<italic>flatten</italic>
</sub>. Using only <italic>M</italic>
<sub>
<italic>encoder</italic>
</sub>, <italic>v</italic>
<sub>
<italic>flatten</italic>
</sub> can be compressed into a <italic>Param</italic>
<sub>
<italic>code</italic>
</sub>-dimensional vector (default value of 32). Using <italic>M</italic>
<sub>
<italic>encoder</italic>
</sub> as the third component of <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub>, the final output <italic>v</italic>
<sub>
<italic>cmp</italic>
</sub> can be obtained.</p>
<p>Based on the above description, the construction and training process for <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub> is summarized in <xref ref-type="statement" rid="alg1">Algorithm&#x20;1</xref>.</p>
<p>
<statement content-type="algorithm" id="alg1">
<label>Algorithm 1</label>
<p>
<italic>M</italic>
<sub>
<italic>cmp</italic>
</sub> construction and training (MCP-CT) algorithm.</p>
<p>
<inline-graphic xlink:href="fenrg-10-852317-fx1.tif"/>
</p>
<p>The MCP-CT algorithm accepts <italic>IMG</italic>
<sub>
<italic>zone</italic>
</sub> and <italic>P</italic>
<sub>
<italic>known</italic>
</sub> as the input and generates the <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub> model after training. Moreover, <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub> can compress and encode an image patch based on the differences with respect to all related images in <italic>known</italic>, and it outputs the compressed representation vector&#x20;<italic>v</italic>
<sub>
<italic>cmp</italic>
</sub>.</p>
</statement>
</p>
</sec>
</sec>
<sec id="s2-4">
<title>Construction of a Distance Encoding Model and Group Assignment Model</title>
<p>This section details the determination of the distance encoding model <italic>M</italic>
<sub>
<italic>distance</italic>
</sub> and group assignment model <italic>M</italic>
<sub>
<italic>group</italic>
</sub>. Plots can then be encoded using these two models.</p>
<p>For Zone <italic>Z</italic>, suppose that the lower left corner is positioned at the two-dimensional coordinates (0, 0), the width of <italic>Z</italic> is <italic>L</italic>
<sub>
<italic>width</italic>
</sub>, and the height is <italic>L</italic>
<sub>
<italic>height</italic>
</sub>. The distances of a plot <italic>p</italic>
<sub>
<italic>i</italic>
</sub> from the coordinates (0, 0) along the <italic>x</italic> and <italic>y</italic> axes are denoted by <italic>p</italic>
<sub>
<italic>i</italic>
</sub>
<italic>.area.x</italic> and <italic>p</italic>
<sub>
<italic>i</italic>
</sub>
<italic>.area.y</italic>, respectively. Accordingly, the following equation is used to describe the relative position of <italic>p</italic>
<sub>
<italic>i</italic>
</sub> in Zone <italic>Z</italic>
<disp-formula id="e3">
<mml:math id="m3">
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>p</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>.</mml:mo>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>p</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>.</mml:mo>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>p</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>.</mml:mo>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.5</mml:mn>
<mml:mo>,</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>p</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>.</mml:mo>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.5</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>where <italic>v</italic>
<sub>
<italic>distance</italic>
</sub> describes the position of <italic>p</italic>
<sub>
<italic>i</italic>
</sub> relative to the center of <italic>Z</italic> and relative to the coordinates (0, 0). For a plot, <xref ref-type="disp-formula" rid="e3">Eq. 3</xref> can describe its position according to the distance from the starting point and the center point of <italic>Z</italic>, and form a vector; this vector is&#x20;easy to participate in the calculation process of the neural network, <italic>v</italic>
<sub>
<italic>distance</italic>
</sub> can assist neural network take plot&#x2019;s location as important features during inference. <italic>M</italic>
<sub>
<italic>distance</italic>
</sub> consists of a single layer with an input of <italic>p</italic>
<sub>
<italic>i</italic>
</sub>
<italic>.area</italic> and output of <italic>v</italic>
<sub>
<italic>distance</italic>
</sub>; thus, <italic>M</italic>
<sub>
<italic>distance</italic>
</sub> can be used to realize end-to-end coding distance coding for a&#x20;plot.</p>
<p>To develop <italic>M</italic>
<sub>
<italic>group</italic>
</sub>, we established the relationship between the SLD and the image encoding of a plot. This process is illustrated in <xref ref-type="fig" rid="F4">Figure&#x20;4</xref>.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Process of establishing the relationship between the SLD and the image encoding of a&#x20;plot.</p>
</caption>
<graphic xlink:href="fenrg-10-852317-g004.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="F4">Figure&#x20;4</xref>, the process of development and training consists of two&#x20;steps.</p>
<sec id="s2-4-1">
<title>SLD Relationship Extraction</title>
<p>For plot <italic>p</italic>
<sub>
<italic>i</italic>
</sub>, <italic>v</italic>
<sub>
<italic>distance</italic>
</sub> is first obtained using <italic>M</italic>
<sub>
<italic>distance</italic>
</sub> and is then concatenated with <italic>p</italic>
<sub>
<italic>i</italic>
</sub>.<italic>sld</italic>. Thereafter, the data from all plots in <italic>P</italic>
<sub>
<italic>known</italic>
</sub> are aggregated into an input sample batch <italic>T</italic>
<sub>
<italic>batch</italic>
</sub>. For SELF-HE, a deep neural network <italic>M</italic>
<sub>
<italic>sldcluster</italic>
</sub> is then used to cluster all samples in <italic>T</italic>
<sub>
<italic>batch</italic>
</sub>. <italic>M</italic>
<sub>
<italic>sldcluster</italic>
</sub> contains three groups of layers, each consisting of a dense layer and a batch normalization layer. The output of the final dense layer is <italic>N</italic>
<sub>
<italic>category</italic>
</sub> (default value is 64). Moreover, <italic>M</italic>
<sub>
<italic>sldcluster</italic>
</sub> encodes all samples in <italic>T</italic>
<sub>
<italic>batch</italic>
</sub>, and the encoding&#x20;result is <italic>T</italic>
<sub>
<italic>norm</italic>
</sub>, which consists of <italic>nondimensional</italic> vectors. It should be noted that <italic>T</italic>
<sub>
<italic>norm</italic>
</sub> can be regarded as a fuzzy representation of the clustering of the samples; by applying ArgMax, the final clustering result <italic>T</italic>
<sub>
<italic>cluster</italic>
</sub> can be obtained. The difference between <italic>T</italic>
<sub>
<italic>cluster</italic>
</sub> and <italic>T</italic>
<sub>
<italic>norm</italic>
</sub> can be used as a loss function for training <italic>M</italic>
<sub>
<italic>sldcluster</italic>
</sub>:<disp-formula id="e4">
<mml:math id="m4">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
</p>
<p>Here, <italic>loss</italic>
<sub>
<italic>sld</italic>
</sub> represents the loss of the output in terms of the SLD difference, which can be expressed as follows:<disp-formula id="e5">
<mml:math id="m5">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munderover>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munderover>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>where <inline-formula id="inf1">
<mml:math id="m6">
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>. In addition, <italic>loss</italic>
<sub>
<italic>distance</italic>
</sub> represents the spatial neighboring constraint and is defined as<disp-formula id="e6">
<mml:math id="m7">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munderover>
<mml:mo>&#x2016;</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mi>n</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>where neighbor(<italic>j</italic>) denotes the number corresponding to the element nearest to Sample <italic>j</italic>. <xref ref-type="disp-formula" rid="e4">Eq. 4</xref> considers constraints on the SLD similarity and spatial continuity. Accordingly, plots with close distances and similar SLDs are assigned to the same cluster. Moreover, <italic>M</italic>
<sub>
<italic>sldcluster</italic>
</sub> undergoes iterative backpropagation to improve the clustering results, as expressed by <xref ref-type="statement" rid="alg2">Algorithm&#x20;2</xref>.</p>
<p>
<statement content-type="algorithm" id="alg2">
<label>Algorithm 2</label>
<p>SLD relationship extraction (SLD-E) algorithm.</p>
<p>
<inline-graphic xlink:href="fenrg-10-852317-fx2.tif"/>
</p>
<p>Using SLD-E, the clustering results <italic>T</italic>
<sub>
<italic>cluster</italic>
</sub> for all plots in <italic>P</italic>
<sub>
<italic>known</italic>
</sub> can be obtained. Plots with close spatial distances and relatively similar SLDs are mapped to the same category. Moreover, <italic>T</italic>
<sub>
<italic>cluster</italic>
</sub> captures the relationship between the SLD in space and the electric load trend. This relationship serves as a basis for the establishment of the relationship between image encoding and SLD similarity.</p>
</statement>
</p>
</sec>
<sec id="s2-4-2">
<title>Group Assignment Model Creation</title>
<p>As shown in <xref ref-type="fig" rid="F4">Figure&#x20;4</xref>, after <italic>T</italic>
<sub>
<italic>cluster</italic>
</sub> is obtained in Step 1, the group assignment model <italic>M</italic>
<sub>
<italic>group</italic>
</sub> can be trained. <italic>M</italic>
<sub>
<italic>group</italic>
</sub> consists of five dense layers and one sigmoid layer. For the elements in <italic>P</italic>
<sub>
<italic>known</italic>
</sub>, <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub> is used to obtain the compressed image encoding <italic>v</italic>
<sub>
<italic>cmp</italic>
</sub>, <italic>M</italic>
<sub>
<italic>distance</italic>
</sub> is used to obtain <italic>v</italic>
<sub>
<italic>distance</italic>
</sub>, and <italic>v</italic>
<sub>
<italic>cmp</italic>
</sub> and <italic>v</italic>
<sub>
<italic>distance</italic>
</sub> are concatenated. In this manner, a description <italic>T</italic>
<sub>
<italic>trainx</italic>
</sub> corresponding to the image content and location information in <italic>P</italic>
<sub>
<italic>known</italic>
</sub> is generated. Moreover, <italic>T</italic>
<sub>
<italic>cluster</italic>
</sub> is used as the model output <italic>T</italic>
<sub>
<italic>trainy</italic>
</sub>. Thereafter, <italic>M</italic>
<sub>
<italic>group</italic>
</sub> is trained using <italic>T</italic>
<sub>
<italic>trainx</italic>
</sub> and <italic>T</italic>
<sub>
<italic>trainy</italic>
</sub>. By training <italic>M</italic>
<sub>
<italic>group</italic>
</sub>, the relationship between image encoding and SLD clustering results is established. This process is expressed by <xref ref-type="statement" rid="alg3">Algorithm&#x20;3</xref>.</p>
<p>
<statement content-type="algorithm" id="alg3">
<label>Algorithm 3</label>
<p>Group assignment model creation (GAMC) algorithm.</p>
<p>
<inline-graphic xlink:href="fenrg-10-852317-fx3.tif"/>
</p>
<p>Using GAMC, <italic>M</italic>
<sub>
<italic>group</italic>
</sub> is obtained. In particular, <italic>M</italic>
<sub>
<italic>group</italic>
</sub> accepts the image encoding (compressed image vector and distance vector) of a ground plot image as an input and generated the corresponding cluster assignment vector <italic>v</italic>
<sub>
<italic>encode</italic>
</sub> as an output. Thereafter, <italic>V</italic>
<sub>
<italic>encode</italic>
</sub> can be used as critical data to identify plots with similar SLD trends.</p>
<p>In the process of obtaining <italic>M</italic>
<sub>
<italic>group</italic>
</sub>, SELF-HE employs an adaptive number of categories. The SLD-E algorithm of SELF-HE prespecifies a number of categories <italic>N</italic>
<sub>
<italic>category</italic>
</sub> that significantly exceed the actual required number. After processing using <italic>M</italic>
<sub>
<italic>sldcluster</italic>
</sub> for <italic>T</italic>
<sub>
<italic>cluster,</italic>
</sub> the dimensions of several categories do not exceed the value of other dimensions (cannot be represented as a category label in the results); thus, the number of categories finally obtained is significantly lower than <italic>N</italic>
<sub>
<italic>category</italic>
</sub>. The actual number of classifications obtained by <italic>M</italic>
<sub>
<italic>group</italic>
</sub> is then as follows:<disp-formula id="e7">
<mml:math id="m8">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:mo>-</mml:mo>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>y</mml:mi>
<mml:mtext>&#xa0;</mml:mtext>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>C</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>q</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>M</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi mathvariant="italic">cluser</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>where <italic>ArgMax</italic> returns indices of the maximum values along an axis, <italic>Unique</italic> returns unique elements of an array, and <italic>Count</italic> returns the number of elements.</p>
</statement>
</p>
</sec>
</sec>
<sec id="s2-5">
<title>High-Level Encoding and SLF</title>
<p>When <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub>, <italic>M</italic>
<sub>
<italic>distance</italic>
</sub>
<italic>,</italic> and <italic>M</italic>
<sub>
<italic>group</italic>
</sub> have been obtained, <italic>M</italic>
<sub>
<italic>encode</italic>
</sub> can be constructed. The inputs into <italic>M</italic>
<sub>
<italic>encode</italic>
</sub> are the image patch and area information, and the output is the high-level encoding vector&#x20;<italic>v</italic>
<sub>
<italic>encode</italic>
</sub>. Based on <italic>v</italic>
<sub>
<italic>encode</italic>
</sub>, an SLF model is constructed. The corresponding process is shown in <xref ref-type="fig" rid="F5">Figure&#x20;5</xref>.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>
<italic>M</italic>
<sub>
<italic>encode</italic>
</sub> and SLF model development.</p>
</caption>
<graphic xlink:href="fenrg-10-852317-g005.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="F5">Figure&#x20;5</xref>, <italic>M</italic>
<sub>
<italic>encode</italic>
</sub> is constructed from <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub>, <italic>M</italic>
<sub>
<italic>distance</italic>
</sub>, and <italic>M</italic>
<sub>
<italic>group</italic>
</sub>. Moreover, <italic>M</italic>
<sub>
<italic>cmp</italic>
</sub> accepts image patch data and generates <italic>v</italic>
<sub>
<italic>cmp</italic>
</sub>, and <italic>M</italic>
<sub>
<italic>distance</italic>
</sub> accepts location information as an input to generate <italic>v</italic>
<sub>
<italic>distance</italic>
</sub>. Finally, <italic>v</italic>
<sub>
<italic>cmp</italic>
</sub> and <italic>v</italic>
<sub>
<italic>distance</italic>
</sub> are concatenated and input into <italic>M</italic>
<sub>
<italic>group</italic>
</sub> to generate the model output <italic>v</italic>
<sub>
<italic>encode</italic>
</sub>. Through this process, <italic>M</italic>
<sub>
<italic>encode</italic>
</sub> can realize the end-to-end capacity to encode the information of individual plots, and the resulting encoding can be further used to establish an SLF&#x20;model.</p>
<p>Through <italic>M</italic>
<sub>
<italic>encode</italic>
</sub>, all plots in <italic>P</italic>
<sub>
<italic>known</italic>
</sub> can be processed to obtain the encoding results <italic>V</italic>
<sub>
<italic>known</italic>
</sub> &#x3d; {<italic>v</italic>
<sub>
<italic>1</italic>
</sub>, <italic>v</italic>
<sub>2</sub>, &#x2026; , <italic>v</italic>
<sub>
<italic>n</italic>
</sub>}. For plot <italic>p</italic>
<sub>
<italic>x</italic>
</sub>, for which an SLF model should be obtained, the corresponding image patch <italic>I</italic>
<sub>
<italic>x</italic>
</sub> is then cut from <italic>Z</italic> in accordance with its <italic>area</italic> attribute, and <italic>p</italic>
<sub>
<italic>x</italic>
</sub>
<italic>.area</italic> and <italic>I</italic>
<sub>
<italic>x</italic>
</sub> are input into <italic>M</italic>
<sub>
<italic>encode</italic>
</sub> to obtain <italic>v</italic>
<sub>
<italic>encode</italic>
</sub>. For two encoding vectors, the distance between them is as follows:<disp-formula id="e8">
<mml:math id="m9">
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>m</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
</p>
<p>Based on <xref ref-type="disp-formula" rid="e8">Eq. 8</xref>, the <italic>m</italic> nearest vectors in <italic>V</italic>
<sub>
<italic>known</italic>
</sub> can be identified using the k-NN algorithm; thus, the most similar plots in <italic>known</italic>, that is, <italic>similar</italic> &#x3d; {<italic>p</italic>
<sub>
<italic>1</italic>
</sub>, <italic>p</italic>
<sub>
<italic>2</italic>
</sub>, &#x2026; , <italic>p</italic>
<sub>
<italic>m</italic>
</sub>}, can be identified. The average SLD, as denoted by <italic>averageSLD</italic>, is calculated as follows:<disp-formula id="e9">
<mml:math id="m10">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>v</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>L</mml:mi>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mi>i</mml:mi>
<mml:mi>m</mml:mi>
</mml:msubsup>
<mml:msub>
<mml:mi>p</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>.</mml:mo>
<mml:mi>S</mml:mi>
<mml:mi>L</mml:mi>
<mml:mi>D</mml:mi>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:mfrac>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>
</p>
<p>Accordingly, <italic>averageSLD</italic> represents the variation trend and&#x20;fluctuation range of the electric load data of <italic>p</italic>
<sub>
<italic>x</italic>
</sub>. Although insufficient historical data are available for <italic>p</italic>
<sub>
<italic>x</italic>
</sub>, these data can provide the range of load changes within a period.&#x20;Thereafter, based on the load change interval <italic>INT</italic> of <italic>p</italic>
<sub>
<italic>x</italic>
</sub>.<italic>history</italic>, long-term historical data can be estimated by calculating <italic>longhistory &#x3d; INT &#xd7; averageSLD</italic>, which can further support the development of <italic>M</italic>
<sub>
<italic>forecast</italic>
</sub>.</p>
<p>After all the above-mentioned steps, we finally obtain an end-to-end deep neural network model <italic>M</italic>
<sub>
<italic>encode</italic>
</sub> that can be used as a bridge from ground-building features to electrical load characteristics. Moreover, the remote sensing image data and location information of a plot are input into <italic>M</italic>
<sub>
<italic>encode</italic>
</sub>, which then produces high-level encoding corresponding to the image. This code can be used to identify the most similar plots with rich historical electrical load data and subsequently to obtain the average SLD. For the current plot, the average SLD can supplement the shortcomings of the insufficient data and obtain forecasting <italic>M</italic>
<sub>
<italic>forecast</italic>
</sub>, which is more stable and accurate than using the historical data of the plot. Finally, electrical power forecasting for developing regions or regions lacking historical load data could be realized.</p>
</sec>
</sec>
<sec id="s3">
<title>Experiments and Results</title>
<sec id="s3-1">
<title>Method Realization and Study Area</title>
<p>We adopted Python to implement the SELF-HE method and all methods considered for comparison, and TensorFlow was used to develop the deep neural network models in SELF-HE. All experiments were performed on a computer with an Intel Core i9-9900K CPU, a GeForce RTX 2080&#x20;11&#xa0;GB graphics processing unit (GPU), and 64&#xa0;GB of memory.</p>
<p>The target area in this study corresponds to the northern area of the city of Changchun, Jilin Province, China. This area is a rapidly growing area of Changchun, and methods such as SELF-HE are required to provide decision support for SLF. This area is shown in <xref ref-type="fig" rid="F6">Figure&#x20;6</xref>.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Study area and the corresponding remote sensing images.</p>
</caption>
<graphic xlink:href="fenrg-10-852317-g006.tif"/>
</fig>
<p>The target area and SLF Zone <italic>Z</italic> marked in <xref ref-type="fig" rid="F6">Figure&#x20;6</xref> contained various commercial, residential, educational, and manufacturing areas, all of which exhibited significantly different electrical load characteristics. The high-resolution remote sensing images of the study area were not obtained from a single remote sensing satellite sensor. In particular, we used the ArcGIS Living Atlas &#x201c;World Image&#x201d; web map service as the data source. For Zone <italic>Z</italic> in the study area, this service can provide detailed remote sensing image information from Level 0 to 23. We selected the 17th level, at which the resolution was 1.19&#xa0;m per pixel, which was sufficient to distinguish the structural characteristics of ground objects and could support the process of SELF-HE. Different regions in <italic>Z</italic> exhibited typical differences in structure and morphology, and these differences were used as critical clues to identify plots with similar&#x20;SLDs.</p>
<p>For the electrical load data, we selected 640 plots with dimensions of 300&#x20;&#xd7; 300&#xa0;m and collected historical electric load data from ammeters in the corresponding plots. The plots are shown in <xref ref-type="fig" rid="F7">Figure&#x20;7</xref>.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Plots and amount of historical&#x20;data.</p>
</caption>
<graphic xlink:href="fenrg-10-852317-g007.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="F7">Figure&#x20;7</xref>, these plots can be divided into three categories, the details of which are listed&#x20;below.</p>
<sec id="s3-1-1">
<title>Five Years</title>
<p>Five years of historical data were available from 2016 to 2020. The corresponding area was developed relatively early; thus, the data were relatively rich, and 170 plots belonged to this category.</p>
</sec>
<sec id="s3-1-2">
<title>Three Years</title>
<p>Three years of historical data were available from 2018 to 2020; several accumulated electrical load data were available for this area, and 351 plots belonged to this category.</p>
</sec>
<sec id="s3-1-3">
<title>Two Years</title>
<p>Only 2&#xa0;years of historical data were available from 2019 to 2020. These plots belonged to a newly developed area, for which there were insufficient historical data; and 119 plots belonged to this category.</p>
<p>Among all the above-mentioned plots, 50% of the plots in categories 1) and 2) were randomly selected as the SLD source dataset. This dataset consisted of historical data from 2016 to 2019 and did not contain data from 2020. The 2020 data for all the plots were used to construct the test set, which was further divided into three subsets, as follows. Test set 1 corresponded to the remaining 50% of the 5-years plots, Test set 2 corresponded to the remaining 50% of the 3-year plots, and Test set 3 corresponded to all 2-year&#x20;plots.</p>
</sec>
</sec>
<sec id="s3-2">
<title>Methods Considered for Comparison</title>
<p>To evaluate the load forecasting capacity of SELF-HE, the following methods were considered for comparison in this&#x20;study.</p>
<sec id="s3-2-1">
<title>Forecasting Model Trained Using Historical Data (F-History)</title>
<p>For all test sets, all data except those from 2020 were used to train the forecasting model. For this model, the SLD dataset was not required. Moreover, F-History uses an LSTM network as a forecasting model, and the forecasting time period is 7&#xa0;days (when forecasting the load for the following 7&#xa0;days at a certain time point, the load data generated in the previous 7&#xa0;days are required as input).</p>
</sec>
<sec id="s3-2-2">
<title>Nearest Matching SLD (Nearest-SLD)</title>
<p>For an unknown plot <italic>p</italic>
<sub>
<italic>x</italic>
</sub>, the plot in the SLD source dataset that was the closest to <italic>p</italic>
<sub>
<italic>x</italic>
</sub> was used to train the same LSTM forecasting model as in F-History based on the corresponding SLD information.</p>
</sec>
<sec id="s3-2-3">
<title>K-Neighbor Matching SLD (Neighbor-SLD)</title>
<p>For an unknown plot <italic>p</italic>
<sub>
<italic>x</italic>
</sub>, the <italic>k</italic> plots in the SLD source dataset that were the closest to <italic>p</italic>
<sub>
<italic>x</italic>
</sub> were identified, and their average SLD was obtained to develop the forecasting&#x20;model.</p>
</sec>
<sec id="s3-2-4">
<title>Structural Similarity Matching SLD (Similar-Structure)</title>
<p>
<italic>M</italic>
<sub>
<italic>cmp</italic>
</sub> from SELF-HE was used to extract <italic>v</italic>
<sub>
<italic>cmp</italic>
</sub> for each plot; <italic>v</italic>
<sub>
<italic>cmp</italic>
</sub> was used as a metric to determine the best-matching plot in the SLD source dataset, and its SLD was then used to construct a forecasting&#x20;model.</p>
</sec>
<sec id="s3-2-5">
<title>SELF-HE</title>
<p>The method proposed in this&#x20;study.</p>
<p>The prediction models used in each of the five methods above exhibit the same structure. Consequently, the capacity to adapt to different data characteristics and historical data volumes has a significant influence on the accuracy of the results. To evaluate the forecasting accuracy of each of the five methods for a given plot, we used the error rate defined below:<disp-formula id="e10">
<mml:math id="m11">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>R</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mo>&#x007C;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>R</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo>&#x007C;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mstyle>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>100</mml:mn>
<mml:mo>%</mml:mo>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:mfrac>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>
</p>
<p>This equation measures the 1-to-<italic>m</italic>-day forecasting error for a plot, where <italic>Forecast</italic>
<sub>
<italic>m</italic>
</sub> represents the forecasting result on the <italic>m</italic>th&#xa0;day, and <italic>real</italic>
<sub>
<italic>m</italic>
</sub> represents the true load on the <italic>m</italic>th&#xa0;day. For the entire test set, the prediction error was as follows:<disp-formula id="e11">
<mml:math id="m12">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>v</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>E</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>R</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>R</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>
</p>
<p>This average error rate represents the average forecasting error for all plots in a set of test data. As the value increases, the error increases. In this study, the average error rate was used to measure the forecasting capacity of each method.</p>
</sec>
</sec>
<sec id="s3-3">
<title>Details of the SELF-HE Clustering Results and Comparison of the Average Error Rates of the Five Methods</title>
<p>The SELF-HE method comprises multiple steps. The <italic>SLD-E</italic> algorithm in Step 2 performs cluster encoding based on SLD and spatial distance, and typical clustering results are shown in <xref ref-type="fig" rid="F8">Figure&#x20;8</xref>.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>Clustering results of <italic>SLD-E.</italic>
</p>
</caption>
<graphic xlink:href="fenrg-10-852317-g008.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="F8">Figure&#x20;8</xref> presents several examples of the typical clustering results of the SLD-E algorithm. The clustering results were obtained using SLD and spatial distance as criteria (the image content was not considered in the clustering process). However, as can be seen from the resulting clusters, plots in the same cluster exhibit similar spatial characteristics. Cluster 1 consists of residential areas that are highly similar in structural scale (size) and arrangement, and the patterns of electricity consumption in these areas are highly similar. For Cluster 2, although the sizes and directions are different, the plots correspond to the production workshops of small enterprises and exhibit similar compositions of content. The plots in Cluster 3 are from commercial areas and display similar patterns of arrangement. For the plots in Cluster 4, although their contents are not the same, they are all close to the main road. As can be seen from the results, the approximation of the SLD is correlated with the spatial characteristics of the remote sensing images. However, the mode of this correlation is not unique, and the four clusters correspond to four different correlation modes. Therefore, pure image approximation cannot describe all relevant relationships, and a more effective method, such as the GAMC algorithm of SELF-HE, is required to describe these relationships.</p>
<p>The average error rates of the five methods are shown in <xref ref-type="table" rid="T1">Table&#x20;1</xref>. As can be seen from this table, F-History does not use the SLD source dataset and relies only on the historical data in the test set to build a forecasting model. Moreover, given that Test set 1 contains 4&#xa0;years of historical data, F-History reaches its optimal forecasting accuracy using this test set. The accuracy of this method rapidly declines as the amount of available historical data decreases, and the poorest result is obtained for Test set 3, with an average error rate of 17.12%. It can be seen that a reduction in the amount of historical data has a significant influence on the forecasting model. For Nearest-SLD and Neighbor-SLD, the spatial distance was used as the criterion for selecting the SLD information from <italic>P</italic>
<sub>
<italic>known</italic>
</sub>. For Test sets 1 and 2, these methods yield lower accuracies than F-History. However, for Test set 3, the results are superior to those of F-History, indicating that Nearest-SLD and Neighbor-SLD have positive influences on the load forecasting when the available historical data are limited. Similar-Structure used the similarity of image characteristics to identify plots with similar SLDs in <italic>known</italic>, and the trend of the results obtained using this method is similar to those of Nearest-SLD and Neighbor-SLD, with an accuracy slightly lower than that of Neighbor-SLD. Among all the methods, SELF-HE achieves the best results. For Test set 1, the average error rate of 4.23% is the lowest result obtained; for Test set 3, with only 1&#xa0;year of historical load data, the average error rate of 8.14% is superior to those of the other methods. A comparison of the performance of the five methods is presented in <xref ref-type="fig" rid="F9">Figure&#x20;9</xref>.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Average error rates of the five methods.</p>
</caption>
<table>
<thead>
<tr>
<td rowspan="2" align="left">Method</td>
<td colspan="3" align="center">Average error rate (%)</td>
</tr>
<tr>
<td align="center">Test set 1</td>
<td align="center">Test set 2</td>
<td align="center">Test set 3</td>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">F-History</td>
<td align="char" char=".">4.91</td>
<td align="char" char=".">8.28</td>
<td align="char" char=".">17.12</td>
</tr>
<tr>
<td align="left">Nearest-SLD</td>
<td align="char" char=".">6.72</td>
<td align="char" char=".">9.54</td>
<td align="char" char=".">13.32</td>
</tr>
<tr>
<td align="left">Neighbor-SLD</td>
<td align="char" char=".">5.26</td>
<td align="char" char=".">8.97</td>
<td align="char" char=".">12.52</td>
</tr>
<tr>
<td align="left">Similar-Structure</td>
<td align="char" char=".">5.76</td>
<td align="char" char=".">10.65</td>
<td align="char" char=".">14.56</td>
</tr>
<tr>
<td align="left">SELF-HE</td>
<td align="char" char=".">4.23</td>
<td align="char" char=".">5.47</td>
<td align="char" char=".">8.14</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>Comparison of the five methods.</p>
</caption>
<graphic xlink:href="fenrg-10-852317-g009.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="F9">Figure&#x20;9</xref>, for all data sets, the SELF-HE method achieves the lowest average error rate, and Neighbor-SLD is superior to the other three methods. Moreover, F-History has the least significant influence on the test set with the smallest amount of data. Test set 1 contains 5&#xa0;years of historical data, and the electricity consumption behavior of the corresponding plots is relatively stable. Based on Test set 1, using 1&#xa0;year (2019), 2&#xa0;years (2018 and 2019), 3&#xa0;years (2017&#x2013;2019), and 4&#xa0;years (2016&#x2013;2019) of historical data, the average error rates achieved by the five methods are listed in <xref ref-type="table" rid="T2">Table&#x20;2</xref>.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Average error rate using Test set 1.</p>
</caption>
<table>
<thead>
<tr>
<td rowspan="2" align="left">Method</td>
<td colspan="4" align="center">Average error rate on test set 1 (%)</td>
</tr>
<tr>
<td align="center">1&#xa0;year</td>
<td align="center">2&#xa0;years</td>
<td align="center">3&#xa0;years</td>
<td align="center">4&#xa0;years</td>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">F-History</td>
<td align="char" char=".">13.31</td>
<td align="char" char=".">7.65</td>
<td align="char" char=".">5.31</td>
<td align="char" char=".">4.91</td>
</tr>
<tr>
<td align="left">Nearest-SLD</td>
<td align="char" char=".">12.67</td>
<td align="char" char=".">8.99</td>
<td align="char" char=".">6.21</td>
<td align="char" char=".">6.72</td>
</tr>
<tr>
<td align="left">Neighbor-SLD</td>
<td align="char" char=".">11.22</td>
<td align="char" char=".">8.05</td>
<td align="char" char=".">6.08</td>
<td align="char" char=".">5.26</td>
</tr>
<tr>
<td align="left">Similar-Structure</td>
<td align="char" char=".">11.07</td>
<td align="char" char=".">7.33</td>
<td align="char" char=".">6.34</td>
<td align="char" char=".">5.76</td>
</tr>
<tr>
<td align="left">SELF-HE</td>
<td align="char" char=".">6.33</td>
<td align="char" char=".">5.63</td>
<td align="char" char=".">4.47</td>
<td align="char" char=".">4.23</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The corresponding trends of the average error rate with respect to the historical data volume shown in <xref ref-type="table" rid="T2">Table&#x20;2</xref> are illustrated in <xref ref-type="fig" rid="F10">Figure&#x20;10</xref>.</p>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption>
<p>Trends of average error rate with respect to the historical data volume.</p>
</caption>
<graphic xlink:href="fenrg-10-852317-g010.tif"/>
</fig>
<p>Given that the plots in Test set 1 (from the older urban areas) have the longest available history, their electricity consumption characteristics are more stable than those for the other test sets. Consequently, the 1-year results in <xref ref-type="table" rid="T2">Table&#x20;2</xref> are superior to the results for Test set 3 in <xref ref-type="table" rid="T1">Table&#x20;1</xref>. As shown in <xref ref-type="table" rid="T1">Table&#x20;1</xref> and <xref ref-type="fig" rid="F10">Figure&#x20;10</xref>, as the amount of historical data increases, the average error rates of all the methods decrease. The decreasing trend of F-History is the most significant, indicating that this method is highly dependent on the amount of historical data. Moreover, F-History requires more historical data than other methods to develop the forecasting model and demonstrates improved performance when there are abundant historical data, and the electricity consumption behavior for the corresponding plots is stable. However, for newly developed areas in a city, sufficient historical data were not available, and the electricity consumption behavior of users corresponding to those plots was not sufficiently stable (e.g., several companies had not started running their machines). These problems prevented F-History from achieving high performance in the SLF. As observed, Nearest-SLD exhibits an unstable trend from three to 4&#xa0;years, with an increase in the amount of historical data, leading to a slight increase in the average error rate; whereas the trends of Neighbor-SLD and Similar-Structure are more stable. Since the <italic>Z</italic> is located in a rapid development region of city, many plots&#x2019; corresponding supporting facilities have been built in just recent years, and some companies have undergone industrial transformation and renovation; this may lead to huge differences in the characteristics of historical data that are far apart in time. At this time, if a larger amount of data is introduced from a single neighbor (whether in distance, distribution, or structure), it may lead to the introduction of too much heterogeneity information and reduce the accuracy; so errors increase for Nearest-SLD, Neighbor-SLD, and Similar-Structure in <xref ref-type="fig" rid="F10">Figure&#x20;10</xref>. Among all the methods, the trend of SELF-HE is the most gradual, and the results obtained using only 2&#xa0;years of historical data are similar to the results of the other methods using 4&#xa0;years of&#x20;data.</p>
<p>Using SLDs to supplement the lack of historical data can improve the performance of an SLF model. The Nearest-SLD algorithm uses a known plot from among the neighbors of the plot of interest as the source of the SLD information. This strategy can achieve higher performance than F-History; however, due to the extensive distribution of boundaries between different land use areas in cities, the use of the plot in the nearest position may cause an increase in error. Hence, Nearest-SLD is not stable. To address this shortcoming, Neighbor-SLD uses multiple known plots from among the neighbors of the plot of interest as the SLD source, achieving higher and more stable performance than Nearest-SLD. The concept of Similar-Structure is consistent with that of SELF-HE. In particular, the similarity between the features of remote sensing images is used as the standard for identifying plots with similar SLDs. However, as can be seen from <xref ref-type="fig" rid="F8">Figure&#x20;8</xref>, the spatial characteristics defining an SLD cluster do not necessarily follow a uniform rule; as distinct spatial arrangements, adjoining relationships, and content compositions may all be commonalities that define SLD clusters. Given that Similar-Structure uses only the vector distance based on <italic>v</italic>
<sub>
<italic>cmp</italic>
</sub> as the standard for assessing similarity, it may be suitable only for cases analogous to that of Cluster 1 in <xref ref-type="fig" rid="F8">Figure&#x20;8</xref>, and it may not readily adapt to other cases. Similar-Structure exhibits no significant advantage over Nearest-SLD or Neighbor-SLD. Among all the methods, the trend of SELF-HE is the most gradual, and the results obtained using only 2&#xa0;years of historical data are similar to those of the other methods using 4&#xa0;years of historical&#x20;data.</p>
<p>To analyze comprehensively the processes by which the SLF is obtained using each method, we selected a typical plot in the northeast corner of <italic>Z</italic> as the unknown plot <italic>P</italic>
<sub>
<italic>x</italic>
</sub>; the process of each algorithm is shown in <xref ref-type="fig" rid="F11">Figure&#x20;11</xref>.</p>
<fig id="F11" position="float">
<label>FIGURE 11</label>
<caption>
<p>Detailed process of each method: <bold>(A)</bold> unknown plot <italic>P</italic>
<sub>
<italic>x</italic>
</sub> and <bold>(B)</bold> comparison of all the methods.</p>
</caption>
<graphic xlink:href="fenrg-10-852317-g011.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="F11">Figure&#x20;11A</xref>, there are two types of plots in this area. The plots indicated in blue are from the training set; their SLD is stable and contains more historical data. The plots indicated in yellow are from the testing set, and they contain less historical data. Given that <italic>P</italic>
<sub>
<italic>x</italic>
</sub> is an unknown plot from the testing set, additional SLD data may be required to facilitate its SLF calculation. The characteristics of the five methods are shown in <xref ref-type="fig" rid="F11">Figure&#x20;11B</xref>, and the error rates of the five methods on <italic>P</italic>
<sub>
<italic>x</italic>
</sub> are listed in <xref ref-type="table" rid="T3">Table&#x20;3</xref>.</p>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Error rates of the five methods on <italic>P</italic>
<sub>
<italic>x</italic>
</sub>.</p>
</caption>
<table>
<thead>
<tr>
<td align="left">Method</td>
<td align="center">Error rate on <italic>P</italic>
<sub>
<italic>x</italic>
</sub> (%)</td>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">F-History</td>
<td align="char" char=".">15.20</td>
</tr>
<tr>
<td align="left">Nearest-SLD</td>
<td align="char" char=".">21.24</td>
</tr>
<tr>
<td align="left">Neighbor-SLD</td>
<td align="char" char=".">13.75</td>
</tr>
<tr>
<td align="left">Similar-Structure</td>
<td align="char" char=".">9.56</td>
</tr>
<tr>
<td align="left">SELF-HE</td>
<td align="char" char=".">6.79</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>For F-History, as it only uses limited historical data for SLF calculations, the plots of the neighbors do not participate in the SLF calculation. Moreover, due to the lack of historical data, the SLF model generated by F-History is readily fitted with specific features, which reduces its prediction accuracy. The error rate of F-History is 15.20%. For Nearest-SLD, there are four plots closest to <italic>P</italic>
<sub>
<italic>x</italic>
</sub> (east, south, west, and north). Given that the north and east are unknown plots, only west or east can be selected. The Nearest-SLD algorithm finally selected the south plot as the source of SLD. Although this selection mitigates the lack of historical data in F-History, this plot is located at the junction of residential and industrial areas, and its load consumption characteristic is significantly different from that of <italic>P</italic>
<sub>
<italic>x</italic>
</sub>, leading to the introduction of heterogeneous SLD. Thus, the forecast results obtained are lower than those of F-History, and its error rate is the highest, at 21.24%. The Nearest-SLD algorithm uses SLD to identify similar plots. As can be seen from <xref ref-type="fig" rid="F11">Figure&#x20;11B</xref>, Nearest-SLD identified a plot across the main road. Although this plot can help <italic>P</italic>
<sub>
<italic>x</italic>
</sub> obtain the SLD and improve the accuracy of the forecast; in urban environments, several main roads divide different administrative regions, functional regions, enterprises, or residential structures in the city, which results in different policies and groups that are core driving forces of power consumption. The Nearest-SLD error rate is 13.75%. Similar-Structure selected a plot with a similar building structure and composition content near <italic>P</italic>
<sub>
<italic>x</italic>
</sub>. The SLD provided by this plot causes the error rate of Similar-Structure to reach 9.56%, indicating that it is feasible to use the structure of the ground building as an index to obtain the SLD. However, this method exhibits several problems. In particular, for this plot in the rapid urban development area, the electricity consumption characteristics are not sufficiently stable; thus, further improvement is required. Moreover, SELF-HE uses <italic>M</italic>
<sub>
<italic>group</italic>
</sub> to assign <italic>v</italic>
<sub>
<italic>encode</italic>
</sub> to all plots and then selects the 10 most similar plots. Based on the average SLD of these plots, the optimal result obtained by SELF-HE demonstrates an error rate of 6.79%. This result indicates that the SELF-HE electric load forecasting based on the high-level encoding of high-resolution remote sensing images is more effective than those of the other methods. Moreover, SELF-HE achieves the optimal results among the five methods, indicating that it can extract key characteristics for SLD clustering in remote sensing images and acquire SLDs that are highly similar to the SLD of a plot of interest, enabling more accurate and stable forecasting results to be obtained. The corresponding results reveal that SELF-HE can foster connections between different remote sensing image characteristics (e.g., the specific characteristics described in <xref ref-type="fig" rid="F8">Figure&#x20;8</xref>) and SLD selection, which can serve as a new data source for&#x20;SLF.</p>
</sec>
<sec id="s3-4">
<title>Comparison of Methods Under Different Scenarios</title>
<p>To more fully evaluate the spatial forecasting ability of SELF-HE under different scenarios, we introduce more regions for comparison, and the characteristics of these regions are as follows.</p>
<sec id="s3-4-1">
<title>Stable old urban region (SO-R).</title>
<p>The central part of Changchun City is selected as the research object. This area has been developed for decades, and the number and type of residents and enterprises are relatively stable.</p>
</sec>
<sec id="s3-4-2">
<title>The changing old urban region (CO-R).</title>
<p>A region of Jilin City was selected as the research object. The original industry in this region was concentrated in the chemical field, and now it is transforming into the green and high-tech&#x20;field.</p>
</sec>
<sec id="s3-4-3">
<title>Rapidly developing area with relatively monotonous industry (DM-R).</title>
<p>Select a developing region in Tonghua City, and the enterprises in this region are mainly concentrated in the pharmaceutical&#x20;field.</p>
</sec>
<sec id="s3-4-4">
<title>Rapidly developing areas combining various industries (DV-R).</title>
<p>The economic and technological development zone of Changchun City is selected as the object, and the enterprises in this area come from various fields.</p>
<p>For the above four test scenarios, we tested the error rates of the five methods, and the comparison is shown in <xref ref-type="table" rid="T4">Table&#x20;4</xref>.</p>
<table-wrap id="T4" position="float">
<label>TABLE 4</label>
<caption>
<p>Comparison of the methods under different scenarios.</p>
</caption>
<table>
<thead>
<tr>
<td rowspan="2" align="left">Scenarios</td>
<td colspan="5" align="center">Average error rate (%)</td>
</tr>
<tr>
<td align="center">F-History</td>
<td align="center">Nearest-SLD</td>
<td align="center">Neighbor-SLD</td>
<td align="center">Similar-Structure</td>
<td align="center">SELF-HE</td>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">SO-R</td>
<td align="char" char=".">5.51</td>
<td align="char" char=".">5.35</td>
<td align="char" char=".">6.77</td>
<td align="char" char=".">6.21</td>
<td align="char" char=".">5.05</td>
</tr>
<tr>
<td align="left">CO-R</td>
<td align="char" char=".">17.67</td>
<td align="char" char=".">10.32</td>
<td align="char" char=".">11.45</td>
<td align="char" char=".">10.67</td>
<td align="char" char=".">7.23</td>
</tr>
<tr>
<td align="left">DM-R</td>
<td align="char" char=".">5.32</td>
<td align="char" char=".">4.32</td>
<td align="char" char=".">4.56</td>
<td align="char" char=".">4.77</td>
<td align="char" char=".">4.01</td>
</tr>
<tr>
<td align="left">DV-R</td>
<td align="char" char=".">8.95</td>
<td align="char" char=".">7.33</td>
<td align="char" char=".">7.89</td>
<td align="char" char=".">7.95</td>
<td align="char" char=".">5.21</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>It can be seen from <xref ref-type="table" rid="T4">Table&#x20;4</xref> that for scenario SO-R, all five methods have achieved good results due to the relatively stable electric load character, and SELF-HE is slightly better than the other four methods. For CO-R, the large amount of historical data becomes unreliable because the region is in industrial restructuring, and F-History achieves the worst results due to its high dependence on historical data. For DM-R, due to the monotonous industrial structure, the prediction is relatively easy, and the five methods have obtained good results. For DV-R, the accuracy drops due to the heterogeneity of electricity users in the region. SELF-HE has obtained the best results for the above four scenarios, indicating that SELF-HE has good stability and can adapt to various spatial forecast work; especially for CO-R and DV-R the advantages of the proposed method are more obvious, indicating that SELF-HE can cope with the changes and diversity of electric users in a region and can obtain higher-precision forecasting results.</p>
</sec>
</sec>
<sec id="s3-5">
<title>Further Research</title>
<p>The separate strategy of plots has a considerable impact on SELF-HE. Smaller plots will make the SLF results more capable of reflecting the characteristics of urban regions, but it will also increase the fluctuation of the load data in the boundaries between different regions and reduce the SLF accuracy. Meanwhile, larger plots will introduce more objects and make the load data more stable, but they will confuse the content of different regions and reduce the value of the SLF result. In this study, the plot size was manually specified; this strategy may not yield the optimal solutions and may cause a longer trial-and-error experimental process. In future research, we plan to introduce more urban data sets and plot sizes to explore the relationships between different urban areas and a variety plot sizes and then explore ways to optimize the plot size automatically to make SELF-HE more efficient.</p>
</sec>
</sec>
<sec sec-type="conclusion" id="s4">
<title>Conclusion</title>
<p>For the SLF process, considerable historical data are typically required to construct forecasting models. As it is generally difficult to accumulate sufficient data for rapidly developing regions in cities, considering the SLD information of plots for which abundant historical data are available is a feasible solution. With this approach, the key is to find plots with electricity consumption behaviors that are similar to that of the plot to be predicted.</p>
<p>To this end, this study proposes a spatial electric load forecasting method based on the high-level encoding of high-resolution remote sensing images called SELF-HE. Based on the experimental results, when the plots contained relatively small amounts of historical data, the traditional F-History approach could not achieve high accuracies, and the Nearest-SLD method could be influenced by the boundaries of different land use categories, introducing errors into the forecasting results. Owing to the diversity of historical data and ground data, a selection strategy that only relies on SLD (Neighbor-SLD) or ground object features (Similar-Structure) cannot fully represent the characteristics of the plot to be predicted; thus, the prediction results are unstable. Moreover, SELF-HE adopts high-resolution remote sensing images as a data source for the identification of similar plots, which enables the direct use of remote sensing images to obtain more appropriate SLD estimates. Thus, SELF-HE achieved the optimal results among the five methods.</p>
<p>Furthermore, SELF-HE bridges the remote sensing features and electric load characteristics and enables SLF to be performed based on remote sensing, to obtain higher-quality electric load forecasting results at a lower data collection cost. Using SELF-HE, load forecasting results for larger regions or areas of new development can, therefore, be rapidly obtained, which play an important role in the field of regional power infrastructure construction planning and power grid management.</p>
</sec>
</body>
<back>
<sec id="s5">
<title>Data Availability Statement</title>
<p>The original contributions presented in the study are included in the article/Supplementary Material, further inquiries can be directed to the corresponding author.</p>
</sec>
<sec id="s6">
<title>Author Contributions</title>
<p>BW: writing and method. HS: idea and proof.</p>
</sec>
<sec id="s7">
<title>Funding</title>
<p>This work was supported in part by the Scientific and Technological Planning Project of Jilin Province (20190302106GX).</p>
</sec>
<sec sec-type="COI-statement" id="s8">
<title>Conflict of Interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s9">
<title>Publisher&#x2019;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors, and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Brunoro</surname>
<given-names>C. M.</given-names>
</name>
<name>
<surname>El Hage</surname>
<given-names>F. S.</given-names>
</name>
<name>
<surname>de Oliveira</surname>
<given-names>C. C. B.</given-names>
</name>
</person-group> (<year>2009</year>). &#x201c;<article-title>Integrated Model of Spatial and Global Load Forecast for Power Distribution Systems</article-title>,&#x201d; in <conf-name>20th International Conference and Exhibition on Electricity Distribution-Part 1</conf-name> (<publisher-name>CIRED, 2009 IET</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>4</lpage>. </citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Carreno</surname>
<given-names>E. M.</given-names>
</name>
<name>
<surname>Rocha</surname>
<given-names>R. M.</given-names>
</name>
<name>
<surname>Padilha-Feltrin</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>A Cellular Automaton Approach to Spatial Electric Load Forecasting</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>26</volume>, <fpage>532</fpage>&#x2013;<lpage>540</lpage>. </citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chakraborty</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Ermida</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhan</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>On the Land Emissivity assumption and Landsat-Derived Surface Urban Heat Islands: A Global Analysis</article-title>. <source>Remote Sensing Environ.</source> <volume>265</volume>, <fpage>112682</fpage>. <pub-id pub-id-type="doi">10.1016/j.rse.2021.112682</pub-id> </citation>
</ref>
<ref id="B4">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Chow</surname>
<given-names>J.&#x20;H.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>F. F.</given-names>
</name>
<name>
<surname>Momoh</surname>
<given-names>J.&#x20;A.</given-names>
</name>
</person-group> (<year>2005</year>). &#x201c;<article-title>Applied Mathematics for Restructured Electric Power Systems</article-title>,&#x201d; in <source>Applied Mathematics for Restructured Electric Power Systems</source> (<publisher-name>Springer</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>9</lpage>. </citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Evangelopoulos</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Karafotis</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Georgilakis</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Probabilistic Spatial Load Forecasting Based on Hierarchical Trending Method</article-title>. <source>Energies</source> <volume>13</volume>, <fpage>4643</fpage>. <pub-id pub-id-type="doi">10.3390/en13184643</pub-id> </citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Georgilakis</surname>
<given-names>P. S.</given-names>
</name>
<name>
<surname>Hatziargyriou</surname>
<given-names>N. D.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>A Review of Power Distribution Planning in the Modern Power Systems Era: Models, Methods and Future Research</article-title>. <source>Electric Power Syst. Res.</source> <volume>121</volume>, <fpage>89</fpage>&#x2013;<lpage>100</lpage>. <pub-id pub-id-type="doi">10.1016/j.epsr.2014.12.010</pub-id> </citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Han</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Deng</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A Spatial Load Forecasting Method Based on DBSCAN Clustering and NAR Neural Network</article-title>. <source>J.&#x20;Phys. Conf. Ser.</source>, <volume>1449</volume>. <comment>IOP Publishing</comment>, <fpage>012032</fpage>. <pub-id pub-id-type="doi">10.1088/1742-6596/1449/1/012032</pub-id> </citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>He</surname>
<given-names>Y. X.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.&#x20;X.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>H. Y.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Forecasting the Urban Power Load in China Based on the Risk Analysis of Land-Use Change and Load Density</article-title>. <source>Int. J.&#x20;Electr. Power Energ. Syst.</source> <volume>73</volume>, <fpage>71</fpage>&#x2013;<lpage>79</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijepes.2015.03.018</pub-id> </citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hung-Chih Wu</surname>
<given-names>H. C.</given-names>
</name>
<name>
<surname>Chan-Nan Lu</surname>
<given-names>C. N.</given-names>
</name>
</person-group> (<year>2002</year>). <article-title>A Data Mining Approach for Spatial Modeling in Small Area Load Forecast</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>17</volume>, <fpage>516</fpage>&#x2013;<lpage>521</lpage>. <pub-id pub-id-type="doi">10.1109/tpwrs.2002.1007927</pub-id> </citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Fernandez-Beltran</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Hong</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Chanussot</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Plaza</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Graph Relation Network: Modeling Relations between Scenes for Multilabel Remote-Sensing Image Classification and Retrieval</article-title>. <source>IEEE Trans. Geosci. Remote Sensing.</source> <volume>59</volume>, <fpage>4355</fpage>&#x2013;<lpage>4369</lpage>. </citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Stein</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Bijker</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhan</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Urban Land Use Extraction from Very High Resolution Remote Sensing Imagery Using a Bayesian Network</article-title>. <source>ISPRS J.&#x20;Photogrammetry Remote Sensing</source> <volume>122</volume>, <fpage>192</fpage>&#x2013;<lpage>205</lpage>. <pub-id pub-id-type="doi">10.1016/j.isprsjprs.2016.10.007</pub-id> </citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Jia</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Gui</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Deep Learning-Based Classification Methods for Remote Sensing Images in Urban Built-Up Areas</article-title>. <source>IEEE Access</source> <volume>7</volume>, <fpage>36274</fpage>&#x2013;<lpage>36284</lpage>. <pub-id pub-id-type="doi">10.1109/access.2019.2903127</pub-id> </citation>
</ref>
<ref id="B13">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Melo</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Carreno</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Padilha-Feltrin</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2012</year>). &#x201c;<article-title>Considering Urban Dynamics in Spatial Electric Load Forecasting</article-title>,&#x201d; in <source>IEEE Power Energy Soc. Gen. Meet.</source> (<publisher-name>IEEE Publications</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.1109/pesgm.2012.6345436</pub-id> </citation>
</ref>
<ref id="B14">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Melo</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Carreno</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Padilha-Feltrin</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2010</year>). &#x201c;<article-title>Spatial Load Forecasting Using a Demand Propagation Approach</article-title>,&#x201d; in <conf-name>(IEEE Publications)/PES Transmission and Distribution Conference and Exposition</conf-name> (<publisher-name>Latin America T&#x26;D-LA</publisher-name>), <fpage>196</fpage>&#x2013;<lpage>203</lpage>. <pub-id pub-id-type="doi">10.1109/tdc-la.2010.5762882</pub-id> </citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Melo</surname>
<given-names>J.&#x20;D.</given-names>
</name>
<name>
<surname>Carreno</surname>
<given-names>E. M.</given-names>
</name>
<name>
<surname>Calvi&#xf1;o</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Padilha-Feltrin</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Determining Spatial Resolution in Spatial Load Forecasting Using a Grid-Based Model</article-title>. <source>Electric Power Syst. Res.</source> <volume>111</volume>, <fpage>177</fpage>&#x2013;<lpage>184</lpage>. <pub-id pub-id-type="doi">10.1016/j.epsr.2014.02.019</pub-id> </citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Melo</surname>
<given-names>J.&#x20;D.</given-names>
</name>
<name>
<surname>Carreno</surname>
<given-names>E. M.</given-names>
</name>
<name>
<surname>Padilha-Feltrin</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Estimation of a Preference Map of New Consumers for Spatial Load Forecasting Simulation Methods Using a Spatial Analysis of Points</article-title>. <source>Int. J.&#x20;Electr. Power Energ. Syst.</source> <volume>67</volume>, <fpage>299</fpage>&#x2013;<lpage>305</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijepes.2014.11.023</pub-id> </citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Monteiro</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Ramirez-Rosado</surname>
<given-names>I. J.</given-names>
</name>
<name>
<surname>Miranda</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Zorzano-Santamaria</surname>
<given-names>P. J.</given-names>
</name>
<name>
<surname>Garcia-Garrido</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Fernandez-Jimenez</surname>
<given-names>L. A.</given-names>
</name>
</person-group> (<year>2005</year>). <article-title>GIS Spatial Analysis Applied to Electric Line Routing Optimization</article-title>. <source>IEEE Trans. Power Deliv.</source> <volume>20</volume>, <fpage>934</fpage>&#x2013;<lpage>942</lpage>. <pub-id pub-id-type="doi">10.1109/tpwrd.2004.839724</pub-id> </citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Moreno-Carbonell</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>S&#xe1;nchez-&#xda;beda</surname>
<given-names>E. F.</given-names>
</name>
<name>
<surname>Mu&#xf1;oz</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Rethinking Weather Station Selection for Electric Load Forecasting Using Genetic Algorithms</article-title>. <source>Int. J.&#x20;Forecast.</source> <volume>36</volume>, <fpage>695</fpage>&#x2013;<lpage>712</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijforecast.2019.08.008</pub-id> </citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pan</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Simplified Object-Based Deep Neural Network for Very High Resolution Remote Sensing Image Classification</article-title>. <source>ISPRS J.&#x20;Photogrammetry Remote Sensing</source> <volume>181</volume>, <fpage>218</fpage>&#x2013;<lpage>237</lpage>. <pub-id pub-id-type="doi">10.1016/j.isprsjprs.2021.09.014</pub-id> </citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Park</surname>
<given-names>S.-J.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>C.-W.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>M.-J.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Landslide Susceptibility Mapping and Comparison Using Decision Tree Models: A Case Study of Jumunjin Area, Korea</article-title>. <source>Remote Sensing</source> <volume>10</volume>, <fpage>1545</fpage>. <pub-id pub-id-type="doi">10.3390/rs10101545</pub-id> </citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Plant</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Kort</surname>
<given-names>E. A.</given-names>
</name>
<name>
<surname>Murray</surname>
<given-names>L. T.</given-names>
</name>
<name>
<surname>Maasakkers</surname>
<given-names>J.&#x20;D.</given-names>
</name>
<name>
<surname>Aben</surname>
<given-names>I.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Evaluating Urban Methane Emissions from Space Using TROPOMI Methane and Carbon Monoxide Observations</article-title>. <source>Remote Sensing Environ.</source> <volume>268</volume>, <fpage>112756</fpage>. <pub-id pub-id-type="doi">10.1016/j.rse.2021.112756</pub-id> </citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pristeri</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Peroni</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Pappalardo</surname>
<given-names>S. E.</given-names>
</name>
<name>
<surname>Codato</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Masi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>De Marchi</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Whose Urban green? Mapping and Classifying Public and Private green Spaces in Padua for Spatial Planning Policies</article-title>. <source>Ijgi</source> <volume>10</volume>, <fpage>538</fpage>. <pub-id pub-id-type="doi">10.3390/ijgi10080538</pub-id> </citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Salv&#xf3;</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Piacquadio</surname>
<given-names>M. N.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Multifractal Analysis of Electricity Demand as a Tool for Spatial Forecasting</article-title>. <source>Energy Sustain. Dev.</source> <volume>38</volume>, <fpage>67</fpage>&#x2013;<lpage>76</lpage>. </citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shi</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>L.</given-names>
</name>
<etal/>
</person-group> (<year>2016</year>). <article-title>Detecting Spatiotemporal Dynamics of Global Electric Power Consumption Using DMSP-OLS Nighttime Stable Light Data</article-title>. <source>Appl. Energ.</source> <volume>184</volume>, <fpage>450</fpage>&#x2013;<lpage>463</lpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2016.10.032</pub-id> </citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shin</surname>
<given-names>J.-H.</given-names>
</name>
<name>
<surname>Yi</surname>
<given-names>B.-J.</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>Y.-I.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>H.-G.</given-names>
</name>
<name>
<surname>Ryu</surname>
<given-names>K. H.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Spatiotemporal Load-Analysis Model for Electric Power Distribution Facilities Using Consumer Meter-reading Data</article-title>. <source>IEEE Trans. Power Deliv.</source> <volume>26</volume>, <fpage>736</fpage>&#x2013;<lpage>743</lpage>. <pub-id pub-id-type="doi">10.1109/tpwrd.2010.2091973</pub-id> </citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Srivastava</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Vargas-Mu&#xf1;oz</surname>
<given-names>J.&#x20;E.</given-names>
</name>
<name>
<surname>Tuia</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Understanding Urban Landuse from the above and Ground Perspectives: A Deep Learning, Multimodal Solution</article-title>. <source>Remote Sensing Environ.</source> <volume>228</volume>, <fpage>129</fpage>&#x2013;<lpage>143</lpage>. <pub-id pub-id-type="doi">10.1016/j.rse.2019.04.014</pub-id> </citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Su</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhong</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Urban Scene Understanding Based on Semantic and Socioeconomic Features: From High-Resolution Remote&#x20;Sensing Imagery to Multi-Source Geographic Datasets</article-title>. <source>ISPRS J.&#x20;Photogrammetry Remote Sensing</source> <volume>179</volume>, <fpage>50</fpage>&#x2013;<lpage>65</lpage>. <pub-id pub-id-type="doi">10.1016/j.isprsjprs.2021.07.003</pub-id> </citation>
</ref>
<ref id="B28">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Vasquez-Arnez</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Jardini</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Casolari</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Magrini</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Semolini</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Pascon</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2008</year>). &#x201c;<article-title>A Methodology for Electrical Energy Forecast and its Spatial Allocation over Developing Boroughs</article-title>,&#x201d; in <conf-name>(IEEE Publications)/PES Transmission and Distribution Conference and Exposition</conf-name>, <fpage>1</fpage>&#x2013;<lpage>6</lpage>. </citation>
</ref>
<ref id="B29">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Willis</surname>
<given-names>H. L.</given-names>
</name>
</person-group> (<year>2002</year>). <source>Spatial Electric Load Forecasting</source>. <publisher-loc>Florida</publisher-loc>: <publisher-name>CRC Press</publisher-name>. </citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Willis</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Tram</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>1983</year>). <article-title>A Cluster Based V.A.I. Method for Distribution Load Forecasting</article-title>. <source>IEEE Trans. Power Apparatus Syst.</source> <volume>PAS-102</volume>, <fpage>2677</fpage>&#x2013;<lpage>2684</lpage>. <pub-id pub-id-type="doi">10.1109/tpas.1983.317673</pub-id> </citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xie</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Kong</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>W.</given-names>
</name>
<etal/>
</person-group> (<year>2018</year>). <article-title>Multi-objective Active Distribution Networks Expansion Planning by Scenario-Based Stochastic Programming Considering Uncertain and Random Weight of Network</article-title>. <source>Appl. Energ.</source> <volume>219</volume>, <fpage>207</fpage>&#x2013;<lpage>225</lpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2018.03.023</pub-id> </citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yao</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Chung</surname>
<given-names>C. Y.</given-names>
</name>
<name>
<surname>Wen</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Qin</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Xue</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Scenario-based Comprehensive Expansion Planning for Distribution Systems Considering Integration of Plug-In Electric Vehicles</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>31</volume>, <fpage>317</fpage>&#x2013;<lpage>328</lpage>. </citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ye</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Ding</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>A Data-Driven Bottom-Up Approach for Spatial and Temporal Electric Load Forecasting</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>34</volume>, <fpage>1966</fpage>&#x2013;<lpage>1979</lpage>. <pub-id pub-id-type="doi">10.1109/tpwrs.2018.2889995</pub-id> </citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ying</surname>
<given-names>L.-C.</given-names>
</name>
<name>
<surname>Pan</surname>
<given-names>M.-C.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>Using Adaptive Network Based Fuzzy Inference System to Forecast Regional Electricity Loads</article-title>. <source>Energ. Convers. Manage.</source> <volume>49</volume>, <fpage>205</fpage>&#x2013;<lpage>211</lpage>. <pub-id pub-id-type="doi">10.1016/j.enconman.2007.06.015</pub-id> </citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yuan</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>H.</given-names>
</name>
<etal/>
</person-group> (<year>2017</year>). <article-title>Retrieving Soybean Leaf Area index from Unmanned Aerial Vehicle Hyperspectral Remote Sensing: Analysis of RF, ANN, and SVM Regression Models</article-title>. <source>Remote Sensing</source> <volume>9</volume>, <fpage>309</fpage>. <pub-id pub-id-type="doi">10.3390/rs9040309</pub-id> </citation>
</ref>
<ref id="B36">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ji</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Detecting Large-Scale Urban Land Cover Changes from Very High Resolution Remote Sensing Images Using CNN-Based Classification</article-title>. <source>Ijgi</source> <volume>8</volume>, <fpage>189</fpage>. <pub-id pub-id-type="doi">10.3390/ijgi8040189</pub-id> </citation>
</ref>
</ref-list>
</back>
</article>