Anode‐voltage‐control circuit for compensation of luminance deterioration

Abstract— An external driving circuit that has realized long lifetime, power‐consumption control, and peak luminance for organic light‐emitting diode (OLED) displays have been developed. This circuit realizes an effective method for constant‐anode‐voltage (CV) driving refered to as clamped inverter (CI) driving. The feature of CV driving is to achieve low‐power consumption compared with constant‐anode‐current (CC) driving and to control the power consumption and peak luminance according to the image because display luminance can be easily changed by controlling the anode voltage. On the other hand, CV driving has the problem that luminance deterioration appears to be serious compared with that of CC driving because the current of the OLED element decreases according to usage time. To cope with this, a lifetime compensation circuit that has increased the anode voltage so that it compensates for the luminance deterioration has been developed. This circuit can compensate not only the decrease in current but also the decrease in luminance at a constant current that CC driving cannot. However, increasing the anode voltage causes an increase in stress on the OLED element. The influence of stress on OLED lifetime was verified. As a result, it was confirmed that this circuit can extend the lifetime by 32% even if the anode voltage is increased, causing stress on the OLED structure.     

Plant zero structure and further order reduction of a singular H∞ controller

A new class of reduced‐order controllers is obtained for the H_∞ problem. The reduced‐order controller does not compromise the performance attained by the full‐order controller. Algorithms for deriving reduced‐order H_∞ controllers are presented in both continuous and discrete time. The reduction in order is related to unstable transmission zeros of the subsystem from disturbance inputs to measurement outputs. In the case where the subsystem has no infinite zeros, the resulting order of the H_∞ controller is lower than that of the existing reduced‐order H_∞ controller designs which are based on reduced‐order observer design. Furthermore, the mechanism of the controller order reduction is analysed on the basis of the two‐Riccati equation approach. The structure of the reduced‐order H_∞ controller is investigated. Copyright © 2002 John Wiley & Sons, Ltd.     

Design of a memory‐based prefilter supplementing a robust PID control system

For systems with uncertainties, lots of PID parameter tuning methods have been proposed from the view point of the robust stability theory. However, the control performance becomes conservative using robust PID controllers. In this paper, a new two‐degree‐of‐freedom (2DOF) controller, which can improve the tracking properties, is proposed for nonlinear systems. According to the proposed method, the prefilter is designed as the PD compensator whose control parameters are tuned by the idea of a memory‐based modeling (MBM) method. Since the MBM method is a type of local modeling methods for nonlinear systems, PD parameters can be tuned adequately in an online manner corresponding to nonlinear properties. Finally, the effectiveness of the newly proposed control scheme is numerically evaluated on a simulation example. Copyright © 2008 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

3D block-based medial axis transform and chessboard distance transform based on dominance

Traditionally, the block-based medial axis transform (BB-MAT) and the chessboard distance transform (CDT) were usually viewed as two completely different image computation problems, especially for three dimensional (3D) space. In fact, there exist some equivalent properties between them. The relationship between both of them is first derived and proved in this paper. One of the significant properties is that CDT for 3D binary image V is equal to BB-MAT for image V' where it denotes the inverse image of V. In a parallel algorithm, a cost is defined as the product of the time complexity and the number of processors used. The main contribution of this work is to reduce the costs of 3D BB-MAT and 3D CDT problems proposed by Wang [65]. Based on the reverse-dominance technique which is redefined from dominance concept, we achieve the computation of the 3D CDT problem by implementing the 3D BB-MAT algorithm first. For a 3D binary image of size N³, our parallel algorithm can be run in O(logN) time using N³ processors on the concurrent read exclusive write (CREW) parallel random access machine (PRAM) model to solve both 3D BB-MAT and 3D CDT problems, respectively. The presented results for the cost are reduced in comparison with those of Wang's. To the best of our knowledge, this work is the lowest costs for the 3D BB-MAT and 3D CDT algorithms known. In parallel algorithms, the running time can be divided into computation time and communication time. The experimental results of the running, communication and computation times for the different problem sizes are implemented in an HP Superdome with SMP/CC-NUMA (symmetric multiprocessor/cache coherent non-uniform memory access) architecture. We conclude that the parallel computer (i.e., SMP/CC-NUMA architecture or cluster system) is more suitable for solving problems with a large amount of input size.     

A statistical evaluation of the free energy of Fe-base ternary ordering alloys

The free energy of the Fe-base ternary ordering alloys whereB2 andD0₃ ordered structures are formed is evaluated. The statistical theory is employed using a pairwise interaction approximation taking into account not only the atomic interaction but also the magnetic interaction, based upon the Bragg-Williams-Gorsky model. The application of this model on Fe-Si-Co ordering alloys are demonstrated. The propriety of the calculation results are performed by comparing the experimental results. The influences of the magnetic energy to the stability of ordered structures are also demonstrated.     

A coarse-to-fine IP-driven registration for pose estimation from single ultrasound image

A fast registration making use of implicit polynomial (IP) models is helpful for the real-time pose estimation from single clinical free-hand Ultrasound (US) image, because it is superior in the areas such as robustness against image noise, fast registration without enquiring correspondences, and fast IP coefficient transformation. However it might lead to the lack of accuracy or failure registration.In this paper, we present a novel registration method based on a coarse-to-fine IP representation. The approach starts from a high-speed and reliable registration with a coarse (of low degree) IP model and stops when the desired accuracy is achieved by a fine (of high degree) IP model. Over the previous IP-to-point based methods our contributions are: (i) keeping the efficiency without requiring pair-wised correspondences, (ii) enhancing the robustness, and (iii) improving the accuracy. The experimental result demonstrates the good performance of our registration method and its capabilities of overcoming the limitations of unconstrained freehand ultrasound data, resulting in fast, robust and accurate registration.     

Probabilistic enhancement of approximate indexing in metric spaces

Some approximate indexing schemes have been recently proposed in metric spaces which sort the objects in the database according to pseudo-scores. It is known that (1) some of them provide a very good trade-off between response time and accuracy, and (2) probability-based pseudo-scores can provide an optimal trade-off in range queries if the probabilities are correctly estimated. Based on these facts, we propose a probabilistic enhancement scheme which can be applied to any pseudo-score based scheme. Our scheme computes probability-based pseudo-scores using pseudo-scores obtained from a pseudo-score based scheme. In order to estimate the probability-based pseudo-scores, we use the object-specific parameters in logistic regression and learn the parameters using MAP (Maximum a Posteriori) estimation and the empirical Bayes method. We also propose a technique which speeds up learning the parameters using pseudo-scores. We applied our scheme to the two state-of-the-art schemes: the standard pivot-based scheme and the permutation-based scheme, and evaluated them using various kinds of datasets from the Metric Space Library. The results showed that our scheme outperformed the conventional schemes, with regard to both the number of distance computations and the CPU time, in all the datasets.