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.

Sequential decision making in general state space models

Many problems in control and signal processing can be formulated as sequential decision problems for general state space models. However, except for some simple models one cannot obtain analytical solutions and has to resort to approximation. In this thesis, we have investigated problems where Sequential Monte Carlo (SMC) methods can be combined with a gradient based search to provide solutions to online optimisation problems. We summarise the main contributions of the thesis as follows. Chapter 4 focuses on solving the sensor scheduling problem when cast as a controlled Hidden Markov Model. We consider the case in which the state, observation and action spaces are continuous. This general case is important as it is the natural framework for many applications. In sensor scheduling, our aim is to minimise the variance of the estimation error of the hidden state with respect to the action sequence. We present a novel SMC method that uses a stochastic gradient algorithm to find optimal actions. This is in contrast to existing works in the literature that only solve approximations to the original problem. In Chapter 5 we presented how an SMC can be used to solve a risk sensitive control problem. We adopt the use of the Feynman-Kac representation of a controlled Markov chain flow and exploit the properties of the logarithmic Lyapunov exponent, which lead to a policy gradient solution for the parameterised problem. The resulting SMC algorithm follows a similar structure with the Recursive Maximum Likelihood(RML) algorithm for online parameter estimation. In Chapters 6, 7 and 8, dynamic Graphical models were combined with with state space models for the purpose of online decentralised inference. We have concentrated more on the distributed parameter estimation problem using two Maximum Likelihood techniques, namely Recursive Maximum Likelihood (RML) and Expectation Maximization (EM). The resulting algorithms can be interpreted as an extension of the Belief Propagation (BP) algorithm to compute likelihood gradients. In order to design an SMC algorithm, in Chapter 8 uses a nonparametric approximations for Belief Propagation. The algorithms were successfully applied to solve the sensor localisation problem for sensor networks of small and medium size.

Tunable hydrodynamic chromatography of microparticles localized in short microchannels.

This paper describes a new way to perform hydrodynamic chromatography (HDC) for the size separation of particles based on a unique recirculating flow pattern. Pressure-driven (PF) and electro-osmotic flows (EOF) are opposed in narrow glass microchannels that expand at both ends. The resulting bidirectional flow turns into recirculating flow because of nonuniform microchannel dimensions. This hydrodynamic effect, combined with the electrokinetic migration of the particles themselves, results in a trapping phenomenon, which we have termed flow-induced electrokinetic trapping (FIET). In this paper, we exploit recirculating flow and FIET to perform a size-based separation of samples of microparticles trapped in a short separation channel using a HDC approach. Because these particles have the same charge (same zeta potential), they exhibit the same electrophoretic mobility, but they can be separated according to size in the recirculating flow. While trapped, particles have a net drift velocity toward the low-pressure end of the channel. When, because of a change in the externally applied PF or electric field, the sign of the net drift velocity reverses, particles can escape the separation channel in the direction of EOF. Larger particles exhibit a larger net drift velocity opposing EOF, so that the smaller particles escape the separation channel first. In the example presented here, a sample plug containing 2.33 and 2.82 microm polymer particles was introduced from the inlet into a 3-mm-long separation channel and trapped. Through tuning of the electric field with respect to the applied PF, the particles could be separated, with the advantage that larger particles remained trapped. The separation of particles with less than 500 nm differences in diameter was performed with an analytical resolution comparable to that of baseline separation in chromatography. When the sample was not trapped in the separation channel but located further downstream, separations could be carried out continuously rather than in batch. Smaller particles could successfully pass through the separation channel, and particles were separated by size. One of the main advantages of exploiting FIET for HDC is that this method can be applied in quite short (a few millimeters) channel geometries. This is in great contrast to examples published to date for the separation of nanoparticles in much longer micro- and nanochannels.

Recurrent input transformations for Hidden Markov models

This paper presents a new architecture which integrates recurrent input transformations (RIT) and continuous density HMMs. The basic HMM structure is extended to accommodate recurrent neural networks which transform the input observations before they enter the Gaussian output distributions associated with the states of the HMM. During training the parameters of both HMM and RIT are simultaneously optimized according to the Maximum Mutual Information (MMI) criterion. Results are presented for the E-set recognition task which demonstrate the ability of recurrent input transformations to exploit longer term correlations in the speech signal and to give improved discrimination.

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.

