Power reduction of micro‐electro‐mechanical system shutter display by temporal smoothing of image signal

Power reduction technique for micro‐electro‐mechanical system (MEMS) shutter display employing a time‐division pulse‐width‐modulation gray scale expression method has been proposed. By temporally smoothing the column data signal, transition frequency between open and closed states of the MEMS shutter decreases, resulting in power reduction. In order to suppress color distortion due to the smoothing, the number of smoothing subfield is limited. In addition, the number of smoothing subfield is adjusted for each pixel after calculating color difference between the original and smoothed pixels. Simulated experiments show about 20% reduction of the transition number of MEMS shutter state when the color‐difference tolerance is 0.8 and the maximum number of smoothing subfield is 3.     

DISCRETIZED SUB‐OPTIMAL TRACKER FOR NONLINEAR CONTINUOUS TWO‐DIMENSIONAL SYSTEMS

The discretized quadratic sub‐optimal tracker for nonlinear continuous two‐dimensional (2‐D) systems is newly proposed in this paper. The proposed method provides a novel methodology for indirect digital redesign for nonlinear continuous 2‐D systems with a continuous performance index. This includes the following features: (1) the 2‐D optimal‐linearization approach of the nonlinear 2‐D Roesser's model (RM), (2) the dynamic programming‐based discretized quadratic optimal tracker for linear continuous 2‐D systems, (3) the steady‐state discretized quadratic sub‐optimal tracker for linear continuous 2‐D systems, and (4) the discretized quadratic sub‐optimal tracker for nonlinear continuous 2‐D systems. Illustrative examples are presented to demonstrate the effectiveness of the proposed procedure.     

Pixel structures using the negative feedback method for high‐resolution active matrix organic light‐emitting diode displays

Novel two pixel structures are proposed for high‐resolution active matrix organic light‐emitting diode displays. The proposed two pixels (pixel structures A and B) use the negative feedback method for high‐resolution displays that requires to have small‐sized storage capacitance. The proposed pixel structures A and B improve the luminance uniformity by reducing the voltage distortion in the storage capacitor. However, the proposed pixel structure A is vulnerable to the organic light‐emitting diode (OLED) degradation because the anode voltage of the OLED affects the emission current. In order to compensate the OLED degradation, the proposed pixel structure B stores the turn‐on voltage of OLEDs in the storage capacitor. The simulation results show that the emission current error of the proposed pixel structure B is improved by four times in comparison with the proposed pixel structure A when the OLED turn‐on voltage increases by 0.1 V. Also, the emission current error of the proposed pixel structure B when the threshold voltage of driving thin‐film transistors varies from ?2.2 to ?1.8 V is from ?0.69 least significant bit (LSB) to 0.13 LSB, which shows the excellent luminance uniformity. The proposed pixels are designed for 5.5‐in. full high‐definition displays.     

Rough‐fuzzy quadratic minimum spanning tree problem

A quadratic minimum spanning tree problem determines a minimum spanning tree of a network whose edges are associated with linear and quadratic weights. Linear weights represent the edge costs whereas the quadratic weights are the interaction costs between a pair of edges of the graph. In this study, a bi‐objective rough‐fuzzy quadratic minimum spanning tree problem has been proposed for a connected graph, where the linear and the quadratic weights are represented as rough‐fuzzy variables. The proposed model is formulated by using rough‐fuzzy chance‐constrained programming technique. Subsequently, three related theorems are also proposed for the crisp transformation of the proposed model. The crisp equivalent models are solved with a classical multi‐objective solution technique, the epsilon‐constraint method and two multi‐objective evolutionary algorithms: (a) nondominated sorting genetic algorithm II (NSGA‐II) and (b) multi‐objective cross‐generational elitist selection, heterogeneous recombination, and cataclysmic mutation (MOCHC) algorithm. A numerical example is provided to illustrate the proposed model when solved with different methodologies. A sensitivity analysis of the example is also performed at different confidence levels. The performance of NSGA‐II and MOCHC are analysed on five randomly generated instances of the proposed model. Finally, a numerical illustration of an application of the proposed model is also presented in this study.     

Line‐Sweep Ambient Obscurance

Screen‐space ambient occlusion and obscurance have become established methods for rendering global illumination effects in real‐time applications. While they have seen a steady line of refinements, their computational complexity has remained largely unchanged and either undersampling artefacts or too high render times limit their scalability. In this paper we show how the fundamentally quadratic per‐pixel complexity of previous work can be reduced to a linear complexity. We solve obscurance in discrete azimuthal directions by performing line sweeps across the depth buffer in each direction. Our method builds upon the insight that scene points along each line can be incrementally inserted into a data structure such that querying for the largest occluder among the visited samples along the line can be achieved at an amortized constant cost. The obscurance radius therefore has no impact on the execution time and our method produces accurate results with smooth occlusion gradients in a few milliseconds per frame on commodity hardware.     

