Search

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.

In greenhouse nurseries, one of the important tasks of the automatic transplanter is replanting missing or bad seedling holes with healthy seedlings. This requires the transplanter to spend significant time moving between the supply trays and target trays during replanting. The diversity and complexity of the transplanting routes affect transplanter efficiency. Path planning method can find a better path for the manipulator and improve the efficiency of transplantation. The A* algorithm (A*), which is one of the optimal path search algorithms, is often used in practical applications of path planning. In this paper, the heuristic function of the A* is optimized by the ant colony algorithm (ACA), and an improved A* algorithm (Imp-A*) is obtained. Simulation tests and transplanting trials of Imp-A*, A*, ACA, Dijkstra (DA), and common sequence method (CSM) were carried out using 32-, 50-, 72-, and 128-hole plug trays. The results show that Imp-A* inherits the advantages of A* and ACA in terms of path planning length and computation time. Compared to A*, ACA, DA, and CSM, the transplanting time for Imp-A* was reduced by 2.4%, 12.84%, 11.63%, and 14.27%, respectively. In just six trays of transplanting tasks, Imp-A* saves 60.91 s compared to CSM, with an average time saving of 10.15 s per tray. The combination optimization algorithm has similar application prospects in agriculture. [ABSTRACT FROM AUTHOR]

A comprehensive evaluation of the performance of satellite-based soil moisture (SM) retrievals is undoubtedly very important to improve its quality and evaluate its potential application in hydrology, climate, and natural disasters (drought, flood, etc.). Since the release of the SMAP (Soil Moisture Active Passive) mission data in April 2015, the associated SM retrieval algorithms have developed rapidly, and their improvement work is still in progress. However, some newly developed SM retrievals have not been fully assessed and inter-compared. One such product is the new multi-temporal dual-channel retrieval algorithm (MT-DCA) SM retrievals, which was recently retrieved using the so-called MT-DCA algorithm. To solve this, we aim to assess the MT-DCA SM retrievals along with the SMAP-enhanced level three SM products (SPL3SMP_E, version 2). More specifically, in this paper we evaluated and inter-compared the two SMAP SM retrievals with the ECMWF (European Centre for Medium-Range Weather Forecasts) modeled SM and ISMN (International Soil Moisture Network) in situ observations by applying four statistical scores: Pearson correlation coefficient (R), root mean square difference (RMSD), bias, and unbiased RMSD (ubRMSD). It was found that both SMAP SM retrievals can better capture the seasonal variations of ECMWF-modeled SM and ground-based measurements according to correlations, and MT-DCA SM was drier than SPL3SMP_E SM by ~0.018 m3/m3 on average on a global scale. With respect to the ISMN ground-based measurements, the performance of SPL3SMP_E SM compared better than the MT-DCA SM. The median ubRMSD of SPL3SMP_E SM and MT-DCA SM with ground measurements computed over all selected ISMN sites were 0.058 m3/m3 and 0.070 m3/m3, respectively. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]