Evaluating Alternative Line Simplification Strategies for Multiple Representations of Cartographic Lines

Two basic strategies have been identified for handling multiple representations of line features in digital databases. Either a finite number of scale-dependent representations of cartographic lines can be explicitly stored, or a scale-independent database is generated from which subsequent scale representations can be extracted as needed. These two strategies parallel differences in hierarchical and non-hierarchical line simplification operators. Non-hierarchical line-simplification can produce the most geometrically accurate simplification at any scale, while hierarchical operators are often associated with scale-independent databases. In this research, hierarchical and non-hierarchical line simplification operators are evaluated by comparing both the points retained by these different algorithms and the overall quality of the graphic portrayal for sample lines of different complexity and at different scales. Visual inspection of the results did not reveal any discernable difference at any scale for any line. Subsequent numerical analyses shows some differences but overall little geometric quality is lost by using a hierarchical operator as opposed to a non-hierarchical one and given the greater flexibility of scale representations that is possible, hierarchical methods appear to be more satisfactory.     

线要素多尺度表达的一种新方法

本文依据多比例尺条件下矢量数据的绘制原理,提出了多尺度线化简与线选取方法。多尺度线化简算法依比例尺将空间坐标转换为像素坐标,根据像素坐标删除曲线中重合点与共线点,综合后的曲线与原始曲线在各比例尺下绘制结果相同;多尺度线选取算法利用仿射变换结果快速计算线要素之间的连通关系,然后渐进删除长度小于阈值的悬线与孤立弧段,保持了线要素的连通性。对不同类型数据的实验验证了本文算法的有效性和可行性。     

Bundle Adjustment with Self–Calibration Using Straight Lines

Increased use of digital imagery has facilitated the opportunity to use features, in addition to points, in photogrammetric applications. Straight lines are often present in object space, and prior research has focused on incorporating straight–line constraints into bundle adjustment for frame imagery. In the research reported in this paper, object–space straight lines are used in a bundle adjustment with self–calibration. The perspective projection of straight lines in the object space produces straight lines in the image space in the absence of distortions. Any deviations from straightness in the image space are attributed to various distortion sources, such as radial and decentric lens distortions. Before incorporating straight lines into a bundle adjustment with self–calibration, the representation and perspective transformation of straight lines between image space and object space should be addressed. In this investigation, images of straight lines are represented as a sequence of points along the image line. Also, two points along the object–space straight line are used to represent that line. The perspective relationship between image– and object–space lines is incorporated in a mathematical constraint. The underlying principle in this constraint is that the vector from the perspective centre to an image point on a straight–line feature lies on the plane defined by the perspective centre and the two object points defining the straight line. This constraint has been embedded in a software application for bundle adjustment with self–calibration that can incorporate point as well as straight–line features. Experiments with simulated and real data have proved the feasibility and the efficiency of the algorithm proposed.     

A Hierarchical Surface Measurement Strategy Using Non-Repeating Patterns

Hierarchical approaches for automated photogrammetric surface measurement invariably employ image pyramids and image matching at multiple resolutions. Such an approach is also applicable in industrial photogrammetry where projected light patterns are used to provide texture on an otherwise texture-free surface. This paper describes a novel strategy for hierarchical surface measurement in which projected non-repeating target patterns are employed, rather than the lower-resolution levels of an image pyramid. Thus, although the final derived digital surface model is obtained by image matching, preliminary surface models which support the matching are obtained using the non-repeating patterns. These projected patterns allow a simplification of the triangulation phase since they offer the potential of a fast and unambiguous solution to the image point correspondence problem. Following an introduction to the non-repeating pattern strategy, integration of the approach into a multi-camera vision metrology system is described and some experimental measurements are summarized     

一种面向DEM多尺度表达的傅里叶能量谱模型

针对数字高程模型（digital elevation model,DEM）数据的多尺度表达问题,根据DEM格网数据在能量谱密度中“低频-高能-大尺度”的对应关系,在化简中关联地形语义特征,构建了DEM数据的多尺度表达模型。实验结果表明,该模型可以实时动态派生不同尺度下的DEM数据,通过等高线放样观察发现,该模型派生的DEM数据满足地形表达、空间认知和制图综合中的“保留主要地形特征、舍弃次要地形特征”的基本原则。与常用的DEM化简方法进行高程值统计以及坡形变化的定量对比分析,结果表明该方法在统计意义与结构意义上都具有较好的效果。     

Area‐preservation Simplification of Polygonal Boundaries by the Use of the Structured Total Least Squares Method with Constraints

