Recurrent neural network technique for behavioral modeling of power amplifier with memory effects

A new technique for behavioral modeling of power amplifier (PA) with short‐ and long‐term memory effects is presented here using recurrent neural networks (RNNs). RNN can be trained directly with only the input–output data without having to know the internal details of the circuit. The trained models can reflect the behavior of nonlinear circuits. In our proposed technique, we extract slow‐changing signals from the inputs and outputs of the PA and use these signals as extra inputs of RNN model to effectively represent long‐term memory effects. The methodology using the proposed RNN for modeling short‐term and long‐term memory effects is discussed. Examples of behavioral modeling of PAs with short‐ and long‐term memory using both the existing dynamic neural networks and the proposed RNNs techniques are shown. © 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:289–298, 2015.     

Wide passband/stopband bandpass filter based on transversal signal interference concepts and modified branch‐line structure

A high selectivity wide passband filter with a broader stopband based on transversal signal‐interaction concepts and modified branch line structure (MBLS) is developed in this article. Two transmission paths, that is, one half‐wavelength transmission line and one MBLS, are used to realize signal transmission from Port 1 to Port 2. Then, two transmission zeros are introduced at both lower and upper sides of the passband, which are used to improve the passband selectivity greatly. The filter bandwidth can be easily controlled by reasonable adjusting the coupling coefficient of the coupled lines. Furthermore, with four stubs connected at the input/output ports, the stopband attenuation level is improved greatly. Finally, one prototype filter having 69.1% of 3 dB fractional bandwidth is fabricated with advantages of sharp selectivity and high out‐of‐band rejection. The EM simulated and measured results are presented, and an excellent agreement can be obtained. © 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:330–336, 2015.     

Extracting Microfacet‐based BRDF Parameters from Arbitrary Materials with Power Iterations

We introduce a novel fitting procedure that takes as input an arbitrary material, possibly anisotropic, and automatically converts it to a microfacet BRDF. Our algorithm is based on the property that the distribution of microfacets may be retrieved by solving an eigenvector problem that is built solely from backscattering samples. We show that the eigenvector associated to the largest eigenvalue is always the only solution to this problem, and compute it using the power iteration method. This approach is straightforward to implement, much faster to compute, and considerably more robust than solutions based on nonlinear optimizations. In addition, we provide simple conversion procedures of our fits into both Beckmann and GGX roughness parameters, and discuss the advantages of microfacet slope space to make our fits editable. We apply our method to measured materials from two large databases that include anisotropic materials, and demonstrate the benefits of spatially varying roughness on texture mapped geometric models.     

Smooth Loops from Unconstrained Video

Converting unconstrained video sequences into videos that loop seamlessly is an extremely challenging problem. In this work, we take the first steps towards automating this process by focusing on an important subclass of videos containing a single dominant foreground object. Our technique makes two novel contributions over previous work: first, we propose a correspondence‐based similarity metric to automatically identify a good transition point in the video where the appearance and dynamics of the foreground are most consistent. Second, we develop a technique that aligns both the foreground and background about this transition point using a combination of global camera path planning and patch‐based video morphing. We demonstrate that this allows us to create natural, compelling, loopy videos from a wide range of videos collected from the internet.     

Path‐space Motion Estimation and Decomposition for Robust Animation Filtering

Renderings of animation sequences with physics‐based Monte Carlo light transport simulations are exceedingly costly to generate frame‐by‐frame, yet much of this computation is highly redundant due to the strong coherence in space, time and among samples. A promising approach pursued in prior work entails subsampling the sequence in space, time, and number of samples, followed by image‐based spatio‐temporal upsampling and denoising. These methods can provide significant performance gains, though major issues remain: firstly, in a multiple scattering simulation, the final pixel color is the composite of many different light transport phenomena, and this conflicting information causes artifacts in image‐based methods. Secondly, motion vectors are needed to establish correspondence between the pixels in different frames, but it is unclear how to obtain them for most kinds of light paths (e.g. an object seen through a curved glass panel). To reduce these ambiguities, we propose a general decomposition framework, where the final pixel color is separated into components corresponding to disjoint subsets of the space of light paths. Each component is accompanied by motion vectors and other auxiliary features such as reflectance and surface normals. The motion vectors of specular paths are computed using a temporal extension of manifold exploration and the remaining components use a specialized variant of optical flow. Our experiments show that this decomposition leads to significant improvements in three image‐based applications: denoising, spatial upsampling, and temporal interpolation.     

Towards a smooth design process for static communicative node‐link diagrams

Node‐link infographics are visually very rich and can communicate messages effectively, but can be very difficult to create, often involving a painstaking and artisanal process. In this paper we present an investigation of node‐link visualizations for communication and how to better support their creation. We begin by breaking down these images into their basic elements and analyzing how they are created. We then present a set of techniques aimed at improving the creation workflow by bringing more flexibility and power to users, letting them manipulate all aspects of a node‐link diagram (layout, visual attributes, etc.) while taking into account the context in which it will appear. These techniques were implemented in a proof‐of‐concept prototype called GraphCoiffure, which was designed as an intermediary step between graph drawing/editing software and image authoring applications. We describe how GraphCoiffure improves the workflow and illustrate its benefits through practical examples.     

Terrain Modelling from Feature Primitives

We introduce a compact hierarchical procedural model that combines feature‐based primitives to describe complex terrains with varying level of detail. Our model is inspired by skeletal implicit surfaces and defines the terrain elevation function by using a construction tree. Leaves represent terrain features and they are generic parametrized skeletal primitives, such as mountains, ridges, valleys, rivers, lakes or roads. Inner nodes combine the leaves and subtrees by carving, blending or warping operators. The elevation of the terrain at a given point is evaluated by traversing the tree and by combining the contributions of the primitives. The definition of the tree leaves and operators guarantees that the resulting elevation function is Lipschitz, which speeds up the sphere tracing used to render the terrain. Our model is compact and allows for the creation of large terrains with a high level o detail using a reduced set of primitives. We show the creation of different kinds of landscapes and demonstrate that our model allows to efficiently control the shape and distribution of landform features.