首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
Downscaling has an important role to play in remote sensing. It allows prediction at a finer spatial resolution than that of the input imagery, based on either (i) assumptions or prior knowledge about the character of the target spatial variation coupled with spatial optimisation, (ii) spatial prediction through interpolation or (iii) direct information on the relation between spatial resolutions in the form of a regression model. Two classes of goal can be distinguished based on whether continua are predicted (through downscaling or area-to-point prediction) or categories are predicted (super-resolution mapping), in both cases from continuous input data. This paper reviews a range of techniques for both goals, focusing on area-to-point kriging and downscaling cokriging in the former case and spatial optimisation techniques and multiple point geostatistics in the latter case. Several issues are discussed including the information content of training data, including training images, the need for model-based uncertainty information to accompany downscaling predictions, and the fundamental limits on the representativeness of downscaling predictions. The paper ends with a look towards the grand challenge of downscaling in the context of time-series image stacks. The challenge here is to use all the available information to produce a downscaled series of images that is coherent between images and, thus, which helps to distinguish real changes (signal) from noise.  相似文献   

2.
支撑向量机及其遥感影像空间特征提取和分类的应用研究   总被引:38,自引:3,他引:38  
提出了基于支撑向量机(SVM)的遥感影像空间特征提取的新方法,并以SPOT全色波段影像上城市特征信息的提取为应用实例,并与人工神经网络(ANN)等特征提取方法进行综合比较,认为SVM方法不但能够获得比较高的分类精度,而且在学习速度、自适应能力、特征空间高维不限制、可表达性等方面具有优势。  相似文献   

3.
A key issue to address in synthesizing spatial data with variable-support in spatial analysis and modeling is the change-of-support problem. We present an approach for solving the change-of-support and variable-support data fusion problems. This approach is based on geostatistical inverse modeling that explicitly accounts for differences in spatial support. The inverse model is applied here to produce both the best predictions of a target support and prediction uncertainties, based on one or more measurements, while honoring measurements. Spatial data covering large geographic areas often exhibit spatial nonstationarity and can lead to computational challenge due to the large data size. We developed a local-window geostatistical inverse modeling approach to accommodate these issues of spatial nonstationarity and alleviate computational burden. We conducted experiments using synthetic and real-world raster data. Synthetic data were generated and aggregated to multiple supports and downscaled back to the original support to analyze the accuracy of spatial predictions and the correctness of prediction uncertainties. Similar experiments were conducted for real-world raster data. Real-world data with variable-support were statistically fused to produce single-support predictions and associated uncertainties. The modeling results demonstrate that geostatistical inverse modeling can produce accurate predictions and associated prediction uncertainties. It is shown that the local-window geostatistical inverse modeling approach suggested offers a practical way to solve the well-known change-of-support problem and variable-support data fusion problem in spatial analysis and modeling.  相似文献   

4.
针对现有空间插值方法对样点空间分布及结构约束考虑较少,难以保真原有空间数据的统计参量等问题,利用Voronoi和Delaunay的相互关系,建立了基于样点分布V-邻域结构的插值控制点自适应生成方法,构建了顾及样点分布结构与分布密度的结构保持空间插值方法。基于中国气象台站日均气温数据的方法验证与对比表明,相比于常用的空间插值算法,本文算法具有更好的结构自适应性,且对原始数据的空间统计特征具有更好的保持性。  相似文献   

5.
等高线内插在地图自动综合、地图数字化、三维地形重建等过程中都具有重要意义。许多等高线内插算法在等高线急剧变化以及闭合等高线处存在问题。在分析已有等高线内插算法优缺点的基础上,提出了一种等高线内插算法。该算法以等高线上的节点为圆心,建立与相邻等高线之间的内切圆来探测相邻等高线之间的空间关系,并获取等高线间的辅助线,进而内插出等高线,一方面弥补了已有等高线内插方法中的问题,另一方面有效提高了等高线内插的速度和质量。通过与其他内插算法之间的实验对比分析,验证了本方法的科学性和先进性。  相似文献   

