2009 17th International Conference on Geoinformatics最新文献

{"title":"Analysis of ground deformations based on parallel geostatistical computations of PSInSAR data","authors":"J. Strzelczyk, S. Porzycka, A. Leśniak","doi":"10.1109/GEOINFORMATICS.2009.5293261","DOIUrl":"https://doi.org/10.1109/GEOINFORMATICS.2009.5293261","url":null,"abstract":"The ground deformations can be caused by many different factors. One of them is coal exploitation. It can cause not only strong and abrupt ground movements but also small, long period deformations which can occur even several years after exploitation is finished. In both cases these displacements are serious menace for surface and subsurface infrastructure. In this work the PSInSAR data were used to study small, long lasting ground deformations which occurred in the Upper Silesian Coal Basin (south Poland) in the years 1992–2003. In this region the intensive coal exploitation has been carried on. Additionally this area has complicated geological structure. These factors make studied region particularly threatened with terrain deformations. The subsidence phenomenon was detected in this region using PSInSAR method. PSInSAR technique is a dynamically developed branch of satellite radar interferometry. It exploits a set of dozens satellite SAR images in order to detect small ground deformations for large areas. PSInSAR technique derives information only about ground movements for stable radar targets, so called PS points. They correspond with man-made features on the ground like buildings, bridges etc. In the Upper Silesian Coal Basin the values of ground deformations were measured for more then 120000 PS points. Their location is very irregular. In order to study the origin of this ground displacements the values of deformations have to be estimated in no-observed locations. In this work this estimation was performed using kriging which is a geostatistical method of interpolation. It is very computationally expensive method because it requires the solution of a large linear system for each grid node in which the interpolation is done. Because the PSInSAR dataset is very large the kriging computations were done in parallel environment. In the designing of the parallel kriging algorithm also strong irregularity of PS points location was taken into consideration. At the beginning of the formulated parallel kriging algorithm, the number of PS points used in grid nodes interpolation was determined. Then, based on this information, data decomposition was conducted. In this process, grid points were divided between CPUs, so that each processor had the same number of calculations to perform. This solution is optimized for PSInSAR data points, which are deployed irregularly, often in local centers on the research area. It was shown in this work that geostatistical methods can be successfully used in PSInSAR data analysis, but are computationally expensive. By designing parallel kriging algorithm for PSInSAR data and using Blade infrastructure for computations, it was possible to conduct the interpolation of ground deformations in viable time. It is worth to underline the universality of this algorithm, which can be used not only for PSInSAR data, but also for other types of data with similar characteristic.","PeriodicalId":121212,"journal":{"name":"2009 17th International Conference on Geoinformatics","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124950344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Wavelet texture extraction and image classification of hyperspectral data based on Support Vector Machine","authors":"Jin-Tsong Hwang","doi":"10.1109/GEOINFORMATICS.2009.5292863","DOIUrl":"https://doi.org/10.1109/GEOINFORMATICS.2009.5292863","url":null,"abstract":"The Support Vector Machine (SVM) was a new machine learning technique developed on the basis of statistical learning theory. It is the most successful realization of statistical learning theory. To testify the validity of SVM, this study chose the data set of hyperspectral images sensed by AVIRIS, with the band selected by Bhattacharya distance. And it added different scales of texture information as the origin information of image for classification. The main difficulty of texture recognition was the lack of effective tools to characterize different scales of textures. To improve the problem, the wavelet co-occurrence parameters, mean, homogeneity, and standard deviation of different level discrete wavelet transform images were used as texture features. In this paper, the texture features combined with PCA band of image were adopted as the characteristic vector of training samples for SVM, and Decision Tree classification. Finally, traditional classification schemes of Maximum Likelihood were comparatively studied. The effectiveness of the classification including texture measures was also analyzed. The experimental results showed that SVM method gave the highest correct classification rate within all of these three methodologies while Maximum Likelihood gave the lowest rate. Adding texture feature information by the proposed approach to images improved classification accuracy for all of SVM, Decision Tree, and Maximum Likelihood classification.","PeriodicalId":121212,"journal":{"name":"2009 17th International Conference on Geoinformatics","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123679907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A case study of developing personalized spatial cognitive road network and raster capable route finding algorithm for pedestrian evacuation behavior simulation","authors":"Lei Wu, Hui Lin","doi":"10.1109/GEOINFORMATICS.2009.5293451","DOIUrl":"https://doi.org/10.1109/GEOINFORMATICS.2009.5293451","url":null,"abstract":"Agent modeling simulation had been widely applied in pedestrian behavior study. However, different to vehicles that behave on linear vector road networks, the pedestrians should be considered as active dots that behave in two-dimensional raster road space during outdoor activities. Since taking into account a large number of cells in the raster space equally forming one link in the vector space, it is hardly efficient to apply traditional algorithms of path finding that aim to find a shortest path to simulations in raster spaces. In addition, the author argued that the assumption implicitly contained in those shortest route algorithms that the agents could search throughout the entire road network to obtain results could not be solid in real event. Therefore, two issues for pedestrian behavior simulation were addressed including an appropriately limited road network according to pedestrian finite spatial knowledge and the route finding algorithm under raster space conditions. In this paper, a field survey was conducted in a real event covering the involved area. By reviewing the survey, the author proposed to personalize the road network based on individual spatial cognition of participant respectively. All the roads in the study area were graded according to their perception of the participants involved in the event through the interview; the more often the road was identified by pedestrians participated, the higher level it was. Each pedestrian derived his own road network from the roads selected from different levels consisted with personal characteristics. The pedestrian agents acted in these separately independent road networks when performing a simulation. In this way, two adjacent agents probably could have different understandings of “shortest route” leading to the same destination, which better represented the diversity of the public in the real world. In the second part, the author attempted to develop a raster capable route finding algorithm utilizing the personalized spatial cognitive road network to simulate the pedestrian behavior. This algorithm profited by the essentials of the classic algorithms and served as a gateway from vector to raster. Two layers, cognition and implementation layers were constructed. On the cognition layer, the pedestrian agents recognized the roads as vector links. They searched their corresponding personalized spatial cognitive road network to find a route to the destination according to their spatial knowledge and behave pattern. The route probably consisted of several roads and several intersections. The intersections performed as check points on the agents' journey to the destinations. While detailing to the implementation layer, the intersections transformed from vector points to a cluster of raster cells. The pedestrian agents figured out the action route from current cell to a particular available intersection cell. Since the search was limited in a section of one road, the process could be practica","PeriodicalId":121212,"journal":{"name":"2009 17th International Conference on Geoinformatics","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124194933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Shortest path queries in mobile broadcast environments","authors":"T. Su, Yun-Tung Hsieh, Chuan-Ming Liu","doi":"10.1109/GEOINFORMATICS.2009.5293414","DOIUrl":"https://doi.org/10.1109/GEOINFORMATICS.2009.5293414","url":null,"abstract":"Emerging technologies on Global Positioning Systems (GPS), wireless communications, networking, and Geographic Information Systems (GIS) makes it possible for people to access information related to their locations ubiquitously. In such wireless mobile environments, data-broadcasting can disseminate information to a large group of mobile clients effectively. Using data-broadcasting to provide different types of services, including range query, point query, and nearest neighbor search, has been extensively studied in recent years. Two measurements are usually considered when applying data-broadcasting to provide services, latency and tuning time. The latency is the time between the issuing and completion of a query and stands for the quality of service. The tuning time measures the actual time when a client listens to the broadcast and presents the power consumption. In this paper, we consider how to provide the shortest path service using data-broadcasting and use the idea of hierarchical graphs to propose the protocol. In our solution, the mobile client does not need to store the entire road network and can derive the shortest path by selectively tuning into the broadcast. On the server side, we focus on how to organize the broadcast. In the broadcast, we add a little additional information to reduce the tuning time; thus saving the energy. On the client side, we provide a process to compute the shortest path by listening to the corresponding broadcast. Last, we present and discuss our findings through extensive experiments. Our experimental results show that our approach performs well in terms of the latency and tuning time.","PeriodicalId":121212,"journal":{"name":"2009 17th International Conference on Geoinformatics","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121828533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Utilizing Particle System to simulate airflow of laneway in underground mine environment","authors":"Qunying Huang, Shanjun Mao, Yunfeng Jiang, Bentao Ru, Mei Li, Ping Dong","doi":"10.1109/GEOINFORMATICS.2009.5293434","DOIUrl":"https://doi.org/10.1109/GEOINFORMATICS.2009.5293434","url":null,"abstract":"The implementation of 3D visualization of air flow of laneway would make it possible to monitor the direction, velocity, characteristics and quantities of air flow visually and directly. The paper firstly has presented how to build up the topological relation of airflow in a ventilation network, and how to search all airflow simulating routes between the air inlet and air outlet of the ventilation network automatically based on the topological relation of airflow in such a network. Then the moving process of air flow in the laneway can be modeled based on the principle of particle system. Different from traditional modeling methods, this paper analyses the spatial relationship of laneway and air flow, and puts forward to an improved model of representing laneway airflow in underground coal mine environment with Particle System. The particle effect is implemented by the OpenGL library and VC++ platform. The approach introduced in this paper effectively solved the problems of bad real-time effects and high consumption of computing resources while simulating air flow of laneway in underground coal mine environment with traditional approaches and it proved to be effectively applied in the 3D visualization system for coalmines.","PeriodicalId":121212,"journal":{"name":"2009 17th International Conference on Geoinformatics","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116028194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Three-dimensional spatial indexing method of complicated geological scene","authors":"Zhenwen He, Gang Liu, Zhengping Weng, Chonglong Wu","doi":"10.1109/GEOINFORMATICS.2009.5293278","DOIUrl":"https://doi.org/10.1109/GEOINFORMATICS.2009.5293278","url":null,"abstract":"How to create high-performance true three-dimensional spatial index for the complicated geological scene to ensure the effective storage management and dispatching of the TB-class mass complicated geological scene data is one of the key technical issues of the 3DGIS, which needs to be resolved urgently. The inefficient space division and the high rate of index node overlap problems will appear in the continuous nonhomogeneous geological space by using the existing three-dimensional R-tree series spatial indexes. They cannot effectively deal with large-scale complicated geological scene data. In order to resolve these problems, the amount of data evaluating techniques of geology solid and multi-levels indices techniques are the introduction of three-dimensional spatial index. Used three-dimensional space division technology based on the amount of data evaluating technology of geology solid, combined with three-dimensional spatial clustering, spatial scan sorting, fast convex hull algorithm and CSR-Tree packing construction techniques, the multi-level mixed three-dimensional spatial index can be constructed dynamically. It advances the query efficiency by using the topological relationships between the geology solids, realizes the complex geological data management and efficient dispatching, and affords new ideas and new method for the continuous nonhomogeneous three-dimensional space.","PeriodicalId":121212,"journal":{"name":"2009 17th International Conference on Geoinformatics","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122393454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Implementation of Sensor Observation Service for Satellite Imagery Sensors","authors":"Huilin Wang, L. Di, Genong Yu, Bei Zhang","doi":"10.1109/GEOINFORMATICS.2009.5293487","DOIUrl":"https://doi.org/10.1109/GEOINFORMATICS.2009.5293487","url":null,"abstract":"This research takes advantages of Sensor Observation Service (SOS), according to a grid-based satellite sensor: Geostationary Operational Environmental Satellites (GOES) to construct a framework to serve GOES data with standard interfaces. The implemented SOS operations here are Get Capabilities to serve the service metadata about the specific service instance, Describe Sensor to serve detailed sensor metadata and Get Observation to retrieve observation data structured according to the Observation and Measurement specification. Two major problems occurred in the implementation will be discussed in this Paper: One is how to retrieve real-time GOES data automatically since the sensors keep collecting data and the other is how to modeling sensor observations. A data order system is designed to achieve the goal of retrieving GOES data. The Observation and Measurements (O&M) specification which can handle lots of data types in an efficient and robust way is adopted to solve the second problem.","PeriodicalId":121212,"journal":{"name":"2009 17th International Conference on Geoinformatics","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116325184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"GWSC-VMR, a GIS supported conceptual distributed hydrological model for cold and arid regions","authors":"T. Fang, Guizuo Wang, L. Ren","doi":"10.1109/GEOINFORMATICS.2009.5293150","DOIUrl":"https://doi.org/10.1109/GEOINFORMATICS.2009.5293150","url":null,"abstract":"Our research focuses on the study of the particular hydrological process in cold and arid regions. Our aims are to develop a Geographical Information System (GIS) supported conceptual model that could be applied to simulate a drainage basin's hydrological process in cold and arid regions and to verify it through a case study. We built a model named the Vertically-Mixed Runoff Model with Grid-based Water Storage Capacity (GWSC-VMR for short). GWSC-VMR includes two parts, i.e. the spatial distributed model of water storage capacity and the vertically-mixed runoff module. First, drainage basin land cover map and typical vegetation rooting depth were acquired by interpreting remote sensing images or accessing land cover database. Second, through the processing of DEM data, we decided water flow direction, catchment area, basin boundary, and the slope of grided basin. Third, we determined the spatial distribution of water storage capacity based on the vegetation rooting depth. Because vegetation root system is a complicated system which is affected by the depth of active soil layer, and the depth of active soil layer is related to the slope, we put forward a series of concepts—upper critical slope gradient, lower critical slope gradient and critical soil layer depth to describe the grid tension water storage capacity and the grid free water storage capacity. Lastly, we integrated the vertically-mixed runoff mechanism and the spatial distribution of drainage basin water storage capacity to develop the GWSC-VMR, which could be applied to simulate drainage basin hydrologic processes, such as snow melt, canopy interception, evapotranspiration, and flow concentration.","PeriodicalId":121212,"journal":{"name":"2009 17th International Conference on Geoinformatics","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126854558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Arbitrary cut algorithm based on 3D geological objects represented by TIN structure","authors":"Weihua Hua, Guoliang Chen, Hengjian Tong","doi":"10.1109/GEOINFORMATICS.2009.5293527","DOIUrl":"https://doi.org/10.1109/GEOINFORMATICS.2009.5293527","url":null,"abstract":"this paper presents a novel arbitrary cut algorithm based on 3D geological objects represented by TIN structure. The geological model is composed by a series of TIN surfaces. Compared with the classical cut algorithm, the algorithm brings some obvious improvements on the following two aspects: the generation of arbitrary section and the partition of cut geological bodies. According judging the position between cut object with the geological model, the result section can be generated. And different methods can be used to deal with different cut types. The thesis gives a new algorithm based on oriented bounding box tree (OBBT) to judge between point and polyhedron to solve the above problem. It converts the complex cutting problem to a series of simple operations: collision detection, intersection between a line segment and a triangle, triangle mesh reconstruction, the position test between point and curve or surface, etc. It use geometric surface or geometric entity to cut any geological model according to the algorithm. Therefore, users can analyze the interior structure of any geological model efficiently. By testing with some underground geological model of Shanghai, China, the algorithm successfully solves the problems of 3D geological models analysis such as arbitrary cutting, generating fence diagram, foundation ditch digging, pit excavation, tunnel digging and virtual drilling.","PeriodicalId":121212,"journal":{"name":"2009 17th International Conference on Geoinformatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124346891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Estimation and analysis of land surface water and heat fluxes in mountain-plain area based on remote sensing and DEM","authors":"Hequn Yang, Y. Liua, Yinming Yang, Cong Zhang","doi":"10.1109/GEOINFORMATICS.2009.5293514","DOIUrl":"https://doi.org/10.1109/GEOINFORMATICS.2009.5293514","url":null,"abstract":"The income and expenses status of water along with heat on land surface determine the form and evolvement of environment to a great extent. This paper focus on the topic of estimation and analysis of land surface water and heat fluxes in mountain-plain area based on remote sensing and DEM, selecting Sunan Mountain and Zhangye Plain in China as a case study. All the biophysical parameters quantitatively retrieved from ASTER data were as the inputs of SVAT-based model—SEBS (Surface Energy Balance System), to derive the latent heat flux and daily evaporation, in which the parameterization schemes for calculating the instantaneous solar radiation and daily integrated radiation were improved by accounting for the variations in slope and azimuth of land surface and terrain shadow in mountainous areas. After preliminary validation and comparison, we consider that the estimation of land surface water and heat fluxes as well as daily evaporation shows a reliable result, which also implies that the parameterization methods and SEBS model are feasible. Then the spatial patterns of land surface heat fluxes as well as daily evaporation on these two landform systems were cross-compared. Different types of land use land cover (LULC) have their corresponding threshold concentrations, and the high vegetation density corresponds to high evaporation (daily evaporation ranges from 0mm to 7.524 mm day-1). Forest, prairie and grassland, irrigated field have higher daily evaporation, while cold desert, Gobi and droughty riverside land have low daily evaporation, some of which reach to 0mm. Results show that land surface heterogeneity has great influence on the spatial pattern of land surface water and heat fluxes, and vegetation coverage influence surface water and heat's characteristic, which figures that it is better to introduce vegetation fraction and Ts to describe land surface water and heat fluxes rather than the commonly used NDVI-Ts, though needed further analysis and validation. Besides the vegetation coverage, terrain complexity dominates the spatial distribution of land surface heat fluxes in mountainous area, which are distinctly different from plain in quantity and spatial law. The standard deviation of the net radiation flux error and latent heat flux error are almost linearly with the standard deviation of height. In certain range, they have significant correlativity with the standard deviation of slope and aspect. These correlations with net radiation flux are even more obviously. In addition, the utility and limitations of SEBS's applicability to watersheds with various land cover types and complex terrain were analyzed.","PeriodicalId":121212,"journal":{"name":"2009 17th International Conference on Geoinformatics","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127786718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}