Grid pattern recognition in road networks using the C4.5 algorithm

Pattern recognition in road networks can be used for different applications, including spatiotemporal data mining, automated map generalization, data matching of different levels of detail, and other important research topics. Grid patterns are a common pattern type. This paper proposes and implements a method for grid pattern recognition based on the idea of mesh classification through a supervised learning process. To train the classifier, training datasets are selected from worldwide city samples with different cultural, historical, and geographical environments. Meshes are subsequently labeled as composing or noncomposing grids by participants in an experiment, and the mesh measures are defined while accounting for the mesh’s individual characteristics and spatial context. The classifier is generated using the C4.5 algorithm. The accuracy of the classifier is evaluated using Kappa statistics and the overall rate of correctness. The average Kappa value is approximately 0.74, which corresponds to a total accuracy of 87.5%. Additionally, the rationality of the classifier is evaluated in an interpretation step. Two other existing grid pattern recognition methods were also tested on the datasets, and comparison results indicate that our approach is effective in identifying grid patterns in road networks.     

Curve matching approaches to waveform classification: a case study using ICESat data

Light Detection and Ranging (LiDAR) waveforms are being increasingly used in many forest and urban applications, especially for ground feature classification. However, most studies relied on either discretizing waveforms to multiple returns or extracting shape metrics from waveforms. The direct use of the full waveform, which contains the most comprehensive and accurate information has been scarcely explored. We proposed to utilize the complete waveform to test its ability to differentiate between objects having distinct vertical structures using curve matching approaches. Two groups of curve matching approaches were developed by extending methods originally designed for pixel-based hyperspectral image classification and object-based high spatial image classification. The first group is based on measuring the curve similarity between an unknown waveform and a reference waveform, including curve root sum squared differential area (CRSSDA), curve angle mapper (CAM), and Kullback–Leibler (KL) divergence. The second group assesses the curve similarity between an unknown and reference cumulative distribution functions (CDFs) of their waveforms, including cumulative curve root sum squared differential area (CCRSSDA), cumulative curve angle mapper (CCAM), and Kolmogorov–Smirnov (KS) distance. When employed to classify open space, trees, and buildings using ICESat waveform data, KL provided the highest average classification accuracy (87%), closely followed by CCRSSDA and CCAM, and they all significantly outperformed KS, CRSSDA, and CAM based on 15 randomized sample sets.