6.
Area-to-point Kriging in spatial hedonic pricing models   总被引:4,自引:1,他引:3  
This paper proposes a geostatistical hedonic price model in which the effects of location on house values are explicitly modeled. The proposed geostatistical approach, namely area-to-point Kriging with External Drift (A2PKED), can take into account spatial dependence and spatial heteroskedasticity, if they exist. Furthermore, this approach has significant implications in situations where exhaustive area-averaged housing price data are available in addition to a subset of individual housing price data. In the case study, we demonstrate that A2PKED substantially improves the quality of predictions using apartment sale transaction records that occurred in Seoul, South Korea, during 2003. The improvement is illustrated via a comparative analysis, where predicted values obtained from different models, including two traditional regression-based hedonic models and a point-support geostatistical model, are compared to those obtained from the A2PKED model.  相似文献   

7.
空间与谱间相关性分析的NMF高光谱解混   总被引:2,自引:1,他引:1  
袁博 《遥感学报》2018,22(2):265-276
非负矩阵分解(NMF)技术是高光谱像元解混领域的研究热点。为了充分利用高光谱图像中丰富的空间与光谱相关性特征,改善基于NMF的高光谱解混算法性能,提出一种结合了空间与谱间相关性分析的NMF解混算法。算法针对NMF的通用性和局部极小问题,引入并结合高光谱图像两种典型的相关性特征,具体包括:基于马尔可夫随机场(MRF)模型,建立描述相邻像元空间相关特征的约束;通过复杂度映射技术,建立描述相邻波段谱间相关(光谱分段平滑)特征的约束;并将上述两种约束同时引入NMF解混目标函数中。实验结果表明,对于一般自然地物场景或人造地物场景,相对于分段平滑和稀疏约束的非负矩阵分解(PSNMFSC)、交互投影子梯度的非负矩阵分解(APSNMF)和最小体积约束的非负矩阵分解(MVCNMF)这3种代表性NMF解混参考算法,该算法可进一步提高高光谱解混精度;对于空间相关或谱间相关特征中某一种不显著的特殊场景,也具有更好的适应能力。通过将空间相关和谱间相关特征相结合,较全面地反映了高光谱数据与解混相关的重要特征,能够对绝大多数真实高光谱数据进行高精度解混,对高光谱解混及后续应用领域相关研究均具有参考价值。  相似文献   

8.
为了有效解决DenStream算法在空间数据流聚类应用中存在的密度空间分布不均的问题,本文提出使用相对密度比代替密度作为聚类参数,通过考虑微簇周围密度环境,降低密度分布不均对聚类的影响。同时,使用空间格网索引,方便查找周围的微簇与数据点,进而提高算法效率。最后,通过使用真实数据对优化前后的算法进行对比,验证了优化后的算法在继承DenStream算法优点的基础上,有效地避免了密度空间分布不均的问题。  相似文献   

9.
In this article, multilayer perceptron (MLP) network models with spatial constraints are proposed for regionalization of geostatistical point data based on multivariate homogeneity measures. The study focuses on non‐stationarity and autocorrelation in spatial data. Supervised MLP machine learning algorithms with spatial constraints have been implemented and tested on a point dataset. MLP spatially weighted classification models and an MLP contiguity‐constrained classification model are developed to conduct spatially constrained regionalization. The proposed methods have been tested with an attribute‐rich point dataset of geological surveys in Ukraine. The experiments show that consideration of the spatial effects, such as the use of spatial attributes and their respective whitening, improve the output of regionalization. It is also shown that spatial sorting used to preserve spatial contiguity leads to improved regionalization performance.  相似文献   

10.
Many geodetic applications require the minimization of a convex objective function subject to some linear equality and/or inequality constraints. If a system is singular (e.g., a geodetic network without a defined datum) this results in a manifold of solutions. Most state-of-the-art algorithms for inequality constrained optimization (e.g., the Active-Set-Method or primal-dual Interior-Point-Methods) are either not able to deal with a rank-deficient objective function or yield only one of an infinite number of particular solutions. In this contribution, we develop a framework for the rigorous computation of a general solution of a rank-deficient problem with inequality constraints. We aim for the computation of a unique particular solution which fulfills predefined optimality criteria as well as for an adequate representation of the homogeneous solution including the constraints. Our theoretical findings are applied in a case study to determine optimal repetition numbers for a geodetic network to demonstrate the potential of the proposed framework.  相似文献   

