26636790
TWISTER: an immersive autostereoscopic display
This paper describes in detail the design, development, and evaluation of the TWISTER III (Telexistence Wide-angle Immersive STEReoscope) and demonstrates how this system can display immersive three-dimensional full-color and live motion pictures without the need for special eye-wear. The device works as a cylindrical display by rotating 30 display units around an observer and presenting time-varying patterns, while immersive autostereoscopic vision is achieved by employing a "rotating parallax barrier" method. After explaining the principle, we discuss the designs and implementations for maximum performance in various aspects of the display. We also evaluate the display.
18847598
A method for panoramic stereo image acquisition
One of the key technologies for one-to-many visual communication is panoramic stereo, in which stereoscopic images for arbitrary horizontal directions are presented to multiple users, according to their positions and postures. In this paper, one of the methods for capturing panoramic stereo motion pictures is proposed and evaluated, along with an experimentation. Through preliminary experimentation, we have confirmed the effectiveness of methods using a curved mirror.
15731243
TORNADO: omnistereo video imaging with rotating optics
One of the key techniques for vision-based communication is omnidirectional stereo (omnistereo) imaging, in which stereoscopic images for an arbitrary horizontal direction are captured and presented according to the viewing direction of the observer. Although omnistereo models have been surveyed in several studies, few omnistereo sensors have actually been implemented. In this paper, a practical method for capturing omnistereo video sequences using rotating optics is proposed and evaluated. The rotating optics system consists of prism sheets, circular or linear polarizing films, and a hyperboloidal mirror. This system has two different modes of operation with regard to the separation of images for the left and right eyes. In the high-speed shutter mode, images are separated using postimage processing, while, in the low-speed shutter mode, the image separation is completed by optics. By capturing actual images, we confirmed the effectiveness of the methods.
18924219
Computation-tuple sequences and object histories
A record-based, algebraically-oriented model is introduced for describing data for “object histories” (with computation), such as checking accounts, credit card accounts, taxes, schedules, and so on. The model consists of sequences of computation tuples defined by a computation-tuple sequence scheme (CSS). The CSS has three major features (in addition to input data): computation (involving previous computation tuples), “uniform” constraints (whose satisfaction by a computation-tuple sequence u implies satisfaction by every interval of u), and specific sequences with which to start the valid computation-tuple sequences. A special type of CSS, called “local,” is singled out for its relative simplicity in maintaining the validity of a computation-tuple sequence. A necessary and sufficient condition for a CSS to be equivalent to at least one local CSS is given. Finally, the notion of “local bisimulatability” is introduced for regarding two CSS as conveying the same information, and two results on local bisimulatability in connection with local CSS are established.
3517036
Fixed Point Theory in Weak Second-Order Arithmetic
Abstract We develop a basic part of fixed point theory in the context of weak subsystems of second-order arithmetic. RCA0 is the system of recursive comprehension and Σ01 induction. WKL0 is RCA0 plus the weak Konig's lemma: every infinite tree of sequences of 0's and 1's has an infinite path. A topological space X is said to possess the fixed point property if every continuous function f:X→X has a point x ϵ X such that f(x) = x. Within WKL0 (indeed RCA0), we prove Brouwer's theorem asserting that every nonempty compact convex closed set C in R n has the fixed point property, provided that C is expressed as the completion of a countable subset of Q n. We then extend Brouwer's theorem to its infinite dimensional analogue (the Tychonoff-Schauder theorem for R N ) still within RCA0. As an application of this theorem, we prove the Cauchy-Peano theorem for ordinary differential equations within WKL0, which was first shown by Simpson without reference to the fixed point theorem. Within RCA0, we also prove the Markov-Kakutani theorem which asserts the existence of a common fixed point for certain families of affine mappings. Adapting Kakutani's ingenious proof for deducing the Hahn–Banach theorem from the Markov-Kakutani theorem, we also establish the Hahn-Banach theorem for seperable Banach spaces within WKL0, which was first shown by Brown and Simpson in a different way.
32965529
Interval Queries on Object Histories
Abstract The present paper introduces the notion of “interval queries” on object histories and explores a certain closure property. In particular, conditions are provided under which an interval query applied to object histories described by one “computational-tuple sequence scheme” (CSS) yields, as its answer, the set of all object histories which can be described by another CSS.
42699164
Computation-Tuple Sequences and Object Histories: Extended Abstract
Recently, much attention has been focussed on database aspects of office automation and their associated research problems [A,EN,PFK,SIGMOD,SSLKG]. One major component in this area is a facility to manage historical data for many “objects”, namely, an object history (management) system. Examples of such systems are those for personal checking account, salary reviews and schedules. However, there has been little widely accepted mathematical formalism which captures major aspects of the historical data for the objects (here called object histories) and permits the identification and analysis of relevant issues. The purpose of the present paper is to introduce a mathematical model allowing such an investigation1.
28304265
Uncertainty Management in Object-Oriented Database Systems
In this paper, we propose an approach and basic constructs to realize a fuzzy database processing capability on an Object-Oriented Database (OODB) system. The proposed approach can manage several types of uncertainties: (1) uncertain objects, (2) uncertain relationships between instance objects, (3) uncertain instance-of relationships, and (4) uncertain is-a (subclass/superclass) relationships. A notable feature is the usage of extensibility offered by OODB systems. That is, it is possible to add these several uncertainties without restructuring a database schema. We will describe our prototype fuzzy OODB system and briefly show the functionalities of the system by using an example movie database.