Processing of optically-captured digital holograms for three-dimensional display

In digital holography, holograms are usually optically captured and then two-dimensional slices of the reconstruction volume are reconstructed by computer and displayed on a two-dimensional display. When the recording is of a three-dimensional scene then such two-dimensional display becomes restrictive. We outline our progress on capturing larger ranges of perspectives of three-dimensional scenes, and our progress on four approaches to better visualise this three-dimensional information encoded in the digital holograms. The research has been performed within a European Commission funded research project dedicated the capture, processing, transmission, and display of real-world 3D and 4D scenes using digital holography. © 2009 SPIE

Capture, processing, and display of real-world 3D objects using digital holography

"Digital holography for 3D and 4D real-world objects' capture, processing, and display" (acronym "Real 3D") is a research project funded under the Information and Communication Technologies theme of the European Commission's Seventh Framework Programme, and brings together nine participants from academia and industry (see www.digitalholography.eu).This three-year project marks the beginning a long-term effort to facilitate the entry of a new technology (digital holography) into the three-dimensional capture and display markets. Its progress at the end of year 2 is summarised. © 2010 IEEE

Lower Bounds on the Computational Power of an Optical Model of Computation

We present lower bounds on the computational power of an optical model of computation called the C2-CSM

Complexity of Continuous Space Machine Operations

We investigate the computational complexity of an optical model of computation called the continuous space machine (CSM). We characterise worst case resource growth over time for each of the CSM's ten operations with respect to seven resource measures. Many operations exhibit unreasonably large growth rates thus motivating restrictions on the CSM, in particular we give a restriction called the C2-CSM

Upper Bounds on the Computational Power of an Optical Model of Computation

We present upper bounds on the computational power of an optical model of computation called the C2-CSM

Parallel and sequential optical computing

We present a number of computational complexity results for an optical model of computation called the continuous space machine. We also describe an implementation for an optical computing algorithm that can be easily defined within the model. Our optical model is designed to model a wide class of optical computers, such as matrix vector multipliers and pattern recognition architectures. It is known that the model solves intractable PSPACE problems in polynomial time, and NC problems in polylogarithmic time. Both of these results use large spatial resolution (number of pixels). Here we look at what happens when we have constant spatial resolution. It turns out that we obtain similar results by exploiting other resources, such as dynamic range and amplitude resolution. However, with certain other restrictions we essentially have a sequential device. Thus we are exploring the border between parallel and sequential computation in optical computing. We describe an optical architecture for the unordered search problem of finding a one in a list of zeros. We argue that our algorithm scales well, and is relatively straightforward to implement. This problem is easily parallelisable and is from the class NC. We go on to argue that the optical computing community should focus their attention on problems within P (and especially NC), rather than developing systems for tackling intractable problems