Large-area assessment of impervious surface based on integrated analysis of single-date Landsat-7 images and geospatial vector data

Driven by a constantly accelerating increase of urban population in recent decades urban sprawl has become one of the most dynamic processes in the context of global land use transformations. The expansion of urban agglomerations is closely associated with a substantial increase of impervious surface. In Europe, methods for an accurate, fast and cost-effective mapping and assessment of impervious surface on a state-wide or national scale have not been established so far. This study presents an approach for estimating the impervious surface based on a combined analysis of single-date Landsat images and road network and railway vector data using Support Vector Machines and functionalities of geographic information processing. The modeling aims at the provision of data on the impervious surface for the total of residential, industrial and transportation-related areas. The derived information is provided for the administrative units of communities. The output of the procedure is a vector data file providing the ‘percent impervious surface of built-up areas’ (PIS_B) and the ‘percent impervious surface of the total of built-up and transportation-related areas’ (PIS_BT) for the administrative units of communities. The developed method is tested for a study area covering almost one third of the German territory. The results prove the suitability of the approach for a widely automated and area-wide mapping of impervious surfaces. Using reference data sets of three cities (Leipzig, Ludwigshafen, Passau) we realized a mean absolute error of 19.8% and an average error of 6.4% for the percent impervious surface modeled on the basis of the Landsat images. The final product resulting from a combination of the imperviousness raster derived from the satellite images with the transportation-related vector information showed a mean difference of 1% to 4% compared to corresponding reference data and results of previous studies. For the year 2000 our research shows that 45.3% of the area occupied by settlements and transport infrastructure in the German federal state of Bavaria, 44.6% in the state of Baden-Württemberg and 42.6% in the state of Saxony was covered by impervious surface.     

Exploring educational immersive videogames: an empirical study with a 3D multimodal interaction prototype

ABSTRACT

Gestural interaction devices emerged and originated various studies on multimodal human–computer interaction to improve user experience (UX). However, there is a knowledge gap regarding the use of these devices to enhance learning. We present an exploratory study which analysed the UX with a multimodal immersive videogame prototype, based on a Portuguese historical/cultural episode. Evaluation tests took place in high school environments and public videogaming events. Two users would be present simultaneously in the same virtual reality (VR) environment: one as the helmsman aboard Vasco da Gama’s fifteenth-century Portuguese ship and the other as the mythical Adamastor stone giant at the Cape of Good Hope. The helmsman player wore a VR headset to explore the environment, whereas the giant player used body motion to control the giant, and observed results on a screen, with no headset. This allowed a preliminary characterisation of UX, identifying challenges and potential use of these devices in multi-user virtual learning contexts. We also discuss the combined use of such devices, towards future development of similar systems, and its implications on learning improvement through multimodal human–computer interaction.     

Morphological Counterparts of Linear Shift-Invariant Scale-Spaces

It is well-known that there are striking analogies between linear shift-invariant systems and morphological systems for image analysis. So far, however, the relations between both system theories are mainly understood on a pure convolution / erosion level. A formal connection on the level of differential or pseudodifferential equations and their induced scale-spaces is still missing. The goal of our paper is to close this gap. We present a simple and fairly general dictionary that allows to translate any linear shift-invariant evolution equation into its morphological counterpart and vice versa. It is based on a scale-space representation by means of the symbol of its (pseudo)differential operator. Introducing a novel transformation, the Cramér–Fourier transform, puts us in a position to relate the symbol to the structuring function of a morphological scale-space of Hamilton–Jacobi type. As an application of our general theory, we derive the morphological counterparts of many linear shift-invariant scale-spaces, such as the Poisson scale-space, \(\alpha \)-scale-spaces, summed \(\alpha \)-scale-spaces, relativistic scale-spaces, and their anisotropic variants. Our findings are illustrated by experiments.     

Principal motion components for one-shot gesture recognition

