Cone-beam computed tomography (CBCT) integrated with a linear accelerator is widely used to increase the accuracy of radiotherapy and plays an important role in image-guided radiotherapy (IGRT). For comparison with fan-beam computed tomography (FBCT), the image quality of CBCT is indistinct due to X-ray scattering, noise, and artefacts. We proposed a deep learning model, “Cycle-Deblur GAN”, combined with CycleGAN and Deblur-GAN models to improve the image quality of chest CBCT images. The 8706 CBCT and FBCT image pairs were used for training, and 1150 image pairs were used for testing in deep learning. The generated CBCT images from the Cycle-Deblur GAN model demonstrated closer CT values to FBCT in the lung, breast, mediastinum, and sternum compared to the CycleGAN and RED-CNN models. The quantitative evaluations of MAE, PSNR, and SSIM for CBCT generated from the Cycle-Deblur GAN model demonstrated better results than the CycleGAN and RED-CNN models. The Cycle-Deblur GAN model improved image quality and CT-value accuracy and preserved structural details for chest CBCT images.
In 5G, multi-access edge computing enables the applications to be offloaded to near-end edge servers for faster response. According to the 3GPP standards, users in 5G are separated into many types, e.g., vehicles, AR/VR, IoT devices, etc. Specifically, the high-priority traffic can preempt edge resources to guarantee the service quality. However, even if a traffic is transmitted with low priority, its latency requirement in 5G is much lower than that in 4G. Too strict latency requirement and priority-based service make resource configuration difficult on the edge side. Therefore, we propose the edge-cloud offloading mechanism, in which each edge server can offload tasks to back-end cloud server to ensure service quality of both high- and low-priority traffic. In this paper, we establish a priority-based queuing system to model the edge-cloud offloading behaviors. Based on the formulation of our system model, we propose Knapsack Potential Game (KPG) to derive an optimal offloading ratio for each edge server to balance the cost-effectiveness of the overall system. We demonstrate that KPG has low computational complexity and outperforms two baseline algorithms. The results indicate that KPG’s performance is optimal and provides a theoretical guideline to operators while designing their edge-cloud offloading strategies without large-scale implementation.
2 June 2016 in IEEE Transactions on Mobile Computing
In Machine-to-Machine (M2M) communications, devices can automatically communicate with each other without any intervention by humans. However, LTE-A is primarily designed and optimized for Human-to-Human (H2H) communications. Even though LTE-A has defined Machine-Type Communications (MTC), several parts are still undefined or follow the existing H2H standards. Specifically, the existing paging mechanism in LTE-A will substantially increase the computational load and signaling overhead of the system when there are many M2M devices. Therefore, we propose an effective solution to mitigate this problem. Compared with the traditional paging mechanism defined in LTE-A, the proposed solution can save more energy for M2M devices, reduce signaling overhead and alleviate the network's load significantly.
19 February 2013 in IEEE Journal on Selected Areas in Communications
Cognitive radio has received great attention recently for its ability to improve spectrum efficiency by letting secondary users to access spectrum resource that is unoccupied by primary users. However, cognitive radio also brings new challenges in the design of future wireless networks. In this paper, we investigate the problem of resource allocation in cognitive radio networks. Specifically, we consider the problem of proportional fair scheduling in cognitive radio relay networks. Our problem formulation takes into account the fluctuations of usable spectrum resource, channel quality variations caused by frequency selectivity, and interference caused by different transmit power levels. We prove that the problem is NP-hard and is computationally infeasible to be solved in a timely manner by using brute force algorithms. An easy-to-compute upper bound for the formulated problem is also derived. We then propose two heuristic algorithms that are easy-to-implement, yet achieve performance close to the upper bound. The proposed algorithms can be executed and finished within 1 millisecond. Thus, they can meet the requirement of real-time scheduling. Simulation experiments verify that the proposed algorithms can achieve good proportional fairness among users and enhance system throughput by proper power control.