BXBolei Xu

Bolei Xu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Bolei Xu has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers
    Open Access

    AuthPrivacyChain: A Blockchain-Based Access Control Framework With Privacy Protection in Cloud

    by Caixia Yang, Liang Tan, Na Shi, Bolei Xu, Yang Cao, Keping Yu

    Cloud is a computing model that provides sharing and supports ubiquitous on-demand access computing, providing new data processing and services for many industries, significantly reducing user computing and storage costs, and improving ease of use. With the development of cloud-scale and intensification, cloud security has become an essential issue in the field of cloud computing. Access control is one of the critical security technologies for protecting sensitive data stored in the cloud by enterprises and individuals. Since the centralized access control mechanism is adopted in the cloud, the sensitive data in the cloud are easy to be tampered with or leaked by hackers or cloud internal managers. To address this issue, we propose a blockchain-based access control framework with privacy protection called AuthPrivacyChain. Firstly, we use the account address of the node in blockchain as the identity, and at the same time, redefine the access control permission of data for the cloud, which is encrypted and stored in blockchain. After that, we design processes of access control, authorization, and authorization revocation in AuthPrivacyChain. Finally, we implement AuthPrivacyChain based on enterprise operation system (EOS), and the results show that AuthPrivacyChain can not only prevent hackers and administrators from illegally accessing resources, but also protect authorized privacy.


  • Attention by Selection: A Deep Selective Attention Approach to Breast Cancer Classification

    by Bolei Xu, Jingxin Liu, Xianxu Hou, Bozhi Liu, Jon Garibaldi, Ian O. Ellis, Andy Green, Linlin Shen, Guoping Qiu

    Deep learning approaches are widely applied to histopathological image analysis due to the impressive levels of performance achieved. However, when dealing with high-resolution histopathological images, utilizing the original image as input to the deep learning model is computationally expensive, while resizing the original image to achieve low resolution incurs information loss. Some hard-attention based approaches have emerged to select possible lesion regions from images to avoid processing the original image. However, these hard-attention based approaches usually take a long time to converge with weak guidance, and valueless patches may be trained by the classifier. To overcome this problem, we propose a deep selective attention approach that aims to select valuable regions in the original images for classification. In our approach, a decision network is developed to decide where to crop and whether the cropped patch is necessary for classification. These selected patches are then trained by the classification network, which then provides feedback to the decision network to update its selection policy. With such a co-evolution training strategy, we show that our approach can achieve a fast convergence rate and high classification accuracy. Our approach is evaluated on a public breast cancer histopathological image database, where it demonstrates superior performance compared to state-of-the-art deep learning approaches, achieving approximately 98% classification accuracy while only taking 50% of the training time of the previous hard-attention approach.


  • Open Access

    Cross Domain Person Re-Identification With Large Scale Attribute Annotated Datasets

    by Bolei Xu, Jingxin Liu, Xianxu Hou, Ke Sun, Guoping Qiu

    We propose a novel deep convolutional neural network framework called Deep Augmented Attribute Network (DAAN) to learn augmented attribute features for cross domain person re-identification (person Re-ID) task. We observed that in some cases different persons could have similar attributes (e.g., wearing similar clothes). It motivates us to distinguish such pedestrians by further learning complementary image features. We thus construct a deep neural network with three branches: (1)The attribute branch predicts the attributes of the input image, (2) the augmentation branch generates complementary features that are fused with the output of the attribute branch to form the augmented attribute features, and (3) the reconstruction branch to refine augmented attribute features on the target dataset. In order to learn precise and detailed attributes for pedestrian, we manually labeled two large datasets (CUHK03 and Market-1501) with 25 pre-defined mid-level semantic attributes. We evaluate DAAN on a series of cross domain person Re-ID tasks, where DAAN demonstrates superior performance (around 6%) to the prior state-of-the-art cross domain algorithms.


  • An End-to-End Deep Learning Histochemical Scoring System for Breast Cancer TMA

    by Jingxin Liu, Bolei Xu, Chi Zheng, Yuanhao Gong, Jon Garibaldi, Daniele Soria, Andew Green, Ian O. Ellis, Wenbin Zou, Guoping Qiu

    One of the methods for stratifying different molecular classes of breast cancer is the Nottingham Prognostic Index Plus (NPI+) which uses breast cancer relevant biomarkers to stain tumour tissues prepared on tissue microarray (TMA). To determine the molecular class of the tumour, pathologists will have to manually mark the nuclei activity biomarkers through a microscope and use a semi-quantitative assessment method to assign a histochemical score (H-Score) to each TMA core. Manually marking positively stained nuclei is a time consuming, imprecise and subjective process which will lead to inter-observer and intra-observer discrepancies. In this paper, we present an end-to-end deep learning system which directly predicts the H-Score automatically. Our system imitates the pathologists’ decision process and uses one fully convolutional network (FCN) to extract all nuclei region (tumour and non-tumour), a second FCN to extract tumour nuclei region, and a multi-column convolutional neural network which takes the outputs of the first two FCNs and the stain intensity description image as input and acts as the high-level decision making mechanism to directly output the H-Score of the input TMA image. To the best of our knowledge, this is the first end-to-end system that takes a TMA image as input and directly outputs a clinical score. We will present experimental results which demonstrate that the H-Scores predicted by our model have very high and statistically significant correlation with experienced pathologists’ scores and that the H-Score discrepancy between our algorithm and the pathologists is on par with the inter-subject discrepancy between the pathologists.


  • Crowd density estimation based on rich features and random projection forest

    by Bolei Xu, Guoping Qiu

    Current state of the art crowd density estimation methods are based on computationally expensive Gaussian process regression or Ridge regression models which can only handle a small number of features. In many computer vision applications, it has been empirically shown that a richer set of image features can lead to enhanced performances. In this paper, we reason that using more image features could potentially boost the performances of crowd detection and thus propose to employ much extensive and richer feature sets for crowd density estimation. To achieve computational efficiency and scalability, we use random forest as the regression model whose tree structure is intrinsically fast and scalable. Unlike traditional approaches to random forest construction, we embed random projection in the tree nodes to simultaneously combat the curse of dimensionality and to introduce randomness in the tree construction (we call this Random Projection Forest) thus making our new method very efficient and effective. Experimental results on two public pedestrian detection video databases show that our new method achieves state of the art performances that are superior to those of previously published regression techniques.