05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Permanent URI for this collectionhttps://elib.uni-stuttgart.de/handle/11682/6

Browse

Search Results

Now showing 1 - 9 of 9
  • Thumbnail Image
    ItemOpen Access
    Usable and fast interactive mental face reconstruction
    (2023) Strohm, Florian; Bâce, Mihai; Bulling, Andreas
    We introduce an end-to-end interactive system for mental face reconstruction - the challenging task of visually reconstructing a face image a person only has in their mind. In contrast to existing methods that suffer from low usability and high mental load, our approach only requires the user to rank images over multiple iterations according to the perceived similarity with their mental image. Based on these rankings, our mental face reconstruction system extracts image features in each iteration, combines them into a joint feature vector, and then uses a generative model to visually reconstruct the mental image. To avoid the need for collecting large amounts of human training data, we further propose a computational user model that can simulate human ranking behaviour using data from an online crowd-sourcing study (N=215). Results from a 12-participant user study show that our method can reconstruct mental images that are visually similar to existing approaches but has significantly higher usability, lower perceived workload, and is faster. In addition, results from a third 22-participant lineup study in which we validated our reconstructions on a face ranking task show a identification rate of , which is in line with prior work. These results represent an important step towards new interactive intelligent systems that can robustly and effortlessly reconstruct a user’s mental image.
  • Thumbnail Image
    ItemOpen Access
    SUPREYES: SUPer resolution for EYES using implicit neural representation learning
    (2023) Jiao, Chuhan; Hu, Zhiming; Bâce, Mihai; Bulling, Andreas
    We introduce SUPREYES - a novel self-supervised method to increase the spatio-temporal resolution of gaze data recorded using low(er)-resolution eye trackers. Despite continuing advances in eye tracking technology, the vast majority of current eye trackers - particularly mobile ones and those integrated into mobile devices - suffer from low-resolution gaze data, thus fundamentally limiting their practical usefulness. SUPREYES learns a continuous implicit neural representation from low-resolution gaze data to up-sample the gaze data to arbitrary resolutions. We compare our method with commonly used interpolation methods on arbitrary scale super-resolution and demonstrate that SUPREYES outperforms these baselines by a significant margin. We also test on the sample downstream task of gaze-based user identification and show that our method improves the performance of original low-resolution gaze data and outperforms other baselines. These results are promising as they open up a new direction for increasing eye tracking fidelity as well as enabling new gaze-based applications without the need for new eye tracking equipment.
  • Thumbnail Image
    ItemOpen Access
    Improving the accuracy of musculotendon models for the simulation of active lengthening
    (2023) Millard, Matthew; Kempter, Fabian; Stutzig, Norman; Siebert, Tobias; Fehr, Jörg
    Vehicle accidents can cause neck injuries which are costly for individuals and society. Safety systems could be designed to reduce the risk of neck injury if it were possible to accurately simulate the tissue-level injuries that later lead to chronic pain. During a crash, reflexes cause the muscles of the neck to be actively lengthened. Although the muscles of the neck are often only mildly injured, the forces developed by the neck’s musculature affect the tissues that are more severely injured. In this work, we compare the forces developed by MAT_156, LS-DYNA’s Hill-type model, and the newly proposed VEXAT muscle model during active lengthening. The results show that Hill-type muscle models underestimate forces developed during active lengthening, while the VEXAT model can more faithfully reproduce experimental measurements.
  • Thumbnail Image
    ItemOpen Access
    The Grant Negotiation and Authorization Protocol : attacking, fixing, and verifying an emerging standard
    (2023) Helmschmidt, Florian; Hosseyni, Pedram; Küsters, Ralf; Pruiksma, Klaas; Waldmann, Clara; Würtele, Tim
    The Grant Negotiation and Authorization Protocol (GNAP) is an emerging authorization and authentication protocol which aims to consolidate and unify several use-cases of OAuth 2.0 and many of its common extensions while providing a higher degree of security. OAuth 2.0 is an essential cornerstone of the security of authorization and authentication for the Web, IoT, and beyond, and is used, among others, by many global players, like Google, Facebook, and Microsoft. Historical limitations of OAuth 2.0 and its extensions have led prominent members of the OAuth community to create GNAP, a newly designed protocol for authorization and authentication. Given GNAP's advantages over OAuth 2.0 and its support within the OAuth community, GNAP is expected to become at least as important as OAuth 2.0. In this work, we present the first formal security analysis of GNAP. We build a detailed formal model of GNAP, based on the Web Infrastructure Model (WIM) of Fett, Küsters, and Schmitz, and provide formal statements of the key security properties of GNAP, namely authorization, authentication, and session integrity. We discovered several attacks on GNAP in the process of trying to prove these properties. We present these attacks, as well as changes to the protocol that prevent them. These modifications have been incorporated into the GNAP specification after discussion with the GNAP working group. We give the first formal security guarantees for GNAP, by proving that GNAP, with our modifications applied, satisfies the mentioned security properties. GNAP was still an early draft when we began our analysis, but is now on track to be adopted as an IETF standard. Hence, our analysis is just in time to help ensure the security of this important emerging standard.
  • Thumbnail Image
    ItemOpen Access
    Comparison of rotor arrangements of Transverse Flux Machines for a robotic direct drive optimized by genetic algorithm and Regression Tree Method
    (2023) Kaiser, Benedikt; Schmid, Martin; Parspour, Nejila
    Articulated robotics applications typically have a demand for high torque at low speed. However, conventional electrical machines cannot generate a reasonable amount of torque directly by electro-magnetics. Therefore, gearboxes are used to convert speed and torque, accepting loss of mechanical power due to additional friction. Although geared solutions for robotic drive trains already offer exceedingly high torque densities, they are limited by the drawbacks of high reduction gears, such as non-linearities in friction, complex flexibility effects, and limited service life of mechanics in contrary to direct drive solutions. The Transverse Flux Machine with the high gravimetric torque density may be a solution for reducing or eliminating the need for a gearbox. Using a genetic algorithm, the proposed Transverse Flux Machines are optimized. To enhance the optimization’s speed, the machines’ calculations done by Finite-Element-Analysis of selected generations are replaced by a Regression Tree Model whose results are verified after a defined expired model service life with a subsequent adjustment of the model. The eligibility of different arrangements the Transverse Flux Machines’ rotor are compared regarding the application as low-speed direct drive in robotics, also compared to similar Radial Flux Machines. The optimized Transverse Flux Machines have a higher efficiency due to lower copper loss and a higher active gravimetric torque density. However, the Radial Flux Machines have higher total torques and power factors.
  • Thumbnail Image
    ItemOpen Access
    Layered symbolic security analysis in DY*
    (2023) Bhargavan, Karthikeyan; Bichhawat, Abhishek; Hosseyni, Pedram; Küsters, Ralf; Pruiksma, Klaas; Schmitz, Guido; Waldmann, Clara; Würtele, Tim
    While cryptographic protocols are often analyzed in isolation, they are typically deployed within a stack of protocols, where each layer relies on the security guarantees provided by the protocol layer below it, and in turn provides its own security functionality to the layer above. Formally analyzing the whole stack in one go is infeasible even for semi-automated verification tools, and impossible for pen-and-paper proofs. The DY* protocol verification framework offers a modular and scalable technique that can reason about large protocols, specified as a set of F* modules. However, it does not support the compositional verification of layered protocols since it treats the global security invariants monolithically. In this paper, we extend DY* with a new methodology that allows analysts to modularly analyze each layer in a way that compose to provide security for a protocol stack. Importantly, our technique allows a layer to be replaced by another implementation, without affecting the proofs of other layers. We demonstrate this methodology on two case studies. We also present a verified library of generic authenticated and confidential communication patterns that can be used in future protocol analyses and is of independent interest.
  • Thumbnail Image
    ItemOpen Access
    Systematic construction of deadlock-free routing for NoC using integer linear programming
    (2023) Liu, Shuang; Radetzki, Martin
    Network-on-Chip (NoC) presents a promising solution for on-chip communication in highly integrated System-on-Chips (SoCs). This work addresses critical challenges in NoC design, including routing construction, application mapping, and particularly the issue of deadlocks in the widely-used wormhole routing method. In this paper, an Integer Linear Programming (ILP) approach for deadlock-free routing is proposed, applicable to arbitrary network topologies. We systematically analyze deadlock-free routing construction for mesh and torus topologies under uniform random traffic and provide alternative solutions to turn models. In the context of application-specific NoCs, application mapping, and deadlock-free routing are integrated within a single ILP. Through evaluation with several benchmark applications, it is demonstrated that the ILP method consistently delivers optimal solutions and could obtain better results than various heuristic methods within an acceptable time. Fault tolerance is also explored and existing techniques are incorporated into the ILP approach. As an illustrative example, application mapping and a 1-link-fault-tolerant deadlock-free routing for the MP3 application on a mesh network is performed.
  • Thumbnail Image
    ItemOpen Access
    Cervical muscle reflexes during lateral accelerations
    (2023) Millard, Matthew; Hunger, Susanne; Broß, Lisa; Fehr, Jörg; Holzapfel, Christian; Stutzig, Norman; Siebert, Tobias
    Autonomous vehicles will allow a variety of seating orientations that may change the risk of neck injury during an accident. Having a rotated head at the time of a rear-end collision in a conventional vehicle is associated with a higher risk of acute and chronic whiplash. The change in posture affects both the movement of the head and the response of the muscles. We are studying the reflexes of the muscles of the neck so that we can validate the responses of digital human body models that are used in crash simulations. The neck movements and muscle activity of 21 participants (11 female) were recorded at the Stuttgart FKFS mechanical driving simulator. During the maneuver we recorded the acceleration of the seat and electromyographic (EMG) signals from the sternocleidomastoid (STR) muscles using a Biopac MP 160 system (USA). As intuition would suggest, the reflexes of the muscles of the neck are sensitive to posture and the direction of the acceleration.
  • Thumbnail Image
    ItemOpen Access
    A muscle model for injury simulation
    (2023) Millard, Matthew; Kempter, Fabian; Fehr, Jörg; Stutzig, Norman; Siebert, Tobias
    Car accidents frequently cause neck injuries that are painful, expensive, and difficult to simulate. The movements that lead to neck injury include phases in which the neck muscles are actively lengthened. Actively lengthened muscle can develop large forces that greatly exceed the maximum isometric force. Although Hill-type models are often used to simulate human movement, this model has no mechanism to develop large tensions during active lengthening. When used to simulate neck injury, a Hill model will underestimate the risk of injury to the muscles but may overestimate the risk of injury to the structures that the muscles protect. We have developed a musculotendon model that includes the viscoelasticity of attached crossbridges and has an active titin element. In this work we evaluate the proposed model to a Hill model by simulating the experiments of Leonard et al. [1] that feature extreme active lengthening.