The impact of misregistration on SRTM and DEM image differences

Image differences between Shuttle Radar Topography Mission (SRTM) data and other Digital Elevation Models (DEMs) are often performed for either accuracy assessment or for estimating vegetation height across the landscape. It has been widely assumed that the effect of sub-pixel misregistration between the two models on resultant image differences is negligible, yet this has not previously been tested in detail. The aim of this study was to determine the impact that various levels of misregistration have on image differences between SRTM and DEMs. First, very accurate image co-registration was performed at two study sites between higher resolution DEMs and SRTM data, and then image differences (SRTM–DEM) were performed after various levels of misregistration were systematically introduced into the SRTM data. It was found that: (1) misregistration caused an erroneous and dominant correlation between elevation difference and aspect across the landscape; (2) the direction of the misregistration defined the direction of this erroneous and systematic elevation difference; (3) for sub-pixel misregistration the error due solely to misregistration was greater than, or equal to the true difference between the two models for substantial proportions of the landscape (e.g., greater than 33% of the area for a half-pixel misregistration); and (4) the strength of the erroneous relationship with aspect was enhanced by steeper terrain. Spatial comparisons of DEMs were found to be sensitive to even sub-pixel misregistration between the two models, which resulted in a strong erroneous correlation with aspect. This misregistration induced correlation with aspect is not likely specific to SRTM data only; we expect it to be a generic relationship present in any DEM image difference analysis.     

Using local transition probability models in Markov random fields for forest change detection

Change detection based on the comparison of independently classified images (i.e. post-classification comparison) is well-known to be negatively affected by classification errors of individual maps. Incorporating spatial-temporal contextual information in the classification helps to reduce the classification errors, thus improving change detection results. In this paper, spatial-temporal Markov Random Fields (MRF) models were used to integrate spatial-temporal information with spectral information for multi-temporal classification in an attempt to mitigate the impacts of classification errors on change detection. One important component in spatial-temporal MRF models is the specification of transition probabilities. Traditionally, a global transition probability model is used that assumes spatial stationarity of transition probabilities across an image scene, which may be invalid if areas have varying transition probabilities. By relaxing the stationarity assumption, we developed two local transition probability models to make the transition model locally adaptive to spatially varying transition probabilities. The first model called locally adjusted global transition model adapts to the local variation by multiplying a pixel-wise probability of change with the global transition model. The second model called pixel-wise transition model was developed as a fully local model based on the estimation of the pixel-wise joint probabilities. When applied to the forest change detection in Paraguay, the two local models showed significant improvements in the accuracy of identifying the change from forest to non-forest compared with traditional models. This indicates that the local transition probability models can present temporal information more accurately in change detection algorithms based on spatial-temporal classification of multi-temporal images. The comparison between the two local transition models showed that the fully local model better captured the spatial heterogeneity of the transition probabilities and achieved more stable and consistent results over different regions of a large image scene.     

Floodplain roughness parameterization using airborne laser scanning and spectral remote sensing

Floodplain roughness parameterization is one of the key elements of hydrodynamic modeling of river flow, which is directly linked to exceedance levels of the embankments of lowland fluvial areas. The present way of roughness mapping is based on manually delineated floodplain vegetation types, schematized as cylindrical elements of which the height (m) and the vertical density (the projected plant area in the direction of the flow per unit volume, m^− 1) have to be assigned using a lookup table. This paper presents a novel method of automated roughness parameterization. It delivers a spatially distributed roughness parameterization in an entire floodplain by fusion of CASI multispectral data with airborne laser scanning (ALS) data. The method consists of three stages: (1) pre-processing of the raw data, (2) image segmentation of the fused data set and classification into the dominant land cover classes (KHAT = 0.78), (3) determination of hydrodynamic roughness characteristics for each land cover class separately. In stage three, a lookup table provides numerical values that enable roughness calculation for the classes water, sand, paved area, meadows and built-up area. For forest and herbaceous vegetation, ALS data enable spatially detailed analysis of vegetation height and density. The hydrodynamic vegetation density of forest is mapped using a calibrated regression model. Herbaceous vegetation cover is further subdivided in single trees and non-woody vegetation. Single trees were delineated using a novel iterative cluster merging method, and their height is predicted (R² = 0.41, rse = 0.84 m). The vegetation density of single trees was determined in an identical way as for forest. Vegetation height and density of non-woody herbaceous vegetation were also determined using calibrated regression models. A 2D hydrodynamic model was applied with the results of this novel method, and compared with a traditional roughness parameterization approach. The modeling results showed that the new method is well able to provide accurate output data. The new method provides a faster, repeatable, and more accurate way of obtaining floodplain roughness, which enables regular updating of river flow models.     