Nanotube-based passively mode-locked Ytterbium-pumped Raman laser

Over the past decades mode-locked fibre lasers have been extensively refined and developed, with most research efforts focussing on employing rare-earth doped fibres as the active elements [1]. This presents the problem that operation is limited to regions of the spectrum where such elements exhibit gain [1]. Raman amplification in silica fibre is an attractive way to overcome this spectral limitation, with gain available across the entire transparency window (300 nm - 2300 nm) [2-4]. There have been a number of reports utilising Raman gain in ultrashort pulse sources [2-4], however none using a broadband saturable absorber, such as carbon nanotubes [5-7] and graphene [7-9]. A broadband saturable absorber is an essential pre-requisite in order to fully exploit the wavelength flexibility provided by the Raman gain in short pulse mode-locked fiber lasers. © 2011 IEEE.

Angular dependence of domain wall resistivity in artificial magnetic domain structures.

We exploit the ability to precisely control the magnetic domain structure of perpendicularly magnetized Pt/Co/Pt trilayers to fabricate artificial domain wall arrays and study their transport properties. The scaling behavior of this model system confirms the intrinsic domain wall origin of the magnetoresistance, and systematic studies using domains patterned at various angles to the current flow are excellently described by an angular-dependent resistivity tensor containing perpendicular and parallel domain wall resistivities. We find that the latter are fully consistent with Levy-Zhang theory, which allows us to estimate the ratio of minority to majority spin carrier resistivities, rho downward arrow/rho upward arrow approximately 5.5, in good agreement with thin film band structure calculations.

Embedded Model Predictive Control (MPC) using a FPGA

Model Predictive Control (MPC) is increasingly being proposed for application to miniaturized devices, fast and/or embedded systems. A major obstacle to this is its computation time requirement. Continuing our previous studies of implementing constrained MPC on Field Programmable Gate Arrays (FPGA), this paper begins to exploit the possibilities of parallel computation, with the aim of speeding up the MPC implementation. Simulation studies on a realistic example show that it is possible to implement constrained MPC on an FPGA chip with a 25MHz clock and achieve MPC implementation rates comparable to those achievable on a Pentium 3.0 GHz PC. Copyright © 2007 International Federation of Automatic Control All Rights Reserved.

Customizing the technology roadmapping technique for software companies

Software importance keeps growing fast and consistently for many organizations. The growth of software functionality in manufactured products and the emergence of digital media, convergent spaces including digital content, software, and multi-channels to the market, are recent examples of organizational changes where software assumed a central position for the corporate strategy. This paper analyzes the alignment between strategic objectives and software development processes at software companies and proposes a methodology to ensure that development processes are aligned with the corporate capabilities required to exploit future market opportunities. The methodology includes the categorization of different software companies according to their core capabilities and the customization of the technology roadmapping technique for software companies. The research process included the realization of case studies and a survey. (c) 2006 PICMET.

Strategies for product recovery decisions

Product recovery is beset by uncertainty regarding the quality of end-of-life (EOL) products, and in order to ascertain the reusability of these products, they have to undergo expensive tests. This undermines the profitability of the recovery process. The key to improve the effectiveness of product recovery is to improve the quality of information available before testing. Emerging data capture technologies can significantly improve the availability of information. However, in order to maximise the potential of these technologies, appropriate decision-making algorithms that exploit such information must be developed. We model the recovery process using a decision-theoretic approach, and derive strategies to ascertain the reusability of EOL products, and also to decide when tests are beneficial. We show that improving the quality of information leads to increase in effectiveness of the recovery process by reducing the need for tests. Copyright © 2009 Inderscience Enterprises Ltd.

Live 3D shape reconstruction, recognition and registration

We present a video-based system which interactively captures the geometry of a 3D object in the form of a point cloud, then recognizes and registers known objects in this point cloud in a matter of seconds (fig. 1). In order to achieve interactive speed, we exploit both efficient inference algorithms and parallel computation, often on a GPU. The system can be broken down into two distinct phases: geometry capture, and object inference. We now discuss these in further detail. © 2011 IEEE.