This article presents an area‐preservation approach for polygonal boundary simplification by the use of structured total least squares adjustment with constraints (STLSC), with the aim being to maintain the area of the original polygons after the simplification. Traditionally, a simplified line is represented by critical points selected from the original one. However, this study focuses on maintaining the areas of the polygons in the process of simplification of polygonal boundaries. Therefore, the proposed method in this article is a supplement to the existing line simplification methods, and it improves the quality of the simplification of polygonal boundaries in terms of positional and area errors. Based on the sub‐divisions of the original polyline, using the critical points detected from the polyline by the use of line simplification methods, the framework of the proposed method includes three main components, as follows: (1) establishment of the straight‐line‐segment fitting model based on both the critical and intermediate points on the sub‐polyline; (2) introduction of both area and end‐point constraints to reduce the geometric distortions due to the line simplification; and (3) derivation of the solution of boundary simplification by the use of STLSC. An empirical example was conducted to test the applicability of the proposed method. The results showed that: (1) by imposing the linear fitting model on both the critical and intermediate points on the sub‐polylines in the proposed STLSC method, the positional differences between the original points and the simplified line are approximately in a normal distribution; and (2) by introducing both end‐point and area constraints in the proposed STLSC method, the areas of the simplified polygons are the same as those of the original ones at different scales, and the two neighboring fitted lines are connected to each other at the optimized position.     

一种综合利用像方和物方信息的多影像匹配方法(英文)

A novel method for multi-image matching by synthesizing image and object-space information is proposed. Firstly, four levels of image pyramids are generated according to the rule that the next pyramid level is generated from the previous level using the average gray values of the 3 by 3 pixels, and the first level of pyramid image is generated from the original image. The initial horizontal parallaxes between the reference image and each searching image are calculated at the highest level of the image pyramid. Secondly, corresponding image points are searched in each stereo image pair from the third level of image pyramid, and the matching results in all stereo pairs are integrated in the object space, by which the mismatched image points can be eliminated and more accurate spatial information can be obtained for the subsequent pyramid image matching. The matching method based on correlation coefficient with geometric constraints and global relaxation matching is introduced in the process of image matching. Finally, the feasibility of the method proposed in this paper is verified by the experiments using a set of digital frame aerial images with big overlap. Compared with the traditional image matching method with two images, the accuracy of the digital surface model (DSM) generated using the proposed method shows that the multi-image matching method can eliminate the mismatched points effectively and can improve the matching success rate significantly. Supported by the National Natural Science Foundation of China (Nos. 40771176, 40721001).     

Contour line simplification method based on the two‐level Bellman–Ford algorithm

The contour line is one of the basic elements of a topographic map. Existing contour line simplification methods are generally applied to maps without topological errors. However, contour lines acquired from a digital elevation model (DEM) may contain topological errors before simplification. Targeted at contour lines with topological errors, a progressive simplification method based on the two‐level Bellman–Ford algorithm is proposed in this study. Simplified contour lines and elevation error bands were extracted from the DEM. The contour lines of the elevation error bands were initially simplified with the Bellman–Ford (BF) algorithm. The contour lines were then segmented using the vertices of the initial simplification result and connected curves with the same bending direction were merged into a new curve. Subsequently, various directed graphs of the merged curves were constructed and a second simplification was made using the BF algorithm. Finally, the simplification result was selected based on the similarity between several simplification results and adjacent contour lines. The experimental results indicate that the main shapes of the contour groups can be maintained with this method and original topological errors are resolved.     

Scale-specific automated line simplification by vertex clustering on a hexagonal tessellation

A new method of cartographic line simplification is presented. Regular hexagonal tessellations are used to sample lines for simplification, where hexagon width, reflecting sampling fidelity, is varied in proportion to target scale and drawing resolution. Tesserae constitute loci at which new sets of vertices are defined by vertex clustering quantization, and these vertices are used to compose simplified lines retaining only visually resolvable detail at target scale. Hexagon scaling is informed by the Nyquist–Shannon sampling theorem. The hexagonal quantization algorithm is also compared to an implementation of the Li–Openshaw raster-vector algorithm, which undertakes a similar process using square raster cells. Lines produced by either algorithm using like tessera widths are compared for fidelity to the original line in two ways: Hausdorff distances to the original lines are statistically analyzed, and simplified lines are presented against input lines for visual inspection. Results show that hexagonal quantization offers advantages over square tessellations for vertex clustering line simplification in that simplified lines are significantly less displaced from input lines. Visual inspection suggests lines produced by hexagonal quantization retain informative geographical shapes for greater differences in scale than do those produced by quantization in square cells. This study yields a scale-specific cartographic line simplification algorithm, following Li and Openshaw's natural principle, which is readily applicable to cartographic linework. Open-source Java code implementing the hexagonal quantization algorithm is available online.     

