Searcharxiv⌕ Search

arXiv subjects

Xiaobo Zhou

Publications and source records attributed to Xiaobo Zhou.

45 records · Page 3Linked to original sources

Transparency guided ensemble convolutional neural networks for stratification of pseudoprogression and true progression of glioblastoma multiform

Pseudoprogression (PsP) is an imitation of true tumor progression (TTP) in patients with glioblastoma multiform (GBM). Differentiating them is a challenging and time-consuming task for radiologists. Although deep neural networks can automatically diagnose PsP and TTP, interpretability shortage is always the heel of Achilles. To overcome these shortcomings and win the trust of physician, we propose a transparency guided ensemble convolutional neural network to automatically stratify PsP and TTP on magnetic resonance imaging (MRI). A total of 84 patients with GBM are enrolled in the study. First, three typical convolutional neutral networks (CNNs) -- VGG, ResNet and DenseNet -- are trained to distinguish PsP and TTP on the dataset. Subsequently, we use the class-specific gradient information from convolutional layers to highlight the important regions in MRI. Radiological experts are then recruited to select the most lesion-relevant layer of each CNN. Finally, the selected layers are utilized to guide the construction of multi-scale ensemble CNN. The classified accuracy of the presented network is 90.20%, the promotion of specificity reaches more than 20%. The results demonstrate that network transparency and ensemble can enhance the reliability and accuracy of CNNs. The presented network is promising for the diagnosis of PsP and TTP.

q-bio.TO↗

Efforts estimation of doctors annotating medical image

Accurate annotation of medical image is the crucial step for image AI clinical application. However, annotating medical image will incur a great deal of annotation effort and expense due to its high complexity and needing experienced doctors. To alleviate annotation cost, some active learning methods are proposed. But such methods just cut the number of annotation candidates and do not study how many efforts the doctor will exactly take, which is not enough since even annotating a small amount of medical data will take a lot of time for the doctor. In this paper, we propose a new criterion to evaluate efforts of doctors annotating medical image. First, by coming active learning and U-shape network, we employ a suggestive annotation strategy to choose the most effective annotation candidates. Then we exploit a fine annotation platform to alleviate annotating efforts on each candidate and first utilize a new criterion to quantitatively calculate the efforts taken by doctors. In our work, we take MR brain tissue segmentation as an example to evaluate the proposed method. Extensive experiments on the well-known IBSR18 dataset and MRBrainS18 Challenge dataset show that, using proposed strategy, state-of-the-art segmentation performance can be achieved by using only 60% annotation candidates and annotation efforts can be alleviated by at least 44%, 44%, 47% on CSF, GM, WM separately.

cs.LG↗

An Efficient Hybrid Beamforming Design for Massive MIMO Receive Systems via SINR Maximization Based on an Improved Bat Algorithm

Hybrid analog and digital (HAD) beamforming has been recently receiving considerable deserved attention for a practical implementation on the large-scale antenna systems. As compared to full digital beamforming, partial-connected HAD beamforming can significantly reduce the hardware cost, complexity, and power consumption. In this paper, in order to mitigate the jamming along with lowering the hardware complexity and cost by reducing the number of RF chains needed, a novel hybrid analog and digital receive beamformer based on an improved bat algorithm (I-BA) and the phase-only is proposed. Our proposed beamformer is compared with robust adaptive beamformers (RABs) methods proposed by us, which are considered in the digital beamforming part. The evolutionary optimization algorithm is proposed since most of the RAB methods are sensitive to the DOA mismatch, and depending on the complex weights, resulting in an expensive receiver. In the analog part, analog phase alignment by linear searching (APALS) with a sufficiently fine grid of points is employed to optimize the analog beamformer matrix. The performance of the proposed I-BA is revealed using MATLAB simulation and compared with BA, and Particle swarm optimization (PSO) algorithms, which shows a better performance in terms of convergence speed, stability, and the ability to jump from the local minima.

cs.IT↗

Robust Directional Modulation Design for Secrecy Rate Maximization in Multi-User Networks

In this paper, based on directional modulation (DM), robust beamforming matrix design for sum secrecy rate maximization is investigated in multi-user systems. The base station (BS) is assumed to have the imperfect knowledge of the direction angle toward each eavesdropper, with the estimation error following the Von Mises distribution. To this end, a Von Mises distribution-Sum Secrecy Rate Maximization (VMD-SSRM) method is proposed to maximize the sum secrecy rate by employing semi-definite relaxation and first-order approximation based on Taylor expansion to solve the optimization problem. Then in order to optimize the sum secrecy rate in the case of the worst estimation error of direction angle toward each eavesdropper, we propose a maximum angle estimation error-SSRM (MAEE-SSRM) method. The optimization problem is constructed based on the upper and lower bounds of the estimated eavesdropping channel related coefficient and then solved by the change of the variable method. Simulation results show that our two proposed methods have better sum secrecy rate than zero-forcing (ZF) method and signal-to-leakage-and-noise ratio (SLNR) method. Furthermore, the sum secrecy rate performance of our VMD-SSRM method is better than that of our MAEE-SSRM method.

cs.IT↗

Alternating Iterative Secure Structure between Beamforming and Power Allocation for UAV-aided Directional Modulation Networks