11.
Due to high data volume, massive spatial data requires considerable computing power for real‐time processing. Currently, high performance clusters are the only economically viable solution given the development of multicore technology and computer component cost reduction in recent years. Massive spatial data processing demands heavy I/O operations, however, and should be characterized as a data‐intensive application. Data‐intensive application parallelization strategies, such as decomposition, scheduling and load‐balance, are much different from that of traditional compute‐intensive applications. In this article we introduce a Split‐and‐Merge paradigm for spatial data processing and also propose a robust parallel framework in a cluster environment to support this paradigm. The Split‐and‐Merge paradigm efficiently exploits data parallelism for massive data processing. The proposed framework is based on the open‐source TORQUE project and hosted on a multicore‐enabled Linux cluster. A specific data‐aware scheduling algorithm was designed to exploit data sharing between tasks and decrease the data communication time. Two LiDAR point cloud algorithms, IDW interpolation and Delaunay triangulation, were implemented on the proposed framework to evaluate its efficiency and scalability. Experimental results demonstrate that the system provides efficient performance speedup.  相似文献   

12.
Traditionally, areal interpolation has referred to techniques for transferring attribute values from one partitioning of space to a different partition of space but this is only one of several situations that create the need for estimating unknown data values for areal units. This paper presents a categorization of four areal interpolation problems that includes the "missing" data problem, the traditional "alternative geography" problem, the overlay of a choropelth and an area-class data layer, and the overlay of two choropleth data layers and demonstrates the relationship between the last three problems and general spatial interaction modelling. The "alternative geography" and overlay of choropleth and area-class data layers mirrors a singly constrained spatial interaction model while the overlay of two choropleth layers is analogous to a doubly constrained interaction model. Iterative proportional fitting techniques with and without ancillary data are developed to solve these three classes of problems.  相似文献   

13.
In the field of surveying, mapping and geodesy, there have been a number of works on the error-in-variable (EIV) model with constraints, where equality constraints are imposed on the parameter vector. However, in some cases, these constraints may be inequalities. The EIV model with inequality constraints has not been fully investigated. Therefore, this paper presents an inequality-constrained total least squares (ICTLS) solution for the EIV model with inequality constraints (denoted as ICEIV). Employing the proposed ICTLS method, the ICEIV problem is first converted into an equality-constrained problem by distinguishing the active constraints through exhaustive searching, and it is then resolved employing the method of equality-constrained total least squares (ECTLS). The applicability and feasibility of the proposed method is illustrated in two examples.  相似文献   

14.
针对可见红外成像辐射仪(visible infrared imaging radiometer suite,VIIRS)月度夜光遥感影像的数据缺失问题,提出一种利用地物邻近关系相关性的像元时空插值方法,以时、空关系互相作为约束条件,将时序变化一致性较好的像元数据作为空间插值的参考,将空间关系一致性较好的月度数据作为时序插值的参考,通过构建不同的卷积核, 在时序和空间维度分别对初步插值结果进行卷积运算,求得待插值像元的时空插值。以2015年江苏省月度夜光遥感影像修复为例,对不同维度时空插值方法进行对比分析,结果表明, 空间维度插值虽然顾及到像元的空间关联性,仍无法满足数据大范围缺失的插值要求,插值结果整体偏低;时间维度插值考虑到像元的时间趋势性,插值精度较空间维度插值有一定提高,但部分月份插值结果有较大偏差;相对于三次Hermit插值,时空插值方法获得的月度影像灯光亮度总和的最大相对误差、年度影像灯光亮度总和相对误差以及逐像元差值均显著降低。总的来看,所提时空插值方法在插值过程中同时顾及到VIIRS数据的时间趋势平稳性和空间结构稳定性,影像插值精度提高明显,且对待插值月份前后时序数据没有严格要求,更具有广泛性。  相似文献   

15.
This article reviews the interdisciplinary research field of spatial optimization for land acquisition problems. We start with a theoretical framework to identify three categories of spatial optimization models: problems with aspatial constraints, location models, and problems with topological constraints. Exact, heuristic, and metaheuristic approaches to solving these problems are critically discussed. Tools that are available in commercial and open‐source GIS packages are reviewed from four aspects. We first survey the off‐the‐shelf support and then the development environments in these packages. A case study of the one‐center problem is used to illustrate the computational performance of different solution methods. Finally the advantages and disadvantages of current GIS data models are discussed. The article concludes with challenges and future directions for solving spatial optimization problems for land acquisition.  相似文献   

