Video-rate computational super-resolution and integral imaging at longwave-infrared wavelengths

We report the first computational super-resolved, multi-camera integral imaging at long-wave infrared (LWIR) wavelengths. A synchronized array of FLIR Lepton cameras was assembled, and computational super-resolution and integral-imaging reconstruction employed to generate video with light-field imaging capabilities, such as 3D imaging and recognition of partially obscured objects, while also providing a four-fold increase in effective pixel count. This approach to high-resolution imaging enables a fundamental reduction in the track length and volume of an imaging system, while also enabling use of low-cost lens materials.Comment: Supplementary multimedia material in http://dx.doi.org/10.6084/m9.figshare.530302

Extended depth-of-field imaging and ranging in a snapshot

Traditional approaches to imaging require that an increase in depth of field is associated with a reduction in numerical aperture, and hence with a reduction in resolution and optical throughput. In their seminal work, Dowski and Cathey reported how the asymmetric point-spread function generated by a cubic-phase aberration encodes the detected image such that digital recovery can yield images with an extended depth of field without sacrificing resolution [Appl. Opt. 34, 1859 (1995)]. Unfortunately recovered images are generally visibly degraded by artifacts arising from subtle variations in point-spread functions with defocus. We report a technique that involves determination of the spatially variant translation of image components that accompanies defocus to enable determination of spatially variant defocus. This in turn enables recovery of artifact-free, extended depth-of-field images together with a two-dimensional defocus and range map of the imaged scene. We demonstrate the technique for high-quality macroscopic and microscopic imaging of scenes presenting an extended defocus of up to two waves, and for generation of defocus maps with an uncertainty of 0.036 waves

Super-resolution imaging using a camera array

The angular resolution of many commercial imaging systems is limited, not by diffraction or optical aberrations, but by pixilation effects. Multiaperture imaging has previously demonstrated the potential for super-resolution (SR) imaging using a lenslet array and single detector array. We describe the practical demonstration of SR imaging using an array of 25 independent commercial-off-the-shelf cameras. This technique demonstrates the potential for increasing the angular resolution toward the diffraction limit, but without the limit on angular resolution imposed by the use of a single detector array

Computational localization microscopy with extended axial range

A new single-aperture 3D particle-localization and tracking technique is presented that demonstrates an increase in depth range by more than an order of magnitude without compromising optical resolution and throughput. We exploit the extended depth range and depth-dependent translation of an Airy-beam PSF for 3D localization over an extended volume in a single snapshot. The technique is applicable to all bright-field and fluorescence modalities for particle localization and tracking, ranging from super-resolution microscopy through to the tracking of fluorescent beads and endogenous particles within cells. We demonstrate and validate its application to real-time 3D velocity imaging of fluid flow in capillaries using fluorescent tracer beads. An axial localization precision of 50 nm was obtained over a depth range of 120μm using a 0.4NA, 20× microscope objective. We believe this to be the highest ratio of axial range-to-precision reported to date

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories

We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007). TABG can test for equality and disequality modulo a given flat equational theory between brother subterms and between subterms whose positions are defined by the states reached during a computation. In particular, TABG can check that all the subterms reaching a given state are distinct. This constraint is related to monadic key constraints for XML documents, meaning that every two distinct positions of a given type have different values. We prove decidability of the emptiness problem for TABG. This solves, in particular, the open question of the decidability of emptiness for TAGED. We further extend our result by allowing global arithmetic constraints for counting the number of occurrences of some state or the number of different equivalence classes of subterms (modulo a given flat equational theory) reaching some state during a computation. We also adapt the model to unranked ordered terms. As a consequence of our results for TABG, we prove the decidability of a fragment of the monadic second order logic on trees extended with predicates for equality and disequality between subtrees, and cardinality.Comment: 39 pages, to appear in LMCS journa

Holistic Monte-Carlo optical modelling of biological imaging

The invention and advancement of biological microscopy depends critically on an ability to accurately simulate imaging of complex biological structures embedded within complex scattering media. Unfortunately no technique exists for rigorous simulation of the complete imaging process, including the source, instrument, sample and detector. Monte-Carlo modelling is the gold standard for the modelling of light propagation in tissue, but is somewhat laborious to implement and does not incorporate the rejection of scattered light by the microscope. On the other hand microscopes may be rigorously and rapidly modelled using commercial ray-tracing software, but excluding the interaction with the biological sample. We report a hybrid Monte-Carlo optical ray-tracing technique for modelling of complete imaging systems of arbitrary complexity. We make the software available to enable user-friendly and rigorous virtual prototyping of biological microscopy of arbitrary complexity involving light scattering, fluorescence, polarised light propagation, diffraction and coherence. Examples are presented for the modelling and optimisation of representative imaging of neural cells using light-sheet and micro-endoscopic fluorescence microscopy and imaging of retinal vasculature using confocal and non-confocal scanning-laser ophthalmoscopes

Combined Optical Raytrace and Monte-Carlo Simulation of Complex Biological Imaging

We report the first holistic modelling of optical systems for imaging in turbid media. Using a user-friendly commercial optical-design programme, we report hybrid ray- tracing and Monte-Carlo propagation to optimise optical fluorescence microscope systems and ophthalmoscopes

Compact multi-aperture imaging with high-angular-resolution

Previous reports have demonstrated that it is possible to emulate the imaging function of a single conventional lens with an NxN array of identical lenslets to provide an N-fold reduction in imaging-system track length. This approach limits the application to low-resolution imaging. We highlight how using an array of dissimilar lenslets, with an array width that can be much wider than the detector array, high-resolution super-resolved imaging is possible. We illustrate this approach with a ray-traced design and optimization of a long-wave infrared system employing a 3x3 array of free-form lenslets to provide a four-fold reduction in track length compared to a baseline system. Simulations of image recovery show that recovered image quality is comparable to that of the baseline system

The HOM problem is EXPTIME-complete

We define a new class of tree automata with constraints and prove decidability of the emptiness problem for this class in exponential time. As a consequence, we obtain several EXPTIME-completeness results for problems on images of regular tree languages under tree homomorphisms, like set inclusion, regularity (HOM problem), and finiteness of set difference. Our result also has implications in term rewriting, since the set of reducible terms of a term rewrite system can be described as the image of a tree homomorphism. In particular, we prove that inclusion of sets of normal forms of term rewrite systems can be decided in exponential time. Analogous consequences arise in the context of XML typechecking, since types are defined by tree automata and some type transformations are homomorphic.Peer ReviewedPostprint (published version

Video-rate 3D Particle Tracking with Extended Depth-of-field in Thick Biological Samples

We present a single-aperture 3D particle localisation and tracking technique with a vastly increased depth-of-field without compromising optical resolution and throughput. Flow measurements in a FEP capillary and a zebrafish blood vessel are demonstrated experimentally