Long-term information of phytoplankton bloom is critical for assessing the processes driving blooms in lakes. A three-decade survey of the phytoplankton blooms was completed for Erhai Lake from 1987 to 2016 with Landsat imagery. A modified three-band model using Landsat broad bands is developed by comparing reflectance data from Landsat imagery to two field datasets. The model is applied to the archived imagery (1987–2016) to predict chlorophyll-a (Chl-a). Predicted ln(Chl-a) and observed ln(Chl-a) measurements are significantly correlated (R² = 0.70; RMSE = 0.13 ug/L). Bloom maps are generated by identifying Landsat pixels that have Chl-a concentrations larger than 20 ug/L as bloom area. Bloom extent and magnitude are estimated. Our study reveals that algal blooms first occurred in 1996 with a bloom area of 150 km². Bloom occurred frequently from 2002 to 2016, with extreme blooms in 2003, 2013 and 2016. Algal blooms were mostly distributed in the northern and southern part of the lake. The proposed method uses one model for all Landsat images for Erhai Lake and can predict past blooms and extend the record to early years when field data is not available. The bloom extent and magnitude produced in this study can be used as the basis for the understanding of the processes that control the bloom outbreak.

For point clusters, the conflict and crowding of map symbols is an inevitable problem during the transition from large to small scales. The cartographic generalization involved in this problem as a spatial decision-making process is usually related to the analysis of spatial context, the choice of abstraction operators, and the judgment of the resulting data quality. The rules summarized by traditional generalization methods usually require manual setting of conditions or thresholds and sometimes encounter special cases that make it difficult to directly match certain rules or integrate different rules together. An alternative method is using a data-driven strategy under AI technology background to simulate cartographer behaviors through typical sample training, such as deep learning. The integration of cartography domain knowledge and deep learning is a better choice to settle generalization decisions. This study uses a combination of domain knowledge and a data-driven approach to introduce graph neural networks into point cluster generalization. First, we construct a virtual graph structure of point clusters using Delaunay triangulation, secondly, we extract spatial features, contextual features, and attributes of each point separately, and then propose a generalization model based on the TAGCN network. Finally, this model is trained with the manually generalized sample to realize the automatic point cluster generalization. The results demonstrate that the proposed model is valid and efficient for point cluster generalization and that this algorithm can better maintain various characteristics of the point cluster in both the local area and the overall map compared to other methods.

This paper proposes a model to quantify the multiscale representation of a polyline based on iterative head/tail breaks. A polyline is first transformed into a corresponding Fourier descriptor consisting of normalized Fourier-series-expansion coefficients. Then, the most significant finite components of the Fourier descriptor are selected and ranked to constitute the polyline constrained Fourier descriptor. Using Shannon’s information theory, information content of the constrained Fourier-descriptor components is defined. Next, head/tail breaks are introduced to iteratively divide the constrained Fourier descriptor into head and tail components according to the heavy-tailed distribution of information contents. Thus, simplified polylines are reconstructed using ordered heads generated from head/tail breaks. Finally, the radical law is introduced and applied to model multiscale polyline representation by quantifying the scale of each simplified polyline. Three experiments are designed and conducted to evaluate the proposed model. The results demonstrate that the proposed model is valid and efficient for quantifying multiscale polyline representation.

The error-in-variable (EIV) model takes the error of all variables into account and has been widely applied to many practical problems arising in environmental study, geology, geographic information science (GIS), and geodesy. Coordinate transformations are among the most frequently encountered problems in spatial data processing, and the EIV model can be built based on two sets of coordinates. In some applications, physical parameters—such as the shift, rotation angle, and scale factor—have constraints. Current implementations of the constrained EIV (CEIV) model do not consider physical constraints explicitly. The purpose of this paper is to convert physical constraints into mathematical forms and to use constrained total least squares (CTLS) to solve the CEIV problem of two-dimensional (2D) affine transformation. The effectiveness of this method is illustrated through a numerical example.

This paper presents a new method for use in performing continuous scale transformations of linear features using Simulated Annealing-Based Morphing (SABM). This study addresses two key problems in the continuous generalization of linear features by morphing, specifically the detection of characteristic points and correspondence matching. First, an algorithm that performs robust detection of characteristic points is developed that is based on the Constrained Delaunay Triangulation (CDT) model. Then, an optimal problem is defined and solved to associate the characteristic points between a coarser representation and a finer representation. The algorithm decomposes the input shapes into several pairs of corresponding segments and uses the simulated annealing algorithm to find the optimal matching. Simple straight-line trajectories are used to define the movements between corresponding points. The experimental results show that the SABM method can be used for continuous generalization and generates smooth, natural and visually pleasing linear features with gradient effects. In contrast to linear interpolation, the SABM method uses the simulated annealing technique to optimize the correspondence between characteristic points. Moreover, it avoids interior distortions within intermediate shapes and preserves the geographical characteristics of the input shapes.

Within-class spectral variation and between-class spectral confusion in remotely sensed imagery degrades the performance of built-up area detection when using planar texture, shape, and spectral features. Terrain slopes and building heights extracted from auxiliary data, such as Digital Surface Models (DSMs) however, can improve the results. Stereo imagery incorporates height information unlike single remotely sensed images. In this study, a new Stereo Pair Disparity Index (SPDI) for indicating built-up areas is calculated from stereo-extracted disparity information. Further, a new method of detecting built-up areas from stereo pairs is proposed based on the SPDI, using disparity information to establish the relationship between two images of a stereo pair. As shown in the experimental results for two stereo pairs covering different scenes with diverse urban settings, the SPDI effectively differentiates between built-up and non-built-up areas. Our proposed method achieves higher accuracy built-up area results from stereo images than the traditional method for single images, and two other widely-applied DSM-based methods for stereo images. Our approach is suitable for spaceborne and airborne stereo pairs and triplets. Our research introduces a new effective height feature (SPDI) for detecting built-up areas from stereo imagery with no need for DSMs.