Compressed Sensing Based on the Single Layer Wavelet Transform for Image Fusion

In this paper, a new method of combination single layer wavelet transform and compressive sensing is proposed for image fusion. In which only measured the high-pass wavelet coefficients of the image but preserved the low-pass wavelet coefficient. Then, fuse the low-pass wavelet coefficients and the measurements of high-pass wavelet coefficient with different schemes. For the reconstruction, by using the minimization of total variation algorithm (TV), high-pass wavelet coefficients could be recovered by the fused measurements. Finally, the fused image could be reconstructed by the inverse wavelet transform. The experiments show the proposed method provides promising fusion performance with a low computational complexity.

Energy-Efficient Joint Caching and Transcoding for HTTP Adaptive Streaming in 5G Networks with Mobile Edge Computing

With the new promising technique of mobile edge computing (MEC) emerging, by utilizing the edge computing and cloud computing capabilities to realize the HTTP adaptive video streaming transmission in MEC-based 5G networks has been widely studied. Although many works have been done, most of the existing works focus on the issues of network resource utilization or the quality of experience (QoE) promotion, while the energy efficiency is largely ignored. In this paper, different from previous works, in order to realize the energy efficiency for video transmission in MEC-enhanced 5G networks, we propose a joint caching and transcoding schedule strategy for HTTP adaptive video streaming transmission by taking the caching and transcoding into consideration. We formulate the problem of energy-efficient joint caching and transcoding as an integer programming problem to minimize the system energy consumption. Due to solving the optimization problem brings huge computation complexity, therefore, to make the optimization problem tractable, a heuristic algorithm based on simulated annealing algorithm is proposed to iteratively reach the global optimum solution with a lower complexity and higher accuracy. Finally, numerical simulation results are illustrated to demonstrated that our proposed scheme brings an excellent performance.

A Game Theoretic Approach for Hierarchical Caching Resource Sharing in 5G Networks with Virtualization

Caching and virtualization have been considered as the promising techniques in 5G Networks. In 5G networks with virtualization, the caching resources deployed by infrastructure providers (InPs) can be abstracted into isolated slices and transparently shared by mobile virtual network operators (MVNOs). In this case, one of the most important issues is how the MVNOs to share the caching resource. To solve this issue, different from previous works, a hierarchical caching architecture that core network and radio access network (RAN) have the caching capability in 5G networks with virtualization is first considered in this paper. Then, we study the problem of hierarchical caching resource sharing for MVNOs, and a competitive game to maximize their expectation revenue based on the oligopoly market model is formulated. As it is a hard problem to find the optimal solution in the hierarchical caching resource sharing problem, we decompose the optimization problem into two independent caching resource sharing problems in RAN and core network, respectively. Then the local optimal solutions are solved and the global Nash equilibrium solution is achieved. Finally, simulation results are illustrated to demonstrate the performance of the proposed scheme.

移动自组织网络下基于跨层感知和邻居协作的视频分享方案(英文)

Fast resources discovery and high Quality of Service(QoS) guarantee are the key determinants for efficient Mobile P2P(MP2P) video sharing.In this paper,we propose a CrossLayer and One-Hop Neighbour-Assisted Video Sharing(CNVS) solution in Mobile Ad Hoc Networks(MANETs).By making use of crosslayer approaches to bridge the overlay and the MAC layer and with the help of dissemination assisted by one-hop neighbours,CNVS intelligently builds the resource-centric self-organization node cluster group.In order to meet the QoS requirement,by making use of video resources access cost model,each peer can disconnect a less efficient connection with the original supplier and choose a peer that provides a low access cost as the new supplier.Simulation results also show how CNVS achieves lower average end-to-end delay,less average number of hops for video data delivery,lower routing overhead and packet loss rate,and higher network throughput than another state-of-the-art solution.

Modeling and inferring 2.1D sketch with mixed Markov random field

This paper presents a method of computing a 2.1D sketch (i.e., layered image representation) from a single image with mixed Markov random field (MRF) under the Bayesian framework. Our model consists of three layers: the input image layer, the graphical representation layer of the computed 2D atomic regions and 3-degree junctions (such as T or arrow junctions), and the 2.1D sketch layer. There are two types of vertices in the graphical representation of the 2D entities: (i) regions, which act as the vertices found in traditional MRF, and (ii) address variables assigned to the terminators decomposed from the 3-degree junctions, which are a new type of vertices for the mixed MRF. We formulate the inference problem as computing the 2.1D sketch from the 2D graphical representation under the Bayesian framework, which consists of two components: (i) region layering/coloring based on the Swendsen-Wang cuts algorithm, which infers partial occluding order of regions, and (ii) address variable assignments based on Gibbs sampling, which completes the open bonds of the terminators of the 3-degree junctions. The proposed method is tested on the D-Order dataset, the Berkeley segmentation dataset and the Stanford 3D dataset. The experimental results show the efficiency and robustness of our approach. ? 2017 Beijing Institute of Aerospace Information.