This paper introduces principal motion components (PMC), a new method for one-shot gesture recognition. In the considered scenario a single training video is available for each gesture to be recognized, which limits the application of traditional techniques (e.g., HMMs). In PMC, a 2D map of motion energy is obtained per each pair of consecutive frames in a video. Motion maps associated to a video are processed to obtain a PCA model, which is used for recognition under a reconstruction-error approach. The main benefits of the proposed approach are its simplicity, easiness of implementation, competitive performance and efficiency. We report experimental results in one-shot gesture recognition using the ChaLearn Gesture Dataset; a benchmark comprising more than 50,000 gestures, recorded as both RGB and depth video with a Kinect?camera. Results obtained with PMC are competitive with alternative methods proposed for the same data set.     

Incorporating technology in service-oriented i* business models: a case study

In recent years, considerable attention has been paid to enterprise information systems. This interest is motivated by the need for achieving better integration of new technologies (hardware and software) with the business processes of an organization. Business processes have become more and more dependent on technologies because technology has a direct impact on business processes, changing the way they are performed and thus also affecting the way analysts design the software system. However, at the present time, there are still some gaps between the definition of business processes and the technologies used in the organization. In practice, organizations have carried out their business processes using different technologies; however, it is sometimes not possible to determine how technologies are useful in achieving current business goals. This is because business models do not explicitly consider the technologies in the organizational requirements. The goal of this paper is to present a systematic process for integrating business processes and technologies at the conceptual level. To validate our approach, we present a case study that describes the processes of the inventory management department of a public research center.     

Theory blending: extended algorithmic aspects and examples

In Cognitive Science, conceptual blending has been proposed as an important cognitive mechanism that facilitates the creation of new concepts and ideas by constrained combination of available knowledge. It thereby provides a possible theoretical foundation for modeling high-level cognitive faculties such as the ability to understand, learn, and create new concepts and theories. Quite often the development of new mathematical theories and results is based on the combination of previously independent concepts, potentially even originating from distinct subareas of mathematics. Conceptual blending promises to offer a framework for modeling and re-creating this form of mathematical concept invention with computational means. This paper describes a logic-based framework which allows a formal treatment of theory blending (a subform of the general notion of conceptual blending with high relevance for applications in mathematics), discusses an interactive algorithm for blending within the framework, and provides several illustrating worked examples from mathematics.     

Land cover classification with coarse spatial resolution data to derive continuous and discrete maps for complex regions

Regularly updated land cover information at continental or national scales is a requirement for various land management applications as well as biogeochemical and climate modeling exercises. However, monitoring or updating of map products with sufficient spatial detail is currently not widely practiced due to inadequate time-series coverage for most regions of the Earth. Classifications of coarser spatial resolution data can be automatically generated on an annual or finer time scale. However, discrete land cover classifications of such data cannot sufficiently quantify land surface heterogeneity or change. This study presents a methodology for continuous and discrete land cover mapping using moderate spatial resolution time series data sets. The method automatically selects sample data from higher spatial resolution maps and generates multiple decision trees. The leaves of decision trees are interpreted considering the sample distribution of all classes yielding class membership maps, which can be used as estimates for the diversity of classes in a coarse resolution cell. Results are demonstrated for the heterogeneous, small-patch landscape of Germany and the bio-climatically varying landscape of South Africa. Results have overall classification accuracies of 80%. A sensitivity analysis of individual modules of the classification process indicates the importance of appropriately chosen features, sample data balanced among classes, and an appropriate method to combine individual classifications. The comparison of classification results over several years not only indicates the method's consistency, but also its potential to detect land cover changes.     

How to calculate symmetries of Petri nets

Symmetric net structure yields symmetric net behaviour. Thus, knowing the symmetries of a net, redundant calculations can be skipped. We present a framework for the calculation of symmetries for several net classes including place/transition nets, timed nets, stochastic nets, self–modifying nets, nets with inhibitor arcs, and many others. Our approach allows the specification of different symmetry groups. Additionally it provides facilities either to calculate symmetries on demand while running the actual analysis algorithm, or to calculate them in advance. For the latter case we define and calculate a ground set of symmetries. Such a set has polynomial size and is sufficient for an efficient implementation of the for all symmetries loop and the partition of net elements into equivalence classes. These two constructions are the usual way to integrate symmetries into an analysis algorithm. Received 7 July 1997 / 10 August 1999