Search

Limited backhaul bandwidth and blockage effects are two main factors limiting the practical deployment of millimeter wave (mmWave) networks. To tackle these issues, we study the feasibility of relaying as well as caching in mmWave networks. A user association and relaying (UAR) criterion dependent on both caching status and maximum biased received power is proposed by considering the spatial correlation caused by the coexistence of base stations (BSs) and relay nodes (RNs). Using stochastic geometry tools, we decouple the UAR and caching placement issues by analyzing the relationship between UAR probabilities and caching placement probabilities. We then optimize the formulated caching placement problem based on polyblock outer approximation by exploiting the monotonic property in the general case and utilizing convex optimization in the noise-limited case. Accordingly, we propose a BS and RN selection algorithm where caching status at BSs and maximum biased received power are jointly considered. Experimental results demonstrate a significant enhancement of backhaul offloading using the proposed algorithms, and show that deploying more RNs and increasing cache size in mmWave networks is a more cost-effective alternative than increasing BS density to achieve similar backhaul offloading performance. [ABSTRACT FROM AUTHOR]

In multi-cell non-orthogonal multiple access (NOMA) systems, designing an appropriate user grouping strategy is an open problem due to diverse quality of service (QoS) requirements and inter-cell interference. In this paper, we exploit both game theory and graph theory to study QoS-aware user grouping strategies, aiming at minimizing power consumption in downlink multi-cell NOMA systems. Under different QoS requirements, we derive the optimal successive interference cancellation (SIC) decoding order with inter-cell interference, which is different from existing SIC decoding order of increasing channel gains, and obtain the corresponding power allocation strategy. Based on this, the exact potential game model of the user grouping strategies adopted by multiple cells is formulated. We prove that, in this game, the problem for each player to find a grouping strategy can be converted into the problem of searching for specific negative loops in the graph composed of users. Bellman-Ford algorithm is expanded to find these negative loops. Furthermore, we design a greedy based suboptimal strategy to approach the optimal solution with polynomial time. Extensive simulations confirm the effectiveness of grouping users with consideration of QoS and inter-cell interference, and show that the proposed strategies can considerably reduce total power consumption comparing with reference strategies. [ABSTRACT FROM AUTHOR]

Recently, robust video transmission system that can eliminate the cliff effect in digital video transmission has attracted great interest from both academia and industry. By linearizing the whole system, robust video transmission is intrinsically scalable to channel conditions in mobile networks. However, the heterogeneity of user devices in terms of viewing resolution has not been well studied for robust video broadcast systems. In this paper, we propose a spatial scalability enabled robust video broadcast (SSRVB) system, aiming at accommodating diverse users with both heterogeneous resolutions and heterogeneous channel conditions. In SSRVB, a novel spatial decomposition method based on linear projection is first designed for robust video transmission. Then the transmission distortion minimization problem with joint subcarrier matching and power allocation is formulated. A near-optimal low-complexity subcarrier matching algorithm based on auction theory and an optimal power allocation strategy are also proposed. Furthermore, an iterative algorithm is designed to solve the problem of joint resource allocation. Simulation results demonstrate that SSRVB can achieve an average of 3 dB gain when compared with the reference schemes (i.e., ECast, MCast, discrete wavelet transform (DWT) based scheme, and scalable video coding (SVC) scheme) in terms of average peak signal-to-noise ratio under heterogeneous scenarios. [ABSTRACT FROM AUTHOR]