16.
快速、准确地对地形进行重建以生成数字高程模型是地理信息表达的重要研究内容,径向基函数(radial basis function,RBF)作为一种插值性能较优的空间插值方法,特别适合于重建复杂的地形模型,但随着已知地形采样点数量的增加,RBF插值模型求解速度变慢,同时插值矩阵过于庞大而导致插值模型求解困难甚至求解失败。针对这个问题,本文基于区域分解和施瓦兹并行原理进行地形插值,以紧支撑径向基函数(compact support RBF,CSRBF)构建基于所有地形采样数据的全局插值矩阵,并自适应求解子区域CSRBF插值节点紧支撑半径,基于限制性加性施瓦兹方法(restricted additive Schwarz method,RASM)采用多核并行架构对各局部子区域的插值矩阵进行求解。以某地区数字高程模型(DEM)数据进行插值实验,结果表明,本文方法能够对大规模地形数据进行准确重建,并且具有较高的求解效率。  相似文献   

17.
若干平滑和插值方法对图像空间分辨力估算的影响   总被引:5,自引:1,他引:4  
图像空间分辨力是图像质量评估中的一个重要指标,而对图像空间分辨力的估算通常采用调制传递函数(MIF)解算。由于图像噪声的存在和采样数据的离散性,平滑和插值是必不可少的两个环节,因此,平滑和插值算法的好坏直接影响最后的评估结果。采用了两种最常用的平滑算法和两种插值算法,并按8种实验方案对两幅典型的图像进行了实验对比研究,获得了这两种算法对图像空间分辨力评估的影响机理,从而遴选出了较好的平滑和插值算法  相似文献   

18.
根据总体最小二乘准则,可以将附有不等式约束的变量误差(errors-in-variables,EIV)模型转化为标准最优化问题,并运用有效集法、序列二次规划法等优化方法求解。已有算法在涉及计算目标函数的Hesse矩阵(二阶导数)时,存在计算量较大的缺陷。针对上述问题,利用基于拟牛顿法修正Hesse矩阵的序列二次规划算法解算附有不等式约束加权总体最小二乘问题,新算法减小了计算量,可以提高收敛速度。通过实例,证明了该算法具有很好的适用性和计算效率。  相似文献   

19.
In this letter, a general Bayesian data fusion (BDF) approach is proposed and applied to the spatial enhancement of ASTER thermal images. This method fuses information coming from the visible or near-infrared bands (15 $times$ 15 m pixels) with the thermal infrared bands (90 $times$ 90 m pixels) by explicitly accounting for the change of support. By relying on linear multivariate regression assumptions, differences of support size for input images can be explicitly accounted for. Due to the use of locally varying variances, it also avoids producing artifacts on the fused images. Based on a set of ASTER images over the region of Lausanne, Switzerland, the advantages of this support-based approach are assessed and compared to the downscaling cokriging approach recently proposed in the literature. Results show that improvements are substantial with respect to both visual and quantitative criteria. Although the method is illustrated here with a specific case study, it is versatile enough to be applied to the spatial enhancement problem in general. It thus opens new avenues in the context of remotely sensed images.   相似文献   

20.
The inequality-constrained least squares (ICLS) problem can be solved by the simplex algorithm of quadratic programming. The ICLS problem may also be reformulated as a Bayesian problem and solved by using the Bayesian principle. This paper proposes using the aggregate constraint method of non-linear programming to solve the ICLS problem by converting many inequality constraints into one equality constraint, which is a basic augmented Lagrangean algorithm for deriving the solution to equality-constrained non-linear programming problems. Since the new approach finds the active constraints, we can derive the approximate algorithm-dependent statistical properties of the solution. As a result, some conclusions about the superiority of the estimator can be approximately made. Two simulated examples are given to show how to compute the approximate statistical properties and to show that the reasonable inequality constraints can improve the results of geodetic network with an ill-conditioned normal matrix.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号