The potential of a GIS-based scoping system: An Israeli proposal and case study

In the environmental impact assessment (EIA) lifecycle, scoping is regarded as the most important stage for the quality of the entire process. Even though many EIA methods exist, only a few of them are specifically suited for scoping. Despite the well-acknowledged potential of geographical information systems (CIS) for EIA and their seemingly widespread use, the applicability of GIS for scoping has not been analyzed sufficiently. This article advances a GIS-based scoping method and discusses the conditions necessary for its utilization. Two specific issues are addressed: the ability of a GIS-based system to identify the pertinent environmental effects on the basis of readily available information under stringent time and budget constraints, and the institutional infrastructure needed for such a system to operate effectively. These issues are analyzed in a case study conducted in Israel. In this case study, the proposed GIS-based scoping system identified all the main effects found independently in a comprehensive environmental impact statement (EIS), as well as issues not analyzed in the EIS. A centralized institutional scoping structure, whereby EIS guidelines are issued by a single entity, is found to be important for the operation of such a system, because it can enjoy the economies of scale and scope involved in setting up and operating a GIS system for scoping purposes

Multi-temporal time-dependent terrain visualization through localized spatial correspondence parameterization

Visualizing quantitative time-dependent changes in the topography requires relying on a series of discrete given multi-temporal topographic datasets that were acquired on a given time-line. The reality of physical phenomenon occurring during the acquisition times is complex when trying to mutually model the datasets; thus, different levels of spatial inter-relations and geometric inconsistencies among the datasets exist. Any straight forward simulation will result in a truncated, ill-correct and un-smooth visualization. A desired quantitative and qualitative modelling is presumed to describe morphologic changes that occurred, so it can be utilized to carry out more precise and true-to-nature visualization tasks, while trying to best describe the reality transition as it occurred. This research paper suggests adopting a fully automatic hierarchical modelling mechanism, hence implementing several levels of spatial correspondence between the topographic datasets. This quantification is then utilized for the datasets morphing and blending tasks required for intermediate scene visualization. The establishment of a digital model that stores the local spatial transformation parameterization correspondences between the topographic datasets is realized. Along with designated interpolation concepts, this complete process ensures that the visualized transition from one topographic dataset to the other via the quantified correspondences is smooth and continuous, while maintaining morphological and topological relations. © 2013 by the authors; licensee MDPI, Basel, Switzerland

Cadastral Triangulation: A Block Adjustment Approach for Joining Numerous Cadastral Blocks

In the last decade or so, there has been a very clear transition in many countries throughout the world from a graphical cadastre and/or relatively non-accurate digital cadastre toward an accurate coordinate based legal cadastre. Aiming at defining accurately the turning points position of the cadastral sub-division based on current data without the need to re-measure the cadastral entities, motivates the development of new algorithms and approaches suitable to performing the task. Implementation on a nationwide level requires to first develop advanced mathematical algorithms and methods to process separate parcellations (cadastral blocks or mutation plans), and then additional algorithms and methods to combine the numerous separate parcellations into a cadastral continuity maintaining rigid topological compatibility. Practical experience, especially from the Israeli viewpoint, indicates that implementation of advanced computational techniques for processing separate cadastral blocks, is only a partial solution of the problem. An optimal joining of the separate cadastral blocks into a homogeneous seamless cadastral space constitutes a complex task due to discrepancies between the adjoining parcellations. These discrepancies, significant in terms of their magnitude and characteristics, are mainly caused by the cadastral parcellation process based on separate cadastral measuring projects on the one hand, and limited accuracy of the measuring techniques in previous decades (mainly in the first half of the 20th century) on the other hand. The paper introduces a new algorithm based on the existing mathematical model, customary in photogrammetric mapping, aimed at connecting the adjoining photographs into blocks based on Block Adjustment by Independent Models. The proposed adjustment method (named the "Cadastral Triangulation") is executed based on the classic Adjustment of Indirect Observations combined with the Chained Similarity Transformation. This adjustment process which is carried out by a global transformation mechanism, enables obtaining both optimal transformation parameters of all the separate parcellations, as well as optimal coordinates of the cadastral boundary turning points. The initial results of the proposed method indicate its effectiveness in connecting the adjoining cadastral blocks, effectiveness expressed by a significant decrease of systematic and random errors compared to their pre-adjusted situation. Additionally, the proposed method enables bringing the adjusted cadastral boundary turning points maximally close to their theoretical true (and unknown) locations and, in any case, much closer than locations computed by currently practiced methods. Therefore, the proposed method may effectively be used as a primary computational algorithm for implementing a nationwide coordinate based legal cadastre

VISIBLE ROUTES IN 3D DENSE CITY USING REINFORCEMENT LEARNING