High Performance GPU‐based Proximity Queries using Distance Fields

Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics‐based modelling, augmented and virtual reality. We present efficient algorithms for proximity queries between a closed rigid object and an arbitrary, possibly deformable, polygonal mesh. Using graphics hardware to densely sample the distance field of the rigid object over the arbitrary mesh, we compute minimal proximity and collision response information on the graphics processing unit (GPU) using blending and depth buffering, as well as parallel reduction techniques, thus minimizing the readback bottleneck. Although limited to image‐space resolution, our algorithm provides high and steady performance when compared with other similar algorithms. Proximity queries between arbitrary meshes with hundreds of thousands of triangles and detailed distance fields of rigid objects are computed in a few milliseconds at high‐sampling resolution, even in situations with large overlap.     

基于目标存在概率场的多视角运动目标检测与对应算法

提出了一种多视角运动目标检测与对应算法---基于目标存在概率场的运动目标检测和对应算法. 目标存在概率场是算法的核心, 其融合各视角的信息, 并依据融合结果在空间中检测目标. 目标窗结构是快速计算目标存在概率场的关键, 并给出了一种同时实现目标检测和对应的框架. 实验结果表明该算法具有遮挡处理能力强, 计算复杂度低的优点.     

Continuous collision detection for adaptive simulation of articulated bodies

We perform continuous collision detection (CCD) for articulated bodies where motion is governed by an adaptive dynamics simulation. Our algorithm is based on a novel hierarchical set of transforms that represent the kinematics of an articulated body recursively, as described by an assembly tree. The performance of our CCD algorithm significantly improves as the number of active degrees of freedom in the simulation decreases.     

基于多时相遥感图像的人造目标变化检测算法

传统的像素级变化检测方法的检测性能受到以下因素的严重制约: 图像辐射差异、配准误差和差异图像分类门限的选取, 并且难以从检测信息中提取出关键的变化. 本文针对遥感图像中人造目标的变化检测问题, 提出了一种综合特征级和像素级的两步变化检测算法. 首先将大幅多时相遥感图像分成一系列子图像对, 采用有监督子图像对分类方法, 提取人造目标变化的感兴趣区域, 然后采用像素级变化检测算法对感兴趣区域进行变化检测, 得到定量的检测结果. 实验结果表明了该算法的可行性和有效性.     

基于顺序统计滤波的实时语音端点检测算法

针对嵌入式语音识别系统,提出了一种高效的实时语音端点检测算法. 算法以子带频谱熵为语音/噪声的区分特征, 首先将每帧语音的频谱划分成若干个子带, 计算出每个子带的频谱熵, 然后把相继若干帧的子带频谱熵经过一组顺序统计滤波器获得每帧的频谱熵, 根据频谱熵的值对输入的语音进行分类. 实验结果表明, 该算法能够有效地区分语音和噪声, 可以显著地提高语音识别系统的性能. 在不同的噪声环境和信噪比条件下具有鲁棒性. 此外, 本文提出的算法计算代价小, 简单易实现, 适合实时嵌入式语音识别系统的应用.     

“How do you know that I don’t understand?” A look at the future of intelligent tutoring systems

Many software systems would significantly improve performance if they could adapt to the emotional state of the user, for example if Intelligent Tutoring Systems (ITSs), ATM’s, ticketing machines could recognise when users were confused, frustrated or angry they could guide the user back to remedial help systems so improving the service. Many researchers now feel strongly that ITSs would be significantly enhanced if computers could adapt to the emotions of students. This idea has spawned the developing field of affective tutoring systems (ATSs): ATSs are ITSs that are able to adapt to the affective state of students. The term “affective tutoring system” can be traced back as far as Rosalind Picard’s book Affective Computing in 1997.This paper presents research leading to the development of Easy with Eve, an ATS for primary school mathematics. The system utilises a network of computer systems, mainly embedded devices to detect student emotion and other significant bio-signals. It will then adapt to students and displays emotion via a lifelike agent called Eve. Eve’s tutoring adaptations are guided by a case-based method for adapting to student states; this method uses data that was generated by an observational study of human tutors. This paper presents the observational study, the case-based method, the ATS itself and its implementation on a distributed computer systems for real-time performance, and finally the implications of the findings for Human Computer Interaction in general and e-learning in particular. Web-based applications of the technology developed in this research are discussed throughout the paper.     

An architecture framework for an adaptive extensible processor

To improve the performance of embedded processors, an effective technique is collapsing critical computation subgraphs as application-specific instruction set extensions and executing them on custom functional units. The problem with this approach is the immense cost and the long times required to design a new processor for each application. As a solution to this issue, we propose an adaptive extensible processor in which custom instructions (CIs) are generated and added after chip-fabrication. To support this feature, custom functional units are replaced by a reconfigurable matrix of functional units (FUs). A systematic quantitative approach is used for determining the appropriate structure of the reconfigurable functional unit (RFU). We also introduce an integrated framework for generating mappable CIs on the RFU. Using this architecture, performance is improved by up to 1.33, with an average improvement of 1.16, compared to a 4-issue in-order RISC processor. By partitioning the configuration memory, detecting similar/subset CIs and merging small CIs, the size of the configuration memory is reduced by 40%.