基于层次信息量的线要素化简算法性能评价研究

化简算法是地图综合的一类基本算法,而算法性能评价是解决算法优化和算法选取的一个重要问题。现有评价指标更多地考虑要素化简前后的位置偏移,难以客观地评价算法性能。为此,本文以线要素为例,全面考虑线要素化简原则,从信息传递的角度,提出一种基于层次信息量的线要素化简算法性能评价方法。首先将线要素的信息划分为三个层次来描述,即：元素层次、邻域层次和整体层次,并发展相应的信息量计算方法。然后,从化简后各层次信息量的保持能力（或信息传递能力）来评价线要素化简算法的性能。其中,元素层次信息传递比评价关键点保持性能;邻域层次信息传递比评价弯曲保持性能;整体层次信息传递比评价整体形态保持性能。最后,以河网为例,采用层次信息量指标,对四种经典化简算法进行评价,分析验证了层次信息量评价指标的合理性,与经典评价指标的对比分析进一步验证了该指标的优越性。     

From point-based to feature-based aerial triangulation

This paper is concerned with using linear features in aerial triangulation. Without loss of generality, the focus is on straight lines with the attempt to treat tie lines in the same fashion as tie points. The parameters of tie lines appear in the block adjustment like the tie points do. This requires a unique representation of lines in object space. We propose a four-parameter representation that also offers a meaningful stochastic interpretation of the line parameters. The proposed line representation lends itself to a parameterized form, allowing use of the collinearity model for expressing orientation and tie line parameters as a function of points measured on image lines. The paper describes in detail the derivation of the extended collinearity model and discusses the advantages of this new approach compared to the standard coplanarity model that is used in line photogrammetry. The intention of the paper is to make a contribution to feature-based aerial triangulation on the algorithmic level.     

基于向量场模型的多光谱遥感图像多尺度边缘检测

提出一种基于向量场模型的多光谱图像多尺度边缘检测算法,并在算法中引入两种梯度方向量化邻域模型。首先,对多光谱图像进行二进小波变换,得到每个波段图像在不同尺度上的细节系数,然后根据向量场模型计算多光谱图像的梯度幅值和梯度方向,选择适宜的邻域模型对梯度方向进行量化,最后沿量化后的方向获取由细到粗的多层次边缘信息。对QuickBird多光谱图像上农田、厂房等地物进行多尺度边缘提取,定性分析了图像分辨率大小与地物尺寸关系在不同尺度边缘信息的表征;利用F测度,定量评价了检测结果的边缘准确度。与传统算子检测结果对比表明,利用向量场模型综合了所有波段的边缘信息,减少了多波段图像边缘信息的不一致性,引入的量化邻域模型能够有效地获取完整的多尺度边缘点。     

基于投影网格的大面积水面生成算法

本文主要研究在现代硬件条件下,如何为渲染生成一个大面积的水面。为了达到摄像机高低不同时对分辨率的要求,同时保持空间的可量测性,现在经常使用的生成算法是各种"层次细节"的方法。但层次细节也存在存储数据量大以及接边等问题。本文介绍了一种替代的算法:投影网格算法。投影网格从我们希望在投影后得到的网格入手,反向找出网格在投影前的位置,更有目的性,有自己的优势。     

一种综合纹理和边缘信息的多尺度图像融合方法

提出了一种综合纹理和边缘信息的多尺度图像融合方法。该方法通过高斯滤波获得原始图像的金字塔分解,考虑高斯滤波器和Laws纹理提取滤波器以及边缘梯度滤波器之间的线性关系,采用奇异值分解法求出纹理和边缘图像的对应系数;利用各尺度图像的这些特征,对分解后图像的各层进行表示,并采用基于相似性测度和显著性测度的融合策略进行融合。为了衡量融合结果,采用了一个客观图像融合性能评价测度对融合结果进行评价。最后用若干组图像数据对该算法进行了仿真。试验表明,该方法比传统的梯度金字塔分解和基于纹理的金字塔分解方法具有更好的融合效果。     

三线阵CCD影像的像点自动匹配技术研究

目前国内针对三线阵CCD影像像点自动量测技术研究比较少,主要采用常规影像匹配方法进行处理。本文在分析众多匹配方法的基础上,根据三线阵CCD影像的特点,在立体环境下对三线阵CCD影像空三加密像点自动量测的方法进行研究。用实验的方法研究了基于金字塔分层动态窗口匹配运算的相关系数法在三线阵CCD影像像点立体匹配中的应用,最后通过三线阵CCD数字模拟影像试验,得出结论:采用金字塔分层动态窗口匹配运算的相关系数法是解决三线阵CCD影像空三加密像点自动量测问题比较有效的途径。     

