Artists portray human faces with the Fourier statistics of complex natural scenes

When artists portray human faces, they generally endow their portraits with properties that render the faces esthetically more pleasing. To obtain insight into the changes introduced by artists, we compared Fourier power spectra in photographs of faces and in portraits by artists. Our analysis was restricted to a large set of monochrome or lightly colored portraits from various Western cultures and revealed a paradoxical result. Although face photographs are not scale-invariant, artists draw human faces with statistical properties that deviate from the face photographs and approximate the scale-invariant, fractal-like properties of complex natural scenes. This result cannot be explained by systematic differences in the complexity of patterns surrounding the faces or by reproduction artifacts. In particular, a moderate change in gamma gradation has little influence on the results. Moreover, the scale-invariant rendering of faces in artists' portraits was found to be independent of cultural variables, such as century of origin or artistic techniques. We suggest that artists have implicit knowledge of image statistics and prefer natural scene statistics (or some other rules associated with them) in their creations. Fractal-like statistics have been demonstrated previously in other forms of visual art and may be a general attribute of esthetic visual stimuli.     

Listener-based analysis of surface importance for acoustic metrics

Acoustic quality in room acoustics is measured by well defined quantities, like definition, which can be derived from simulated impulse response filters or measured values. These take into account the intensity and phase shift of multiple reflections due to a wave front emanating from a sound source. Definition (D50) and clarity (C50) for example correspond to the fraction of the energy received in total to the energy received in the first 50 ms at a certain listener position. Unfortunately, the impulse response measured at a single point does not provide any information about the direction of reflections, and about the reflection surfaces which contribute to this measure. For the visualization of room acoustics, however, this information is very useful since it allows to discover regions with high contribution and provides insight into the influence of all reflecting surfaces to the quality measure. We use the phonon tracing method to calculate the contribution of the reflection surfaces to the impulse response for different listener positions. This data is used to compute importance values for the geometry taking a certain acoustic metric into account. To get a visual insight into the directional aspect, we map the importance to the reflecting surfaces of the geometry. This visualization indicates which parts of the surfaces need to be changed to enhance the chosen acoustic quality measure.We apply our method to the acoustic improvement of a lecture hall by means of enhancing the overall speech comprehensibility (clarity) and evaluate the results using glyphs to visualize the clarity (C50) values at listener positions throughout the room.     

Classification and comparison of ligand-binding sites derived from grid-mapped knowledge-based potentials

We describe the application of knowledge-based potentials implemented in the MOE program to compare the ligand-binding sites of several proteins. The binding probabilities for a polar and a hydrophobic probe are calculated on a grid to allow easy comparison of binding sites of superimposed related proteins. The method is fast and simple enough to simultaneously use structural information of multiple proteins of a target family. The method can be used to rapidly cluster proteins into subfamilies according to the similarity of hydrophobic and polar fields of their ligand-binding sites. Regions of the binding site which are common within a protein family can be identified and analysed for the design of family-targeted libraries or those which differ for improvement of ligand selectivity. The field-based hierarchical clustering is demonstrated for three protein families: the ligand-binding domains of nuclear receptors, the ATP-binding sites of protein kinases and the substrate binding sites of proteases. More detailed comparisons are presented for serine proteases of the chymotrypsin family, for the peroxisome proliferator-activated receptor subfamily of nuclear receptors and for progesterone and androgen receptor. The results are in good accordance with structure-based analysis and highlight important differences of the binding sites, which have been also described in the literature.     

Single sourcing versus dual sourcing under conditions of learning

This paper considers a buyer who has to decide whether to select a single or two sources of supply for a homogeneous product. The production processes of the suppliers are subject to learning effects, which reduce the production costs and increase the production capacities of the suppliers. This, in turn, enables the suppliers to reduce the sales price, which results in lower acquisition costs at the buyer. As the supplier selection decision influences the individual production quantity of a supplier, the learning effect has to be considered when deciding how many and which suppliers to select. Since the effect of learning on the supplier selection problem has not been investigated in the literature, this paper addresses this limitation and derives models for continuous learning and when learning plateaus. Numerical results indicate that the supplier selection decision can comprehensively influence the learning process for the suppliers and therewith the total costs of the system under study. The results also show that it is not necessarily optimal solely to select the supplier with the highest learning rate.     

Identifying plant species using mid-wave infrared (2.5–6 μm) and thermal infrared (8–14 μm) emissivity spectra