Robust identification of MISO neuro‐fractional‐order Hammerstein systems

This paper introduces a multiple‐input–single‐output (MISO) neuro‐fractional‐order Hammerstein (NFH) model with a Lyapunov‐based identification method, which is robust in the presence of outliers. The proposed model is composed of a multiple‐input–multiple‐output radial basis function neural network in series with a MISO linear fractional‐order system. The state‐space matrices of the NFH are identified in the time domain via the Lyapunov stability theory using input‐output data acquired from the system. In this regard, the need for the system state variables is eliminated by introducing the auxiliary input‐output filtered signals into the identification laws. Moreover, since practical measurement data may contain outliers, which degrade performance of the identification methods (eg, least‐square–based methods), a Gaussian Lyapunov function is proposed, which is rather insensitive to outliers compared with commonly used quadratic Lyapunov function. In addition, stability and convergence analysis of the presented method is provided. Comparative example verifies superior performance of the proposed method as compared with the algorithm based on the quadratic Lyapunov function and a recently developed input‐output regression‐based robust identification algorithm.     

Large‐Scale Pixel‐Precise Deferred Vector Maps

Rendering vector maps is a key challenge for high‐quality geographic visualization systems. In this paper, we present a novel approach to visualize vector maps over detailed terrain models in a pixel‐precise way. Our method proposes a deferred line rendering technique to display vector maps directly in a screen‐space shading stage over the 3D terrain visualization. Due to the absence of traditional geometric polygonal rendering, our algorithm is able to outperform conventional vector map rendering algorithms for geographic information systems, and supports advanced line anti‐aliasing as well as slope distortion correction. Furthermore, our deferred line rendering enables interactively customizable advanced vector styling methods as well as a tool for interactive pixel‐based editing operations.     

High luminance and high see‐through head‐mounted displays with beam‐splitter‐array waveguides

We have developed head‐mounted displays with high transmittance and luminance, which could be utilized outside safely without dimming glasses. We first specified required optical performance specifications by considering user's safety and usability. In order to ensure that the user is able to recognize both surrounding environment and the image of the head‐mounted display, we set the target specification that the transmittance is higher than or equal to 85%, and the luminance contrast ratio is larger than or equal to 1.15 with display image of white solid pattern. We then developed the beam‐splitter‐array waveguide to achieve the requirements. It has advantages in high efficiency and high see‐through property. In order to determine configuration of the waveguide, we have performed optical ray trace simulation. We also established versatile waveguide measurement method applicable to different‐type waveguides. By utilizing the waveguide we have developed, we made a prototype of a head‐mounted display (HMD) with high transmittance 94% and high luminance 4.8 × 10³ cd/m² and thus luminance contrast ratio 1.25 under the sun. With these advantages, our HMD is suitable for usage outside including applications of work support systems where dimming effect is not preferred, and the HMD is used under the sun.     

Design of non‐fragile guaranteed‐cost repetitive‐control system based on two‐dimensional model

This paper concerns a new method of repetitive control based on two‐dimensional (2D) system theory. First, a 2D model is presented that enables the independent adjustment of control, which happens within a repetition period, and learning, which happens between periods. Next, the problem of designing a repetitive‐control law is formulated as a state‐feedback design problem for the 2D model. An existence condition and a method of designing a robust repetitive‐control law for a plant containing time‐invariant structured uncertainties are established by combining 2D system theory with linear matrix inequalities. Then, based on those results, a non‐fragile guaranteed‐cost repetitive‐control law is derived. The controller gain to be designed is assumed to have additive gain variations. It guarantees that the value of a quadratic performance function is less than a specified upper bound for all admissible uncertainties. The main feature of this approach is that it enables the control action and the learning process to be adjusted independently by the direct tuning of the weighting matrices in the quadratic cost function. Finally, a numerical example demonstrates the validity of this approach. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Foveated Real‐Time Ray Tracing for Head‐Mounted Displays

Head‐mounted displays with dense pixel arrays used for virtual reality applications require high frame rates and low latency rendering. This forms a challenging use case for any rendering approach. In addition to its ability of generating realistic images, ray tracing offers a number of distinct advantages, but has been held back mainly by its performance. In this paper, we present an approach that significantly improves image generation performance of ray tracing. This is done by combining foveated rendering based on eye tracking with reprojection rendering using previous frames in order to drastically reduce the number of new image samples per frame. To reproject samples a coarse geometry is reconstructed from a G‐Buffer. Possible errors introduced by this reprojection as well as parts that are critical to the perception are scheduled for resampling. Additionally, a coarse color buffer is used to provide an initial image, refined smoothly by more samples were needed. Evaluations and user tests show that our method achieves real‐time frame rates, while visual differences compared to fully rendered images are hardly perceivable. As a result, we can ray trace non‐trivial static scenes for the Oculus DK2 HMD at 1182 × 1464 per eye within the the VSync limits without perceived visual differences.     

