The visual pigment rhodopsin belongs to the family of G protein-coupled receptors that can form higher oligomers. It is controversial whether rhodopsin forms oligomers and whether oligomers are functionally relevant. Here, we study rhodopsin organization in cryosections of dark-adapted mouse rod photoreceptors by cryoelectron tomography. We identify four hierarchical levels of organization. Rhodopsin forms dimers; at least ten dimers form a row. Rows form pairs (tracks) that are aligned parallel to the disk incisures. Particle-based simulation shows that the combination of tracks with fast precomplex formation, i.e. rapid association and dissociation between inactive rhodopsin and the G protein transducin, leads to kinetic trapping: rhodopsin first activates transducin from its own track, whereas recruitment of transducin from other tracks proceeds more slowly. The trap mechanism could produce uniform single-photon responses independent of rhodopsin lifetime. In general, tracks might provide a platform that coordinates the spatiotemporal interaction of signaling molecules.

Corneal topography estimation that is based on the Placido disk principle relies on good quality of precorneal tear film and sufficiently wide eyelid (palpebral) aperture to avoid reflections from eyelashes. However, in practice, these conditions are not always fulfilled resulting in missing regions, smaller corneal coverage, and subsequently poorer estimates of corneal topography. Our aim was to enhance the standard operating range of a Placido disk videokeratoscope to obtain reliable corneal topography estimates in patients with poor tear film quality, such as encountered in those diagnosed with dry eye, and with narrower palpebral apertures as in the case of Asian subjects. This was achieved by incorporating in the instrument's own topography estimation algorithm an image processing technique that comprises a polar-domain adaptive filter and a morphological closing operator. The experimental results from measurements of test surfaces and real corneas showed that the incorporation of the proposed technique results in better estimates of corneal topography, and, in many cases, to a significant increase in the estimated coverage area making such an enhanced videokeratoscope a better tool for clinicians.

Corneal-height data are typically measured with videokeratoscopes and modeled using a set of orthogonal Zernike polynomials. We address the estimation of the number of Zernike polynomials, which is formalized as a model-order selection problem in linear regression. Classical information-theoretic criteria tend to overestimate the corneal surface due to the weakness of their penalty functions, while bootstrap-based techniques tend to underestimate the surface or require extensive processing. In this paper, we propose to use the efficient detection criterion (EDC), which has the same general form of information-theoretic-based criteria, as an alternative to estimating the optimal number of Zernike polynomials. We first show, via simulations, that the EDC outperforms a large number of information-theoretic criteria and resampling-based techniques. We then illustrate that using the EDC for real corneas results in models that are in closer agreement with clinical expectations and provides means for distinguishing normal corneal surfaces from astigmatic and keratoconic surfaces.

In this paper, we present a fully automatic evaluation approach that can be used for fast inline CT scanning. In contrast to classical defect-recognition algorithms, this approach does not require good image quality. Instead, it allows to distinguish CT artifacts from real defects introduced in the production process. To this end, a three-step workflow was developed, in which any deviations from a reference part are detected and subsequently classified and segmented, to allow automatic decision whether the part fulfills given quality requirements. We demonstrate this approach using CT scans of aluminum castings, typically used in the automotive industry. Also, a comparison between two different segmentation algorithms is shown.

No abstract