Nowadays, the Internet of Video Things (IoVT) is growing rapidly in terms of quantity and computation demands. In spite of the higher local computation capability on visual processing compared to conventional Internet of Things devices, IoVT devices need to offload partial visual processing tasks to the mobile edge computing (MEC) server wirelessly due to its larger computation demands. However, visual processing task offloading is limited by uplink throughput and computation capability of the MEC server. To break through these limitations, a novel non-orthogonal multiple access (NOMA)-assisted IoVT framework with multiple MEC servers is proposed, where NOMA is exploited to improve uplink throughput, and MEC servers are co-located with base stations to provide enough computation capability for off-loading. In the proposed framework, the association strategy, uplink visual data transmission assisted by NOMA, and division of the visual processing tasks as well as computation resource allocation at the MEC servers are jointly optimized to minimize the total delay of all visual processing tasks, while meeting the delay requirements of all IoVT devices. Simulation results demonstrate that significant performance gains can be achieved by proposed joint optimization with NOMA transmission and multi-MEC offloading in the heterogeneous IoVT network. [ABSTRACT FROM AUTHOR]

Spectral clustering has been an attractive topic in the field of computer vision due to the extensive growth of applications, such as image segmentation, clustering and representation. In this problem, the construction of the similarity matrix is a vital element affecting clustering performance. In this paper, we propose a multi-view joint learning (MVJL) framework to achieve both a reliable similarity matrix and a latent low-dimensional embedding. Specifically, the similarity matrix to be learned is represented as a convex hull of similarity matrices from different views, where the nuclear norm is imposed to capture the principal information of multiple views and improve robustness against noise/outliers. Moreover, an effective low-dimensional representation is obtained by applying local embedding on the similarity matrix, which preserves the local intrinsic structure of data through dimensionality reduction. With these techniques, we formulate the MVJL as a joint optimization problem and derive its mathematical solution with the alternating direction method of multipliers strategy and the proximal gradient descent method. The solution, which consists of a similarity matrix and a low-dimensional representation, is ultimately integrated with spectral clustering or K-means for multi-view clustering. Extensive experimental results on real-world datasets demonstrate that MVJL achieves superior clustering performance over other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

To cope with rapid growth of video services, we propose a non-orthogonal multiple access (NOMA) based scalable video multicast (NOMA-SVM) framework for mobile networks, by exploiting NOMA's specific potential in scalable video multicast transmission. We consider statistical channels, instead of channels with perfect estimation, in the proposed NOMA-SVM framework in order to capture the realistic channel behaviors. As quality of experience (QoE) is a better metric than throughput for video transmission, QoE-driven power allocation is performed among multiple video layers in the proposed NOMA-SVM framework, in which users can decode video with quality proportional to their channel conditions. Specifically, we formulate the power allocation problem with the goal to maximize the average QoE over all users while guaranteeing the basic services of these users. To solve such a non-convex discrete problem, an optimal algorithm is developed based on the hidden monotonicity of the problem. A suboptimal algorithm is also proposed with much lower complexity in order to meet the practical needs. Simulation results show that the proposed algorithms outperform existing orthogonal multiple access (OMA) and NOMA based algorithms under various multicast scenarios in terms of QoE. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) is promising to enable growing video services with requirements of massive traffic and low latency. In this paper, we investigate a novel multi-user NOMA system design for video delivery. Different from data delivery considered in existing NOMA systems, video distortion is taken into consideration for the design and optimization of the proposed scheme. We first propose a cross-layer scalable video delivery scheme over NOMA wireless networks based on given user grouping. By adopting a semi-analytical rate distortion model for encoded video sequences and investigating the physical layer model for the multi-carrier NOMA network, the distortion-aware power allocation problem is formulated with the goal to minimize the system end-to-end distortion with quality-of-service requirements. To solve such a non-convex problem, we design an efficient algorithm by exploiting its hidden monotonic property to approximate the optimal solution. Inspired by the decoding order in NOMA, a fast algorithm is developed by combining water-filling and greedy strategies to further tame the computational complexity. Simulations results have verified the advantages of the proposed cross-layer scheme with distortion-aware power allocation algorithms, against two existing NOMA schemes and an OMA scheme. [ABSTRACT FROM AUTHOR]