A Shape‐Preserving Approach to Image Resizing

We present a novel image resizing method which attempts to ensure that important local regions undergo a geometric similarity transformation, and at the same time, to preserve image edge structure. To accomplish this, we define handles to describe both local regions and image edges, and assign a weight for each handle based on an importance map for the source image. Inspired by conformal energy, which is widely used in geometry processing, we construct a novel quadratic distortion energy to measure the shape distortion for each handle. The resizing result is obtained by minimizing the weighted sum of the quadratic distortion energies of all handles. Compared to previous methods, our method allows distortion to be diffused better in all directions, and important image edges are well‐preserved. The method is efficient, and offers a closed form solution.     

Generic interactive pixel‐level image editing

Several image editing methods have been proposed in the past decades, achieving brilliant results. The most sophisticated of them, however, require additional information per‐pixel. For instance, dehazing requires a specific transmittance value per pixel, or depth of field blurring requires depth or disparity values per pixel. This additional per‐pixel value is obtained either through elaborated heuristics or through additional control over the capture hardware, which is very often tailored for the specific editing application. In contrast, however, we propose a generic editing paradigm that can become the base of several different applications. This paradigm generates both the needed per‐pixel values and the resulting edit at interactive rates, with minimal user input that can be iteratively refined. Our key insight for getting per‐pixel values at such speed is to cluster them into superpixels, but, instead of a constant value per superpixel (which yields accuracy problems), we have a mathematical expression for pixel values at each superpixel: in our case, an order two multinomial per superpixel. This leads to a linear least‐squares system, effectively enabling specific per‐pixel values at fast speeds. We illustrate this approach in three applications: depth of field blurring (from depth values), dehazing (from transmittance values) and tone mapping (from brightness and contrast local values), and our approach proves both favorably interactive and accurate in all three. Our technique is also evaluated with a common dataset and compared favorably.     

Color error from an RGB‐stripe pixel structure

Abstract— Most direct‐view color displays have a sub‐pixel structure similar to the RGB‐stripe structure. The video data for R and B are produced on the condition that they are reproduced at the same position as G but they are displayed on the screen with 1/3 of a pixel separation from the corresponding G pixel. This pixel structure thus entails a convergence error of 1/3 of a pixel. The modified s‐CIELAB method was applied to investigate color errors produced by the RGB‐stripe pixel structure. The results show that the pixel structure can degrade the image quality even for a viewing distance where the pixel structure is not visible because the color difference caused by the structure has a low‐frequency component and the human vision can detect it. The same method was applied to the convergence error and it was shown that the necessary convergence accuracy is around 1/4 of a pixel.     

Hybrid harmonic‐intermodulation distortion behavioral model for shortwave power amplifiers

In this article, a hybrid harmonic‐intermodulation distortion (HHIMD) behavioral model is proposed for imitating the shortwave power amplifier (SWPA) behavioral distortion, that is, harmonic distortion, intermodulation distortion, and memory effect. The proposed model is composed of an intermodulation distortion module, a quadrature digital up‐converter module and a harmonic distortion module. To demonstrate the modeling accuracy, the proposed model and measured SWPA are compared in the time domain and spectrum domain. It is shown that the proposed model can imitate the SWPA not only harmonic and intermodulation distortion, but also memory effect. The modeling normalized mean squared error between the HHIMD and measured SWPA output is lower than ?44‐dB.     

Spectral Affine‐Kernel Embeddings

In this paper, we propose a controllable embedding method for high‐ and low‐dimensional geometry processing through sparse matrix eigenanalysis. Our approach is equally suitable to perform non‐linear dimensionality reduction on big data, or to offer non‐linear shape editing of 3D meshes and pointsets. At the core of our approach is the construction of a multi‐Laplacian quadratic form that is assembled from local operators whose kernels only contain locally‐affine functions. Minimizing this quadratic form provides an embedding that best preserves all relative coordinates of points within their local neighborhoods. We demonstrate the improvements that our approach brings over existing nonlinear dimensionality reduction methods on a number of datasets, and formulate the first eigen‐based as‐rigid‐as‐possible shape deformation technique by applying our affine‐kernel embedding approach to 3D data augmented with user‐imposed constraints on select vertices.     