Robust estimation of local genetic ancestry in admixed populations using a nonparametric Bayesian approach.

We present a new haplotype-based approach for inferring local genetic ancestry of individuals in an admixed population. Most existing approaches for local ancestry estimation ignore the latent genetic relatedness between ancestral populations and treat them as independent. In this article, we exploit such information by building an inheritance model that describes both the ancestral populations and the admixed population jointly in a unified framework. Based on an assumption that the common hypothetical founder haplotypes give rise to both the ancestral and the admixed population haplotypes, we employ an infinite hidden Markov model to characterize each ancestral population and further extend it to generate the admixed population. Through an effective utilization of the population structural information under a principled nonparametric Bayesian framework, the resulting model is significantly less sensitive to the choice and the amount of training data for ancestral populations than state-of-the-art algorithms. We also improve the robustness under deviation from common modeling assumptions by incorporating population-specific scale parameters that allow variable recombination rates in different populations. Our method is applicable to an admixed population from an arbitrary number of ancestral populations and also performs competitively in terms of spurious ancestry proportions under a general multiway admixture assumption. We validate the proposed method by simulation under various admixing scenarios and present empirical analysis results from a worldwide-distributed dataset from the Human Genome Diversity Project.

Sparsity-Inducing Optimization Algorithm for the Extraction of Planar Structures in Noisy Point-Cloud Data

Most of the manual labor needed to create the geometric building information model (BIM) of an existing facility is spent converting raw point cloud data (PCD) to a BIM description. Automating this process would drastically reduce the modeling cost. Surface extraction from PCD is a fundamental step in this process. Compact modeling of redundant points in PCD as a set of planes leads to smaller file size and fast interactive visualization on cheap hardware. Traditional approaches for smooth surface reconstruction do not explicitly model the sparse scene structure or significantly exploit the redundancy. This paper proposes a method based on sparsity-inducing optimization to address the planar surface extraction problem. Through sparse optimization, points in PCD are segmented according to their embedded linear subspaces. Within each segmented part, plane models can be estimated. Experimental results on a typical noisy PCD demonstrate the effectiveness of the algorithm.

Improving LVCSR system combination using neural network language model cross adaptation

State-of-the-art large vocabulary continuous speech recognition (LVCSR) systems often combine outputs from multiple subsystems developed at different sites. Cross system adaptation can be used as an alternative to direct hypothesis level combination schemes such as ROVER. The standard approach involves only cross adapting acoustic models. To fully exploit the complimentary features among sub-systems, language model (LM) cross adaptation techniques can be used. Previous research on multi-level n-gram LM cross adaptation is extended to further include the cross adaptation of neural network LMs in this paper. Using this improved LM cross adaptation framework, significant error rate gains of 4.0%-7.1% relative were obtained over acoustic model only cross adaptation when combining a range of Chinese LVCSR sub-systems used in the 2010 and 2011 DARPA GALE evaluations. Copyright © 2011 ISCA.

Graphene field-effect transistors as room-temperature terahertz detectors

The unique optoelectronic properties of graphene make it an ideal platform for a variety of photonic applications, including fast photodetectors, transparent electrodes in displays and photovoltaic modules, optical modulators, plasmonic devices, microcavities, and ultra-fast lasers. Owing to its high carrier mobility, gapless spectrum and frequency-independent absorption, graphene is a very promising material for the development of detectors and modulators operating in the terahertz region of the electromagnetic spectrum (wavelengths in the hundreds of micrometres), still severely lacking in terms of solid-state devices. Here we demonstrate terahertz detectors based on antenna-coupled graphene field-effect transistors. These exploit the nonlinear response to the oscillating radiation field at the gate electrode, with contributions of thermoelectric and photoconductive origin. We demonstrate room temperature operation at 0.3 THz, showing that our devices can already be used in realistic settings, enabling large-area, fast imaging of macroscopic samples. © 2012 Macmillan Publishers Limited. All rights reserved.