Network morphism is an effective learning scheme to morph a well-trained neural network to a new one with the network function completely preserved. However, existing network morphism scheme addresses only basic morphing types on the layer level. In this research, we address the central problem of network morphism at a higher level, i.e., how a convolutional layer can be morphed into an arbitrary module of a neural network. To simplify the representation of a network, we abstract a module as a graph with blobs as vertices and convolutional layers as edges. Based on this graph, the morphing process can be formulated as a graph transformation problem. Two atomic morphing operations are introduced to construct the graphs, based on which modules are classified into two families, i.e., simple morphable modules and complex modules. We present practical morphing solutions for both families, and prove that any module can be morphed from a single convolutional layer. Extensive experiments have been conducted based on the state-of-the-art ResNet on benchmarks to verify the effectiveness of the proposed solution. [ABSTRACT FROM AUTHOR]

In multi-person videos, especially team sport videos, a semantic event is usually represented as a confrontation between two teams of players, which can be represented as collective motion. In broadcast basketball videos, specific camera motions are used to present specific events. Therefore, a semantic event in broadcast basketball videos is closely related to both the global motion (camera motion) and the collective motion. A semantic event in basketball videos can be generally divided into three stages: pre-event, event occurrence (event-occ), and post-event. By analyzing the influence of different stages of video segments to semantic events discrimination, it is observed that the pre-event and event-occ segments are effective for classification, while the post-events are effective for event success/failure classification. In this paper, we propose an ontology-based global and collective motion pattern (On_GCMP) algorithm for the basketball event classification. First, a two-stage GCMP-based event classification scheme is proposed. The GCMP is extracted using the optical flow. The two-stage scheme progressively combines a five-class event classification algorithm on event-occs and a two-class event classification algorithm on pre-events. Both algorithms utilize the sequential convolutional neural networks (CNNs) and the long short-term memory (LSTM) networks to extract the spatial and temporal features of GCMP for event classification. Second, we utilize the post-event segments to predict success/failure using deep features of images in the video frames (RGB_DF_VF)-based algorithms. Finally, the event classification results and success/failure classification results are integrated to obtain the final results. To evaluate the proposed scheme, we collected a new dataset called NCAA+, which is automatically obtained from the NCAA dataset by extending the fixed length of video clips forward and backward of the corresponding semantic events. The experimental results demonstrate that the proposed scheme achieves the mean average precision of 58.10% on NCAA+. It is higher by 6.50% than the state of the art on NCAA. [ABSTRACT FROM AUTHOR]

In Cache-enabled dense small cell networks (DSCNs), energy consumption and file delivery delay are two critical performance metrics. On the other hand, power control is an essential mechanism to mitigate inter-cell interference in DSCNs. However, the impact of power control at small base stations (SBSs) on the system performance when caches are involved has not been well studied. Observing energy consumption and file delivery delay are coupled with each other in cache-enabled DSCNs, different from existing studies, we attempt to optimize these two performance metrics at the same time, taking into account sophisticated power control at SBSs. Firstly, we formulate the energy-delay optimization problem as a utility maximization problem, where cooperative power control among SBSs, file placement and user association are considered. Then, we solve the optimization problem in two stages (i.e., caching stage and delivery stage), based on the fact that caching is performed during off-peak time. At the caching stage, a local popular file placement policy is proposed by estimating user preference at each SBS. At the delivery stage, with given caching status at SBSs, the optimization problem is further decomposed by Benders’ decomposition method. An efficient algorithm is proposed to approach the optimal association and power solution by iteratively shrinking the gap of the upper and lower bounds. Finally, extensive simulations are performed to validate our analytical and algorithmic work. The results demonstrate that the proposed algorithms can achieve a better tradeoff between energy consumption and file delivery delay than the existing algorithms. [ABSTRACT FROM AUTHOR]

