Zhang Deng-rong

Algorithm and its application of N shortest paths problem

The shortest path problem is one of the basic and classical problems of graph theory and is applied to many fields, such as GIS network analysis. Dijkstras and Floyds algorithms are two classical algorithms. While the shortest path indicates only the shortest one path, algorithms designed for it can only get one path. This paper brings forward the N shortest paths problem then designs an algorithm for it and analyzes its complexity. The algorithm is tested by experiment and applied to a traffic consultation system of Guangzhou city and proved to be efficient.

A new decomposing approach of analyzing remotely sensed digital image

A new method to decompose digital remotely sensed images is discussed in this paper. The information in the original remotely sensed data can be decomposed, pixel-by-pixel, into three components of natural light - solar direct illuminance (SDI), sky-scattering illuminance (SSI) and atmospheric path radiance (APR). Because the remotely sensed information is the result of the interaction between each component and ground features, the resultant component images of this method are more powerful than the original remotely sensed data in the quantitative inversion research of ground radiation energy, atmospheric environment condition, and remote sensing image pattern recognition.