Explore the vast range of titles available.

An accelerating trend of global urbanization accompanying various environmental and urban issues makes frequently urban mapping. Nighttime light data (NTL) has shown great advantages in urban mapping at regional and global scales over long time series because of its appropriate spatial and temporal resolution, free access, and global coverage. However, the existing urban extent extraction methods based on nighttime light data rely on auxiliary data and training samples, which require labor and time for data preparation, leading to the difficulty to extract urban extent at a large scale. This study seeks to develop an unsupervised method to extract urban extent from nighttime light data rapidly and accurately without ancillary data. The clustering algorithm is applied to segment urban areas from the background and multi-scale spatial context constraints are utilized to reduce errors arising from the low brightness areas and increase detail information in urban edge district. Firstly, the urban edge district is detected using spatial context constrained clustering, and the NTL image is divided into urban interior district, urban edge district and non-urban interior district. Secondly, the urban edge pixels are classified by an adaptive direction filtering clustering. Finally, the full urban extent is obtained by merging the urban inner pixels and the urban pixels in urban edge district. The proposed method was validated using the urban extents of 25 Chinese cities, obtained by Landsat8 images and compared with two common methods, the local-optimized threshold method (LOT) and the integrated night light, normalized vegetation index, and surface temperature support vector machine classification method (INNL-SVM). The Kappa coefficient ranged from 0.687 to 0.829 with an average of 0.7686 (1.80% higher than LOT and 4.88% higher than INNL-SVM). The results in this study show that the proposed method is a reliable and efficient method for extracting urban extent with high accuracy and simple operation. These imply the significant potential for urban mapping and urban expansion research at regional and global scales automatically and accurately.

This article describes a comparison of the pixel-based classification methods used to distinguish ice from other land cover types. The article focuses on processing RGB imagery, as these are very easy to obtained. The imagery was taken using UAVs and has a very high spatial resolution. Classical classification methods (ISODATA and Maximum Likelihood) and more modern approaches (support vector machines, random forests, deep learning) have been compared for image data classifications. Input datasets were created from two distinct areas: The Pond Skříň and the Baroch Nature Reserve. The images were classified into two classes: ice and all other land cover types. The accuracy of each classification was verified using a Cohen’s Kappa coefficient, with reference values obtained via manual surface identification. Deep learning and Maximum Likelihood were the best classifiers, with a classification accuracy of over 92% in the first area of interest. On average, the support vector machine was the best classifier for both areas of interest. A comparison of the selected methods, which were applied to highly detailed RGB images obtained with UAVs, demonstrates the potential of their utilization compared to imagery obtained using satellites or aerial technologies for remote sensing.

This manuscript describes a new technique for segmenting color images in different color spaces based on geometrical properties of lattice auto-associative memories. Lattice associative memories are artificial neural networks able to store a finite set X of n -dimensional vectors and recall them when a noisy or incomplete input vector is presented. The canonical lattice auto-associative memories include the min memory W XX and the max memory M XX , both defined as square matrices of size n × n . The column vectors of W XX and M XX , scaled additively by the components of the minimum and maximum vector bounds of X , are used to determine a set of extreme points whose convex hull encloses X . Specifically, since color images form subsets of a finite geometrical space, the scaled column vectors of each memory will correspond to saturated color pixels. Thus, maximal tetrahedrons do exist that enclose proper subsets of pixels in X and such that other color pixels are considered as linear mixtures of extreme points determined from the scaled versions of W XX and M XX . We provide illustrative examples to demonstrate the effectiveness of our method including comparisons with alternative segmentation methods from the literature as well as color separation results in four different color spaces.