High-dimensional imaging is becoming increasingly relevant in many fields from astronomy and cultural heritage to systems biology. Visual exploration of such high-dimensional data is commonly facilitated by dimensionality reduction. Consequently, exploration of such data is Figure 1: Texture-aware dimensionality reduction. An image typically split into a step focusing on the attribute space followed by (a) with black and white pixels forms multiple textures. In this paper, distance-based dimensionality reduction produces one cluster of we present a method for incorporating spatial neighborhood information black and one cluster of white pixels (b), a texture-aware version into distance-based dimensionality reduction methods, such as should create clusters for the different textures (c). We achieve this by modifying the distance measure between high-dimensional attribute vectors associated with each pixel such that it takes the pixel's spatial neighborhood into account. Based on a classification The spatial configuration is, however, commonly of interest when of different methods for comparing image patches, we explore a analyzing high-dimensional image data. We compare these approaches from neighborhood information into account, in addition to highdimensional a theoretical and experimental point of view. Typical approaches to combine high-dimensional evaluation on synthetic data and two real-world use cases. They use the embedding as a colormap and perform segmentation on the re-colored image. High-dimensional data is commonly acquired and analyzed in various Decoupling the high-dimensional and spatial analysis in such a application domains, from systems biology [26] to insurance way has several downsides: Most importantly, boundaries between fraud detection [37]. Typically, high-dimensional data are tabular clusters in an embedding are often not well defined, and as such data with many columns (or attributes), corresponding to the dimensionality classification is ambiguous and has a level of arbitrariness.

With the field of rigid-body robotics having matured in the last fifty years, routing, planning, and manipulation of deformable objects have emerged in recent years as a more untouched research area in many fields ranging from surgical robotics to industrial assembly and construction. Routing approaches for deformable objects which rely on learned implicit spatial representations (e.g., Learning-from-Demonstration methods) make them vulnerable to changes in the environment and the specific setup. On the other hand, algorithms that entirely separate the spatial representation of the deformable object from the routing and manipulation, often using a representation approach independent of planning, result in slow planning in high dimensional space. This paper proposes a novel approach to spatial representation combined with route planning that allows efficient routing of deformable one-dimensional objects (e.g., wires, cables, ropes, threads). The spatial representation is based on the geometrical decomposition of the space into convex subspaces, which allows an efficient coding of the configuration. Having such a configuration, the routing problem can be solved using a dynamic programming matching method with a quadratic time and space complexity. The proposed method couples the routing and efficient configuration for improved planning time. Our tests and experiments show the method correctly computing the next manipulation action in sub-millisecond time and accomplishing various routing and manipulation tasks.

Successful analysis of video data requires an integration of techniques from KR, Computer Vision, and Machine Learning. Being able to detect and to track objects as well as extracting their changing spatial relations with other objects is one approach to describing and detecting events. Different kinds of spatial relations are important, including topology, direction, size, and distance between objects as well as changes of those relations over time. Typically these kinds of relations are treated separately, which makes it difficult to integrate all the extracted spatial information. We present a uniform and comprehensive spatial representation of moving objects that includes all the above spatial/temporal aspects, analyse different properties of this representation and demonstrate that it is suitable for video analysis.

The Region Connection Calculus (RCC) is a well-known calculus for representing part-whole and topological relations. It plays an important role in qualitative spatial reasoning, geographical information science, and ontology. The computational complexity of reasoning with RCC has been investigated in depth in the literature. Most of these works focus on the consistency of RCC constraint networks. In this paper, we consider the important problem of redundant RCC constraints.

We present a cognitive design assistance system equipped with analytical capabilities aimed at anticipating architectural building design performance with respect to people-centred functional design goals. The paper focuses on the system capability to generate "narratives of visuo-locomotive user experience" from digital computer-aided architecture design (CAAD) models. The system is based on an underlying declarative narrative representation and computation framework pertaining to conceptual, geometric, and qualitative spatial knowledge. The semantics of the declarative narrative model, i.e., the overall representation and computation model, is founded on: (a).

