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.

Towards a complete dense geometric and photometric reconstruction under varying pose and illumination

This paper proposes a novel framework to construct a geometric and photometric model of a viewed object that can be used for visualisation in arbitrary pose and illumination. The method is solely based on images and does not require any specialised equipment. We assume that the object has a piece-wise smooth surface and that its reflectance can be modelled using a parametric bidirectional reflectance distribution function. Without assuming any prior knowledge on the object, geometry and reflectance have to be estimated simultaneously and occlusion and shadows have to be treated consistently. We exploit the geometric and photometric consistency using the fact that surface orientation and reflectance are local invariants. In a first implementation, we demonstrate the method using a Lambertian object placed on a turn-table and illuminated by a number of unknown point light-sources. A discrete voxel model is initialised to the visual hull and voxels identified as inconsistent with the invariants are removed iteratively. The resulting model is used to render images in novel pose and illumination. © 2004 Elsevier B.V. All rights reserved.

Random function priors for exchangeable arrays with applications to graphs and relational data

A fundamental problem in the analysis of structured relational data like graphs, networks, databases, and matrices is to extract a summary of the common structure underlying relations between individual entities. Relational data are typically encoded in the form of arrays; invariance to the ordering of rows and columns corresponds to exchangeable arrays. Results in probability theory due to Aldous, Hoover and Kallenberg show that exchangeable arrays can be represented in terms of a random measurable function which constitutes the natural model parameter in a Bayesian model. We obtain a flexible yet simple Bayesian nonparametric model by placing a Gaussian process prior on the parameter function. Efficient inference utilises elliptical slice sampling combined with a random sparse approximation to the Gaussian process. We demonstrate applications of the model to network data and clarify its relation to models in the literature, several of which emerge as special cases.

Function propagation through nested systems

Concepts of function are central to design but statements about a device's functions can be interpreted in different ways. This raises problems for researchers trying to clarify the foundations of design theory and for those developing design support-tools that can represent and reason about function. By showing how functions relate systems to their sub-systems and super-systems, this article illustrates some limitations of existing function terminology and some problems with existing function statements. To address these issues, a system-relative function terminology is introduced. This is used to demonstrate that systems function not only with respect to their most local super-system, but also with respect to their more global super-systems. © 2012 Elsevier Ltd. All rights reserved.

A Stochastic Model for Electron Multiplication Charge-Coupled Devices - From Theory to Practice

Electron multiplication charge-coupled devices (EMCCD) are widely used for photon counting experiments and measurements of low intensity light sources, and are extensively employed in biological fluorescence imaging applications. These devices have a complex statistical behaviour that is often not fully considered in the analysis of EMCCD data. Robust and optimal analysis of EMCCD images requires an understanding of their noise properties, in particular to exploit fully the advantages of Bayesian and maximum-likelihood analysis techniques, whose value is increasingly recognised in biological imaging for obtaining robust quantitative measurements from challenging data. To improve our own EMCCD analysis and as an effort to aid that of the wider bioimaging community, we present, explain and discuss a detailed physical model for EMCCD noise properties, giving a likelihood function for image counts in each pixel for a given incident intensity, and we explain how to measure the parameters for this model from various calibration images. © 2013 Hirsch et al.

Geometric optimization methods for independent component analysis applied on gene expression data

DNA microarrays provide a huge amount of data and require therefore dimensionality reduction methods to extract meaningful biological information. Independent Component Analysis (ICA) was proposed by several authors as an interesting means. Unfortunately, experimental data are usually of poor quality- because of noise, outliers and lack of samples. Robustness to these hurdles will thus be a key feature for an ICA algorithm. This paper identifies a robust contrast function and proposes a new ICA algorithm. © 2007 IEEE.

Transient response of structures with uncertain properties to nonlinear shock loading

A method is presented to predict the transient response of a structure at the driving point following an impact or a shock loading. The displacement and the contact force are calculated solving the discrete convolution between the impulse response and the contact force itself, expressed in terms of a nonlinear Hertzian contact stiffness. Application of random point process theory allows the calculation of the impulse response function from knowledge of the modal density and the geometric characteristics of the structure only. The theory is applied to a wide range of structures and results are experimentally verified for the case of a rigid object hitting a beam, a plate, a thin and a thick cylinder and for the impact between two cylinders. The modal density of the flexural modes for a thick slender cylinder is derived analytically. Good agreement is found between experimental, simulated and published results, showing the reliability of the method for a wide range of situations including impacts and pyroshock applications. © 2013 Elsevier Ltd. All rights reserved.

Theory of high-power mode-locked lasers with a slow absorber

We develop an analytical theory of high-power passively mode-locked lasers with a slow absorber; the theory is valid at pulse energies well exceeding the saturation energy. We analyze the Haus modelocking master equation in the pulse-energy-domain representation, approximating the intensity profile function by a series in the vicinity of its peak value. We consider the high-power operation regime of subpicosecond blue-violet GaN mode-locked diode lasers, using the approach developed. © 2010 Springer Science+Business Media, Inc.

Multilinear function factorisation for time series feature extraction

This work applies a variety of multilinear function factorisation techniques to extract appropriate features or attributes from high dimensional multivariate time series for classification. Recently, a great deal of work has centred around designing time series classifiers using more and more complex feature extraction and machine learning schemes. This paper argues that complex learners and domain specific feature extraction schemes of this type are not necessarily needed for time series classification, as excellent classification results can be obtained by simply applying a number of existing matrix factorisation or linear projection techniques, which are simple and computationally inexpensive. We highlight this using a geometric separability measure and classification accuracies obtained though experiments on four different high dimensional multivariate time series datasets. © 2013 IEEE.