Matthias Schubert

Prof. Dr. Matthias Schubert

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2020 in Remote Sensing
Verified
Journal Article
Open access
PDF file
JRJAKARIA RABBI
JAKARIA RABBI
NRNilanjan Ray
Nilanjan Ray
MSMatthias Schubert
Matthias Schubert
SCSubir Chowdhury
Subir Chowdhury
DCDennis Chao
Dennis Chao
The detection performance of small objects in remote sensing images has not been satisfactory compared to large objects, especially in low-resolution and noisy images. A generative adversarial network (GAN)-based model called enhanced super-resolution GAN (ESRGAN) showed remarkable image enhancement performance, but reconstructed images usually miss high-frequency edge information. Therefore, object detection performance showed degradation for small objects on recovered noisy and low-resolution remote sensing images. Inspired by the success of edge enhanced GAN (EEGAN) and ESRGAN, we applied a new edge-enhanced super-resolution GAN (EESRGAN) to improve the quality of remote sensing images and used different detector networks in an end-to-end manner where detector loss was backpropagated into the EESRGAN to improve the detection performance. We proposed an architecture with three components: ESRGAN, EEN, and Detection network. We used residual-in-residual dense blocks (RRDB) for both the ESRGAN and EEN, and for the detector network, we used a faster region-based convolutional network (FRCNN) (two-stage detector) and a single-shot multibox detector (SSD) (one stage detector). Extensive experiments on a public (car overhead with context) dataset and another self-assembled (oil and gas storage tank) satellite dataset showed superior performance of our method compared to the standalone state-of-the-art object detectors.

4 November 2019 in Remote Sensing
Verified
Journal Article
Open access
PDF file
MFMichael Fromm
Michael Fromm
MSMatthias Schubert
Matthias Schubert
Guillermo CastillaGuillermo Castilla
Guillermo Castilla
JLJulia Linke
Julia Linke
Greg McDermidGreg McDermid
Greg McDermid
Monitoring tree regeneration in forest areas disturbed by resource extraction is a requirement for sustainably managing the boreal forest of Alberta, Canada. Small remotely piloted aircraft systems (sRPAS, a.k.a. drones) have the potential to decrease the cost of field surveys drastically, but produce large quantities of data that will require specialized processing techniques. In this study, we explored the possibility of using convolutional neural networks (CNNs) on this data for automatically detecting conifer seedlings along recovering seismic lines: a common legacy footprint from oil and gas exploration. We assessed three different CNN architectures, of which faster region-CNN (R-CNN) performed best (mean average precision 81%). Furthermore, we evaluated the effects of training-set size, season, seedling size, and spatial resolution on the detection performance. Our results indicate that drone imagery analyzed by artificial intelligence can be used to detect conifer seedling in regenerating sites with high accuracy, which increases with the size in pixels of the seedlings. By using a pre-trained network, the size of the training dataset can be reduced to a couple hundred seedlings without any significant loss of accuracy. Furthermore, we show that combining data from different seasons yields the best results. The proposed method is a first step towards automated monitoring of forest restoration/regeneration.

1 August 2013
Verified
Conference Paper
Closed access
ADAnders Drachen
Anders Drachen
MSMatthias Schubert
Matthias Schubert
The recently emerged field of game analytics and the development and adaptation of business intelligence techniques to support game design and development has given data-driven techniques a direct role in game development. Given that all digital games contain some sort of spatial operation, techniques for spatial analysis had their share in these developments. However, the methods for analyzing and visualizing spatial and spatio-temporal patterns in player behavior being used by the game industry are not as diverse as the range of techniques utilized in game research, leaving room for a continuing development. This paper presents a review of current work on spatial and spatio-temporal game analytics across industry and research, describing and defining the key terminology, outlining current techniques and their application. We summarize the current problems and challenges in the field, and present four key areas of spatial and spatio-temporal analytics: Spatial Outlier Detection, Spatial Clustering, Spatial Predictive Models, Spatial Pattern and Rule Mining. All key areas are well-established outside the context of games and hold the potential to reshape the research roadmap in game analytics.

23 May 2023 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
ZLZhuang Liu
Zhuang Liu
YMYunpu Ma
Yunpu Ma
MSMatthias Schubert
Matthias Schubert
YOYuanxin Ouyang
Yuanxin Ouyang
WRWenge Rong
Wenge Rong
ZXZhang Xiong
Zhang Xiong
Explanations play an essential role in helping users evaluate results from recommender systems. Various natural language generation methods have been proposed to generate explanations for the recommendation. However, they usually suffer from two problems. First, since user-provided review text contains noisy data, the generated explanations may be irrelevant to the recommended items. Second, as lacking some supervision signals, most of the generated sentences are similar, which cannot meet the diversity and personalized needs of users. To tackle these problems, we propose a multimodal contrastive transformer (MMCT) model for an explainable recommendation, which incorporates multimodal information into the learning process, including sentiment features, item features, item images, and refined user reviews. Meanwhile, we propose a dynamic fusion mechanism during the decoding stage, which generates supervision signals to guide the explanation generation. Additionally, we develop a contrastive objective to generate diverse explainable texts. Comprehensive experiments on two real-world datasets show that the proposed model outperforms comparable explainable recommendation baselines in terms of explanation performance and recommendation performance. Efficiency analysis and robustness analysis verify the advantages of the proposed model. While ablation analysis establishes the relative contributions of the respective components and various modalities, the case study shows the working of our model from an intuitive sense.

15 July 2023
Verified
Conference Paper
Open access
AGAlessandro Giovagnoli
Alessandro Giovagnoli
VTVolker Tresp
Volker Tresp
YMYunpu Ma
Yunpu Ma
MSMatthias Schubert
Matthias Schubert
Quantum Machine Learning (QML) is a recent and rapidly evolving field where the theoretical framework and logic of quantum mechanics are employed to solve machine learning tasks. Various techniques with different levels of quantum-classical hybridization have been proposed. Here we focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks in the noisy intermediate-scale quantum (NISQ) era. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. This paper focuses on this last problem for finding optimal architectures of variational quantum circuits for various tasks. To address it, we propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC. In particular, we present a version of the well-known neuroevolution of augmenting topologies (NEAT) algorithm and adapt it to the case of variational quantum circuits. We refer to the proposed architecture search algorithm for VQC as QNEAT. We test the algorithm with different benchmark problems of classical fields of machine learning i.e. reinforcement learning and combinatorial optimization.

5 November 2013
Verified
Conference Paper
Open access
GJGregor Jossé
Gregor Jossé
MSMatthias Schubert
Matthias Schubert
HKHans-Peter Kriegel
Hans-Peter Kriegel
Ordinary navigation systems compute the cost-optimal way to a given destination. However, it is often not possible to directly park the car at the destination of a route. Since parking possibilities are often limited, drivers have to locate a free parking spot when getting close to their destination. This often proves rather problematic in unknown environments. Recent advances in car sensoring techniques and vehicle ad-hoc networks allow the construction of real-time maps of currently unoccupied parking spots. In this paper, we examine the problem of guiding a driver to an unoccupied parking spot given such an ad-hoc map. The major problem of this task is the volatility of parking spot vacancy, especially in urban residential areas. Thus, we model the availability as a probability distribution decreasing over time and compute routes maximizing the likelihood of finding a parking spot. Formally, this task can be considered as a variant of the time-dependent traveling salesman problem (TSP). Due to the exponential time complexity, we propose an efficient greedy algorithm to find a good approximation. In our experimental evaluation, we compare the greedy approach to a time-capped complete search.