In the last few years, the 3D GIS domain has developed rapidly, and has become increasingly accessible to different disciplines. 3D Spatial analysis of Built-up areas seems to be one of the most challenging topics in the communities currently dealing with spatial data. One of the most basic problems in spatial analysis is related to visibility computation in such an environment. Visibility calculation methods aim to identify the parts visible from a single point, or multiple points, of objects in the environment. In this work, we present a unique method combining visibility analysis in 3D environments with dynamic motion planning algorithm, named Visibility Velocity Obstacles (VVO) with Markov process defined as spatial visibility analysis for routes in 3D dense city environment. Based on our VVO analysis, we use Reinforcement Learning (RL) method in order to find an optimal action policy in dense 3D city environment described as Markov decision process, navigating in the most visible routes. As far as we know, we present for the first time a Reinforcement Learning (RL) solution to the visibility analysis in 3D dense environment problem, generating a sequence of viewpoints that allows an optimal visibility in different routes in urban city. Our analysis is based on fast and unique solution for visibility boundaries, formulating the problem with RL methods.</p

PYRAMIDAL APPROACH TOWARD MERGING TOPOGRAPHIC DATA FROM DIFFERENT DTM DATASETS

ABSTRACT Nowadays DTM databases, which describe terrain relief, are among the main interactions between data acquisition and a wide area of applications. One of the main problems in this discipline is data merging, which involves integrating data from different sets. Various factors cause global-systematic errors as well as local-random ones, which reflect on a different scale of spatial geometric and radiometric differences. Consequently, the required integration process yields the merging of geo-spatial datasets consisting of different resolution, accuracy, datum, orientation, and level of detailing. This paper describes a new approach to merging datasets, in which a careful examination, investigation and eventually an appropriate solution is given. The idea is to implement a hierarchical solution of pyramidal approach, in which local geometric discrepancies are monitored and prevented. The solution for the dataset matching procedure given here suggests the implementation of two working levels of topographic zoning -global and local. The suggested procedure is as follows: zonal division of the whole datasets area into patches, in which a local registration is extracted for each; sub-zonal division, in which an accurate &apos;local&apos; ICP matching process is achieved while using the local extracted corresponding registration values. This new approach has good results for DTM datasets merging, therefore achieving a singular, unified and spatial continuous surface representation of the terrain relief

IMPLEMENTING SIFT AND BI-TRIANGULAR PLANE TRANSFORMATION FOR INTEGRATING DIGITAL TERRAIN MODELS

Since their inception in the middle of the twentieth century, Digital Terrain Models (DTMs) have played an important role in many fields and applications that are used by geospatial professionals, ranging from commercial companies to government agencies. Thus, both the scientific community and the industry have introduced many methods and technologies for DTM generation and data handling. These resulted in a high volume and variety of DTM databases, each having different coverage and data-characteristics, such as accuracy, resolution, level-of-detail &ndash; amongst others. These various factors can cause a dilemma for scientists, mappers, and engineers that now have to choose a DTM to work with, let alone if several of these representations exist for a specified area. Traditionally, researchers tackled this problem by using only one DTM (e.g., the most accurate or detailed one), and only rarely tried to implement data fusion approaches, combining several DTMs into one cohesive unit. Although to some extent this was successful in reducing errors and improving the overall integrated DTM accuracy, two prominent problems are still scarcely addressed. The first is that the horizontal datum distortions and discrepancies between the DTMs are mostly ignored, with only the height dimension taken into account, even though in most cases these are evident. The second is that most approaches operate on a global scale, and thus do not address the more localized variations and discrepancies that are presented in the different DTMs. Both problems affect the resulting integrated DTM quality, which retains these unresolved distortions and discrepancies, resulting in a representation that is to some extent inferior and ambiguous. In order to tackle this, we propose an image based fusion approach: using the SIFT algorithm for matching and registration of the different representations, alongside localized morphing. Implementing the proposed approach and algorithms on various DTMs, the results are promising, with the capacity correctly geospatially align the DTMs, thus reducing the mean height difference variance between the databases to close to zero, as well as reducing the standard deviation between them by more than 30&thinsp;%

Global bundle adjustment with variable orientation point distance for precise mars express orbit reconstruction

The photogrammetric bundle adjustment of line scanner image data requires a precise description of the time-dependent image orientation. For this task exterior orientation parameters of discrete points are used to model position and viewing direction of a camera trajectory via polynomials. This paper investigates the influence of the distance between these orientation points on the quality of trajectory modeling. A new method adapts the distance along the trajectory to the available image information. Compared to a constant distance as used previously, a better reconstruction of the exterior orientation is possible, especially when image quality changes within a strip. In our research we use image strips of the High Resolution Stereo Camera (HRSC), taken to map the Martian surface. Several experiments on the global image data set have been carried out to investigate how the bundle adjustment improves the image orientation, if the new method is employed. For evaluation the forward intersection errors of 3D points derived from HRSC images, as well as their remaining height differences to the MOLA DTM are used. In 13.5 % (515 of 3,828) of the image strips, taken during this ongoing mission over the last 12 years, high frequency image distortions were found. Bundle adjustment with a constant orientation point distance was able to reconstruct the orbit in 239 (46.4 %) cases. A variable orientation point distance increased this number to 507 (98.6 %).German Federal Ministry for Economic Affairs and Energy (BMWi)German Aerospace Center (DLR)/50 QM 130