• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Using mixed integer programming and airborne laser scanning to generate forest management units

    2022-02-26 10:15:14AdriPascualndorth
    Journal of Forestry Research 2022年1期

    Adrián Pascual · Sándor F.Tóth

    Abstract Airborne laser scanning (ALS) has been widely applied to estimate tree and forest attributes, but it can also drive the segmentation of forest areas.Clustering algorithms are the dominant technique in segmentation but spatial optimization using exact methods remains untested.This study presents a novel approach to segmentation based on mixed integer programming to create forest management units (FMUs).This investigation focuses on using raster information derived from ALS surveys.Two mainstream clustering algorithms were compared to the new MIP formula that simultaneously accounts for area and adjacency restrictions, FMUs size and homogeneity in terms of vegetation height.The optimal problem solution was found when using less than 150 cells, showing the problem formulation is solvable.The results for MIP were better than for the clustering algorithms; FMUs were more compact based on the intravariation of canopy height and the variability in size was lower.The MIP model allows the user to strictly control the size of FMUs, which is not possible in heuristic optimization and in the clustering algorithms tested.The definition of forest management units based on remote sensing data is an important operation and our study pioneers the use of MIP ALS-based optimal segmentation.

    Keywords Segmentation · Precision forestry · Optimization · Mathematical programming · Airborne laser scanning

    Abbreviations

    ALS Airborne laser scanning

    3D Three dimensional

    CHM Canopy height model

    DTM Digital terrain model

    FMUs Forest management units

    GEOBIA Geospatial object-based image analysis

    GIS Geographic information systems

    LiDAR Light detection and ranging

    OF Objective function

    MIP Mixed integer programming

    Introduction

    The integration of remote sensing (RS) data has expanded the frontiers of large-scale mapping projects (White et al.2016).Laser scanning, in particular, has become a popular tool due to the capability of Light Detection and Ranging (LiDAR) to precisely describe the three-dimensional (3D) structure of forests (Wehr and Lohr 1999; Hyypp? et al.2008).The statistics computed from LiDAR data are used to assess forest ecosystems (N?sset et al.2004; Wulder et al.2012).The outputs of LiDAR-assisted forest inventory usually include wall-to-wall estimates of tree height in raster format and canopy height models (CHM).These layers are useful to aggregate forest stands of similar characteristics (Mustonen et al.2008; Chen and Hay 2011; Pukkala 2020).The term forest management unit (FMU) refers to a homogeneous forest area of similar bio-physical characteristics that can be managed as a unit.Decision models such as harvestscheduling are formulated based on these as spatial decision units (McDill et al.2016).The definition of FMUs is very important in forest planning as they represent the calculation units on which to implement planning decisions covering long-term intervals (Pukkala 2019a).The boundaries of FMUs have been traditionally considered as fixed in time, rather than dynamic.The traditional approach of permanent FMU delineations might, in some cases, be replaced by methods that allow dynamic boundaries subject to evolving management objectives (Pascual 2018).The widespread use of LiDAR to collect input data can help with the automation of these new algorithms (Kangas et al.2018; Goodbody et al.2019).The tactical delineation of harvest units within the boundaries of more permanent FMUs would benefit, in particular, from dynamic boundary generation methods.Using ALS data can better meet those demand constraints for various forest products subject to operational constraints.

    The use of high-resolution outputs from LiDAR-assisted forest inventory has induced the development of clustering algorithms to delineate homogeneous forest stands for the purpose of management (Lucieer and Stein 2005; Maxwell et al.2018; Stereńczak et al.2018).The underlying algorithmic process is also known as “segmentation” (Koch et al.2009; R?s?nen et al.2013; Olofsson and Holmgren 2014).The goal of segmentation has typically been to maximize the homogeneity of forest attributes and RS statistics within the FMUs.Delineating FMUs with minimum canopy height variance is not a trivial exercise, and yet it is a very important goal of segmentation because each FMU must be manageable on the ground as a unit (Saremi et al.2014; Pascual 2018).With the integration of LiDAR-and imagery-assisted methods, researchers can boost the detection of spatial discontinuities (Pascual et al.2019; Ordway and Asner 2020).The mainstream method to conduct segmentation and generate FMUs is to use clustering algorithms under geospatial object-based image analysis (GEOBIA), which provides fast results in large-scale mapping applications (Blaschke 2010).The spatial, spectral and textural properties of the segments can be controlled under GEOBIA options, although the clustering does not allow the user to specifically control the number of segments to be produced (Blaschke 2010; Liu and Xia 2010).Some widely used algorithms, such as mean-shift segmentation (MSS), restrict the simultaneous control of the number of desired FMUs and their size (Michel et al.2015).As a result, segmentation is hardly a one-time operation, as some degree of after-math is frequently required to increase the size of segments to the targeted value for FMUs by merging or removing segments below a certain area threshold (Hay et al.2005; Koch et al.2009).Despite these limitations, GEOBIA solutions are widely implemented on geographical information systems (GIS) such as the outstanding commercial grade eCognition software (Trimble, Sunnyvale, CA, USA), for which open sourced alternative solutions exist (Gon?alves et al.2019).Clustering rules differ to the principles of spatial optimization methods oriented to find an optimal solution within the feasible region defined by spatial constraints (R?nnqvist et al.2015).The benefit of viewing segmentation as a spatial optimization problem, rather than as a series of weighted clustering rules, motivated this study.

    The conceptualization of segmentation as a spatially explicit mathematical formulation has been recently addressed in forest optimization (Pukkala 2019a, b).The examples cited used heuristics to tackle complex combinatorial problems using many thousands of raster cells.Heuristics require parametrization to avoid underperforming, which is difficult to measure in the absence of a global incumbent solution acting as best bound (Bettinger and Boston 2017).However, neither the size nor the number of FMUs can be strictly controlled during the search (Pukkala 2019a, b).As a proxy, the user can balance the weights that rule the clustering to increase the average size of the resulting FMUs (Pascual 2018).Heuristics can rapidly process thousands of cells (?hman and Eriksson 2010).One alternative to heuristics is to use methods based on exact solutions such as mixed integer programming (MIP).

    The decision for using MIP over GEOBIA and heuristics might be appropriate at the operational planning level, for which the array of cells could comprise some hundreds of units (Mustonen et al.2008; R?s?nen et al.2013).Rapid improvement in computing power has made exact optimization techniques such as MIP an increasingly attractive choice for segmentation tasks.This research evaluates the tradeoffs using MIP over solutions based on clustering rules or heuristic optimization as carried out in other research areas (Sa?lam et al.2006).This research presents a new MIP optimization model to create FMUs using airborne LiDAR data.The model accounts for the intra-height variation of raster cells within a given FMU while controlling the mean height difference between adjacent FMUs.The size of FMUs is also controlled, which is a major contribution when compared to clustering algorithms and heuristics.This is just one of many formulations that are possible with our proposed MIP approach.For example, one could maximize the difference in mean canopy heights between adjacent units or use other silvicultural attributes as the basis of stand homogeneity within individual units.This flexibility is one of the reasons why our proposed mathematical optimization framework for segmentation should appeal to the forestry remote sensing community.

    This study expands the frontiers of MIP spatial optimization towards stand delineation.We start by formally introducing our proposed mixed integer programming model.For demonstration purposes, this model was formulated to generate a pre-defined number of management units; (1) whose areas are roughly the same (+/-20%); (2) they are as compact as possible in terms of perimeterarea ratios; and, (3) the canopy height variation within each unit is kept to a minimum.The formal, mathematical formulation of the MIP is followed by a case study using ALS data from Spain to illustrate how the model works relative to existing benchmarks such as K-means or meanshift segmentation algorithm (MSS) under GEOBIA.We found that the performance of MIP is superior to these benchmarks with regards to controlling the size and shape of management units, as well as keeping canopy height variations within the units below a predefined maximum.

    Methods

    Model formulation

    The proposed segmentation model is cast as a mixed 0-1 integer program.The mathematical notation is introduced first to provide a convenient section of reference for all components of the model.This section is divided into four parts.Using set notation, the model parameters are first defined accompanied by an explanation as to how they were acquired and/or estimated for the purpose of this study.The definition of decision variables is next.These are the variables whose values our model seeks to optimize.These are followed by the accounting variables, created for convenience so that certain attributes of the forest that result from the various values that the decision variables take in the model can be controlled by the user.A third class of variables, termed auxiliary variables, is used to linearize cross-product terms that would render the model non-linear and otherwise computationally intractable.Although these linearization techniques are standard routines in integer programming, we explain below how they work in detail.The model itself is presented in the form of an objective function that minimizes the total perimeter of the FMUs to control their shape, along with a set of inequalities that represent the constraints the user wishes to impose on segmentation, such the number of FMUs to be generated.The mathematical domains of the variables are defined as the last part of the model formulation.Finally, a detailed explanation is provided of the objective function as well as the constraints.

    Parameters

    C=set of raster cells indexed byc; set C represents the grid cells of a canopy height model (CHM) derived from ALS surveys.For computational testing, we used 144 cells;

    S=set of FMUs indexed bys; 5 FMUs will be generated to have an average unit size that is manageable on the ground;

    E=set of adjacent cells indexed byij; ESRI ArcMap’s Polygon Neighbors tool (ESRI Inc.2017) was used to derive 506 pairwise adjacencies;

    hc=height of cellccomputed as the 95th height percentile of ALS echoes ranging within cellc;

    ac=area of cellc; 144 cells each 1,600 m2was used;

    pc=perimeter of cellcwhich was 160 m (40 m edge);

    dmax=maximum allowable deviation from the mean heigh in each FMU for all cells in the FMU; 4 m for dmaxwas used.

    Decision variables

    xcs=1 if raster cellcis assigned to FMUs, 0 otherwise.

    Accounting variables

    as=the area of FMUs computed as the sum of all raster cellscassigned to FMUs,

    ps=the perimeter of FMUscomputed as the sum of perimeters of all cells assigned to FMUsminus the sum of common boundary lengths between adjacent cells times two,

    dcs=the height deviation of cellc(assigned to FMUs) from the mean height of FMUs.With parameter dmax, one can set a limit on dcsand thus control the variability of canopy height within each FMU.

    Auxiliary variables for linearization

    Model formulation

    The objective function (Eq.1) minimizes the perimeters all FMUs.The purpose of this function is to keep the shape of the FMUs compacted rather than elongated for operational convenience.Eq.2) calculates the area of FMUs based on the number, and area of cells assigned to it.It also stores the areas of the FMUs in variable as.The pair of inequalities (3) (Eq.3) constrains the areas of the FMUs to be within +/-20% of each other.In the case study that follows, the computational performance of the model was tested with different levels of area variations: +/-10%, 20%, 30% and 40%.Eq.4 calculates the total perimeter of all FMUs by taking the perimeter of all cells, each with a perimeter of 4 m, minus the total length of shared boundaries between adjacent cells that are assigned to the same FMU.The cross-product term, xcsxjsin Eq.4 needs to be linearized to keep the model computationally tractable.In order to do so, we substituted xcsxcjwith a binary indicator variablethat turns on if both cellscandjare assigned to FMUs, i.e., xcs=xjs=1 .Otherwise,=0 .This is done by introducing the following pair of inequalities (11):

    Eq.5 calculates the average height of all cells assigned to each of the FMUs.The cross-product between continuous variableand the binary xcsis linearized using the following set of three inequalities (12) that enforce the substitution ωcs=.

    TheMconstant was set to 50 m to act as an upper boundary on average canopy height.When xcs=1 , the last inequality reduces to, forces ωcs=≤ωcswhich, together with ωcs≤.If, on the other hand xcs=0 , the first inequality in Eq.12 forces ωcs=0 , which completes the desired substitution.

    Inequalities Eq.6 compute the height difference dcsbetween hc(canopy height in cellc) and the average canopy height of FMUs.When xcs=0 , these inequalities reduce to 0 ≤dcs, which means that the height deviation of Cellcfrom the mean height of FMUsis excluded from accounting when Cellcis not assigned to FMUs.Otherwise, when xcs=1 , then≤dcs, which in turn forces |||hc--hc≤dcsand hc-|||≤dcs.This, in conjunction with Constraint Eq.7, ensures that height deviations within each FMU cannot exceed the FMU’s mean canopy height by more than dmax=4m .Constraint Eq.7 forces the maximum allowed height deviation to be less than or equal to threhold dmax, which we set to 4 m.Working in concert with the objective function (1), Constraint Eq.8 requires that all raster cellscin setCare assigned to one and only to one FMU.Lastly, constraints Eqs.9 and 10 declare the decison variables as binary and the accounting variables as positive real.

    Pilot study area

    A forest patch within a Mediterranean pine forest in central Spain was selected to illustrate the model (Fig.1).The main species of the mixed forest arePinus pinasterAit.andPinus sylvestrisL.Forest management in the area targets sustained yield production using area-based regulation methods with rotation periods between 100 and 120 years, and planning intervals of 10-20 years for tactical planning.The limits of the FMUs defined in the first forest plans have been preserved since manual delineation was carried out using aerial images and field observations.The use of novel and dynamic methods to upgrade and update FMUs are of the highest interests to forest managers.The selected 23.0 ha area showed variability in terms of the spatial distribution of trees, presence of gaps and the balance between young versus mature forest patches.For a broader overview of the study area, see the ground data used in Pascual et al.(2018), although in this study only airborne LiDAR data was used.The ALS surveys were collected in April 2010 using the Leica ALS60 II model.The study area was scanned from an altitude of 1200 m above ground using a Leica ALS60 II sensor.The scanning angle of 12° resulted in a 26-cm footprint.The filtering algorithm from Axelsson (2000) was used to classify ALS echoes for generating the digital terrain model (DTM) from which the canopy height model (CHM) is derived by subtracting DTM elevations from ALS echoes classified as first returns.The original resolution for both the DTM and the CHM was 1-m2cell size, which was later upscaled to 40 m for the CHM, corresponding to 144 raster cells to cover the training area.

    Spatial adjacencies and problem dimension

    Raster grid cells were converted into vectorial polygons to compute the ALS statistics corresponding to the echoes within the extension of each CHM raster cell (Fig.1).In ALS-based forest inventory, height-based statistics and density metrics are calculated to approximate forest attributes using estimation models (N?sset et al.2004; Magnussen et al.2010).For instance,H95is the 95th height percentile of the ALS echoes distributed within the extension of the grid cell.The close relationship betweenH95and dominant height has been widely documented (N?sset et al.2004; White et al.2016), and therefore we usedH95as the ALS statistic for the model coefficients.The formulation of the MIP optimization problem requires the relative position of all cell polygons and the adjacency relationships.The pairwise adjacencies were calculated considering two cells are adjacent when sharing an edge.

    Fig.1 Overview of the laser coverage in the region for the 2010 campaign; the canopy height model (CHM, m) is mapped on a grayscale while the testing site is in color.The 40-m grid-cell map and the CHM histogram are also presented

    The MIP problem was resolved four times, considering the area fluctuation between FMUs ranging from 10% to 40%.The problem instances were read and solved with the IBM ILOG CPLEX 12.9 (64 bit) on 12 threads on an i7-4790 Intel CPU (3.60 GHz) machine with 20 GB of RAM and a 64-bit Windows 10 Pro.The problem comprised a total of 3496 variables (1456 non-negative and 2040 binary) and 7141 constraints.The rules to accept optimization results were either to consider the incumbent solution to the problem (optimality gap of 0%) or the best bound achieved for a time-limit of two hours.The specified time limit is feasible for operational planning but substantially greater than what is required using GEOBIA-based clustering.The performance of MIP optimization was benchmarked against two mainstream methods relying on clustering.

    Segmentation using clustering algorithms

    The array of possibilities to conduct clustering includes the K-means algorithm (Jain 2010), versions of the region growing approach (Lucieer and Stein 2005), or the robust MSS (Michel et al.2015).Ease of implementation, simplicity, efficiency, and empirical success are still the main reasons for the popularity of the K-means, whose goal is to partition features to conform groups of similar feature properties.The math formulation can be found in Jain (2010): (1) the algorithm first identifies seed features used to grow each group, for which the user declares the preferred number; (2) the first seed is selected randomly but the selection of the remaining seeds is based on weighting rules that favor the selection of subsequent seeds farthest in space from the existing set of seed features.The user needs only to specify the number of clusters (five for this study).A different approach is to segment an area by controlling the textural, spatial and compactness of the resulting segments, as happens with MSS.

    MSS is a non-parametric estimator framed on featurespace analysis.The gradient ascent method discovers local maximums that progressively increase to be used as nexus to create spatial clusters (Cheng 1995).When applied to imagery, feature spectral differences and their proximity drives the segmentation.Another parameter is usually necessary during segmentation: the feature minimum size, which is the minimum number of, e.g., raster cells, to compose an individual feature.MSS does not allow to explicitly control the number of FMUs as happens with the K-means algorithm because the number depends on: (1) the weights assigned to spectral and spatial components; (2) the threshold for feature minimum size; and, (3) the extension of the area to segment.The parameters of the MSS algorithm (i.e., the spectral and spatial attributes, plus the minimum size allowed for a segment) were iteratively tuned to produce five FMUs.The values for the spectral and spatial ranged from 1 to 20 as coded in the algorithm ArcMap implementation (ESRI Inc.2017).Equal weights (10) were assigned.High values for the spectral help to distinguish objects with similar spectral attributes, while high values for the spatial boost the resolution goodness of the segments.

    Results

    Mixed integer programming

    The progress of the optimizations under the novel MIP formula were first assessed by attending to their completion.The results showed that solving the problem is feasible but the computation time was insufficient to obtain a gap in optimality below 15%.The results for the MIP problem were assessed by considering the increment in parametera; allowing area variation from 10% to 40% had no impact on the homogeneity of FMUs in terms of height but it did allow more variability in their size (Fig.2).At the same time, the maximum deviation between FMUs mean heights and the maximum height for a cell inside a given stand progressively decreased with increasing value ofa(Table 1).The spatial arrangement of cell assignments was visually displayed to assess clustering and to identify multi-part FMUs.The presence of several multipartitioned and dis-jointed FMU was observed in all scenarios tested (Fig.3).

    Fig.2 Size of FMUs using a=10%

    Fig.3 Spatial layout of cell assignments to the five FMUs by increasing the value of a: a 10%, b 20%, c 30%, and d 40%

    Table 1 Statistics of FMUs created with the optimization problem; variance and standard deviation (Std), maximum deviation between maximum cell height and the mean height of the given FMU are presented

    Benchmarking MIP solutions and clustering algorithms

    The standard deviation of cell heights within stands showed the MIP as the most efficient approach to minimize height variations within FMU boundaries.The mean heights for the set of five FMUs were also compared among the three methods.The results showed the K-means as creating the most balanced mosaic of FMUs (Fig.4).High inter-FMU variability and low intra-FMU height variability are the objectives of segmentation.The results for the K-means and MSS showed great disparity on FMU mean size compared to the MIP showcase (Fig.5).The performance of both algorithms succeeded in producing single-part and compact FMUs.However, the spatial layout of the FMUs was uneven, especially for the K-means algorithm.

    Fig.4 Standard deviation of cell heights within the set of five FMUs a and standard deviation of the five mean heights b; the results are for the K-means algorithm, the novel MIP problem and the meanshift segmentation (MSS)

    Fig.5 Distribution of FMU size and segmentation map using the K-means algorithm (a and b), and the mean-shift segmentation algorithm (c and d)

    Discussion

    The goal of the new formula tackles an important step in forest management planning: the generation of forest management units on which to implement decisions.The boundaries of FMUs, sometimes called stands, are usually respected in long-term planning but when it comes to operational planning, there is a real need to provide precise units to manage forest assets by maximizing opportunities remote sensing brings.The formula developed acknowledges the intra-variation of canopy heights within the units, a major improvement compared to alternative options on heuristic optimization (Pukkala 2019a, b).The MIP formulation accounted for segmentation principles (Koch et al.2009; R?s?nen et al.2013), intra-group homogeneity and inter-group heterogeneity expressed in above-ground height.It allows the user to simultaneously control the minimum and maximum size of FMUs while maximizing the goodness of the units.The clustering algorithms tested were performed poorer than the MIP formula at producing homogenous FMUs in terms of height, although clustering algorithms mostly ensured single-part units as outcomes.The goodness of clustering was substantially better for clustering algorithms compared toMIP optimization, which might perform better with more computing time.

    A main outcome of this study is that the formulation works and the problem is solvable.We showed how to make use of linearization procedures to tackle relevant non-linear relationships between the equations needed in the model system.The comparison might even look better for the MIP, considering that the optimality gap between 15-20% was achieved with the computer resources used and in the time of two hours to complete the search.Arguably, the time limit was not enough to address the combinatorial problem for the more complex problems, but the aim was to compare all the MIP optimizations in the same conditions.With the increasing availability of super-computation resources, the optimality gap can decrease rapidly without delaying optimization runs beyond reasonable limits for operational forest planning.The results showed the impact, and consequences, of optimality, as FMUs after the MIP search were not spatiallycontinuous (dis-jointed).In simple terms, a given FMU could consist of more than one multi-partitioned units, if the optimization turns incomplete as shown.Once the MIP formulation is proved to be feasible, the forest manager must decide to devote more time to optimize and reduce the optimality gap, or to accept less efficient but faster solutions.

    The risk of accepting solutions remote from the incumbent might not be a problem when for instance, both Model I and Model II formulation for the harvest-scheduling are followed (McDill et al.2016).There might be no penalty using better FMUs generated with the MIP rather than through heuristics or clustering algorithms, despite the units being multi-partitioned.The restrictions might come from forest legislation due to the definition of FMUs, which varies between countries (R?nnqvist et al.2015).It is noteworthy that clustering algorithms might not always avoid the multipart problem as observed in preliminary tests using MSS with a larger dataset of cells (Fig.6).

    Fig.6 Spatial layout of FMUs using the mean-shift algorithm with 2304 cells a in the training site and b over a nearby forest patch of the same dimension

    Neighboring settings are also an important consideration when framing MIP problems and spatial problems in general dealing with adjacencies.Are two cells sharing a corner as neighbors as when sharing an edge? In this investigation, adjacency was restricted by considering only edges.The choice could have promoted the compactness of the generated FMUs for the MIP more than for the MSS for instance.The development of the MIP formula was simplified using squared cells-the format of a raster.But if would be interesting to further explore the formulation by adding a set of constraints to make the transition boundary between stands as clear as possible.

    Imagine one cellaassigned to FMUiand cellbassigned to FMUj.Ifaandbare adjacent but belong to different FMUs, it would be useful to maximize the difference in height between those cells so that the division line between the two FMUs is easy to detect and paves the way to better recognition in the field.The conceptualization of the improved problem formulation will be the core of an additional investigation using nano-segments as input units, together with raster cells from LiDAR data.The use of nano-segments is promising (Heinonen et al.2018), and thedeveloped formula could follow a first clustering to group raster cells into nano-segments of irregular shape (Pascual 2018).Moreover, the level of patchiness could be integrated in the problem formulation as suggested by Pukkala (2019b).In this study, the solutions were benchmarked based on the AP ratio, which was not, as such, the driver of the optimization process.Simple but meaningful statistics on patchiness could be tested in further development of the problem formulation (San-Miguel et al.2020).

    The use of LiDAR to derive canopy height models of forest ecosystems adds value to the development of new methods to generate forest management units.The developed formulation based on the MIP only requires canopy height models (CHM) and adjacency relationships to generate a set of FMUs.The information from the CHM reflects the vertical and horizontal distribution of the forest only from the raw ALS point cloud.To segment on the basis of model predictions for forest attributes somehow bias the homogeneity by adding an error in model prediction (Pukkala 2020).Model error might be assumable for dominant heights but perhaps not when using model predictions of basal area of volume to generate FMUs (Pascual 2018).

    The timing of this study is suitable in the light of recent advances in satellite missions.For instance, the NASA’s GEDI mission has released LiDAR data worldwide since 2019, including vegetation statistics of height at a spatial resolution of 25 m (Dubayah et al.2020; Duncanson et al.2020).Therefore, there is good momentum to advance further integration of laser data into operational forest planning (Pascual 2018; Stereńczak et al.2018; Packalen et al.2020).

    Conclusion

    The definition of forest management units is an important decision on which MIP (mixed integer programming) optimization can make a difference.The research showed how to use MIP optimization to perform the delineation of management units.The description of the problem and the linearization of non-linear constraints is a good baseline to be upscaled to larger problems.Once the MIP model has shown to be valid, the selection of MIP over clustering rules is a matter of balancing time, spatial scales, and the desired quality of the delineation.The MIP formulation can be improved when it accounts for edge effects and the integration of irregular-shape units as calculation units.

    AcknowledgementsThe authors thank the University of Eastern Finland and the University of Washington for financial, technical, and scientific support during the first stages of the research.The study also benefited from the research exchange platform provided by the SuFo-Run project (Marie Sklodowska-Curie Grant Agreement No.691149).The first author (I.P.in the scope of Norma Transitória-DL57/2016/CP5151903067/CT4151900586) was supported by Funda??o para a Ciência e a Tecnologia through the MODFIRE project-A multiple criteria approach to integrate wildfire behavior in forest management planning (PCIF/MOS/0217/2017).

    国产乱来视频区| 国产一区二区亚洲精品在线观看| 成人高潮视频无遮挡免费网站| 亚洲精品成人av观看孕妇| 亚洲av福利一区| 国产精品一区二区性色av| 欧美97在线视频| 91久久精品电影网| 又黄又爽又刺激的免费视频.| 婷婷色综合www| 免费电影在线观看免费观看| 永久网站在线| 久久这里有精品视频免费| 男人爽女人下面视频在线观看| 日韩av免费高清视频| 日本与韩国留学比较| 国产成人精品福利久久| 新久久久久国产一级毛片| 麻豆成人午夜福利视频| 亚洲精品国产色婷婷电影| 国产亚洲一区二区精品| 成人特级av手机在线观看| 国产精品国产三级专区第一集| 不卡视频在线观看欧美| 亚洲不卡免费看| 大香蕉97超碰在线| 欧美国产精品一级二级三级 | 少妇人妻久久综合中文| 日本免费在线观看一区| 人人妻人人看人人澡| 国产精品国产三级国产专区5o| 亚洲欧美日韩卡通动漫| 国产亚洲91精品色在线| 精品人妻视频免费看| 亚洲欧美精品自产自拍| 看黄色毛片网站| 99久久人妻综合| 久久精品夜色国产| 国模一区二区三区四区视频| 国产av不卡久久| 精品人妻视频免费看| 免费观看在线日韩| 色5月婷婷丁香| 内地一区二区视频在线| 色婷婷久久久亚洲欧美| 丝袜美腿在线中文| 久久久国产一区二区| 国产真实伦视频高清在线观看| 欧美区成人在线视频| 看黄色毛片网站| 又爽又黄a免费视频| 午夜激情福利司机影院| 亚洲国产色片| 成年人午夜在线观看视频| videossex国产| 丰满乱子伦码专区| 一区二区av电影网| 国产真实伦视频高清在线观看| 欧美区成人在线视频| 亚洲人成网站在线观看播放| 内地一区二区视频在线| 亚洲精品成人av观看孕妇| 性插视频无遮挡在线免费观看| 欧美少妇被猛烈插入视频| 九九久久精品国产亚洲av麻豆| 边亲边吃奶的免费视频| 国产白丝娇喘喷水9色精品| 黄色欧美视频在线观看| 蜜桃久久精品国产亚洲av| 午夜福利视频1000在线观看| 午夜亚洲福利在线播放| 一边亲一边摸免费视频| 美女主播在线视频| 91午夜精品亚洲一区二区三区| 高清午夜精品一区二区三区| 高清视频免费观看一区二区| 国产成人精品一,二区| 亚洲精品国产av蜜桃| 青春草国产在线视频| 久久精品久久精品一区二区三区| 97在线视频观看| 日韩av不卡免费在线播放| 一级毛片黄色毛片免费观看视频| 精品少妇黑人巨大在线播放| 国产日韩欧美亚洲二区| 日韩 亚洲 欧美在线| 最近手机中文字幕大全| 日本av手机在线免费观看| 一级片'在线观看视频| 国产一区二区在线观看日韩| av网站免费在线观看视频| 国产爽快片一区二区三区| 国产精品久久久久久av不卡| 色视频在线一区二区三区| 久久精品综合一区二区三区| 少妇人妻 视频| 91aial.com中文字幕在线观看| 国产 一区精品| 永久网站在线| 欧美激情国产日韩精品一区| 亚洲在线观看片| 男人狂女人下面高潮的视频| 又爽又黄无遮挡网站| 97精品久久久久久久久久精品| videossex国产| 综合色丁香网| 国产亚洲最大av| 久久久久久久午夜电影| 一级片'在线观看视频| 丰满人妻一区二区三区视频av| 日韩不卡一区二区三区视频在线| 男女边摸边吃奶| 天堂中文最新版在线下载 | 人人妻人人澡人人爽人人夜夜| 欧美激情国产日韩精品一区| 另类亚洲欧美激情| 夜夜爽夜夜爽视频| 国产乱人偷精品视频| 欧美3d第一页| 色婷婷久久久亚洲欧美| 国产黄片视频在线免费观看| 听说在线观看完整版免费高清| 亚洲av成人精品一二三区| 蜜臀久久99精品久久宅男| a级一级毛片免费在线观看| 欧美3d第一页| 国产精品精品国产色婷婷| 男女国产视频网站| 少妇的逼好多水| 黑人高潮一二区| 国产精品一及| 精品久久久久久久久亚洲| 在线观看av片永久免费下载| 日本黄大片高清| 欧美xxⅹ黑人| 纵有疾风起免费观看全集完整版| 免费观看在线日韩| 国产av码专区亚洲av| .国产精品久久| 看免费成人av毛片| 日韩成人伦理影院| 熟女av电影| 日本熟妇午夜| 色5月婷婷丁香| 身体一侧抽搐| 哪个播放器可以免费观看大片| 久久热精品热| 2021天堂中文幕一二区在线观| freevideosex欧美| 男女啪啪激烈高潮av片| 中文字幕av成人在线电影| 精品熟女少妇av免费看| 国产成人精品久久久久久| 永久免费av网站大全| 纵有疾风起免费观看全集完整版| 久久热精品热| 亚洲精品自拍成人| 汤姆久久久久久久影院中文字幕| 国产黄色免费在线视频| 亚洲一区二区三区欧美精品 | 99九九线精品视频在线观看视频| 嫩草影院精品99| 男女国产视频网站| 成人漫画全彩无遮挡| 亚洲av一区综合| 在线观看国产h片| 少妇裸体淫交视频免费看高清| 一级毛片久久久久久久久女| 国产精品精品国产色婷婷| 国产亚洲最大av| 舔av片在线| 在线观看美女被高潮喷水网站| 天美传媒精品一区二区| 91久久精品国产一区二区成人| 最近中文字幕高清免费大全6| 一区二区三区四区激情视频| 日韩免费高清中文字幕av| 在线 av 中文字幕| 国产亚洲av片在线观看秒播厂| 成人高潮视频无遮挡免费网站| 白带黄色成豆腐渣| 制服丝袜香蕉在线| 欧美精品一区二区大全| 2021天堂中文幕一二区在线观| 亚洲伊人久久精品综合| 日本av手机在线免费观看| 秋霞在线观看毛片| 国产在线男女| 欧美三级亚洲精品| 成年av动漫网址| 国产成人精品一,二区| 国产毛片a区久久久久| 熟女电影av网| 国产亚洲5aaaaa淫片| 亚洲av免费在线观看| 欧美性感艳星| 18禁裸乳无遮挡免费网站照片| 如何舔出高潮| 精品一区二区三卡| 内射极品少妇av片p| 边亲边吃奶的免费视频| 美女主播在线视频| 高清av免费在线| 91精品伊人久久大香线蕉| 亚洲欧美中文字幕日韩二区| 亚洲久久久久久中文字幕| av专区在线播放| 免费av不卡在线播放| 精品人妻视频免费看| 国产精品三级大全| 亚洲,一卡二卡三卡| 精品一区二区三区视频在线| 啦啦啦啦在线视频资源| 久久久久久久久久久丰满| 日韩一区二区视频免费看| 人人妻人人澡人人爽人人夜夜| 大话2 男鬼变身卡| 97人妻精品一区二区三区麻豆| 国产成人免费观看mmmm| 91久久精品国产一区二区三区| 亚洲,一卡二卡三卡| 热99国产精品久久久久久7| 晚上一个人看的免费电影| 久久这里有精品视频免费| 精品国产露脸久久av麻豆| 日产精品乱码卡一卡2卡三| 国产欧美另类精品又又久久亚洲欧美| 国产综合精华液| 91久久精品国产一区二区成人| 王馨瑶露胸无遮挡在线观看| 国产亚洲精品久久久com| 久久久久国产精品人妻一区二区| 久热久热在线精品观看| 精品人妻一区二区三区麻豆| 久久精品熟女亚洲av麻豆精品| 欧美激情国产日韩精品一区| 国产毛片a区久久久久| 欧美xxⅹ黑人| 午夜日本视频在线| 日韩伦理黄色片| 国产成年人精品一区二区| 亚洲精品国产成人久久av| 成人漫画全彩无遮挡| 日本一二三区视频观看| 色视频www国产| 免费少妇av软件| 中国美白少妇内射xxxbb| 免费看不卡的av| 岛国毛片在线播放| 成年女人看的毛片在线观看| 亚洲激情五月婷婷啪啪| 亚洲av成人精品一二三区| 日本爱情动作片www.在线观看| 国产淫片久久久久久久久| 新久久久久国产一级毛片| 人人妻人人看人人澡| 十八禁网站网址无遮挡 | 成人黄色视频免费在线看| 久久久成人免费电影| 国产亚洲91精品色在线| 久久99热这里只频精品6学生| 国模一区二区三区四区视频| 黄色视频在线播放观看不卡| a级毛色黄片| 高清在线视频一区二区三区| 国产在线男女| 99re6热这里在线精品视频| 亚洲欧美精品自产自拍| 日韩欧美精品v在线| 五月玫瑰六月丁香| 69人妻影院| 亚洲成人久久爱视频| 亚洲不卡免费看| 免费看不卡的av| 午夜福利在线观看免费完整高清在| 日日啪夜夜撸| 色吧在线观看| 嫩草影院精品99| 日本一二三区视频观看| 亚洲成人一二三区av| 国产 一区 欧美 日韩| 久久久欧美国产精品| 99视频精品全部免费 在线| 午夜福利在线在线| 日韩大片免费观看网站| 少妇裸体淫交视频免费看高清| 色婷婷久久久亚洲欧美| 中文字幕亚洲精品专区| 久久精品熟女亚洲av麻豆精品| 色综合色国产| 日韩av不卡免费在线播放| www.色视频.com| 国产精品女同一区二区软件| 精品一区二区三区视频在线| 国产综合懂色| 永久免费av网站大全| 中国国产av一级| 男人和女人高潮做爰伦理| 熟妇人妻不卡中文字幕| a级一级毛片免费在线观看| 欧美3d第一页| 一个人看视频在线观看www免费| 波野结衣二区三区在线| 性插视频无遮挡在线免费观看| 干丝袜人妻中文字幕| 日韩在线高清观看一区二区三区| 在线看a的网站| 在线观看三级黄色| 在线观看免费高清a一片| 国产乱来视频区| 大又大粗又爽又黄少妇毛片口| 国产老妇女一区| 亚洲熟女精品中文字幕| 亚洲婷婷狠狠爱综合网| 亚洲成人一二三区av| 日韩欧美一区视频在线观看 | 激情五月婷婷亚洲| 国产淫片久久久久久久久| 亚洲图色成人| 女人久久www免费人成看片| 少妇人妻一区二区三区视频| 在线观看国产h片| 成人亚洲精品av一区二区| 国产白丝娇喘喷水9色精品| 中文欧美无线码| a级毛片免费高清观看在线播放| 亚洲最大成人手机在线| 亚洲人成网站在线播| 日韩国内少妇激情av| 久久久午夜欧美精品| 丝袜美腿在线中文| 久久久久性生活片| 中文字幕久久专区| 国产精品一区二区在线观看99| 汤姆久久久久久久影院中文字幕| 欧美日韩视频高清一区二区三区二| 少妇 在线观看| 人妻 亚洲 视频| 最近中文字幕2019免费版| 久久精品国产自在天天线| 美女xxoo啪啪120秒动态图| 亚洲久久久久久中文字幕| 国产精品99久久久久久久久| 亚洲精品视频女| 国产黄a三级三级三级人| 午夜福利视频1000在线观看| 中文字幕人妻熟人妻熟丝袜美| 亚洲av二区三区四区| 成人国产麻豆网| 色播亚洲综合网| 国产爽快片一区二区三区| 久久精品国产亚洲av涩爱| 黄片wwwwww| 卡戴珊不雅视频在线播放| 久久久久久久大尺度免费视频| 欧美激情国产日韩精品一区| 国产一区二区三区av在线| 男男h啪啪无遮挡| 青春草视频在线免费观看| 自拍偷自拍亚洲精品老妇| 各种免费的搞黄视频| 国产在视频线精品| 国产一区有黄有色的免费视频| 日韩欧美精品免费久久| 中文字幕免费在线视频6| 一个人看视频在线观看www免费| 国产极品天堂在线| 91久久精品国产一区二区三区| 超碰97精品在线观看| 欧美激情久久久久久爽电影| 久久久成人免费电影| 亚洲综合精品二区| 亚洲人成网站在线播| 色综合色国产| 精品一区二区免费观看| 午夜福利视频1000在线观看| 韩国高清视频一区二区三区| 看免费成人av毛片| 26uuu在线亚洲综合色| av卡一久久| 国产综合懂色| 身体一侧抽搐| 一级毛片电影观看| 久久精品国产亚洲网站| 永久网站在线| 免费观看无遮挡的男女| 小蜜桃在线观看免费完整版高清| 亚州av有码| 国产精品久久久久久精品古装| 男人舔奶头视频| 欧美日韩国产mv在线观看视频 | 国产高清三级在线| 亚洲成人中文字幕在线播放| 国产淫片久久久久久久久| 99久久精品一区二区三区| 日韩伦理黄色片| 五月天丁香电影| 伊人久久精品亚洲午夜| av免费在线看不卡| 国产亚洲一区二区精品| 日本-黄色视频高清免费观看| 青青草视频在线视频观看| 别揉我奶头 嗯啊视频| 男女边摸边吃奶| 午夜福利视频精品| 亚洲人成网站在线观看播放| 3wmmmm亚洲av在线观看| 国产亚洲精品久久久com| kizo精华| 国产精品秋霞免费鲁丝片| 黄色视频在线播放观看不卡| 国产精品一区二区三区四区免费观看| 麻豆国产97在线/欧美| 欧美成人午夜免费资源| 亚洲欧美一区二区三区黑人 | 国产男女超爽视频在线观看| 欧美少妇被猛烈插入视频| 欧美高清性xxxxhd video| 午夜福利高清视频| 国产成人a∨麻豆精品| 国产精品国产av在线观看| 最近最新中文字幕免费大全7| 亚洲成人一二三区av| 天堂中文最新版在线下载 | 一级黄片播放器| 精品国产露脸久久av麻豆| 97在线视频观看| 亚洲久久久久久中文字幕| 国产乱人视频| 大片免费播放器 马上看| 亚洲精品一二三| 日日撸夜夜添| 日韩一区二区三区影片| 全区人妻精品视频| 国产高清有码在线观看视频| 干丝袜人妻中文字幕| 日本黄大片高清| 亚洲,一卡二卡三卡| 黄色欧美视频在线观看| 亚洲欧洲国产日韩| 亚洲人与动物交配视频| 波野结衣二区三区在线| 亚洲av电影在线观看一区二区三区 | 99久久人妻综合| 日日啪夜夜撸| 国产精品嫩草影院av在线观看| 岛国毛片在线播放| 成人漫画全彩无遮挡| 亚洲人成网站高清观看| 2021天堂中文幕一二区在线观| 亚洲四区av| 亚洲经典国产精华液单| 国产视频首页在线观看| 国产精品麻豆人妻色哟哟久久| 3wmmmm亚洲av在线观看| 最近2019中文字幕mv第一页| 午夜免费男女啪啪视频观看| 美女视频免费永久观看网站| 边亲边吃奶的免费视频| 亚洲色图综合在线观看| 中文字幕久久专区| 欧美日韩精品成人综合77777| 在线免费十八禁| 成人亚洲欧美一区二区av| 深爱激情五月婷婷| 午夜免费观看性视频| 99久久中文字幕三级久久日本| 超碰97精品在线观看| 亚洲一区二区三区欧美精品 | 国产伦在线观看视频一区| 国产男女内射视频| 国产综合懂色| 久久久久久伊人网av| 国产91av在线免费观看| 亚洲精品aⅴ在线观看| 欧美成人a在线观看| 赤兔流量卡办理| 少妇的逼好多水| 日本一本二区三区精品| 免费播放大片免费观看视频在线观看| 青春草国产在线视频| 91久久精品电影网| 一区二区三区免费毛片| 麻豆成人av视频| 国国产精品蜜臀av免费| 国产乱人偷精品视频| 黄片无遮挡物在线观看| 老司机影院成人| 成人免费观看视频高清| 女人十人毛片免费观看3o分钟| 人妻一区二区av| 日韩av免费高清视频| av在线app专区| 一区二区av电影网| 干丝袜人妻中文字幕| 日日啪夜夜撸| 国产人妻一区二区三区在| 九九在线视频观看精品| 校园人妻丝袜中文字幕| 另类亚洲欧美激情| 国产男人的电影天堂91| 99久久人妻综合| 最新中文字幕久久久久| 美女高潮的动态| 婷婷色麻豆天堂久久| 国产淫片久久久久久久久| 99精国产麻豆久久婷婷| 在线观看免费高清a一片| 赤兔流量卡办理| 一边亲一边摸免费视频| 涩涩av久久男人的天堂| 一区二区av电影网| 欧美日韩亚洲高清精品| 亚洲精品,欧美精品| 亚洲成人久久爱视频| 国产午夜福利久久久久久| 亚洲精品影视一区二区三区av| 国产探花极品一区二区| av在线天堂中文字幕| 国产伦精品一区二区三区四那| 爱豆传媒免费全集在线观看| 尤物成人国产欧美一区二区三区| 久久国产乱子免费精品| 久久99热6这里只有精品| 亚洲av欧美aⅴ国产| 春色校园在线视频观看| 亚洲电影在线观看av| 毛片一级片免费看久久久久| 色综合色国产| 啦啦啦中文免费视频观看日本| 国产又色又爽无遮挡免| 有码 亚洲区| 国产成人精品一,二区| 日韩制服骚丝袜av| 99热这里只有精品一区| 亚洲欧美日韩无卡精品| 欧美3d第一页| 2021天堂中文幕一二区在线观| 简卡轻食公司| 交换朋友夫妻互换小说| 毛片女人毛片| 全区人妻精品视频| 成人无遮挡网站| 黄色一级大片看看| av在线播放精品| 久久久久久久久久成人| 午夜免费鲁丝| 在线播放无遮挡| 我要看日韩黄色一级片| 26uuu在线亚洲综合色| 蜜桃亚洲精品一区二区三区| 国产极品天堂在线| 99热6这里只有精品| 男女边摸边吃奶| 51国产日韩欧美| 亚洲精品自拍成人| 韩国av在线不卡| 亚洲精品久久久久久婷婷小说| 国产人妻一区二区三区在| 天堂中文最新版在线下载 | 一级黄片播放器| 日韩中字成人| 国产色爽女视频免费观看| 亚洲av.av天堂| 国产大屁股一区二区在线视频| 亚洲国产av新网站| 丝瓜视频免费看黄片| 少妇人妻久久综合中文| 亚洲人成网站在线播| 精品国产三级普通话版| 精品亚洲乱码少妇综合久久| 亚州av有码| 成人美女网站在线观看视频| 国产一区亚洲一区在线观看| 国产高清三级在线| 七月丁香在线播放| 国产亚洲av片在线观看秒播厂| 国产精品秋霞免费鲁丝片| 99久久人妻综合| 久久久成人免费电影| 97在线人人人人妻| 丰满人妻一区二区三区视频av| 免费少妇av软件| 亚洲国产欧美在线一区| 精品视频人人做人人爽| 国产男人的电影天堂91| 亚洲人成网站在线观看播放| 久久综合国产亚洲精品| 久久久久国产网址| 69av精品久久久久久| 三级经典国产精品| 一区二区三区四区激情视频| 久久久久久久久久久免费av| 久久韩国三级中文字幕| 夫妻性生交免费视频一级片| 精品久久久精品久久久| 国产成人精品久久久久久| av女优亚洲男人天堂| 国产永久视频网站| 国产精品一二三区在线看| 欧美日韩在线观看h| 18禁动态无遮挡网站| 在线观看一区二区三区| 中文字幕人妻熟人妻熟丝袜美| 亚洲国产精品专区欧美| 中文在线观看免费www的网站| 高清av免费在线| 在线播放无遮挡| 嫩草影院新地址| 国产男女超爽视频在线观看| 禁无遮挡网站| 成人毛片a级毛片在线播放| 免费黄色在线免费观看| 成人黄色视频免费在线看| 精品99又大又爽又粗少妇毛片|