Enhanced wide-activated residual network for efficient and accurate image deblocking

To save bandwidth and storage space as well as speed up data transmission, people usually perform lossy compression on images. Although the JPEG standard is a simple and effective compression method, it usually introduces various visually unpleasing artifacts, especially the notorious blocking artifacts. In recent years, deep convolutional neural networks (CNNs) have seen remarkable development in compression artifacts reduction. Despite the excellent performance, most deep CNNs suffer from heavy computation due to very deep and wide architectures. In this paper, we propose an enhanced wide-activated residual network (EWARN) for efficient and accurate image deblocking. Specifically, we propose an enhanced wide-activated residual block (EWARB) as basic construction module. Our EWARB gives rise to larger activation width, better use of interdependencies among channels, and more informative and discriminative non-linearity activation features without more parameters than residual block (RB) and wide-activated residual block (WARB). Furthermore, we introduce an overlapping patches extraction and combination (OPEC) strategy into our network in a full convolution way, leading to large receptive field, enforced compatibility among adjacent blocks, and efficient deblocking. Extensive experiments demonstrate that our EWARN outperforms several state-of-the-art methods quantitatively and qualitatively with relatively small model size and less running time, achieving a good trade-off between performance and complexity.     

Process Intensification of Living Cationic Polymerization of Isobutylene by a Flow Reaction System

Increasing the reaction temperature of the living cationic polymerization of isobutylene is crucial for industrial production due to the cost of refrigeration. The reaction temperature increase was achieved with an accelerated reaction rate using a flow reaction system. The polymerization conditions, including the flow reactor design, were based on the results of kinetic studies. Utilizing a milli‐scale flow reactor, polyisobutylene, which has a narrow molecular weight distribution, was obtained within a considerably short residence time at a high temperature. Furthermore, it was confirmed that the value of M_w/M_n correlates with the product of the Reynolds number and the angle of collision.     

Learning shape and texture progression for young child face aging

Face aging (FA) for young faces refers to rendering the aging faces at target age for an individual, generally under 20s, which is an important topic of facial age analysis. Unlike traditional FA for adults, it is challenging to age children with one deep learning-based FA network, since there are deformations of facial shapes and variations of textural details. To alleviate the deficiency, a unified FA framework for young faces is proposed, which consists of two decoupled networks to apply aging image translation. It explicitly models transformations of geometry and appearance using two components: GD-GAN, which simulates the Geometric Deformation using Generative Adversarial Network; TV-GAN, which simulates the Textural Variations guided by the age-related saliency map. Extensive experiments demonstrate that our method has advantages over the state-of-the-art methods in terms of synthesizing visually plausible images for young faces, as well as preserving the personalized features.     

Secure image encryption scheme using 4D-Hyperchaotic systems based reconfigurable pseudo-random number generator and S-Box

This paper introduces the design of a hardware efficient reconfigurable pseudorandom number generator (PRNG) using two different feedback controllers based four-dimensional (4D) hyperchaotic systems i.e. Hyperchaotic-1 and -2 to provide confidentiality for digital images. The parameter's value of these two hyperchaotic systems is set to be a specific value to get the benefits i.e. all the multiplications (except a few multiplications) are performed using hardwired shifting operations rather than the binary multiplications, which doesn't utilize any hardware resource. The ordinary differential equations (ODEs) of these two systems have been exploited to build a generic architecture that fits in a single architecture. The proposed architecture provides an opportunity to switch between two different 4D hyperchaotic systems depending on the required behavior. To ensure the security strength, that can be also used in the encryption process in which encrypt the input data up to two times successively, each time using a different PRNG configuration. The proposed reconfigurable PRNG has been designed using Verilog HDL, synthesized on the Xilinx tool using the Virtex-5 (XC5VLX50T) and Zynq (XC7Z045) FPGA, its analysis has been done using Matlab tool. It has been found that the proposed architecture of PRNG has the best hardware performance and good statistical properties as it passes all fifteen NIST statistical benchmark tests while it can operate at 79.101-MHz or 1898.424-Mbps and utilize only 0.036 %, 0.23 %, and 1.77 % from the Zynq (XC7Z045) FPGA's slice registers, slice LUTs, and DSP blocks respectively. Utilizing these PRNGs, we design two 16 × 16 substitution boxes (S-boxes). The proposed S-boxes fulfill the following criteria: Bijective, Balanced, Non-linearity, Dynamic Distance, Strict Avalanche Criterion (SAC) and BIC non-linearity criterion. To demonstrate these PRNGs and S-boxes, a new three different scheme of image encryption algorithms have been developed: a) Encryption using S-box-1, b) Encryption using S-box-2 and, c) Two times encryption using S-box-1 and S-box-2. To demonstrate that the proposed cryptosystem is highly secure, we perform the security analysis (in terms of the correlation coefficient, key space, NPCR, UACI, information entropy and image encryption quantitatively in terms of (MSE, PSNR and SSIM)).     

