𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Latency Reduction for Telerobotic Applications

✍ Scribed by Stemmer, Ralf ;Nagel, Dirk ;Drüe, Siegbert


Publisher
Curtin University of Technology
Year
2008
Tongue
English
Weight
803 KB
Volume
13
Category
Article
ISSN
0969-1855

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

This paper tackles the problem of reducing the latency in telerobotic applications. The time delay between an action of the human operator and the corresponding reaction of the system has a negative impact on the synchrony, disturbs the operator's immersion, and yields adverse effects like simulator sickness or kinetoses. In this context we present an application to control a stereo camera system by measuring the operator's head motion. To decrease the latency, the head motion is described as Gauss‐Markov model and predicted with a Kalman filter. This estimation provides a reduction of the mean orientation error by 70% and the maximum error by 50% in contrast to an unpredicted control of the vision system. Experiments with subjects showed an improved compatibility due to the reduced latency.


📜 SIMILAR VOLUMES


A Compiler-Directed Approach to Network
✍ Sibabrata Ray; Hong Jiang; Qing Yang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 254 KB

and/or devising improved routing disciplines in the case of distributed memory architecture, to reduce the expected access time for a variable. Extensive work has been done on both cache design and message routing. In this paper a new shared-data approach is taken to attack the problem. We consider

A Real-Time Image Noise Reduction System
✍ Feng Ouyang; Gene Dwyer 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 279 KB

## A Real-Time Image Noise Reduction System for FLIR Applications video rate FLIR image processing system is described. Four TM5320C44 digital signal processors (DSPs) are used to form a pipe line-type parallel architecture. The processing system Ai mproves image quality by performing motion compe

Lattice basis reduction for indefinite f
✍ Gábor Ivanyos; Ágnes Szántó 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 615 KB

In this paper we present an analogue of the lattice basis reduction algorithm of A.K. Lenstra, H.W. Lenstra and L. Lov~sz for the case of an indefinite non-degenerate symmetric bilinear form. The algorithm produces a reduced basis with similar size properties as in the Euclidean case. As an applicat