The process that creates stereo images typically takes from 1.5 to 2 times longer than the algorithm for mono images. This paper presents a fast image-based algorithm for computing stereo images, that needs a little more time than the algorithm for mono images. The presented algorithm uses a single image with depth information (e.g. z-buffer) as an input and produces two images for left and rig...

Chen andWilliams[2]show how precomputedz-buffer hnagesfromdifferent fixedviewing positions canbe reprojected toproduceanimagefora new viewpoint. Hereimagesareprecomputedfortwigsand branchesatvariouslevelsinthehierarchical structure ofa tree,and adaptivelycombined,dependingon thepositionof thenew viewpoint.The precomputedimages containmultiplez levelstoavoidmissingpixelsinthereconstruction, subp...

This work describes a method for synthesizing correct virtual images of a real scene, described by a set of uncalibrated reference images. The approach used is rendering a projective 3-D model. Projective model reconstruction and positioning a projective virtual camera are not addressed. First, the algorithm transfers the vertices of triangles in the triangulated model and then warps interiors ...

There is an agreement that perceived usability is important beyond actual effectiveness of software systems. Perceived usability is often obtained by self-reports provided after system use. Aiming to improve summative usability testing, we propose a methodology to enhance in-depth testing of users' performance and perceived usability at the task level. The metacognitive research approach allows...

In this paper, we show how standard GIS operations like the complement, union, intersection, and buffering of maps can be made more flexible by using fuzzy set theory. In particular, we present a variety of algorithms for operations on fuzzy raster maps, focusing on buffer operations for such maps. Furthermore, we show how widely-available special-purpose hardware (in particular, z-buffering in...

Diagnostic of complex problems involving the interaction between several applications and the operating systems in a distributed multi-core system with tracing requires to extract system events without disturbing its execution. Recording an event must therefore take negligible time (e.g. less than the duration of simple system call) and should not change the ordering of events (non locking). As...

A scalable workstation is one vision of a mainstream parallel computer: a machine that combines scalable, fine-grain communication facilities for parallel applications with virtual memory and preemptive multiprogramming to support general-purpose workloads. A key challenge in a scalable workstation is the Virtual Network Interface (VNI) problem. The problem is that high performance communicatio...

Many large-scale production parallel programs often run for a very long time and require data checkpoint periodically to save the state of the computation for program restart and/or tracing the progress. Such a write-only pattern has become a dominant part of an application’s I/O workload and implies the importance of its optimization. Existing approaches for write-behind data buffering at both...

Abstract In ATM switches, data from more than one input port can be multiplexed onto a single output port. Thus the cell arrival rate can exceed the port's capacity. Switches conventionally deal with this problem by discarding cells. Buffering could reduce this problem, but is generally avoided in ATM designs, to minimise delays and jitter. The association between buffering and the drawbacks of...

Video streaming applications over wireless networks have turned out to be immensely popular recently. In this thesis, we first study the buffering schemes for the VBR video streaming in heterogeneous wireless networks. An analytical framework is presented to derive the expected number of jitters and average buffering delay. Through experimenting with a wide range of buffering schemes, we quanti...