We address the issues of 3-D head pose estimation and face modeling from a depth image. Given a depth image, random forests are effective for estimating the location and orientation of a person's head. However, the accuracy of the estimation is not high enough. We propose using corrected regression votes. The corrected votes are obtained by considering the cooperation of all trees, leading to significant improvement of head pose estimation accuracy. Based on the head pose estimator, we present a face modeling system. In our system, the face model is generated by aligning a deformable face model to a depth image using an iterative closest point (ICP) algorithm. The novelty of our approach is that an optimal weight for each vertex is incorporated into the ICP algorithm with point to plane constraints. Experiments show that our system can automatically estimate the head pose and generate a realistic face model from a single depth image. We also provide a detailed evaluation that shows the benefits of our approach. [ABSTRACT FROM AUTHOR]

Privacy-aware location-based service (PA-LBS) preserves LBS users’ privacy but undesirably sacrifices service quality. In order to balance the two factors with satisfactory user experience, existing frameworks are faced with two barriers, that is, scalability and social-friendliness. First, existing schemes do not enable LBS users to flexibly scale their privacy level on service provision. Such a lack of scalability easily results in either unacceptable service-quality degradation or insufficient privacy protection and fails to meet dynamic user requirements. Second, existing schemes handle privacy protection by merely considering the trust relationship between users and servers but ignore the complex trust relationships among users. As a result, users cannot preserve privacy in location-based social services that involve user-to-user interactions. In this paper, we present the first scalable and social-friendly PA-LBS system. In particular, we propose a novel camouflage algorithm with a formal privacy guarantee that enables LBS users to expose their location information by scaling two privacy related factors, that is, camouflage range and place type. Furthermore, we apply the scalable ciphertext policy attribute-based encryption algorithm to enable LBS users to effectively control the access from other users to their location information. Moreover, we also demonstrated the operational efficiency of the proposed system through successful implementations on Android devices. [ABSTRACT FROM AUTHOR]

Video delivery has been playing an essential role in video services over edge networks. Although HTTP segment-based streaming, e.g., Dynamic Adaptive Streaming over HTTP (DASH), has become the prevailing technique, it cannot provide guaranteed video playback in terms of bitrate to mobile users. In essence, HTTP streaming downloads the video segments in a best effort fashion, i.e., passively responding to the channel dynamics. This can cause unstable playback with frequent rebuffer and multi-client competition that degrades a network-wide performance. In this paper, we present a network-assisted streaming framework for Guaranteed Playback-Experience Streaming over HTTP (GESH) that leverages the proactive control of network resources and joint coordination among multiple clients for service-aware network resource allocation. Specifically, GESH is empowered by a new weighted proportional fair scheduling without modifying existing cellular infrastructure, a per-segment channel variation model, and a suite of algorithms to seek the optimal weights for the scheduling. Extensive evaluations show that GESH can maximally guarantee the video playback of multiple users, as well as significantly outperforming conventional HTTP streaming and current DASH systems. [ABSTRACT FROM AUTHOR]

With rapid development of space platforms such as small satellites and UAVs for public services, remote sensing services have been considered as one of the most promising services in space information networks. Small satellites and UAVs equipped with sensors such as cameras capture on-demand images and videos. Various remote sensing services using these images and videos can be enabled for public users, including geographical photography, navigation, live broadcast, surveillance and monitoring, road traffic analysis, and so on. In these remote sensing services, images and videos must be transmitted to individual users in a real-time manner. Therefore, the transmission techniques adopted will have direct impact on the received quality of users. As a newly emerged robust wireless transmission scheme, Soft- Cast is able to accommodate multiple receivers of different channel conditions by directly transmitting power scaled samples. In this article, CS and robust transmission-based SoftCast are investigated for downlink image/video-based remote sensing services under resource-limited, time-varying, and heterogeneous space environments, which are developed in order to improve bandwidth utilization efficiency and to achieve graceful performance, respectively. The proposed ComCast scheme is implemented by integrating CS and robust transmission into one framework to exploit benefits from both techniques. Furthermore, resource allocation in ComCast is also addressed to minimize system distortion caused by both CS and transmission. Simulation results demonstrate that ComCast outperforms the existing CS-based scheme as well as the robust transmission scheme in terms of peak signal-to-noise ratio and visual quality. [ABSTRACT FROM AUTHOR]

