The analytic hierarchy process (AHP), a decision-making method, allows the relative prioritization and assessment of alternatives under multiple criteria contexts. This method is also well suited for road selection. The method for road selection based on AHP involves four steps: (i) Points of Interest (POIs), the point-like representations of the facilities and habitations in maps, are used to describe and build the contextual characteristic indicator of roads; (ii) form an AHP model of roads with topological, geometrical, and contextual characteristic indicators to calculate their importance; (iii) select roads based on their importance and the adaptive thresholds of their constituent density partitions; and (iv) maintain the global connectivity of the selected network. The generalized result at a scale of 1:200,000 by AHP-based methods better preserved the structure of the original road network compared with other methods. Our method also gives preference to roads with relatively significant contextual characteristics without interfering with the structure of the road network. Furthermore, the result of our method largely agrees with that of the manual method.

Points on maps that stand for geographic objects such as settlements are generally connected by road networks. However, in the existing algorithms for point cluster simplification, points are usually viewed as discrete objects or their distances are considered in Euclidean spaces, and therefore the point cluster generalization results obtained by these algorithms are sometimes unreasonable. To take roads into consideration so that point clusters can be simplified in appropriate ways, the network Voronoi diagram is used and a new algorithm is proposed in this paper. First, the weighted network Voronoi diagram is constructed taking into account the weights of the points and the properties of the related road segments. Second, the network Voronoi polygons are generated and two factors (i.e., the area of the network Voronoi polygon and the total length of the dilated road segments in the polygon) are considered as the basis for point simplification. Last, a Cartesian coordinate system is built based on the two factors and the point clusters are simplified by means of the “concentric quadrants”. Our experiments show that the algorithm can effectively and correctly transmit types of information in the process of point cluster simplification, and the results are more reasonable than that generated by the ordinary Voronoi-based algorithm and the weighted Voronoi-based algorithm.

Pulse-coupled neural network (PCNN) and its modified models are suitable for dealing with multi-focus and medical image fusion tasks. Unfortunately, PCNNs are difficult to directly apply to multispectral image fusion, especially when the spectral fidelity is considered. A key problem is that most fusion methods using PCNNs usually focus on the selection mechanism either in the space domain or in the transform domain, rather than a details injection mechanism, which is of utmost importance in multispectral image fusion. Thus, a novel pansharpening PCNN model for multispectral image fusion is proposed. The new model is designed to acquire the spectral fidelity in terms of human visual perception for the fusion tasks. The experimental results, examined by different kinds of datasets, show the suitability of the proposed model for pansharpening.

This letter proposes a novel dual-output pulse coupled neural network model (DPCNN). The new model is applied to obtain a more stable texture description in the face of the geometric transformation. Time series, which are computed from output binary images of DPCNN, are employed as translation-, rotation-, scale-, and distortion-invariant texture features. In the experiments, DPCNN has been well tested by using Brodatz's album and the VisTex database. Several existing models are compared with the proposed DPCNN model. The experimental results, based on different testing data sets for images with different translations, orientations, scales, and affine transformations, show that our proposed model outperforms existing models in geometry-invariant texture retrieval. Furthermore, the robustness of DPCNN to noisy data is examined in the experiments.