Computer generated hologram with geometric occlusion using GPU-accelerated depth buffer rasterization for three-dimensional display

We present a method of rapidly producing computer-generated holograms that exhibit geometric occlusion in the reconstructed image. Conceptually, a bundle of rays is shot from every hologram sample into the object volume.We use z buffering to find the nearest intersecting object point for every ray and add its complex field contribution to the corresponding hologram sample. Each hologram sample belongs to an independent operation, allowing us to exploit the parallel computing capability of modern programmable graphics processing units (GPUs). Unlike algorithms that use points or planar segments as the basis for constructing the hologram, our algorithm's complexity is dependent on fixed system parameters, such as the number of ray-casting operations, and can therefore handle complicated models more efficiently. The finite number of hologram pixels is, in effect, a windowing function, and from analyzing the Wigner distribution function of windowed free-space transfer function we find an upper limit on the cone angle of the ray bundle. Experimentally, we found that an angular sampling distance of 0:01' for a 2:66' cone angle produces acceptable reconstruction quality. © 2009 Optical Society of America.

Multiview stereo via volumetric Graph-Cuts and occlusion robust photo-consistency.

This paper presents a volumetric formulation for the multi-view stereo problem which is amenable to a computationally tractable global optimisation using Graph-cuts. Our approach is to seek the optimal partitioning of 3D space into two regions labelled as "object" and "empty" under a cost functional consisting of the following two terms: (1) A term that forces the boundary between the two regions to pass through photo-consistent locations and (2) a ballooning term that inflates the "object" region. To take account of the effect of occlusion on the first term we use an occlusion robust photo-consistency metric based on Normalised Cross Correlation, which does not assume any geometric knowledge about the reconstructed object. The globally optimal 3D partitioning can be obtained as the minimum cut solution of a weighted graph.

Physical properties of a hybrid and a nanohybrid dental light-cured resin composite.

This work was aimed at the study of some physical properties of two current light-cured dental resin composites, Rok (hybrid) and Ice (nanohydrid). As filler they both contain strontium aluminosilicate particles, however, with different size distribution, 40 nm-2.5 mum for Rok and 10 nm-1 mum for Ice. The resin matrix of Rok consists of UDMA, that of Ice of UDMA, Bis-EMA and TEGDMA. Degree of conversion was determined by FT-IR analysis. The flexural strength and modulus were measured using a three-point bending set-up according to the ISO-4049 specification. Sorption, solubility and volumetric change were measured after storage of composites in water or ethanol/water (75 vol%) for 1 day, 7 or 30 days. Thermogravimetric analysis was performed in air and nitrogen atmosphere from 30 to 700 degrees C. Surface roughness and morphology of the composites was studied by atomic force microscopy (AFM). The degree of conversion was found to be 56.9% for Rok and 61.0% for Ice. The flexural strength of Rok does not significantly differ from that of Ice, while the flexural modulus of Rok is higher than that of Ice. The flexural strengths of Rok and Ice did not show any significant change after immersion in water or ethanol solution for 30 days. The flexural modulus of Rok and Ice did not show any significant change either after immersion in water for 30 days, while it decreased significantly, even after 1 day immersion, in ethanol solution. Ice sorbed a higher amount of water and ethanol solution than Rok and showed a higher volume increase. Thermogravimetric analysis showed that Rok contains about 80 wt% inorganic filler and Ice about 75 wt%.

High-level scene structure using visibility and occlusion

We demonstrate a new method for extracting high-level scene information from the type of data available from simultaneous localisation and mapping systems. We model the scene with a collection of primitives (such as bounded planes), and make explicit use of both visible and occluded points in order to refine the model. Since our formulation allows for different kinds of primitives and an arbitrary number of each, we use Bayesian model evidence to compare very different models on an even footing. Additionally, by making use of Bayesian techniques we can also avoid explicitly finding the optimal assignment of map landmarks to primitives. The results show that explicit reasoning about occlusion improves model accuracy and yields models which are suitable for aiding data association. © 2011. The copyright of this document resides with its authors.