Objective methods for assessing perceptual image quality have traditionally attempted to quantify the visibility of errors between a distorted image and a reference image using a variety of known properties of the human visual system. Under the assumption that human visual perception is highly

;quot;ninary space partitioning " tree whose inorder traversal of visibility priority at run-time will produce a lineaL " order, dependent upon the viewing position, on (parts of) the polygons, which can then be used to easily solve the hidden surfac6 problem. In the application where the entire

are a structured set of views of a 3D object or scene, intermediate frames derived by morphing can be used to approximate intermediate 3D transformations of the object or scene. Using the view interpolation approach to synthesize 3D scenes has two main advantages. First, the 3D representation

Ego-motion estimation for an agile single camera moving through general, unknown scenes becomes a much more challenging problem when real-time performance is required rather than under the off-line processing conditions under which most successful structure from motion work has been achieved

conversion. The two hierarchical data structures make it possible to reject hidden geometry very rapidly while rendering visible geometry with the speed of scan conversion. For animation, the algorithm is also able to exploit temporal coherence. The method is well suited to models with high depth complexity

to design digital systems that support coherent behavior by making participants and their activities visible to one another. We call such systems "socially translucent systems" and suggest that they have three characteristics-visibility, awareness, and accountability-which enable people to draw

Abstract — In this paper we consider visual feedback attitude synchronization in leader-follower type visibility structures in SE(3). We first define visual robotic networks consisting of the dynamics describing rigid body motion, visibility structures among bodies and visual measurements. We

Object-oriented programming languages allow inter-object aliasing. Although necessary to construct linked data structures and networks of interacting objects, aliasing is problematic in that an aggregate object's state can change via an alias to one of its components, without the aggregate

horizons on a polyhedral terrain, and introduce a visibility model, that we call the . We present a construction algorithm and a data structure for encoding the horizon map, and show how it can be used for solving point visibility queries with respect to a fixed viewpoint. 0 3 -th horizon

of the visibility culling techniques developed in the last decade. The taxonomy we use distinguishes between point-based and from-region methods. Point-based methods are further subdivided into object and image-precision techniques, while from-region approaches can take advantage of the cell-and-portal structure