In unmanned aerial vehicle (UAV) networks, directional modulation (DM) is adopted to improve the secrecy rate (SR) performance. Alice, a ground base station, behaves as a control center, and Bob is a UAV of flying along a linear flight trajectory who optimizes its SR performance by dynamically adjusting its beamforming vectors and power allocation (PA) strategy. Per fixed time interval during the Bob's flight process, the transmit beamforming vectors for useful messages and AN projection are given by the rule of maximizing signal-to-leakage-and-noise ratio (Max-SLNR) and maximizing AN-and-leakage-to-noise ratio (ANLNR), and the optimal PA strategy is based on maximizing SR (Max-SR). More importantly, an alternating iterative structure (AIS) between beamforming and PA is proposed to further improve the SR performance. Simulation results show that the proposed AIS converges rapidly, and can achieve substantial SR gains over Max-SLNR plus Max-ANLNR with fixed PA such as PA factor $β=$ 0.5, and 0.9. In particular, in the case of small-scale antenna array, the SR performance gain achieved by the proposed AIS is more attractive. Additionally, as the number of antennas tends to be large-scale, the average SR performance of the proposed AIS approaches an SR ceil.

cs.IT↗

Energy-Efficient Wireless Powered Secure Transmission with Cooperative Jamming for Public Transportation

In this paper, wireless power transfer and cooperative jamming (CJ) are combined to enhance physical security in public transportation networks. First, a new secure system model with both fixed and mobile jammers is proposed to guarantee secrecy in the worst-case scenario. All jammers are endowed with energy harvesting (EH) capability. Following this, two CJ based schemes, namely B-CJ-SRM and B-CJ-TPM, are proposed, where SRM and TPM are short for secrecy rate maximization and transmit power minimization, respectively. They respectively maximize the secrecy rate (SR) with transmit power constraint and minimize the transmit power of the BS with SR constraint, by optimizing beamforming vector and artificial noise covariance matrix. To further reduce the complexity of our proposed optimal schemes, their low-complexity (LC) versions, called LC-B-CJ-SRM and LC-B-CJ-TPM are developed. Simulation results show that our proposed schemes, B-CJ-SRM and B-CJ-TPM, achieve significant SR performance improvement over existing zero-forcing and QoSD methods. Additionally, the SR performance of the proposed LC schemes are close to those of their original versions.

cs.CR↗

Secure SWIPT for Directional Modulation Aided AF Relaying Networks

Secure wireless information and power transfer based on directional modulation is conceived for amplify-and-forward (AF) relaying networks. Explicitly, we first formulate a secrecy rate maximization (SRM) problem, which can be decomposed into a twin-level optimization problem and solved by a one-dimensional (1D) search and semidefinite relaxation (SDR) technique. Then in order to reduce the search complexity, we formulate an optimization problem based on maximizing the signal-to-leakage-AN-noise-ratio (Max-SLANR) criterion, and transform it into a SDR problem. Additionally, the relaxation is proved to be tight according to the classic Karush-Kuhn-Tucker (KKT) conditions. Finally, to reduce the computational complexity, a successive convex approximation (SCA) scheme is proposed to find a near-optimal solution. The complexity of the SCA scheme is much lower than that of the SRM and the Max-SLANR schemes. Simulation results demonstrate that the performance of the SCA scheme is very close to that of the SRM scheme in terms of its secrecy rate and bit error rate (BER), but much better than that of the zero forcing (ZF) scheme.

cs.IT↗

GPI-based Secrecy Rate Maximization Beamforming Scheme for Wireless Transmission with AN-aided Directional Modulation

In a directional modulation network, a general power iterative (GPI) based beamforming scheme is proposed to maximize the secrecy rate (SR), where there are two optimization variables required to be optimized. The first one is the useful precoding vector of transmitting confidential messages to the desired user while the second one is the artificial noise (AN) projection matrix of forcing more AN to eavesdroppers. In such a secure network, the paramount problem is how to design or optimize the two optimization variables by different criteria. To maximize the SR (Max-SR), an alternatively iterative structure (AIS) is established between the AN projection matrix and the precoding vector for confidential messages. To choose a good initial value of iteration process of GPI, the proposed Max-SR method can readily double its convergence speed compared to the random choice of initial value. With only four iterations, it may rapidly converge to its rate ceil. From simulation results, it follows that the SR performance of the proposed AIS of GPI-based Max-SR is much better than those of conventional leakage-based and null-space projection methods in the medium and large signal-to-noise ratio (SNR) regions, and its achievable SR performance gain gradually increases as SNR increases.

cs.IT↗

Rule Optimization for Real-Time Query Service in Software-Defined Internet of Vehicles

Internet of Vehicles (IoV) has recently gained considerable attentions from both industry and research communities since the development of communication technology and smart city. However, a proprietary and closed way of operating hardwares in network equipments slows down the progress of new services deployment and extension in IoV. Moreover, the tightly coupled control and data planes in traditional networks significantly increase the complexity and cost of network management. By proposing a novel architecture, called Software-Defined Internet of Vehicles (SDIV), we adopt the software-defined network (SDN) architecture to address these problems by leveraging its separation of the control plane from the data plane and a uniform way to configure heterogeneous switches. However, the characteristics of IoV introduce the very challenges in rule installation due to the limited size of Flow Tables at OpenFlow-enabled switches which are the main component of SDN. It is necessary to build compact Flow Tables for the scalability of IoV. Accordingly, we develop a rule optimization approach for real-time query service in SDIV. Specifically, we separate wired data plane from wireless data plane and use multicast address in wireless data plane. Furthermore, we introduce a destination-driven model in wired data plane for reducing the number of rules at switches. Experiments show that our rule optimization strategy reduces the number of rules while keeping the performance of data transmission.

cs.NI↗