Hybrid hydrate processes for CO2/H2 mixture purification: A techno-economic analysis

In this work, hydrate based separation technique was combined with membrane separation and amine-absorption separation technologies to design hybrid processes for separation of CO₂/H₂ mixture. Hybrid processes are designed in the presence of different types of hydrate promoters. The conceptual processes have been developed using Aspen HYSYS. Proposed processes were simulated at different flow rates for the feed stream. A comprehensive cost model was developed for economic analysis of novel processes proposed in this study. Based on the results from process simulation and equipment sizing, the amount of total energy consumption, fixed cost, variable cost, and total cost were calculated per unit weight of captured CO₂ for various flow rates of feed stream and in the presence of different hydrate promoters. Results showed that combination of hydrate formation separation technique with membrane separation technology results in a CO₂ capture process with lowest energy consumption and total cost per unit weight of captured CO₂. As split fraction and heat of hydrate formation increases, the share of hydrate formation section in total energy consumption increases. When TBAB is applied as hydrate promoter, due to its higher hydrate separation efficiency, more amount of CO₂ is captured in hydrate formation section and consequently the total cost for process decreases considerably. Hybrid hydrate-membrane process in the presence of TBAB as hydrate promoter with 29.47 US$/ton CO₂ total cost is the best scheme for hybrid hydrate CO₂ capture process. Total cost for this process is lower than total cost for single MDEA-based absorption process as the mature technology for CO₂ capture.     

A novel fusion paradigm for multi-channel image denoising

Multi-channel and single-channel image denoising are on two important development fronts. Integrating multi-channel and single-channel image denoisers for further improvement is a valuable research direction. A natural assumption is that using more useful information is helpful to the output results. In this paper, a novel multi-channel and single-channel fusion paradigm (MSF) is proposed. The proposed MSF works by fusing the estimates of a multi-channel image denoiser and a single-channel image denoiser. The performance of recent multi-channel image denoising methods involved in the proposed MSF can be further improved at low additional time-consuming cost. Specifically, the validity principle of the proposed MSF is that the fused single-channel image denoiser can produce auxiliary estimate for the involved multi-channel image denoiser in a designed underdetermined transform domain. Based on the underdetermined transformation, we create a corresponding orthogonal transformation for fusion and better restore the multi-channel images. The quantitative and visual comparison results demonstrate that the proposed MSF can be effectively applied to several state-of-the-art multi-channel image denoising methods.     

Improved error performance for generalised spatial modulation with enhanced spectral efficiency

The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these.     

Theoretical framework for formulating MIP scheduling models with multiple and non-uniform discrete-time grids

We present a framework for the formulation of MIP scheduling models based on multiple and nonuniform discrete time grids. In a previous work we showed that it is possible to use different (possibly non-uniform) time grids for each task, unit, and material. Here, we generalize these ideas to account for general resources, and a range of processing characteristics such as limited intermediate storage and changeovers. Each resource has its own grid based on resource consumption and availability allowing resource constraints to be modeled more accurately without increasing the number of binary variables. We develop algorithms to define the unit-, task-, material-, and resource-specific grids directly from problem data. Importantly, we prove that the multi-grid formulation is able to find a schedule with the same optimal objective as the discrete-time single-grid model with an arbitrarily fine grid. The proposed framework leads to the formulation of models with reduced number of binary variables and constraints, which are able to find good solutions faster than existing models.     

A signal adaptive diffusion filter for video coding: Mathematical framework and complexity reductions

In this paper we combine video compression and modern image processing methods. We construct novel iterative filter methods for prediction signals based on Partial Differential Equation (PDE) based methods. The mathematical framework of the employed diffusion filter class is given and some desirable properties are stated. In particular, two types of diffusion filters are constructed: a uniform diffusion filter using a fixed filter mask and a signal adaptive diffusion filter that incorporates the structures of the underlying prediction signal. The latter has the advantage of not attenuating existing edges while the uniform filter is less complex. The filters are embedded into a software based on HEVC with additional QTBT (Quadtree plus Binary Tree) and MTT (Multi-Type-Tree) block structure. In this setting, several measures to reduce the coding complexity of the tool are introduced, discussed and tested thoroughly. The coding complexity is reduced by up to 70% while maintaining over 80% of the gain. Overall, the diffusion filter method achieves average bitrate savings of 2.27% for Random Access having an average encoder runtime complexity of 119% and 117% decoder runtime complexity. For individual test sequences, results of 7.36% for Random Access are accomplished.