Plant species discrimination using remote sensing is generally limited by the similarity of their reflectance spectra in the visible, NIR and SWIR domains. Laboratory measured emissivity spectra in the mid infrared (MIR; 2.5 μm–6 μm) and the thermal infrared (TIR; 8 μm–14 μm) domain of different plant species, however, reveal significant differences. It is anticipated that with the advances in airborne and space borne hyperspectral thermal sensors, differentiation between plant species may improve. The laboratory emissivity spectra of thirteen common broad leaved species, comprising 3024 spectral bands in the MIR and TIR, were analyzed. For each wavelength the differences between the species were tested for significance using the one way analysis of variance (ANOVA) with the post-hoc Tukey HSD test. The emissivity spectra of the analyzed species were found to be statistically different at various wavebands. Subsequently, six spectral bands were selected (based on the histogram of separable pairs of species for each waveband) to quantify the separability between each species pair based on the Jefferies Matusita (JM) distance. Out of 78 combinations, 76 pairs had a significantly different JM distance. This means that careful selection of hyperspectral bands in the MIR and TIR (2.5 μm–14 μm) results in reliable species discrimination.     

Separate compilation of hierarchical real-time programs into linear-bounded Embedded Machine code

Hierarchical Timing Language (HTL) is a coordination language for distributed, hard real-time applications. HTL is a hierarchical extension of Giotto and, like its predecessor, based on the logical execution time (LET) paradigm of real-time programming. Giotto is compiled into code for a virtual machine, called the Embedded Machine (or E machine). If HTL is targeted to the E machine, then the hierarchical program structure needs to be flattened; the flattening makes separate compilation difficult, and may result in E machine code of exponential size. In this paper, we propose a generalization of the E machine, which supports a hierarchical program structure at runtime through real-time trigger mechanisms that are arranged in a tree. We present the generalized E machine, and a modular compiler for HTL that generates code of linear size. The compiler may generate code for any part of a given HTL program separately in any order.     

Segmentation of cervical cell nuclei in high-resolution microscopic images: A new algorithm and a web-based software framework

In order to automate cervical cancer screening tests, one of the most important and longstanding challenges is the segmentation of cell nuclei in the stained specimens. Though nuclei of isolated cells in high-quality acquisitions often are easy to segment, the problem lies in the segmentation of large numbers of nuclei with various characteristics under differing acquisition conditions in high-resolution scans of the complete microscope slides. We implemented a system that enables processing of full resolution images, and proposes a new algorithm for segmenting the nuclei under adequate control of the expert user. The system can work automatically or interactively guided, to allow for segmentation within the whole range of slide and image characteristics. It facilitates data storage and interaction of technical and medical experts, especially with its web-based architecture. The proposed algorithm localizes cell nuclei using a voting scheme and prior knowledge, before it determines the exact shape of the nuclei by means of an elastic segmentation algorithm. After noise removal with a mean-shift and a median filtering takes place, edges are extracted with a Canny edge detection algorithm. Motivated by the observation that cell nuclei are surrounded by cytoplasm and their shape is roughly elliptical, edges adjacent to the background are removed. A randomized Hough transform for ellipses finds candidate nuclei, which are then processed by a level set algorithm. The algorithm is tested and compared to other algorithms on a database containing 207 images acquired from two different microscope slides, with promising results.     

Efficient data management in a large-scale epidemiology research project

This article describes the concept of a "Central Data Management" (CDM) and its implementation within the large-scale population-based medical research project "Personalized Medicine". The CDM can be summarized as a conjunction of data capturing, data integration, data storage, data refinement, and data transfer. A wide spectrum of reliable "Extract Transform Load" (ETL) software for automatic integration of data as well as "electronic Case Report Forms" (eCRFs) was developed, in order to integrate decentralized and heterogeneously captured data. Due to the high sensitivity of the captured data, high system resource availability, data privacy, data security and quality assurance are of utmost importance. A complex data model was developed and implemented using an Oracle database in high availability cluster mode in order to integrate different types of participant-related data. Intelligent data capturing and storage mechanisms are improving the quality of data. Data privacy is ensured by a multi-layered role/right system for access control and de-identification of identifying data. A well defined backup process prevents data loss. Over the period of one and a half year, the CDM has captured a wide variety of data in the magnitude of approximately 5terabytes without experiencing any critical incidents of system breakdown or loss of data. The aim of this article is to demonstrate one possible way of establishing a Central Data Management in large-scale medical and epidemiological studies.     

Polytope-based computation of polynomial ranges

Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensorial Bernstein basis, which is exponential size in the number n of variables. In this paper, we consider methods to compute tight bounds for polynomials in n variables by solving two linear programming problems over a polytope. We formulate a polytope defined as the convex hull of the coefficients with respect to the tensorial Bernstein basis, and we formulate several polytopes based on the Bernstein polynomials of the domain. These Bernstein polytopes can be defined by a polynomial number of halfspaces. We give the number of vertices, the number of hyperfaces, and the volume of each polytope for n=1,2,3,4, and we compare the computed range widths for random n-variate polynomials for n?10. The Bernstein polytope of polynomial size gives only marginally worse range bounds compared to the range bounds obtained with the tensorial Bernstein basis of exponential size.