Images are always contaminated by noise, increasing uncertainty. Fuzzy set (FS) theory is a useful tool for dealing with uncertainty in images. When comparing with the FS, an intuitionistic fuzzy set (IFS) can better describe the blurred characteristic in images due to the membership, nonmembership, and hesitation degrees. However, when applied to an image segmentation, the IFS cannot completely overcome the influence of noise. With the aim of performing noisy image segmentation under several criteria, this paper defines a noise robust IFS (NR-IFS) for an image and then presents a novel noise robust multiobjective evolutionary intuitionistic fuzzy clustering algorithm (NR-MOEIFC). A majority dominated suppressed similarity measure using the neighborhood statistics and the competitive learning is proposed to obtain the NR-IFS representation for the image corrupted by noise. Then, the NR-IFS is fully used to motivate the whole process of multiobjective evolutionary clustering: first, computing a three-parameter intuitionistic fuzzy distance measure; second, constructing intuitionistic fuzzy fitness functions; third, designing a nonuniform intuitionistic fuzzy mutation operator; and forth, defining an intuitionistic fuzzy cluster validity index to select the optimal solution from the final nondominated solution set. The histogram statistics of NR-IFS are adopted in the NR-MOEIFC to greatly reduce the computational complexity. Experimental results on Berkeley and real magnetic resonance images reveal that the NR-MOEIFC behaves well in noise robustness and segmentation performance while requiring a low time cost. [ABSTRACT FROM AUTHOR]

The prevalence of social networks has made it easier than ever for users to share their photos, videos, and other media content with anybody from anywhere. However, the easy access of user-generated media content also brings about privacy concerns. Traditional access control mechanisms, where a single access policy is made for a specific piece of content, cannot satisfy the user privacy requirements in large-scale media sharing systems. Instead, configuring multiple levels of access privileges for the shared media content is desired. On one hand, it conforms to the principle of social networks in information propagation. On the other hand, it accords with the diverse and complex social relationship among social network users. In this paper, we propose a scalable media access control (SMAC) system to enable such a configuration in a secure and efficient manner. The proposed SMAC system is empowered by the scalable ciphertext policy attribute-based encryption algorithm as well as a comprehensive key-management scheme. We provide formal security proof to prove the security of the proposed SMAC system. In addition, we conduct extensive experiments on mobile devices to demonstrate its efficiency. [ABSTRACT FROM AUTHOR]

Wireless body area network (WBAN) has become a promising network for continuous health monitoring of various diseases. The limited energy of sensors in WBAN cannot support the long-term work with the high requirements of Quality of Service (QoS) for health applications. Energy harvesting (EH)-powered WBAN, which can provide uninterrupted work, has attracted more attention from both academic and industry. However, the time-varying and heterogeneous EH states of different sensors become an important factor when designing the resource allocation schemes in EH-powered WBAN. In this paper, we propose a novel two-phase resource allocation scheme, which optimizes the allocation of the transmission power, the source rate and the time slots to improve the QoS performances of EH-powered WBAN. In the first phase, we investigate that the statistical knowledge of energy harvesting to measure the long-term QoS performances, and then a joint power-rate control scheme is proposed to optimize the transmission power and the source rate for ensuring the long-term QoS performance. Moreover, we design a QoS aware slot allocation scheme to dynamically adjust the time slot allocation to cope with the time-varying and heterogeneous EH states for obtaining better short-term QoS performances in the second phase. Finally, numerical simulation results demonstrate that the proposed joint power-rate-slot resource allocation scheme of EH-powered WBANs can efficiently exploit the time-varying EH to improve both the long-term and short-term QoS performances. [ABSTRACT FROM AUTHOR]