个人信息Personal Information
学历:博士研究生毕业
学位:工学博士学位
毕业院校:北方交通大学
所在单位:地球科学与工程学院
报考该导师研究生的方式
欢迎你报考朱庆老师的研究生,报考有以下方式:
1、参加西南交通大学暑期夏令营活动,提交导师意向时,选择朱庆老师,你的所有申请信息将发送给朱庆老师,老师看到后将和你取得联系,点击此处参加夏令营活动
2、如果你能获得所在学校的推免生资格,欢迎通过推免方式申请朱庆老师研究生,可以通过系统的推免生预报名系统提交申请,并选择意向导师为朱庆老师,老师看到信息后将和你取得联系,点击此处推免生预报名
3、参加全国硕士研究生统一招生考试报考朱庆老师招收的专业和方向,进入复试后提交导师意向时选择朱庆老师。
4、如果你有兴趣攻读朱庆老师博士研究生,可以通过申请考核或者统一招考等方式报考该导师博士研究生。
学术著作
Filter by type:
- 全部
- GIS
- 摄影测量
- 书的章节
- 专著
Reliable spatial relationship constrained feature point matching of oblique aerial images
Abstract
This paper proposes a reliable feature point matching method for oblique images using various spatial relationships and geometrical information for the problems resulted by the large view point changes, the image deformations, blurring, and other factors. Three spatial constraints are incorporated to filter possible outliers, including a cyclic angular ordering constraint, a local position constraint, and a neighborhood conserving constraint. Other ancillary geometric information, which includes the initial exterior orientation parameters that are obtained from the platform parameters and a rough DEM, are used to transform the oblique images geometrically and reduce the perspective deformations. Experiment results revealed that the proposed method is superior to the standard SIFT regarding both precision and correct matches using images obtained by the SWDC-5 system.
摘要
飞行器航路前方的“威胁态势图”
面向飞行器导航需求,针对传统空地环境警告信息繁杂导致情境意识薄弱和决策时间长等瓶颈问题,建立了机场环境威胁态势信息在语义空间的统一表示模型,提出了对多源、多尺度、多种分布类型的机场空地环境信息在语义空间的统一建模与动态更新方法,实现了从实时接入的动态观测数据中深度搜索威胁态势信息,并达到信息快速组织与检索的目的。从林芝机场的数据建模和实验结果表明,该方法能精准、高效的建立面向飞行器导航应用的动态机场环境威胁态势图。
摘要
利用灾后机载激光扫描点云的地震损毁房屋检测方法主要针对平面屋顶房屋,从局部分析屋顶的平面特征,导致只能有效检测屋顶严重破碎的损毁房屋。为此本文提出了一种等高线簇相似分析的地震损毁房屋检测方法,充分挖掘房屋等高线簇蕴含的房屋表面形状丰富的二维和三维信息,利用等高线簇形状相似度的归一化信息熵从整体上综合描述损毁房屋的损毁特征,并利用最大熵模型自动检测损毁房屋。采用2010年4月 El Mayor‐Cucapah地震断裂带激光点云数据进行了试验,证明本文提出的方法能快速、准确、可靠地检测损毁房屋。
摘要
针对公共安全应急响应中支持推理、挖掘和关联分析的地理视频建模难题,提出了一种显式表达视频变化的多层次地理视频语义模型,并用UML图进行描述.该模型的特点是:改变了传统视频流整体语义描述方法,通过面向变化的三域(特征域-行为过程域-事件域)定义地理视频语义的层次结构和数据的层次表达;在各层次语义描述中将地理环境语义与视频内容语义有机结合,支持多地理视频数据的关联表示.以公共安全事件监控视频为例阐明了模型的实用性和有效性.
摘要
为兼顾时空索引方法的空间利用率、时间效率和查询种类,提出了一种新的轨迹数据索引方法-HBSTR树.其基本思想是:轨迹采样点以轨迹节点的形式成组集中管理,哈希表用于维护移动目标的最新轨迹节点,轨迹节点满后作为叶节点插入时空R 树,另外采用B 树对轨迹节点构建一维索引,既有利于提升索引创建效率,又同时满足时空条件搜索和特定目标轨迹搜索等多种查询类型.为提升时空查询效率,提出了新的时空R 树评价指标和节点选择子算法改进时空R 树插入算法,同时提出了一种时空R树的数据库存储方案.试验结果表明,HBSTR 树在创建效率、查询效率和支持查询类型等方面综合性能优于现有方法,支持大规模实时轨迹数据库的动态更新和高效访问.
摘要
建筑信息模型(BIM)与地理信息系统(GIS)集成,不仅使得精细化的三维模型得到极大重用,同时两者的数据集成和共享可实现从几何到物理和功能特性的多尺度综合表达,已经成为新一代数字城市三维建模的关键途径之一。本文选取典型的BIM模型数据格式(RVT),提出语义约束的RVT模型到CityGML模型的转换方法,以BIM模型丰富的语义信息为约束实现几何简化及转换,同时实现了几何部件与语义信息的一一映射及语义输出,并以建筑模型、暖通、桥梁模型为例进行了验证。
Automatic topology derivation from IFC building model for in-door intelligent navigation
摘要
With the goal to achieve an accuracy navigation within the building environment, it is critical to explore a feasible way for building the connectivity relationships among 3D geographical features called in-building topology network. Traditional topology construction approaches for indoor space always based on 2D maps or pure geometry model, which remained information insufficient problem. Especially, an intelligent navigation for different applications depends mainly on the precise geometry and semantics of the navigation network. The trouble caused by existed topology construction approaches can be smoothed by employing IFC building model which contains detailed semantic and geometric information. In this paper, we present a method which combined a straight media axis transformation algorithm (S-MAT) with IFC building model to reconstruct indoor geometric topology network. This derived topology aimed at facilitating the decision making for different in-building navigation. In this work, we describe a multi-step deviation process including semantic cleaning, walkable features extraction, Multi-Storey 2D Mapping and S-MAT implementation to automatically generate topography information from existing indoor building model data given in IFC.
Multi-level indoor path planning method
摘要
Indoor navigation is increasingly widespread in complex indoor environments, and indoor path planning is the most important part of indoor navigation. Path planning generally refers to finding the most suitable path connecting two locations, while avoiding collision with obstacles. However, it is a fundamental problem, especially for 3D complex building model. A common way to solve the issue in some applications has been approached in a number of relevant literature, which primarily operates on 2D drawings or building layouts, possibly with few attached attributes for obstacles. Although several digital building models in the format of 3D CAD have been used for path planning, they usually contain only geometric information while losing abundant semantic information of building components (e.g. types and attributes of building components and their simple relationships). Therefore, it becomes important to develop a reliable method that can enhance application of path planning by combining both geometric and semantic information of building components. This paper introduces a method that support 3D indoor path planning with semantic information.
A task-oriented disaster information correlation method
摘要
With the rapid development of sensor networks and Earth observation technology, a large quantity of disaster-related data is available, such as remotely sensed data, historic data, case data, simulated data, and disaster products. However, the efficiency of current data management and service systems has become increasingly difficult due to the task variety and heterogeneous data. For emergency task-oriented applications, the data searches primarily rely on artificial experience based on simple metadata indices, the high time consumption and low accuracy of which cannot satisfy the speed and veracity requirements for disaster products. In this paper, a task-oriented correlation method is proposed for efficient disaster data management and intelligent service with the objectives of 1) putting forward disaster task ontology and data ontology to unify the different semantics of multi-source information, 2) identifying the semantic mapping from emergency tasks to multiple data sources on the basis of uniform description in 1), and 3) linking task-related data automatically and calculating the correlation between each data set and a certain task. The method goes beyond traditional static management of disaster data and establishes a basis for intelligent retrieval and active dissemination of disaster information. The case study presented in this paper illustrates the use of the method on an example flood emergency relief task.
An adaptive organization method of GeoVideo data for spatio-temporal association analysis
摘要
Public security incidents have been increasingly challenging to address with their new features, including large-scale mobility, multi-stage dynamic evolution, spatio-temporal concurrency and uncertainty in the complex urban environment, which require spatio-temporal association analysis among multiple regional video data for global cognition. However, the existing video data organizational methods that view video as a property of the spatial object or position in space dissever the spatio-temporal relationship of scattered video shots captured from multiple video channels, limit the query functions on interactive retrieval between a camera and its video clips and hinder the comprehensive management of event-related scattered video shots. GeoVideo, which maps video frames onto a geographic space, is a new approach to represent the geographic world, promote security monitoring in a spatial perspective and provide a highly feasible solution to this problem. This paper analyzes the large-scale personnel mobility in public safety events and proposes a multi-level, event-related organization method with massive GeoVideo data by spatio-temporal trajectory. This paper designs a unified object identify(ID) structure to implicitly store the spatio-temporal relationship of scattered video clips and support the distributed storage management of massive cases. Finally, the validity and feasibility of this method are demonstrated through suspect tracking experiments.
An integrated virtual geographic environmental simulation framework: a case study of flood disaster simulation
摘要
Dynamic flood disaster simulation is an emerging and promising technology significantly useful in urban planning, risk assessment, and integrated decision support systems. It is still an important issue to integrate the large assets such as dynamic observational data, numerical flood simulation models, geographic information technologies, and computing resources into a unified framework. For the intended end user, it is also a holistic solution to create computer interpretable representations and gain insightful understanding of the dynamic disaster processes, the complex impacts, and interactions of disaster factors. In particular, it is still difficult to access and join harmonized data, processing algorithms, and models that are provided by different environmental information infrastructures. In this paper, we demonstrate a virtual geographic environments-based integrated environmental simulation framework for flood disaster management based on the notion of interlinked resources, which is capable of automated accumulating and manipulating of sensor data, creating dynamic geo-analysis and three-dimensional visualizations of ongoing geo-process, and updating the contents of simulation models representing the real environment. The prototype system is evaluated by applying it as a proof of concept to integrate in situ weather observations, numerical weather and flood disaster simulation models, visualization, and analysis of the real time flood event. Case applications indicate that the developed framework can be adopted for use by decision-makers for short-term planning and control since the resulting simulation and visualization are completely based on the latest status of environment.
An adaptive surface filter for airborne laser scanning point clouds by means of regularization and bending energy
摘要
Descriptions of the bending energy and the transformed compensation value generated during interpolation of the corresponding raster surface. (a) The interpolated raster surface, (b) the generated bending energy as a by-product of the TPS interpolation and (c) the transformed bend_gain by piece-wise linear interpolation from the bending energy raster given a upper bound of 0.3 m. The dashed curves in (a) and (b) represent the same ridge.
The filtering of point clouds is a ubiquitous task in the processing of airborne laser scanning (ALS) data; however, such filtering processes are difficult because of the complex configuration of the terrain features. The classical filtering algorithms rely on the cautious tuning of parameters to handle various landforms. To address the challenge posed by the bundling of different terrain features into a single dataset and to surmount the sensitivity of the parameters, in this study, we propose an adaptive surface filter (ASF) for the classification of ALS point clouds. Based on the principle that the threshold should vary in accordance to the terrain smoothness, the ASF embeds bending energy, which quantitatively depicts the local terrain structure to self-adapt the filter threshold automatically. The ASF employs a step factor to control the data pyramid scheme in which the processing window sizes are reduced progressively, and the ASF gradually interpolates thin plate spline surfaces toward the ground with regularization to handle noise. Using the progressive densification strategy, regularization and self-adaption, both performance improvement and resilience to parameter tuning are achieved. When tested against the benchmark datasets provided by ISPRS, the ASF performs the best in comparison with all other filtering methods, yielding an average total error of 2.85% when optimized and 3.67% when using the same parameter set.
Real-time control of human actions using inertial sensors
Abstract
Our study proposes a new local model to accurately control an avatar using six inertial sensors in real-time. Creating such a system to assist interactive control of a full-body avatar is challenging because control signals from our performance interfaces are usually inadequate to completely determine the whole body movement of human actors. We use a pre-captured motion database to construct a group of local regression models, which are used along with the control signals to synthesize whole body human movement. By synthesizing a variety of human movements based on actors’ control in real-time, this study verifies the effectiveness of the proposed system. Compared with the previous models, our proposed model can synthesize more accurate results. Our system is suitable for common use because it is much cheaper than commercial motion capture systems.
A Hybrid Spatio-Temporal Data Indexing Method for Trajectory Databases
Abstract
In recent years, there has been tremendous growth in the field of indoor and outdoor positioning sensors continuously producing huge volumes of trajectory data that has been used in many fields such as location-based services or location intelligence. Trajectory data is massively increased and semantically complicated, which poses a great challenge on spatio-temporal data indexing. This paper proposes a spatio-temporal data indexing method, named HBSTR-tree, which is a hybrid index structure comprising spatio-temporal R-tree, B*-tree and Hash table. To improve the index generation efficiency, rather than directly inserting trajectory points, we group consecutive trajectory points as nodes according to their spatio-temporal semantics and then insert them into spatio-temporal R-tree as leaf nodes. Hash table is used to manage the latest leaf nodes to reduce the frequency of insertion. A new spatio-temporal interval criterion and a new node-choosing sub-algorithm are also proposed to optimize spatio-temporal R-tree structures. In addition, a B*-tree sub-index of leaf nodes is built to query the trajectories of targeted objects efficiently. Furthermore, a database storage scheme based on a NoSQL-type DBMS is also proposed for the purpose of cloud storage. Experimental results prove that HBSTR-tree outperforms TB*-tree in some aspects such as generation efficiency, query performance and query type.
A GIS database engine for linking calculation and storage
Abstract
Abstract
三维GIS 是当今乃至未来GIS 技术的主要标志性内容之一,它突破了空间信息在二维地图平面中单调表现 的束缚,为各行各业以及人们的日常生活提供了更有效的辅助决策支持。本文重点介绍了三维GIS 的数据模型、 数据库管理和可视化分析等关键技术及其研究进展,并以武汉市为例展示了三维GIS 对城市立体空间的整体表 达,为大城市、全市域的三维数字城市建设奠定了基础,最后探讨了在智慧城市建设与城市安全中三维GIS将发挥 日益重要的时空信息承载引擎与空间智能技术支撑作用。
Abstract
针对传统Hough变换用于直线检测存在的问题进行了细致的分析和归纳总结,在此基础上,提出一种结合边缘编组的Hough变换直线提取算法。该算法首先采用基于8邻域的边缘跟踪算法对Canny算子检测得到的边缘点进行编组;然后对每一个边缘组分别进行Hough变换,单独确定Hough变换原点和参数的取值范围。Hough变换过程中,采用迭代的“投票”方式,每次确定单一峰值点并删除对应像素。实验证明,该算法原理简单,能有效解决传统Hough变换存在的精度不高、计算复杂等问题。同时该算法具有较强的鲁棒性,可以有效处理不同类型的影像数据,适用于并行处理。
Abstract
以“4·20”芦山7.0级强烈地震中应急测绘保障为例,系统分析了目前应急测绘保障工作的机制,以及数据获取、传输、处理、发布以及应急测绘数据共享多个环节中存在的突出问题,提出了一种新的应急测绘保障体系架构和任务驱动的聚焦服务机制。
Abstract
基于三维建筑空间表达充分结合建筑防火专题语义信息建立了面向建筑物内部空间划分与通达性分析的一体化语义描述并结合防火部件层次的动态特征发展面向室内火灾动态疏散过程的三维建筑信息模型从而辅助火灾应急疏散的三维空间逃生分析 基于实验构建的三维建筑信息模型及其基于语义的动态联通网络证明了其在室内火灾动态疏散中的特殊价值
Abstract
为实现大规模地形景观和精细工程设施模型在三维GIS中的无缝集成管理,并支持工程设施全生命周期的共享应用,提出了一种可根据设计参数自动建立复杂设施三维模型并交互式编辑修改的方法,扩展了三维GIS数据模型,实现了三维几何模型与其参数信息的有机集成与同步更新,并以桥梁模型的构建为例验证了该方法的可行性和有效性。
Abstract
近年来,建筑信息模型(BIM)与地理信息系统(GIS)的集成应用越来越广泛且深入,不同专业领域通过简单模型转换实现信息交互的方法由于只保留了少量的语义信息从而导致了应用的分散和独立,局限性十分明显.IFC和CityGML分别为BIM和GIS领域内通用的数据模型标准,两者之间的几何和语义信息共享将为BIM和GIS的集成奠定基础.本文基于IFC和CityGML标准,提出IFC几何要素过滤方法以及IFC到CityGML的语义映射规则,为IFC与CityGML建筑模型的几何、语义信息互操作提供一种通用手段,并通过实例进行了验证.
Abstract
针对三维建筑物屋顶和立面目标的自动提取难题提出了一种利用倾斜影像生成的像素高度图来识别和提取三维建筑物目标的方法根据高度图的梯度特征提取垂直立面目标根据高度图的最大熵阈值特征提取屋顶目标 采用多角度面阵数字航空相机获取的倾斜影像数据进行实验验证了本文方法的正确性与有效性
Abstract
多角度倾斜相机已经成为三维数字城市建设的主要数据获取手段。针对倾斜摄影测量特点,面向海量影像集成处理需求,综合考虑相机成像模型以及影像关联关系,设计与实现了一种大规模倾斜影像数据管理工具,提供了工程管理信息存储、倾斜影像分组浏览、地面覆盖范围计算、目标快速检索等功能。应用实验证明该管理工具能够满足倾斜摄影测量工程管理的实际需求,有效提高了多模式海量影像数据的检索效率。
Abstract
作为点云数据处理的关键步骤,点云数据配准的结果直接影响后续数据处理的精度.基于人工标靶和ICP思想的传统配准方法存在受环境影响、初始条件限制以及特征点提取困难等问题.针对传统地面激光扫描点云数据的高精度配准方法主要依赖人工标靶和特征点选取等局限,提出了一种改进的粒子群优化算法,以法向量叉积代数和最小作为适应度函数,对相邻点云重叠区域内的所有数据进行高效的全局搜索,在选取最佳配准点的基础上实现了散乱点云的精确配准.通过对多站扫描的高陡边坡岩体点云数据进行整体配准,并与ICP等经典算法进行对比实验,结果验证了本方法的可行性、有效性和稳定性,可以有效解决配准过程中标靶或同名特征点不易寻找的问题.
Abstract
商业中心、交通枢纽、医院、停车场等复杂室内及地下空间的安全管理与应急响应对室内外无缝导航与位置服务的需求日益迫切,提出了一种室内位置信息模型,扩展了OGC标准CityGML和IndoorGML中的位置信息描述,提供了描述室内相对位置和室内绝对位置的本体,介绍了一种针对三维建筑物模型的室内空间自动提取方法,为智能位置服务奠定了重要基础。
Abstract
传统基于“图层付象”的组织方法,没有考虑三维城市模型的不同内容以及不同细节层次的粒度差 异,导致在网络环境下的传输效率低,难以满足多用户并发访问的流畅可视化。深入分析了大范围漫游与小 范围聚焦的用户体验特点,通过元数据统筹管理和对象离散化,即时响应用户请求,减少无效数据传输,保证 了多用户并发环境下的高效调度和浏览。针对模型LoI)和分解的对象,设计了结构统一的对象ID,隐式存储 关联关系并支持分布式模型存储管理。以分布式数据库MongoDB为平台进行实验,验证了本文方法的可行 性和有效性。
An integrated geospatial information service system for disaster management in China
The task-oriented FSM of the IDISS
Abstract
The Chinese Government and citizens face enormous challenges of disaster management as widespread devastation, economic damages, and loss of human lives caused by increasing natural disasters. Disaster management requires a complicated iterative process that includes disaster monitoring, early detection, forecasting, loss assessment, and efficient analysis of disaster reduction. Each task typically involves the use of technologists and multiple geospatial information resources, including sensors, data sources, models, geo-tools, software packages, and computing resources. However, most existing disaster management systems operate in a typical passive data-centric mode, where resources cannot be fully utilized. This impediment is partially being addressed by the increasingly complex application requirements and the growing availability of diverse resources. In this paper, we summarize and analyze the practical problems experienced by the National Disaster Reduction Application System of China. To address the issues of data-centric, centralized, isolated solutions, we propose a novel Focusing Service Mechanism, which is capable of scheduling and allocating for optimum utilization of multiple resources, to dynamically generate collaborative and on-demand disaster information services. We also demonstrate the design and implementation of the Integrated Disaster Information Service System (IDISS). Through the service strategies of Virtualizing, Wrapping, and Integrating, disaster-related resources are constructed into services in the IDISS. These services are dynamically aggregated into focusing service chains, for diverse disaster management tasks. Actual applications illustrate that the proposed service system can significantly improve the capability of disaster management in China.
Virtual Geographic Environments (VGEs): A New Generation of Geographic Analysis Tool
Structure of a complete VGE
Abstract
Abstract Virtual Geographic Environments (VGEs) are proposed as a new generation of geographic analysis tool to contribute to human understanding of the geographic world and assist in solving geographic problems at a deeper level. The development of VGEs is focused on meeting the three scientific requirements of Geographic Information Science (GIScience) — multi-dimensional visualization, dynamic phenomenon simulation, and public participation. To provide a clearer image that improves user understanding of VGEs and to contribute to future scientific development, this article reviews several aspects of VGEs. First, the evolutionary process from maps to previous GISystems and then to VGEs is illustrated, with a particular focus on the reasons VGEs were created. Then, extended from the conceptual framework and the components of a complete VGE, three use cases are identified that together encompass the current state of VGEs at different application levels: 1) a tool for geo-object-based multi-dimensional spatial analysis and multi-channel interaction, 2) a platform for geo-process-based simulation of dynamic geographic phenomena, and 3) a workspace for multi-participant-based collaborative geographic experiments. Based on the above analysis, the differences between VGEs and other similar platforms are discussed to draw their clear boundaries. Finally, a short summary of the limitations of current VGEs is given, and future directions are proposed to facilitate ongoing progress toward forming a comprehensive version of VGEs.
Consistency Maintenance in Collaborative CAD Systems
Abstract
The difference between real-time CSCW systems and traditional distributed systems is that the former one is supposed to provide a natural, free and fast interface for multi-user interaction. However, the typical multi-user interaction method applied in 3D CAD systems is strict consistency maintenance, such as locking mechanism and floor control, which may generate a stagnant and unnatural interface. This paper proposes a 3D semanticbased Operational transformation (OT) to support less constrained multi-user interaction and to achieve consistency in collaborative CAD editing (co-CAD) systems, and it can be used in many collaborative CAD/CAM industries.
A flexible method for zoom lens calibration and modeling using a planar checkerboard
Abstract
This paper presents a flexible method for zoom lens calibration and modeling using a planar checkerboard. The method includes the following four steps. First, the principal point of the zoom-lens camera is determined by a focus-of-expansion approach. Second, the infl uences of focus changes on the principal distance are modeled by a scale parameter. Third, checkerboard images taken at varying object distances with convergent image geometry are used for camera calibration. Finally, the variations of the calibration parameters with respect to the various zoom and focus settings are modeled using polynomials. Three different types of lens are examined in this study. Experimental analyses show that high precision calibration results can be expected from the developed approach. The relative measurement accuracy (accuracy normalized with object distance) using the calibrated zoom-lens camera model ranges from 1:5 000 to 1:25 000. The developed method is of significance to facilitate the use of zoom-lens camera systems in various applications such as robotic exploration, hazard monitoring, traffic monitoring, and security surveillance.
A semantics-constrained profiling approach to complex 3D city models
Abstract
A complex 3D city model contains detailed descriptions of both its appearance and its internal structure, including architectural components. Because of the topological complexity and the large volumes of data in such models, profiling is an effective method to present the internal structure, the distributed characteristics, and the hierarchical relationships of the model to provide intuitive visual information to the viewer and to reveal the relationships between the elements of the model and the whole. However, with commonly used boundary descriptions, it is difficult to comprehensively preserve the consistency of three-dimensional profiling using existing algorithms based on geometric constraints. This paper proposes a novel semantics-constrained profiling approach to ensure the consistency of the geometrical, topological, and semantic relationships when profiling complex 3D city models. The approach transforms the 3D model’s boundary description, defined using the CityGML standard of the Open Geospatial Consortium (OGC), into a set of unified volumetric features described as solids. This approach is characterized by (1) the use of the concepts of semantic relationships, virtual edges, and virtual surfaces; (2) the semantic analysis of 3D models and the extraction of volumetric features as basic geometric analytic units; (3) the completion of structural connectivity and space coverage for each volumetric feature, which is represented as a solid model; and (4) the use of a reliable 3D Boolean operation for efficient and accurate profiling. A typical detailed 3D museum model is used as an example to illustrate the profiling principle, and the experimental results demonstrate the correctness and effectiveness of this approach.
Integration method of TINs and Grids for multi-resolution surface modeling
Abstract
Highly detailed surface models and their real-time applications are increasingly popular in architecture, construction and other design and engineering fields. However, new and related problems have emerged concerning the efficient management of the resulting large datasets and the seamless integration of heterogeneous data. Moreover, the increasingly common requirements of local high-fidelity modeling combined with large-scale landscapes lead to difficulty in the seamless multi-resolution representation of hybrid triangulated irregular networks (TINs) and Grids. This paper presents a hybrid data structure with high-efficiency and a related organizational method for the seamless integration of multi-resolution models. This approach is characterized by (1) a self-adaptive algorithm for feature-preserving surface partitioning, (2) an efficient hybrid index structure for combined Grid and TIN surfaces, and (3) a view-dependent scheduling strategy with access to Grids of necessary resolution, giving priority to the dynamic loading of TINs. Experiments using typical real design datasets of highway constructions are able to achieve accuracy-preserved and real-time availability of results that prove the validity and efficiency of this approach.
Real-Time GIS and its Application in Indoor Fire Disaster
Abstract
GIS is now faced with the challenge how to represent and understand the fast-paced, constantly changing world, given increasingly real-time data including readings from large-scale distributed sensors and large quantities of simulation data generated by computation models. Traditional static GIS pays more attention to representing historic data and Temporal GIS(TGIS) only treats time as a occasional but not critical factor and can't support the explicit change representation. In this context, Real-time GIS(RGIS) is put forward and its data model becomes a key problem how to make an appropriate abstraction over the rapid changes implied in real-time data stream and establish the general interaction relationship between them. The paper proposes a spatiotemporal changeoriented three-domain model with the emphasis on the semantic interaction relationship of object, event and process. Based on this model, a semantic enrichment method for multi-scale spatiotemporal change is put forward. Finally, as a RGIS application, indoor fire disaster simulation is illustrated and proves the validity of the proposed model.
Real-Time GIS and its Application in Indoor Fire Disaster
Abstract
Aiming at the increasing requirements of seamless indoor and outdoor navigation and location service, a Chinese standard of Multidimensional Indoor Location Information Model is being developed, which defines ontology of indoor location. The model is complementary to 3D concepts like CityGML and IndoorGML. The goal of the model is to provide an exchange GML-based format for location needed for indoor routing and navigation. An elaborated user requirements analysis and investigation of state-of-the-art technology in expressing indoor location at home and abroad was completed to identify the manner humans specify location. The ultimate goal is to provide an ontology that will allow absolute and relative specification of location such as "in room 321", "on the second floor", as well as, "two meters from the second window", "12 steps from the door"
Problems In Indoor Mapping and Modelling
Abstract
Research in support of indoor mapping and modelling (IMM) has been active for over thirty years. This research has come in the form of As-Built surveys, Data structuring, Visualisation techniques, Navigation models and so forth. Much of this research is founded on advancements in photogrammetry, computer vision and image analysis, computer graphics, robotics, laser scanning and many others. While IMM used to be the privy of engineers, planners, consultants, contractors, and designers, this is no longer the case as commercial enterprises and individuals are also beginning to apply indoor models in their business process and applications. There are three main reasons for this. Firstly, the last two decades have seen greater use of spatial information by enterprises and the public. Secondly, IMM has been complimented by advancements in mobile computing and internet communications, making it easier than ever to access and interact with spatial information. Thirdly, indoor modelling has been advanced geometrically and semantically, opening doors for developing user-oriented, context-aware applications. This reshaping of the public’s attitude and expectations with regards to spatial information has realised new applications and spurred demand for indoor models and the tools to use them. This paper examines the present state of IMM and considers the research areas that deserve attention in the future. In particular the paper considers problems in IMM that are relevant to commercial enterprises and the general public, groups this paper expects will emerge as the greatest users IMM. The subject of indoor modelling and mapping is discussed here in terms of Acquisitions and Sensors, Data Structures and Modelling, Visualisation, Applications, Legal Issues and Standards. Problems are discussed in terms of those that exist and those that are emerging. Existing problems are those that are currently being researched. Emerging problems are those problems or demands that are expected to arise because of social changes, technological advancements, or commercial interests. The motivation of this work is to define a set of research problems that are either being investigated or should be investigated. These will hopefully provide a framework for assessing progress and advances in indoor modelling. The framework will be developed in the form of a problem matrix, detailing existing and emerging problems, their solutions and present best practices. Once the framework is complete it will be published online so that the IMM community can discuss and modify it as necessary. When the framework has reached a steady state an empirical benchmark will be provided to test solutions to posed problems. A yearly evaluation of the problem matrix will follow, the results of which will be published.
Abstract
洪涝灾害损失评估是防洪减灾科学决策的基础,其中洪水淹没分析是准确提取洪水淹没范围、水深及历时等灾情信息的关键。洪水淹没分析主要采用数字高程模型数据(DEM),由于DEM的格网分辨率与高程精度有限,常出现异常的洼地或平地,导致难以可靠计算每个格网点处的流向,而传统方法采用统一高程的洼地填平处理又使得容易出现洪水演进过程中复杂起伏地形水面爬坡以及平坦地形水位断流的问题,为此本文提出了顾及流速和淹没时间的自适应逐点水位修正算法,即在DEM坡面流模拟的基础上,根据洪水水流特性、地形、边界变化、水流速度、水深变化以及淹没点的淹没时间,计算水位修正值,对洪水演进过程中每个格网点的水位进行修正,采用多种地貌类型的DEM数据进行实验,证明洪水演进的淹没范围、水深及历时的实时计算结果准确可靠,可为快速评估灾害损失与防洪决策服务提供更为科学的依据。
Abstract
针对多视影像密集匹配中的遮挡问题,本文提出一种像方特征点和物方平面元集成的多视影像密集匹配方法。该方法利用规则格网划分的空间平面作为基础,对两种不同形式的匹配基元进行集成。首先通过多视影像上特征点投影范围和平面元位置相互制约,实现特征点和平面元的同时匹配,为后续匹配提供初始可靠的DSM;然后在此基础上,结合铅垂线轨迹法和基于高度遮挡检测方法对平面上规则分布的平面元进行匹配,加密初始匹配结果。最后通过对某地区四张UCX数字航空影像的匹配试验,验证了本文方法的有效性。
Abstract
针对直线匹配可靠性问题,提出了一种基于三角网约束的立体影像线特征多级匹配方法。首先采用SURF算法匹配一部分可靠的种子点,利用这些种子点约束其邻域内的直线匹配;然后,将这些种子点构建三角网,利用三角网约束直线匹配的搜索范围,进行三角网约束下的线 线匹配;再次,在三角网的约束下,进行线 面匹配。为了提高直线匹配相似性测度的可区分性,提出了基于移动窗口的自适应直线相关方法,不仅在表面非连续区域能取得可靠匹配,在纹理缺乏区域也能取得可靠匹配结果。利用具有典型纹理特征的近景影像和航空影像进行了试验分析,结果表明,本方法能获取可靠的直线匹配结果。
Abstract
现有"像素级"的真正射影像纠正方法由于没有充分考虑地物特征和影像像素间的关联关系,导致对DSM分辨率十分敏感,难以保持地物轮廓边缘特征的准确性和纹理结构的完整性,遮挡恢复和阴影补偿难以自动化处理,需要大量人工干预等问题。提出了一种面向对象的真正射影像纠正方法,主要内容包括:①物方和像方对象的定义及语义描述;②像方对象的全局可见性索引;③面向对象的真正射纠正和纹理优化采样。选择广东阳江地区多角度航摄影像进行了实验,结果表明,面向对象的真正射纠正方法既能保持准确的几何特征和完整的纹理结构,还能自适应地处理遮挡和阴影,为多角度高分辨率影像数据的自动化、智能化真正射纠正提供了一种有效的新途径。
Abstract
影像纹理划分表达的像方对象
真正射影像作为新一代数字影像产品,其应用需求日益广泛。随着高分辨率倾斜影像的日益可得,逐像素处理的真正射影像生产方法局限性越来越突出。为此,针对面向对象的真正射影像处理,本文提出了物方对象和像方对象的概念,并描述了两类对象间的语义关联关系,并用实例分析了其特殊价值。
Geo-information processing service composition for concurrent tasks: A QoS-aware game theory approach
Abstract
Typical characteristics of remote sensing applications are concurrent tasks, such as those found in disaster rapid response. The existing composition approach to geographical information processing service chain, searches for an optimisation solution and is what can be deemed a “selfish” way. This way leads to problems of conflict amongst concurrent tasks and decreases the performance of all service chains. In this study, a non-cooperative game-based mathematical model to analyse the competitive relationships between tasks, is proposed. A best response function is used, to assure each task maintains utility optimisation by considering composition strategies of other tasks and quantifying conflicts between tasks. Based on this, an iterative algorithm that converges to Nash equilibrium is presented, the aim being to provide good convergence and maximise the utilisation of all tasks under concurrent task conditions. Theoretical analyses and experiments showed that the newly proposed method, when compared to existing service composition methods, has better practical utility in all tasks.
An Efficient Point Cloud Management Method Based on a 3D R-Tree
Abstract
Vehicle-borne laser-scanned point clouds have become increasingly important 3D data sources in fields such as digital city modeling and emergency response management. Aiming at reducing the technical bottlenecks of management and visualization of very large point cloud data sets, this paper proposes a new spatial organization method called 3DOR-Tree, which integrates Octree and 3D R-Tree data structures. This method utilizes Octree index rapid convergence to generate R-Tree leaf nodes, which are inserted directly into the R-Tree, thus avoiding time-consuming point-by-point insertion operations. Furthermore, this paper extends the R-Tree structure to support LOD (level of detail) models. Based on the extended structure, a practical data management method is presented. Finally, an adaptive control method for LODS of point clouds is illustrated. Typical experimental results show that our method possesses quasi-real-time index construction speed, a good storage utilization rate, and efficient visualization performance.
Mathematical morphology-based generalization of complex 3D building models incorporating semantic relationships
The LoDs produced from experimental data (for each LoD: above, illustration with original material; below, illustration with pseudo material).
Abstract
A complex 3D building model contains a detailed description of both its appearance and internal structure with authentic architectural components. Because of its high complexity and huge data volumes, using a less detailed representation for the distant visual application of such a model is preferable. However, most mesh simplification algorithms cannot preserve manmade features of such models, and the existing 3D generalization algorithms are mainly proposed for regular-shaped buildings. More importantly, neither method can consistently express geometry, topological relations, and semantics in multiple discrete Levels of Details (LoDs). This paper presents a novel mathematical morphology-based algorithm that generalizes the complex 3D building model in a unified manner using the following steps: (1) semantic relationships between components, which reflect structural connectivity in the building at a certain LoD, are defined and extracted; (2) semantically connected components are merged and trivial geometric features of the components are eliminated simultaneously, with semantics associated with components then updated according to the merging; and (3) post-process is carried out to further reduce the redundancy of facets. The semantic relationships extracted ensure the proper generalization of topological relations and semantics of building components, and mathematical morphological operations implemented in the algorithm are capable of handling closed two-manifold components of various shapes. Experiments on both complex 3D building models in the classical Chinese style and prismatic 3D city models prove the effectiveness of the proposed method.
Integrated point and edge matching on poor textural images constrained by self-adaptive triangulations
Comparison of with and without edge information for the adaptive triangulations
Abstract
This paper presents an innovative image matching method for reliable and dense image matching on poor textural images, which is the integrated point and edge matching based on the self-adaptive edge-constrained triangulations. Firstly, several seed points and seed edges are obtained on the stereo images, and they are used to construct a pair of initial edge-constrained triangulations on the images. Then, points and edges are matched based on the triangle constraint and other constraints. The newly matched points and edges are inserted into the triangulations and the constrained triangulations are updated dynamically along with the matching propagation. The final results will be the final edge-constrained triangulations generated from the successfully matched points and edges. Experiments using typical space-borne, airborne, and terrestrial images with poor textures revealed that the integrated point and edge matching method based on self-adaptive triangulations is able to produce dense and reliable matching results. Moreover, from the final matched points and edges, 3D points and edges preserving the physical boundaries of objects can be further derived based on photogrammetric techniques, which is ideal for further object modeling applications.
A Multi-Level Cache Approach for Realtime Visualization of Massive 3D GIS Data
Abstract
The real-time visualization of 3D GIS at a whole city scale always faces the challenge of dynamic data loading with high-efficiency. Based on the multi-tier distributed 3D GIS framework, this paper presents a multi-level cache approach for dynamic data loading. It aims to establish in 3D GIS spatial database engine (3DGIS-SDE) the unified management mechanism of caches on three levels, including: the client memory cache (CMC) oriented to sharing application, the client file cache (CFC) organized by index, as well as the application server memory cache (ASMC) of structural consistency. With the help of the proposed optimized cache replacement policy, multi-level cache consistency maintenance as well as multithread loading model designed in the paper, the engine is able to adaptively make full use of each-level caches according to their own application properties and achieve effective coordination between them. Finally, a practical 3D GIS database based on Oracle 11g is employed for test. The experimental results prove this approach could satisfy multi-user concurrent applications of 3D visual exploration.
Abstract
针对飞行器可视导航中复杂空地环境时空要素统一精准表示的难题,本文提出了面向飞行器可视导航的复杂空地环境动态3维表示的GIS数据模型和相应的时刻数据存储结构,并用UML图进行了描述。该模型综合考虑了复杂空地环境要素多维、动态、边界模糊等特点,刻画了多维动态时空数据在空间、时间、尺度、语义四个方面的特征及其相互关系。最后,以某机场的空地环境数据的组织、分析和可视化为例,验证了该模型的实用性。
Abstract
面向大型土木工程设计,提出了一种运用WMS共享空间数据源并实现高效应用集成的工程设计应用技术体系。首先,直接针对WMS数据服务器定向开发数据获取应用,通过高效并行多线程实现空间数据的分块网络传输,同时结合本地缓存机制与网络共享,实现了一种双轨存储访问机制;其次,基于独立的应用下载与嵌入的实时线程分配,实现了远程数据的本地化模拟应用环境与分布式共享协同;再次,针对WMS数据的应用,实现了空间数据向工程数据的高精度转换与工程制图出图体系,开发了统一的全球三维可视化平台,用于直观地综合表达各种WMS数据源。
Abstract
车载激光扫描点云数据已经成为数字城市和危机管理等领域越来越重要的三维空间信息源,针对大规模点云数据高效管理的技术瓶颈,提出一种八叉树和三维R树集成的空间索引方法——3DOR树,充分利用八叉树的良好收敛性创建R树叶节点,避免逐点插入费时过程,同时R树平衡结构保证良好的数据检索效率。并还扩展R树结构生成多细节层次(LOD)点云模型,提出一种支持缓存的多细节层次点云数据组织方法。试验证明,该方法具有良好的空间利用率和空间查询效率,支持多细节层次描述能力和数据缓存机制,可应用于大规模点云数据的后处理与综合应用。
Repair and generalization of hand-made 3D building models
Abstract
Many 3D GIS applications require 3D building models with different LoD (Level of Detail) that satisfy certain quality criteria. However, because of their complexity, most detailed 3D building models available are still produced manually, which results in inevitable geometric and topological errors. These errors hinder the downstream processing of such models. And existing researches on LoD production either focus on the simplification of smooth polygonal mesh or the generalization of regular prismatic building models. The generalization of detailed 3D building models is still immature. Aiming at producing cleaned models of different LoD for existing hand-made 3D building models, this paper starts by investigating two typical modeling errors of such models, incompleteness and separation. Repair methods with reasonable assumptions of buildings are then proposed for each type of errors. The generalization method based on morphological operations is then employed, coupled with model repair, to generate error-free simplified models.
A triangulation-based hierarchical image matching method for wide-baseline images
Results of the triangulation-based affine-adaptive cross correlation: (a) a reference image with labeled study areas, (b) left image for the study area 1, (c) right image for the study area 1, (d) left image for the study area 2, and (e) right image for the study area 2.
Abstract
This paper presents a triangulation-based hierarchical image matching method for wide-baseline images. The method includes the following three steps: (a) image orientation by incorporating the SIFT algorithm with the RANSAC approach, (b) feature matching based on the self-adaptive triangle constraint, which includes point-to-point matching and subsequent point-to-area matching, and (c) triangulation constrained dense matching based on the previous matched results. Two new constraints, the triangulation-based disparity constraint and triangulation-based gradient orientation constraint, are developed to alleviate the matching ambiguity for wide-baseline images. A triangulation based affine-adaptive cross-correlation is developed to help find correct matches even in the image regions with large perspective distortions. Experiments using Mars ground wide-baseline images and terrestrial wide-baseline images revealed that the proposed method is capable of generating reliable and dense matching results for terrain mapping and surface reconstruction from the wide-baseline images.
Spatial data dynamic balancing distribution method based on the minimum spatial proximity for parallel spatial database
Abstract
Spatial data balancing distribution can evidently improve the performance of parallel spatial database in shared nothing parallel architecture. Considering spatial locality and unstructured variable length characteristics of spatial data, this paper proposes a dynamic spatial data balancing distribution method under shared nothing parallel database environment. By using Hilbert ordering code to keep spatial locality relationship between spatial objects, the presented method can fulfill spatial data static balancing distribution status, which depends on hierarchically decomposing Hilbert space-filling curve code to allocate approximately even spatial data volume to parallel nodes in distributed network. Then spatial proximity index is introduced to resolve spatial data unbalancing problem caused by spatial database dynamic updating. Through moving spatial data fragments to goal node which is the minimum spatial proximity with data moving out node, the spatial database redistributing strategy can attain dynamic data balance among all network parallel nodes. Our experimental results show that the proposed method can effectively improve parallel performance deterioration resulted from spatial data unbalancing and achieve spatial data dynamic balancing distribution in parallel spatial database.
Abstract
多细节层次表达是三维GIS的重要特征之一。为提高细节层次模型的管理效率,本文提出一种扩展多细节层次功能的三维R树索引方法,通过全局优化和三维聚类分析建立动态三维R树索引,研制了先自下而上、后自上而下全局搜索的节点选择算法和基于k-medoids聚类算法的节点分裂算法,保证节点尺寸均匀、形状规则以及重叠减少。基于良好的三维树形结构,本文扩展了传统的三维R树索引结构,实现R树索引和细节层次模型的无缝集成。为验证本文方法的有效性,通过仿真实验,结果证明了本文方法能很大程度地提升多细节层次三维城市模型数据库的空间查询效率,具有较好的应用前景和实用价值。
Abstract
三维模型多细节层次的自适应控制是三维GIS和虚拟环境等领域研究的难点问题之一,针对大规模三维城市建模需要,本文介绍了一种基于三维R树索引的多细节层次(以下简称LOD)管理方法,从叶节点层向根节点自动生成LOD模型,并设计实现了视锥体查询和LOD检索的算法。通过实验分析,证明本文的LOD定义参数能够定量调整场景复杂度,进而自适应控制三维模型可视化的细节层次,适合建筑物类型地物的LOD描述。
Abstract
针对大规模三维城市建模与数据库协同应用,设计实现了一种高效的三维GIS数据库引擎,支持基于Oracle 11g的多模式数据库管理;提出了顾及语义的三维空间数据库模型,为地上下室内外三维空间数据的一体化组织管理奠定了基础。介绍了该引擎涉及的多层次三维空间索引、多级缓存、多线程调度以及异步通信传输等关键技术,并用武汉市三维城市模型数据进行了试验分析,验证了该引擎的有效性和可靠性。
Abstract
从基本概念、应用需求和技术动态等方面就3维GIS技术的发展与演进进行了简要评述,强调了专业化与大众化两种应用对3维GIS提出的不同挑战。
GeoScope: Full 3D geospatial information system case study
Abstract
Aiming at the integrative management and comprehensive applications of large-scale 3D geospatial information covering the full 3D space of a city, this paper briefly introduces the design and implementation of a full 3D GIS platform: GeoScope, which provides a professional solution for the massive full three-dimensional geospatial data integration, management, analysis, visualization, and applications. GeoScope is characterized by: (1) extendible software architecture based on the hierarchical message bus, facilitates multimodal integrative applications of 2D GIS and 3D GIS; (2) unified 3D city models, support multiscale semantic representation of outdoor & indoor and aboveground & underground 3D objects; (3) high-efficient 3D geospatial database engine, supports integrated management of massive 3D geospatial data for real-time applications; and (4) high-performance visualization engine exploiting the massively parallel computation architecture of modern GPUs, supports real-time realistic rendering of large-scale complicated 3D geospatial environments. The successful pilot application of GeoScope is also illustrated with the 3D city models of 8494 km2 of the whole Wuhan City, the largest city in middle China.
Non-cooperative Game Based QoS-Aware Web Services Composition Approach for Concurrent Tasks
Abstract
Web services make tools which used to be merely accessible to the specialist available to all, and permitting previous manual data processing and analysis tasks to be automated. One of key problem is Web services composition in terms of Quality of Service (QoS). There are many task concurrencies, such as remote sensing image processing, in computation-intensive scientific applications. However, existing Web service optimal combination approaches are mainly focused on single tasks by using "selfish" behavior to pursue optimal solutions. This causes conflicts because many concurrent tasks are competing for limited optimal resources, and the reducing of service quality in services. Based on the best reply function of quantified task conflicts and game theory, this paper establishes a mathematical model to depict the competitive relationship between multitasks and Web service under QoS constraints and it guarantees that every task can obtain optimal utility services considering other task combination strategies. Moreover, an iterative algorithm to reach the Nash equilibrium is also proposed. Theory and experimental analysis show the approach has a fine convergence property, and can considerably enhance the actual utility of all tasks when compared with existing Web services combinatorial methods. The proposed approach provides a new path for QoS-aware Web service with optimal combinations for concurrent tasks.
Knowledge-based building reconstruction from terrestrial video sequences
Reconstruction results from extracted line and surface features, guided by the building knowledges
Abstract
The paper presents an automatic method for the reconstruction of building models from video image sequences. These videos may be recorded using a hand-held camera or a camera mounted on a moving car. Such terrestrial video sequences are economic and flexible. Presenting buildings as geometric models–rather than for instance a representation from a simple meshing of 3D points–enables one to perform a wide range of analyses. However, sparse 3D points and 3D edges do not contain topological relations. Therefore, integrating building structure knowledge into the reconstruction steps plays an important role in our method. First, some rules are applied to reasonably group the extracted features. Then, a suitable outline and normal direction are specified for each surface patch. Based on these surface patches, a hybrid model- and data-driven method is used to recover a building model from both the extracted surface patches and hypothesized parts. Using the building structure knowledge leads to a simple and fast reconstruction method, and also enables one to obtain the main structures of buildings. The results show that this method correctly sets up topological relationships between generated surface patches and also obtains reasonable structure models in occluded areas. Therefore, the reconstructed models satisfy requirements for both visualization and analysis.
Multiple close-range image matching based on a self-adaptive triangle constraint
Abstract
Reliable image matching is an essential and difficult task in digital photogrammetry and computer vision. Possible problems from geometric distortions, illumination changes, scale changes and difficult texture conditions will result in matching ambiguity, especially for close-range image matching. This paper presents a multiple close-range image matching method for surface reconstruction based on a self-adaptive triangle constraint. This method features two aspects. First, the triangles constructed from the previously matched interest points provide strong geometric constraints for the subsequent point matching combined with gradient orientation and disparity constraints. The dynamic update of the triangulation adapts automatically to the changes of image textures. Secondly, a consistency check in object space is performed to remove possible mismatches. Using three sets of actual triple overlapped close-range images for the experiment, the results revealed that the proposed method provides improved matching reliability.
An improved segmentation approach for planar surfaces from unstructured 3D point clouds
Abstract
The extraction of object features from massive unstructured point clouds with different local densities, especially in the presence of random noisy points, is not a trivial task even if that feature is a planar surface. Segmentation is the most important step in the feature extraction process. In practice, most segmentation approaches use geometrical information to segment the 3D point cloud. The features generally include the position of each point (X, Y and Z), locally estimated surface normals and residuals of best fitting surfaces; however, these features could be affected by noisy points and in consequence directly affect the segmentation results. Therefore, massive unstructured and noisy point clouds also lead to bad segmentation (over-segmentation, under-segmentation or no segmentation). While the RANSAC (random sample consensus) algorithm is effective in the presence of noise and outliers, it has two significant disadvantages, namely, its efficiency and the fact that the plane detected by RANSAC may not necessarily belong to the same object surface; that is, spurious surfaces may appear, especially in the case of parallel-gradual planar surfaces such as stairs. The innovative idea proposed in this paper is a modification for the RANSAC algorithm called Seq-NV-RANSAC. This algorithm checks the normal vector (NV) between the existing point clouds and the hypothesised RANSAC plane, which is created by three random points, under an intuitive threshold value. After extracting the first plane, this process is repeated sequentially (Seq) and automatically, until no planar surfaces can be extracted from the remaining points under the existing threshold value. This prevents the extraction of spurious surfaces, brings an improvement in quality to the computed attributes and increases the degree of automation of surface extraction. Thus the best fit is achieved for the real existing surfaces
Semantics-based 3D dynamic hierarchical house property model
Description of hierarchical levels of detail
Abstract
Aiming at the increasing critical issues of existing 2D plans and map‐based methodology for integrated management of advanced buildings and related dynamic property rights in complicated 3D built environments, a novel semantics‐based 3D dynamic house property model with hierarchical levels of detail is proposed in this paper, based on comprehensive analysis of 3D house property objects and various application requirements. This model is characterized by: (1) 3D geometric semantics: a 3D geometry hierarchy of exterior and interior of buildings is defined; (2) thematic semantics, comprehensive house property object and related property right relationships are illustrated; (3) temporal semantics, dynamic representation of house property driven by both geometric events and property right events is involved. This model facilitates comprehensive data mining to analyze spatial relationships and dynamic change of property rights in real 3D built environments and can also support the sale and lease of real estate, facility management, house planning and so on.
Quantitative analysis of discrete 3D geometrical detail levels based on perceptual metric
The comparison results of a facade (Eq represents equal interval and exp represents exponential interval)
Abstract
Aiming at the fundamental issue of optimal design of discrete levels of detail (LOD) for the visualization of complicated 3D building façades, this paper presents a new quantitative analytical method of perceptible 3D details based on perceptual metric. First, the perceptual metric is defined as the quantitative indicator of the visual perceptibility of façade details at a given viewing distance. Then, according to the human vision system, an algorithm employing 2D discrete wavelet transform and contrast sensitivity function is developed to extract the value of perceptual metric from the rendered image of the façade. Finally, a perceptual metric function is defined, based on the perceptual metric values extracted at equal interval viewing distances. The minimum detail redundancy model is then proposed for the optimal design of discrete LODs. This method provides a quantitative instruction for generating discrete LODs. The experimental results prove the effectiveness and great potential of this method.
Semantic Modeling Approach of 3D City Models and Applications in Visual Exploration
Abstract
In recent years, the necessity of the incorporation of semantic information into three-dimensional city models (3DCMs) has become a consensus in 3D GIS field. In order to provide practical support for visual applications concerned with semantics, this paper firstly presents an extended semantic model based on the CityGML standard, which was worked out for the general storage and representation of semantics. In this model, concepts like Room, Corridor and Stair are all derived from concept Space which corresponds to the concept of Room in CityGML. This extension will benefit the indoor structure representation. Geological feature is also supported by the model for the underground analysis. Next, for the promotion of semantic modeling by this model, a semi-automatic process of semantic enrichment is implemented in a data integration tool. It provides an adaptive way to link semantics with pure geometry. Finally, two typical cases of visual exploration are illustrated to prove the model's practicability in a national 3D GIS project of China. One is indoor routing, which adopts this model to extract the geometric path and thus enrich traditional semantic-enhanced navigation routine; another case is unified profiler, where semantics are intergrated in order to fill up the cross section correctly and ensure the topological and semantic consistency.
Design and implementation of 3D model database for general-purpose 3D GIS
Abstract
To improve the reusability of three-dimensional (3D) models and simplify the complexity of natural scene reconstruction, this paper presents a 3D model database for universal 3D GIS. After the introduction of its extensible function architecture, accompanied by the conclusion of implicit spatial-temporal hierarchy of models in any reconstructed scene of 3D GIS for general purpose, several key issues are discussed in detail, such as the storage and management of 3D models and related retrieval and load method, as well as the interfaces for further on-demand development. Finally, the validity and feasibility of this model database are proved through its application in the development of 3D visualization system of railway operation.
Contextual Routing and Navigation Method in Road Networks
Abstract
In this paper, a novel method, namely contextual routing and navigation, is proposed. This method is based on the author's proposed hierarchical, lane-oriented 3D road network. The key to implement contextual routing and navigation is to adopt cognition-based hierarchical routing strategy and the view-based multi-scale navigation strategy. The two strategies enable users routing on roadway centreline, carriageway or lane and provides 2D, 2.5D and 3D communicating based on user defined context. A prototype is also developed in the VGEGIS system and the experimental results have confirmed the effectiveness and efficiency of the method. The paper will provide a contribution to flexible location-based services by innovatively considering the hierarchical knowledge of the road network system and contextual visualization needs.
Texture data storage method based on hierarchical spatial index
Abstract
Aiming at the massive data organization and management of textures with various sizes for real-time rendering of large-scale 3D city models, this paper proposes a new method: a texture spatial index tree is built up based on the hierarchical spatial index of 3D geometries, and then the texture data is written into mapping files structure through depth-first and hierarchical iteration for the clustering of data blocks, which facilitates the flexible size-changed disk I/O operations. Experimental results prove such kind of storage is more compact and more effective than single file storage method, and enables the fast access of texture data.
Generalization of tiled models with curved surfaces using typification
Abstract
Especially for landmark buildings or in the context of cultural heritage documentation, highly detailed digital models are being created in many places. In some of these models, surfaces are represented by tiles which are individually modeled as solid shapes. In many applications, the high complexity of these models has to be reduced for more x efficient visualization and analysis. In our paper, we introduce an approach to derive versions at different scales from such a model through the generalization method of typification that works for curved underlying surfaces. Using the example of tiles placed on a curved roof – which occur, for example, very frequently in ancient Chinese architecture, the original set of tiles is replaced by fewer but bigger tiles while keeping a similar appearance. In the first step, the distribution of the central points of the tiles is approximated by a spline surface. This is necessary because curved roof surfaces cannot be approximated by planes at large scales. After that, the new set of tiles with less rows and/or columns is distributed along a spline surface generated from a morphing of the original surface towards a plane. The degree of morphing is dependent on the desired target scale. If the surface can be represented as a plane at the given resolution, the tiles may be converted to a bump map or a simple texture for visualization. In the final part, a perception-based method using CSF (contrast sensitivity function) is introduced to determine an appropriate LoD (level of detail) version of the model for a given viewing scenario (point of view and camera properties) at runtime.
Towards semantic 3D city modeling and visual explorations
Abstract
In recent years, the integration of semantics into 3D city models has become a consensus. The CityGML standard laid the foundation for the storage and application of semantics, which boosts the progress of semantic 3D city modeling. This paper reports an extended semantic model based on CityGML and its visual applications under the content of a three-dimensional GIS project of China. Firstly, concepts Room, Corridor and Stair are derived from concept Space which represents the similar concept of Room in CityGML. These concepts will benefit the application of indoor navigation. Geological model is also supported by this model, which enables the underground analysis. Secondly, a semi-automatic data integration tool is developed. The types of semantic concept are defined based on the Technical Specification for Three-Dimensional City Modeling of China which leads to an adaptive way to assign semantics into pure geometry. In order to better visualize the models enriched by semantics, two fundamental techniques, data reduction and selective representation are then introduced. It shows that semantics could not only help improve the performance of exploration tasks but also enhance the efficiency of spatial cognition. Finally, two exploration cases are presented, one is indoor navigation, the semantic model is used to extract the geometric path and a semantics enhanced navigation routine is used, which greatly enriches the connotation of ordinary navigation applications; the other is a unified profiler, in order to fill up the cross-section correctly, semantics are incorporated, which help ensure the topological and semantic consistency.
Spatial data declustering method considering spatial locality for parallel spatial database
Abstract
Spatial data declustering is an important data processing method for parallel spatial database especially in shared nothing parallel architecture. Spatial data declustering can achieve parallel dataflow to exploit the I/O bandwidth of multiple parallel nodes by reading and writing them in parallel, which can improve the performance of parallel spatial database evidently. Aiming at the unique spatial objects locality, this paper presents a novel spatial data declustering method, which uses Hilbert space-filling curve to impose a linear ordering on multidimensional spatial objects, and to partition spatial objects logical segments according to this ordering to preserve spatial locality of spatial objects, and then to allocate logical segments to physical parallel nodes based on round-robin rule. Experimental results show that the proposed method can obtain well spatial data declustering results.
Abstract
针对时域、空间、专题、分辨率等多种语义相互关联所导致的遥感信息处理服务组合的准确性难题,提出了一种基于语义匹配的遥感信息处理服务组合方法,包括多层次的遥感信息处理服务语义匹配和渐进精化的服务组合,即时构建与用户需求相关的服务关系与或图,将后续服务选择范围限定在需求相关服务的范围之内,在关系与或图中进行启发式搜索,并选择语义匹配度最高的子图作为服务组合的结果。
Abstract
针对结构错综复杂的目标实时绘制中的遮挡剔除问题,提出了部件可视锥概念,用一个圆锥区域描述部件在考虑其邻近范围其他部件联合遮挡情况下的可视区域,并提出了基于部件可视锥的遮挡剔除算法,实现了实时绘制过程中可见性的快速判断,并以一个典型的虚拟建筑环境为例测试了本文方法的有效性。实验证明,利用可视锥能简化绘制过程中的可见性识别,大大提高实时绘制效率。
Abstract
提出了QoS感知的多任务服务优化组合非合作博弈模型,准确刻画了不同任务之间的竞争关系,在此基础上设计了顾及QoS的遥感信息服务优化组合反应函数,为求解遥感信息服务优化组合奠定理论基础。理论和实验分析表明,该模型有利于减少任务并发时的资源冲突,最大化所有任务的平均效用。
An efficient algorithm to plot flooded intertidal areas
Abstract
The efficient display of flooding in intertidal zones is crucial to coastal applications (e.g., coastal zone management and anti-flood directing systems). This paper proposes a new algorithm to plot flooded intertidal areas. Initially, a digital tide-coordinated shoreline (DTS) is traced on the basis of creating a digital intertidal zone model (DIZM) and an instantaneous water surface model (IWSM). Then unconnected depressions are obtained depending on the type of DTS. At the same time, the algorithm detects unconnected depressions by considering the influences of the changing water level, and creates an index from different water levels to corresponding depressions. Finally, unconnected depressions are effectively handled and flooded areas are plotted correctly. Experimental results demonstrate that the proposed algorithm results in a more accurate and efficient display than with traditional algorithms.
Abstract
根据海洋大气环境的多维动态特征设计了应用于专业领域的可视化系统结构体系,阐述了系统开发的关键技术并实现了系统的开发,最后以一个实例介绍系统的具体应用。
Abstract
房产管理的产权对象在三维空间中的变化具有显著的多样性与异步性特征,已有的模型以二维地图方式表达建筑物整体的动态变化,很难准确有效地表达真三维建筑多重产权实体变更的不同步性。本文充分利用房产对象的空间层次关联性及产权单元的语义约束知识,定义了从地块到幢、层、户和权属的多层次事件概念,建立了三维房产从外至内动态表示的概念模型,为三维城市空间中建筑物的变迁以及房地产权属异动的准确表达与时空分析奠定了基础。
Abstract
针对复杂三维城市模型动态可视化中实时碰撞检测的可靠性和高性能需求,充分顾及离散检测与连续检测的特点,建立了视点运动空间的胶囊体模型,并定义了其描述参数,提出了基于该模型进行实时碰撞检测的两步检测算法。其中,预检测用来提高计算效率,而精检测则有力地保证了检测的准确性。利用典型的虚拟建筑环境进行实验,证明了该算法的有效性。
Abstract
针对遥感信息服务中用户需求语义的复杂性,数据维度语义的丰富性,传感器语义的多样性,遥感信息处理语义的错综复杂性和遥感信息传输语义的时变性,从用户语义约束、数据语义约束、处理服务功能语义约束和处理服务质量语义约束等4个不同层次,建立多层次语义约束模型。
A data skew handling method based on the minimum spatial proximity for parallel spatial database
Abstract
Data skew is one of most important reasons to deteriorate the performance of parallel spatial database. This paper studies the issues of handling data skew in shared nothing parallel spatial database system architecture. A novel data skew handling method is proposed, which fulfill spatial data distribution balancing based on the spatial proximity of data fragments. The minimum spatial proximity is used to be the principle of moving data fragments among different network parallel nodes. Our experimental results show that the proposed data skew handling method can achieve dynamic data load balancing and offer significant improvement for reducing response time of parallel spatial queries.
Spatial Data Dynamic Balancing Distribution Method for Parallel Spatial Database
Abstract
Spatial data balancing distribution can evidently improve the performance of parallel spatial database in shared nothing parallel architecture. Considering spatial locality and unstructured variable length characteristics of spatial data, this paper proposes a dynamic spatial data balancing distribution method under shared nothing parallel database environment. By using Hilbert ordering code to keep spatial locality relationship between spatial objects, the presented method can fulfill spatial data static balancing distribution status, which depends on hierarchically decomposing Hilbert space-filling curve code to allocate approximately even spatial data volume to parallel nodes in distributed network. Then spatial proximity index is introduced to resolve spatial data unbalancing problem caused by spatial database dynamic updating. Through moving spatial data fragments to goal node which is the minimum spatial proximity with data moving out node, the spatial database redistributing strategy can attain dynamic data balance among all network parallel nodes. Our experimental results show that the proposed method can effectively improve parallel performance deterioration resulted from spatial data unbalancing and achieve spatial data dynamic balancing distribution in parallel spatial database.
An Extension of "SEQ-NV-RANSAC" Approach To Avoid Bad-Segmentation Cases From Unstructured 3D Point Clouds Using Topology Information
Abstract
Recently many applications require an automatic processing of massive unstructured 3D point clouds in order to extract planar surfaces of man-made objects. While segmentation is the essential step in feature extracting process, but bad-segmentation results (i.e. under and over-segmentation) are still standing as a big obstacle to extract planar surfaces with best fit reality. In this paper, we propose an extension of "SEQ-NVRANSAC" approach to avoid the bad-segmentation problems using topology information and intuitive threshold value. First, in order to avoid the under-segmentation problem, we check each one group which resulted from original "SEQ-NV-RANSAC" approach to get all neighbours points which have Euclidean distance less than the threshold value as a one surface group. This process will be repeated until no more points can be adding to that surface group. Then a new surface group will be created to check the remaining points. Second, in order to solve the oversegmentation, we propose three checks; the similarity of normal vectors (NV), the perpendicular distance and the intersection zone using bounding box test.
Optimal Composition Algorithm Concerned with Response Time for Remotely Sensed Image Processing Services
Abstract
As remote sensing technologies have become ever more powerful due to the introduction of multi-platforms and multi-sensors, hundreds of terabytes of image data can be made available daily. But in many cases, raw remotely sensed images are not directly useful without further processing. There are more and more needs to aggregate remotely sensed image processing to satisfy the increasing demands of various applications. Remotely sensed image processing services are modular components that are self-contained, self-describing and can be published, located, and invoked across a network to access and process remote sensing data (Onchaga 2004). Remotely sensed image processing services encapsulate all processing functions into services and combine them into a service chain to provide a valueadded service. The various requirements of users can be achieved by combining different existing data and services into a value-added service chain.
Research and practice in three-dimensional city modeling
Abstract
The way we interact with spatial data has been changed from 2D map to 3D Virtual Geographic Environment (VGE). Three-dimensional representations of geographic information on a computer are known as VGE, and in particular 3D city models provide an efficient way to integrate massive, heterogenous geospatial information and georeferenced information in urban areas. 3D city modeling (3DCM) is an active research and practice topic in distinct application areas. This paper introduces different modeling paradigms employed in 3D GIS, virtual environment, and AEC/FM. Up-to-date 3DCM technologies are evolving into a data integration and collaborative approach to represent the full spatial coverage of a city, to model both aboveground and underground, outdoor and indoor environments including man-made objects and natural features with 3D geometry, appearance, topology and semantics.
Knowledge-based topological reconstruction for building facade surface patches
Abstract
3D city models constructed from ground based data are becoming an interesting and challenging problem as they present the realistic facades, which contain more details than the models constructed from aerial data. Such kind of information is interesting for quite a lot of applications. This paper presents a new method for connecting building façade surface patches that generated from video image sequence, which integrates building structure knowledge into reconstruction. Therefore reasonable and correct topological relationship can be built up between them even when some surface patches are not observed or wrongly detected. The results show our method correctly set up topological relationship between generated surface patches and getting reasonable structure model about area with occlusions
Perceptually guided geometrical primitive location method for 3D complex building simplification
Abstract
Because of detailed geometrical components based description, 3D complex building contains the most elaborated perceptual and comprehensive semantic information. However, since the lack of optimal simplification method, the automatic LOD generation of such kind of model becomes a bottle neck which prohibited the high-fidelity 3D city applications. This paper proposed a perceptually guided geometrical primitive location method for the optimal simplification of 3D complex buildings. Firstly, the rendered image is snapped and a 2D discrete wavelet transform based human vision system filtering approach is adopted to extract the imperceptible details in the image, and then a kind of visual difference image is generated with sufficient perceptual information. Secondly, a ray-casting like method is proposed to precisely map the perceptual information from the image onto the geometric primitives. The statistics is carried out to determine whether a traced primitive is to be preserved or simplified. The results show that this method is able to efficiently locate the perceptible primitives and leave the imperceptible and undisplayable primitives to be further handled by simplification operations which enable a strong perceptual feature preserved simplification of 3D complex building models.
3D GIS database model for efficient management of large scale underground spatial data
Abstract
One issue of GIS is management of huge amount of spatial data. Nowadays, acquisition capacity of 3D spatial data with various scales and resolutions is much more convenient due to new 3D acquisition technologies. It is a difficulty that how to efficiently and synthetically organize and manage large scale underground 3D spatial data with contents of continuous distribution and nonuniformity. A 3D GIS data management system framework with three layers is proposed to deal with large scale underground data integrated management. The related key issues and methods include: (1) Multi-scale underground spatial object concept model. (2) 3D spatial database model considering spatial and semantic relationship and corresponding data structure is introduced to support extendable storage environment such as file system, typical commercial database management system and cluster parallel system. (3) True 3D spatial index considering level of detail (LOD). (4) Efficient dynamic dispatch method of great amount of 3D spatial data is adopted based on 3D data content and associated information. (5) 3D spatial data engine (SDE) provides a uniform access interface for file management system, relational database management system and cluster parallel system and other applications. The 3D GIS database model focuses on the key issues of massive underground 3D spatial data provides a new way for the high performance database organization and management of true 3D geological data as well as its integration with the aboveground spatial data.
Scheme evaluation of urban design using 3D visual analysis
Abstract
The evaluation of urban landscape and the design of urban space are in need of a scientific visual analysis tool that can wholly include the qualitative analysis, the quantitative analysis and the orientation analysis. With the outstanding saving, management, visualization and analytical functions of 3D space information, 3DGIS can exactly provide powerful technique support for this. Based on the humanistic analysis conception, the concept of visual openness index is introduced, and some visual analysis functions are designed and implemented based on VGEGIS platform. Finally a case study for the application of visual analysis is carried out and the results show that the urban design scheme evaluation is improved distinctively.
A Solution to the Ambiguity Problem in Depth Contouring
Abstract
Depth contours on a chart are important for safe navigation. The ambiguity problem can appear when points of equal depth are joined in contouring. Unreasonable solutions may mistake a shallow area for a deep one, which could result in a potential danger for navigation. A solution is presented to solve the ambiguity problem using constrained lines formed by two shallow depths. The constrained lines are used to limit the joining of the points with equal depth. Experimental results demonstrate that the proposed solution can reduce the dangers of producing non-existent deep areas in bathymetric contouring.
Hierarchical lane‐oriented 3D road‐network model
From 2D to 3D road networks
Abstract
The existing road‐network models based on the 2D link‐node of roadway centrelines have inhibited lane‐oriented network flow analysis and multi‐dimensional inventory management in complicated 3D urban environments. This paper proposes a hierarchical lane‐oriented 3D road‐network model (HL‐3DRNM), with a unified modelling language (UML) diagram. HL‐3DRNM is a non‐planar topological model with the support of a 3D lane ribbon cartographic display, which is characterized by: (1) multiple topological and cartographic representations and various abstraction levels (street, road segment, carriageway and lane); and (2) referenced multi‐dimensional road information (point, line, area and volume) at lane level. HL‐3DRNM provides solid mathematical foundations for a more detailed inventory management, effective network analysis and realistic navigation in the increasingly complicated 3D urban transportation systems.
A sub‐pixel location method for interest points by means of the Harris interest strength
Sub-pixel location of interest points in actual aerial image: (a) the reference image; (b) zoomed image section (4x) with interest points detected by Harris detector (grey x crosses) and their corresponding precise location (black + crosses); (c) zoomed image (15x) section, in which the white dashed lines indicate the actual edge of the road in the square.
Abstract
The sub-pixel location of interest points is one of the most important tasks in refined image-based 3D reconstruction in digital photogrammetry. The interest point detectors based on the Harris principles are generally used for stereoscopic image matching and subsequent 3D reconstruction. However, the locations of the interest points detected in this way can only be obtained to 1 pixel accuracy. The Harris detector has the following characteristics: (1) the Harris interest strength, which denotes the distinctiveness of an interest point, is a grey scale descriptor which computes the gradient at each sample point in a region around the point, and (2) the Harris interest strengths of the pixels in a template window centred on the interest point exhibit an approximately paraboloid distribution. This paper proposes a precise location method to improve the precision of the interest points on the basis of these characteristics of the Harris interest strength. Firstly, a least squares fit of a paraboloid function to the image grey scale surface using the Harris interest strength is designed in a template window and a Gaussian-distance algorithm is employed to determine the weight. Then, the precise coordinates of this interest point are obtained by calculating the extremities of the fitting surface. The location accuracy of this method is studied both from the theoretical and the practical point of view. Experimental analysis is illustrated with synthetic images as well as actual images, which yielded a location accuracy of 0·15 pixels. Furthermore, experimental results also indicate that this method has the desired anti-image-noise and efficiency characteristics.
Propagation strategies for stereo image matching based on the dynamic triangle constraint
The propagating process of image matching.
Abstract
For the purpose of reliable stereo image matching, this paper discusses a novel propagation strategy of image matching under the dynamic triangle constraint. Firstly, the construction and the dynamic updating method for the corresponding triangulations on the stereo pairs are introduced, which are used as both constraints and carriers during the matching propagation. Then, three propagation strategies: the stochastic propagation, the adjacent propagation based on the topological relationship of triangles, and the self-adaptive propagation, which considers the texture features are proposed. The detailed algorithms of these three propagation strategies are also presented. To compare these strategies, a stereo pair with typic texture features is employed to describe the different propagation manners of these three strategies, and an experimental analysis is illustrated with different aerial stereo pairs. From test results, the following has been found: (1) stochastic propagation gives the worst matching results; (2) self-adaptive propagation performs better than the adjacent propagation by making use of the global “best first” strategy. From these conclusions, the self-adaptive propagation strategy is recommended for reliable stereo image matching under the dynamic triangle constraint.
An efficient 3D R-tree spatial index method for virtual geographic environments
Abstract
A three-dimensional (3D) spatial index is required for real time applications of integrated organization and management in virtual geographic environments of above ground, underground, indoor and outdoor objects. Being one of the most promising methods, the R-tree spatial index has been paid increasing attention in 3D geospatial database management. Since the existing R-tree methods are usually limited by their weakness of low efficiency, due to the critical overlap of sibling nodes and the uneven size of nodes, this paper introduces the k-means clustering method and employs the 3D overlap volume, 3D coverage volume and the minimum bounding box shape value of nodes as the integrative grouping criteria. A new spatial cluster grouping algorithm and R-tree insertion algorithm is then proposed. Experimental analysis on comparative performance of spatial indexing shows that by the new method the overlap of R-tree sibling nodes is minimized drastically and a balance in the volumes of the nodes is maintained.
A filtering strategy for interest point detecting to improve repeatability and information content
Abstract
This paper compares several stereo image interest point detectors with respect to their repeatability and information content through experimental analysis. The Harris-Laplace detector gives better results than other detectors in areas of good texture; however, in areas of poor texture, the Harris-Laplace detector may be not the best choice. A featurerelated filtering strategy is designed for the Harris-Laplace detector (as well as the standard Harris detector) to improve the repeatability and information content for imagery with both good and poor texture: (a) the local information entropy is computed to describe the local feature of the image; and (b) the redundant interest points are filtered according to the interest strength and the local information entropy. After the filtering process, the repeatability and information content of the final interest points are improved, and the mismatching then can be reduced. This conclusion is supported by experimental analysis with actual stereo images.
An efficient depression processing algorithm for hydrologic analysis
Comparison of extraction on a plain region. (a) Extraction result of proposed method. (b) Extraction result of method implemented in ArcGIS.
Abstract
Depression filling and direction assignment over flat areas are critical issues in hydrologic analysis. This paper proposes an efficient approach for the treatment of depressions and flat areas, based on gridded digital elevation models. Being different from the traditional raster neighborhood process which is time consuming, a hybrid method of vector and raster manipulation is designed for depression filling, followed by a neighbor-grouping scan method to assign the flow direction over flat areas. The results from intensive experiments show that there is a linear relationship between time efficiency and data volume, and the extracted hydrologic structures of flat areas are also more reasonable than those proposed by the existing methods.
Seed point selection method for triangle constrained image matching propagation
Automatic selection of seed points
Abstract
In order to select proper seed points for triangle constrained image-matching propagation, this letter analyzes the affects of different numbers and different distributions of seed points on the image-matching results. The concept of distribution quality is introduced to quantify the distribution of seed points. An intensive experimental analysis is illustrated using two different stereo aerial images and, based on the experimental results, a seed point selection strategy for triangle constrained image-matching propagation is proposed. An automatic selection method is then introduced that gives good distribution quality for a defined number of seed points.
Triangulation of well-defined points as a constraint for reliable image matching
The matching propagation in a water area of poor texture: (a) initial matching result, (b) further matching result, (c) final matching result.
Abstract
This study demonstrates the utilization of the well-defined points to improve the reliability and accuracy of image matching. The basic principle is: (a) to triangulate a few well-defined points within the stereo model area to form a coarse triangulation; (b) to detect certain amount of corners within each triangle for further matching; (c) to propagate the matching of corner points from the reference points (i.e., the three triangle vertices) to obtain the best matching for each of these corners; (d) to dynamically update the triangulation by inserting the newly matched corner; and (e) to further detect corners and perform matching for them until a pre-defined criteria (the minimum size of triangle or the largest number of points matched) is reached. Experimental results reveal: (a) the false matching caused by the occlusion and repetitive texture is diminished; (b) the accuracy is improved, i.e., with a reduction of RMSE of check points (located in different types of terrain areas) by 12 percent to 62 percent, and a reduction of the largest error by up to two times; and (c) most building corners and boundary points of main objects could be matched directly and accurately.
CyberCity GIS (CCGIS): Integration of DEMs, Images, and 3D Models
Abstract
This paper examines the differences between CyberCity, three-dimensional (3D) geographic information systems (GIS) and CyberCity GIS (CCGIS). A CyberCity is defined as a virtual representation of a city that enables a user to explore and interact in cyberspace with the vast amount of environmental and cultural information gathered about the city. The technical characteristics of a CyberCity GIS prototype software are reported, including the 3D hierarchical modeling technique, the integrated database structure, and the interactive method of visualization of the 3D data of urban environments. The effective integrated data organization strategy for dynamical loading and progressive rendering, which enables CCGIS to support the development, design and presentation of a large CyberCity, is stressed. A pilot application for municipal planning and land information publications has been implemented. This pilot application proved that the hierarchical 3D modeling method and data model are significant to the 3D GIS; the real-time visualization of a large CyberCity needs elaborate data organization and a dynamic loading strategy.
Effects of Various Factors on the Accuracy of DEMs: An Intensive Experimental Investigation
Abstract
This paper describes a series of tests that measured the effects of 4 factors (accuracy, density of source data, characteristics of the terrain surface, and modeling approaches) on the accuracy of digital elevation models (DEMs). A large area covered by 2 1:10,000-scale maps was selected for testing. The terrain types ranged from flat to hilly to mountainous. Results and conclusions are provided.
Virtual Geographic Environments
Abstract
Large-scale 3D models are the cutting edge of computer technology for understanding and planning our urban environments and infrastructures. These models have emerged from two modelling structures — systems for architecture, engineering, and construction (AEC) and geographic information systems (GIS). The problems and challenges facing today’s modelers, developed for different purposes, focus almost exclusively on data integration — the ability to use data originally developed in one modeling system in the other and vice versa. This need for data transportability is not new, as evidenced by several authors in this volume. What is new is the desire to go beyond various conversion programs into an environment where data is truly integrated, where the modeling framework is more universal, and where data standards cut across software programs and vendor-specific platforms.
This book captures the excitement of researchers, organizations, and vendors in this quest. The border between data structures used within GIS and AEC continues to diminish. As these two principal forms of modeling continue to merge, as the result of increased interest in large-scale 3D models, the need for data structures capable of supporting both types of modeling efforts, as well as new types of modeling efforts that combine the best features of both simple efforts, is manifest.
Multidimensional and dynamic vehicle emergency routing algorithm based on 3D GIS
Abstract
When disaster occurs, the response phase is viewed as the most critical in terms of saving lives and protecting property. Exploring the development of increased efficiency in emergency services, this volume covers technological advances that allow wider, faster, and more effective utilization of geospatial information. It discusses advances in positioning, virtual reality, and simulation models leading to improved response times in emergency situations. The book also discusses legislative attempts to promote the broader sharing and accessibility of vital information. The authors cover data collection, data production, data management, and 3D routing, as well as lesser known emerging technologies.
Abstract
本书全面、系统总结了城市三维建模技术的最新研究成果,分别对三维城市建模技术规范、三维空间数据获取、三维建模与更新、三维建模资料准备、三维建模工艺与质量控制、三维城市模型集成处理、常用的城市三维建模辅助工具等主要内容进行了详细介绍。本书力求阐述城市三维建模技术的系统性与可操作性,图文并茂,理论与实践相结合,使具备一般计算机技术的工程技术人员都可以读懂本书。
摘要
书系统介绍了面向任务的遥感信息聚焦服务理论与方法,包括遥感信息共享的多维动态全局逻辑模型——遥感信息球模型,以及基于此模型的任务理解、语义搜索与动态聚合的服务
Abstract
Digital terrain modeling has been a research area for more than 40 years in geo-sciences and has become a rather self-contained subject. Digital Terrain Modeling: Principles and Methodology is the only authored book to provide comprehensive coverage of recent developments in the field. The topics include terrain analysis, sampling strategy, acquisition methodology, surface modeling principles, triangulation algorithms, interpolation techniques, on-line and off-line quality control in data acquisition, DTM accuracy assessment and mathematical models for DTM accuracy prediction, multi-scale representation, data management, contouring, visual analysis (or visualization), the derivation of various types of terrain parameters, and future development and applications
序言
城市化是一个国家经济发展的重要标志。据联合国《世界城市化展望: 2003年回顾》发布的数字,2003 年世界人口已有48%居住在城市,预计在2007年将达到50%以上,历史上第一次超过农村人口。我国国家统计局最近发布的结果,2003年有40.53%的人口居住在城市,与1990年同项数据18.96%相比,可以看出我国城市化的进程是逐步加快的,发展迅猛。这一方面反映了我国经济的快速增长,另一方面也对我国城市建设及相关的配套设施与政策法规提出了严峻的挑战。面对如此紧迫的形势,加快城市建设信息化的步伐将是解决城市化过程中所出现的各种新老问题的有效办法。
城市信息化的通俗解释就是建设“数字城市”。它是要构建一个以城市地理空间(Geospace)数据和专题数据为基础,以网络计算和通信为工具,协助“人”来更有效地认识、规划、建设和管理城市,也为“人”的生存、工作、生活和安全提供保障的科技、人文环境。
朱庆、林珲二位教授的《数码城市地理信息系统》一书的出版正是应对城市信息化建设的新形势,解决“数字城市”建设中的理论与技术问题,并预见城市信息化前景的一本非常及时的专著。作者在城市地理信息系统的概念、原理和方法上设置了一个十分确切的解释空间,搭建了一个建立数字城市地理信息系统的认知框架,并将多年来国内外同行们在这一领域所取得的丰硕成果经过分析、评价之后融入其中。为我们提供了一条能直接而便捷地进入领域核心地带的途径。
这本书还反映了作者及其团队多年来的科研成果和经验,特别是在数字城市理论方法的深化过程中提出的空间建模、多维分析、数据质量控制等方面的见解,都有很强的启发性和指导意义。
“数字城市”既是目标,也是一个过程。最终要达到什么样的境界目前还说不太清楚。但是可以肯定的说它不是一个单纯的技术系统,而是一个“以人为本”,人机结合的大型综合集成体系。本书在这个问题上的描述有明显的特色和亮点,尽管国内外的研究探索只是刚刚起步,但方向是清晰的,应该引起我们的重视。例如,书中提出的构建分布式的虚拟地理环境,开始强调人与虚拟环境的交互与关系;讨论了地理协同( Geocollaboration)理论在分布式虚拟地理环境中的应用,这必然会引出认知主体和客体,虚拟与实在( Reality)等跨计算机、心理学和哲学的多种问题,并将引导“数字城市”研究与开发的深化。
在全球化的网格(Grid)技术的新环境中,城市信息化建设将有新的思路和新的举措。本书可以为这一即将到来的新变革打下一个稳固的基础。感谢作者多年的工作及在地理信息科学的学术交流方面所做的努力和贡献。
前言
城市在这个星球上的出现已经有了五千多年的历史。然而,大规模城市化是过去一百多年中发生的事情。城市的发展是与创新分不开的,这里不仅是指科技方面的创新,也包括文化方面的创新。例如,云南丽江古城凭借文化创新也迎来了发展的机会。近二十年来,城市信息化似乎成为许多中国城市发展的创新契机,并被冠以“数字城市”建设的美喻。与此同时,我们也应该看到城市本身的发展对于城市信息化也提出了挑战。譬如,珠江三角洲和长江三角洲城市群的协调发展,也呼唤出“城市群地理信息系统”的新思路。
近年来,受到“数字地球”(digital earth)概念的影响,“数字城市”(digital city)在不同的认识层次和学科领域得到了不同的理解,因而具有两层明显不同的含义:广义上被用于描述城市信息化的目标,而狭义上则主要指城市空间信息基础设施。不管如何理解,城市地理信息系统都是其重要的核心内容,并正在积极向动态、多维和网络化方向发展。为了突出虚拟现实技术在城市空间信息交流方面的重要意义,“虚拟城市”(virtual city)也被用于描述通常由三维场景组成的城市地区,用户能够在里面移动和交互。
城市逼真的三维数字表示由于其在城市基础设施管理、无线通讯网络规划、城市开发决策支持、污染分布仿真、土木工程与军事行动支持等众多领域显现出巨大的应用潜力,从而成为普遍关注的热点问题。如何从二维地理信息系统向城市环境三维描述(三维地理信息系统)转变正日益成为城市数据管理的时髦问题。城市的三维逼真描述——三维城市模型不仅具有传统虚拟现实表现的高度真实感,而且具有三维GIS数据库管理与分析应用等特殊功能并能与其他社会经济信息互联。因此,三维城市模型常被作为CyberCity的代名词,有关其数据获取与管理的研究受到了广泛重视。格林(Gruen)等学者将三维城市模型数据库系统称为“CyberCity Spatial Information System”(CyberCity空间信息系统)。针对城市地理环境应用,笔者认为CyberCity Geographic Information System(CyberCity GIS)的提法更为恰当,并将其翻译为数码城市地理信息系统。我们认为,数码城市地理信息系统是“数字城市”空间数据基础设施的重要组成部分,也是“虚拟城市”的核心内容;同时,也将其作为GIS向“虚拟地理环境”(virtual geographic environment)方向发展的一个初步原型。因此,本书以“数码城市地理信息系统——虚拟城市环境之三维城市模型初探”作为书名。
尽管有关三维城市模型的研究与实践在国内外已经十分广泛,但大多数成果由于立足于特定的有限领域而且都还是分散的、不全面的。比如,广泛应用于城市规划设计评价和旅游目的的各种“虚拟城市”往往侧重于其逼真的视觉表现,而忽略了可靠的空间数据获取方法和灵活的海量数据管理与分析能力。本书力图比较全面地论述当今国内外关于数码城市地理信息系统最先进的理念和研究进展,从摄影测量与遥感和地理信息工程的角度着重论述三维城市模型的数据内容与数据快速获取方法,多种类型数据的一体化管理与集成应用,海量数据的动态交互式可视化等关键技术,为我国正在开展的城市数字化工程建设提供必要的理论铺垫和技术支持。相比其他领域,城市问题具有特别的复杂性,其对 GIS技术提出了更高的要求。因此,本书关于数码城市地理信息系统的理论方法和关键技术对数字化国土、数字化战场环境和地下工程等其他相关领域的应用实践也具有一定的适用性。同时,本书集中反应了数码城市地理信息系统平台软件CCGIS4.0(2003年度国产GIS软件测评推荐软件)研发和大量工程应用实践的成果,争取在理论研究及技术应用两方面均获得发展和创新,体现先进性、系统性、实用性和可操作性的时代要求。当然,由于研究工作的局限,有关虚拟城市环境的其他问题如时态、城市人文环境等还有待在今后的版本中予以充实。书中的许多观点也期待进一步更加广泛的争论。
本书的完成还得到了许多人直接或间接的无私贡献。有关数码城市地理信息系统的研究与实践一直得到了武汉大学李德仁院士和龚建雅教授的关心与支持。李德仁院士在百忙中审阅了书稿,提出了宝贵的建议并给予了鼓励。解放军信息工程大学高俊院士不顾繁忙的学术活动亲自审阅全书并欣然作序,使本书增色许多,令作者深受鼓舞。要感谢测绘遥感信息工程国家重点实验室(武汉大学)和地球信息科学联合实验室(香港中文大学)有关的教师、博士研究生和硕士研究生们给予的极大支持。在几年前首次策划本书内容时,香港理工大学的李志林教授提出了许多宝贵的意见和建议,它们已经体现在今天的书稿当中。作者要感谢眭海刚博士,吴波、赵杰、黄铎、张霞、胡海棠、王静文、韩李涛、李逢春、龚俊、张叶廷、钟正等博士研究生,高玉荣和周艳等硕士研究生的辛勤付出。同时,作者还要感谢香港裘搓基金会赞助朱庆在香港中文大学地球信息科学联合实验室的访问和学术交流,使其有机会与龚建华研究员、辛晓红博士、沈大勇博士、孔云峰博士、杨育彬博士、李响、赵一斌、施晶晶和王纲胜等博士研究生进行深入讨论,并有颇多收益。本书得到了国家973项目“虚拟现实的基础理论、算法及其实现”(2002CB312101)、 国家863项目“ 虚拟地理环境的研究与开发 ”( 2001AA135130)和国家自然科学基金项目“多种类型大型空间数据库集成方法”(40001017)的资助。
最后,作者要感谢武汉大学出版社责任编辑任翔先生以及参与本书出版编辑工作的所有老师艰苦细致的审编工作,使该书顺利面世。
朱庆、 林珲
2004年2月20日
香港中文大学 未圆湖畔