基于直线和区域特征的遥感影像线状目标检测

针对高分辨率航空遥感影像中线状目标的特点,提出一种结合区域和直线特征识别线状目标的方法。在基于标记点分水岭变换进行初始分割的基础上,利用关于目标的知识和区域邻接图(RAG)对感兴趣区域进行合并,得到最终检测结果。实验结果表明,本文方法可以有效地从遥感影像中提取线状目标。     

3D Building Modelling with Digital Map, Lidar Data and Video Image Sequences

Three-dimensional (3D) reconstruction and texture mapping of buildings or other man-made objects are key aspects for 3D city landscapes. An effective coarse-to-fine approach for 3D building model generation and texture mapping based on digital photogrammetric techniques is proposed. Three video image sequences, two oblique views of building walls and one vertical view of building roofs, acquired by a digital video camera mounted on a helicopter, are used as input images. Lidar data and a coarse two-dimensional (2D) digital vector map used for car navigation are also used as information sources. Automatic aerial triangulation (AAT) suitable for a high overlap image sequence is used to give initial values of camera parameters of each image. To obtain accurate image lines, the correspondence between outlines of the building and their line features in the image sequences is determined with a coarse-to-fine strategy. A hybrid point/line bundle adjustment is used to ensure the stability and accuracy of reconstruction. Reconstructed buildings with fine textures superimposed on a digital elevation model (DEM) and ortho-image are realistically visualised. Experimental results show that the proposed approach of 3D city model generation has a promising future in many applications.     

Image matching as a data source for forest inventory – Comparison of Semi-Global Matching and Next-Generation Automatic Terrain Extraction algorithms in a typical managed boreal forest environment

Image matching is emerging as a compelling alternative to airborne laser scanning (ALS) as a data source for forest inventory and management. There is currently an open discussion in the forest inventory community about whether, and to what extent, the new method can be applied to practical inventory campaigns. This paper aims to contribute to this discussion by comparing two different image matching algorithms (Semi-Global Matching [SGM] and Next-Generation Automatic Terrain Extraction [NGATE]) and ALS in a typical managed boreal forest environment in southern Finland. Spectral features from unrectified aerial images were included in the modeling and the potential of image matching in areas without a high resolution digital terrain model (DTM) was also explored. Plot level predictions for total volume, stem number, basal area, height of basal area median tree and diameter of basal area median tree were modeled using an area-based approach. Plot level dominant tree species were predicted using a random forest algorithm, also using an area-based approach. The statistical difference between the error rates from different datasets was evaluated using a bootstrap method.Results showed that ALS outperformed image matching with every forest attribute, even when a high resolution DTM was used for height normalization and spectral information from images was included. Dominant tree species classification with image matching achieved accuracy levels similar to ALS regardless of the resolution of the DTM when spectral metrics were used. Neither of the image matching algorithms consistently outperformed the other, but there were noticeably different error rates depending on the parameter configuration, spectral band, resolution of DTM, or response variable. This study showed that image matching provides reasonable point cloud data for forest inventory purposes, especially when a high resolution DTM is available and information from the understory is redundant.     

矢量GIS图上地理曲线的定位误差模型

为了分析ＧＩＳ图上地理曲线的定位精度,首先探讨地理曲线的表达与定位误差,区分“数字曲线”和“连续曲线”两个概念;然后结合由数字曲线生成连续曲线的ＧＩＳ算法,建立连续曲线的误差带模型,并导出地理曲线长度的误差估计公式;最后通过算例说明地理曲线误差带的可视化方法和曲线长度误差估计公式的应用。     

一种顾及空间关系约束的线化简算法

线要素化简在制图表达与综合领域一直是研究的热点和难点之一。然而,经典化简算法多针对单独线要素进行处理,缺乏对该线要素与周边线要素之间整体空间关系的考虑,并且,存在计算结果生硬(D-P算法)、局部极值点缺失,特别是在曲度较大之处出现相交异常(L-O算法)等问题。为此,本文提出一种顾及空间关系约束的线化简算法,建立线要素全局化简方法(LGSM)和矢量位移、面积位移等5类评价指标。采用等高线、河流和道路3类线要素实际数据进行了试验,充分检验了本文算法的优越性,其处理结果符合开方根模型规律,降低了曲线复杂度,在保证全局空间关系不变条件下,不仅更好地保持了曲线整体形状特征,而且光滑美观、精度高。