We introduce a framework for qualitative reasoning about directions in high-dimensional spaces, called EER, where our main motivation is to develop a form of commonsense reasoning about semantic spaces. The proposed framework is, however, more general; we show how qualitative spatial reasoning about points with several existing calculi can be reduced to the realisability problem for EER (or REER for short), including LR and calculi for reasoning about betweenness, collinearity and parallelism. Finally, we propose an efficient but incomplete inference method, and show its effectiveness for reasoning with EER as well as reasoning with some of the aforementioned calculi.

Qualitative spatial reasoning deals with relational spatial knowledge and with how this knowledge can be processed efficiently. Identifying suitable representations for spatial knowledge and checking whether the given knowledge is consistent has been the main research focus in the past two decades. However, where the spatial information comes from, what kind of information can be obtained and how it can be obtained has been largely ignored. This paper is an attempt to start filling this gap. We present a method for extracting detailed spatial information from sensor measurements of regions. We analyse how different sparse sensor measurements can be integrated and what spatial information can be extracted from sensor measurements. Different from previous approaches to qualitative spatial reasoning, our method allows us to obtain detailed information about the internal structure of regions. The result has practical implications, for example, in disaster management scenarios, which include identifying the safe zones in bushfire and flood regions.

The ability to understand behaviour is a crucial skill for Artificial Intelligence systems that are expected to interact with external agents such as humans or other AI systems. Such systems might be expected to operate in co-operative or team-based scenarios, such as domestic robots capable of helping out with household jobs, or disaster relief robots expected to collaborate and lend assistance to others. Conversely, they may also be required to hinder the activities of malicious agents in adversarial scenarios. In this paper we address the problem of modelling agent behaviour in domains expressed in continuous, quantitative space by applying qualitative, relational spatial abstraction techniques. We employ three common techniques for Qualitative Spatial Reasoning -- the Region Connection Calculus, the Qualitative Trajectory Calculus and the Star calculus. We then supply an algorithm based on analysis of Mutual Information that allows us to find the set of abstract, spatial relationships that provide high degrees of information about an agent's future behaviour. We employ the RoboCup soccer simulator as a base for movement-based tasks of our own design and compare the predictions of our system against those of systems utilising solely metric representations. Results show that use of a spatial abstraction-based representation, along with feature selection mechanisms, allows us to outperform metric representations on the same tasks.

In this paper we present a logical formalism for the treatment of pragmatic ambiguity in spatial expressions of the frontal axis (front/back). The ambiguity occurs because the same situation can be analyzed from different points of view. For this, we use frames of reference for the interpretation of front/back (intrinsic, extrinsic, deictic) together with formalisms of qualitative spatial reasoning.

Accurate real-time traffic forecast is critical for intelligent transportation systems (ITS) and it serves as the cornerstone of various smart mobility applications. Though this research area is dominated by deep learning, recent studies indicate that the accuracy improvement by developing new model structures is becoming marginal. Instead, we envision that the improvement can be achieved by transferring the "forecasting-related knowledge" across cities with different data distributions and network topologies. To this end, this paper aims to propose a novel transferable traffic forecasting framework: Domain Adversarial Spatial-Temporal Network (DASTNet). DASTNet is pre-trained on multiple source networks and fine-tuned with the target network's traffic data. Specifically, we leverage the graph representation learning and adversarial domain adaptation techniques to learn the domain-invariant node embeddings, which are further incorporated to model the temporal traffic data. To the best of our knowledge, we are the first to employ adversarial multi-domain adaptation for network-wide traffic forecasting problems. DASTNet consistently outperforms all state-of-the-art baseline methods on three benchmark datasets. The trained DASTNet is applied to Hong Kong's new traffic detectors, and accurate traffic predictions can be delivered immediately (within one day) when the detector is available. Overall, this study suggests an alternative to enhance the traffic forecasting methods and provides practical implications for cities lacking historical traffic data.