Super-realistic rendering using real-time tweening

The realism of contemporary computer graphics (and especially Virtual Reality {VR}) is limited by the great computational cost of rendering objects of appropriate complexity with convincing lighting and surface effects. We introduce a framework that allows rendering of objects in true photographic quality using tweening. The simple but effective design of our system allows us not only to perform the necessary operations in real-time on standard hardware, but also achieve other effects like morphing. Furthermore, it is shown how our system can be gainfully employed in non-VR contexts like extreme low-bandwidth video-conferencing and others.

New approach to controllable nitrogen doping for improved nano-semiconductors

The data covers the following:
X-ray photoelectron spectroscopy (XPS) - to collect surface chemical structure changes (using RMIT instrument);
Scanning electron microscopy (SEM) - to collect surface physical structure changes;
Atomic force microscopy (AFM) - to collect surface morphology changes;
Internal/External quantum efficiency (IQE/EQE) – to collect DSSC (Dye Sensitised Solar Cells) efficiency data;
Discharge/Charge capacity - to collect battery efficiency data.

Image reduction using means on discrete product lattices

We investigate the problem of averaging values on lattices, and in particular on discrete product lattices. This problem arises in image processing when several color values given in RGB, HSL, or another coding scheme, need to be combined. We show how the arithmetic mean and the median can be constructed by minimizing appropriate penalties, and we discuss which of them coincide with the Cartesian product of the standard mean and median. We apply these functions in image processing. We present three algorithms for color image reduction based on minimizing penalty functions on discrete product lattices.

Penalty functions over a cartesian product of lattices

In this work we present the concept of penalty function over a Cartesian product of lattices. To build these mappings, we make use of restricted dissimilarity functions and distances between fuzzy sets. We also present an algorithm that extends the weighted voting method for a fuzzy preference relation.