An improved robust model predictive control for linear parameter‐varying input‐output models

This paper describes a new robust model predictive control (MPC) scheme to control the discrete‐time linear parameter‐varying input‐output models subject to input and output constraints. Closed‐loop asymptotic stability is guaranteed by including a quadratic terminal cost and an ellipsoidal terminal set, which are solved offline, for the underlying online MPC optimization problem. The main attractive feature of the proposed scheme in comparison with previously published results is that all offline computations are now based on the convex optimization problem, which significantly reduces conservatism and computational complexity. Moreover, the proposed scheme can handle a wider class of linear parameter‐varying input‐output models than those considered by previous schemes without increasing the complexity. For an illustration, the predictive control of a continuously stirred tank reactor is provided with the proposed method.     

Two‐Colored Pixels

In this paper we show how to use two‐colored pixels as a generic tool for image processing. We apply two‐colored pixels as a basic operator as well as a supporting data structure for several image processing applications. Traditionally, images are represented by a regular grid of square pixels with one constant color each. In the two‐colored pixel representation, we reduce the image resolution and replace blocks of N × N pixels by one square that is split by a (feature) line into two regions with constant colors. We show how the conversion of standard mono‐colored pixel images into two‐colored pixel images can be computed efficiently by applying a hierarchical algorithm along with a CUDA‐based implementation. Two‐colored pixels overcome some of the limitations that classical pixel representations have, and their feature lines provide minimal geometric information about the underlying image region that can be effectively exploited for a number of applications. We show how to use two‐colored pixels as an interactive brush tool, achieving realtime performance for image abstraction and non‐photorealistic filtering. Additionally, we propose a realtime solution for image retargeting, defined as a linear minimization problem on a regular or even adaptive two‐colored pixel image. The concept of two‐colored pixels can be easily extended to a video volume, and we demonstrate this for the example of video retargeting.     

A robust continuous‐time fixed‐lag smoother for nonlinear uncertain systems

This paper presents a scheme for the design of a robust fixed‐lag smoother for a class of nonlinear uncertain systems. The proposed approach combines a nonlinear robust estimator with a stable fixed‐lag smoother, to improve the estimation error covariance. The robust fixed‐lag smoother is based on the use of integral quadratic constraints and minimax linear quadratic regulator estimation and control theory. The state estimator uses a copy of the system nonlinearity in the estimator and combines an approximate model of the delayed states to produce a smoother signal. Also in this work, a characterization of the delay approximation error is presented, and the corresponding integral quadratic constraint is included in the design, which gives a guaranteed bound on the performance cost function. In order to see the effectiveness of the method, it is applied to a quantum optical phase estimation problem. Results show a significant improvement in the error covariance of the estimator when compared with a robust nonlinear filter. Copyright © 2015 John Wiley & Sons, Ltd.     

High‐performance local‐dimming algorithm based on image characteristic and logarithmic function

With the emergence of high‐dynamic range (HDR) image and video, displaying an HDR image or video on a standard dynamic range displays with natural visual effect, clear details on local areas, and high‐contrast ratio has become an important issue. To achieve HDR, local‐dimming technique has been commonly practiced. In this paper, we investigate the problem of local dimming for LED‐backlight LC display to provide algorithm support for developing HDR displays. A novel local‐dimming algorithm is proposed to improve the contrast ratio, enhance the visual quality, and reduce the power consumption of the LCDs. The proposed algorithm mainly consists of two parts. The first part is a backlight luminance extraction method based on dynamic threshold and the maximum grayscale of an image block to improve the contrast ratio and reduce the power consumption. In the second one, a pixel compensation method based on logarithmic function is used to improve the visual quality and contrast ratio. At the same time, in order to better smooth the backlight diffusion at the edges of the backlight luminance signal to enhance the accuracy of the pixel compensation, we draw on the idea of BMA and improve it to establish the backlight diffusion model with different low‐pass‐filter templates for different types of blocks. Simulation and measured results show that the proposed algorithm outperforms the competing ones in contrast ratio, visual quality, and power‐saving ratio.     

Robust sampled‐data model predictive control for networked systems with time‐varying delay

In this paper, the problem of sampled‐data model predictive control (MPC) is investigated for linear networked control systems with both input delay and input saturation. The delay‐induced nonlinearity is overapproximatively modeled as a polytopic inclusion. The nonlinear behavior of input saturation is expressed as a convex polytope. The resulting closed‐loop systems are represented as linear systems with polytopic and additive norm‐bounded uncertainties. The aim is to determine a robust MPC controller that asymptotically stabilizes the uncertain system at the origin with a certain level of quadratic performance. The effectiveness of the proposed algorithm is demonstrated by a numerical example.