Arrow Research search

Author name cluster

Xiaofan Yang

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

5 papers
1 author row

Possible papers

5

JBHI Journal 2022 Journal Article

Automatic Coronary Artery Segmentation of CCTA Images With an Efficient Feature-Fusion-and-Rectification 3D-UNet

  • Along Song
  • Lisheng Xu
  • Lu Wang
  • Bin Wang
  • Xiaofan Yang
  • Bu Xu
  • Benqiang Yang
  • Stephen E. Greenwald

Automatic coronary artery segmentation is of great value in diagnosing coronary disease. In this paper, we propose an automatic coronary artery segmentation method for coronary computerized tomography angiography (CCTA) images based on a deep convolutional neural network. The proposed method consists of three steps. First, to improve the efficiency and effectiveness of the segmentation, a 2D DenseNet classification network is utilized to screen out the non-coronary-artery slices. Second, we propose a coronary artery segmentation network based on the 3D-UNet, which is capable of extracting, fusing and rectifying features efficiently for accurate coronary artery segmentation. Specifically, in the encoding process of the 3D-UNet network, we adapt the dense block into the 3D-UNet so that it can extract rich and representative features for coronary artery segmentation; In the decoding process, 3D residual blocks with feature rectification capability are applied to improve the segmentation quality further. Third, we introduce a Gaussian weighting method to obtain the final segmentation results. This operation can highlight the more reliable segmentation results at the center of the 3D data blocks while weakening the less reliable segmentations at the block boundary when merging the segmentation results of spatially overlapping data blocks. Experiments demonstrate that our proposed method achieves a Dice Similarity Coefficient (DSC) value of 0. 826 on a CCTA dataset constructed by us. The code of the proposed method is available at https://github.com/alongsong/3D_CAS.

TCS Journal 2014 Journal Article

Conditional diagnosability of optical multi-mesh hypercube networks under the comparison diagnosis model

  • XianYong Li
  • Xiaofan Yang
  • Li He
  • Jing Zhang
  • Cui Yu

Due to integrated positive features of both hypercubes and tori, optical multi-mesh hypercube (OMMH) networks are regarded as a class of promising optical interconnection topologies. The notion of conditional diagnosability helps enhance the self-diagnosing capability of multicomputers. This paper determines the conditional diagnosabilities of OMMH networks under the Maeng–Malek comparison model.

TCS Journal 2014 Journal Article

Optimal wavelength assignment in the implementation of parallel algorithms with ternary n -cube communication pattern on mesh optical network

  • Cui Yu
  • Xiaofan Yang
  • Li He
  • Jing Zhang

Multi-ary n-cubes are a class of communication patterns that are employed by a number of typical parallel algorithms. This paper addresses the implementation of parallel algorithms with bidirectional and unidirectional ternary n-cube communication patterns on a mesh WDM optical network. For each of these two communication patterns, a routing and wavelength assignment scheme is described, and the number of wavelengths required is shown to attain the minimum, which guarantees the optimality of the proposed scheme.

TCS Journal 2011 Journal Article

Hamiltonian properties of twisted hypercube-like networks with more faulty elements

  • Xiaofan Yang
  • Qiang Dong
  • Erjie Yang
  • Jianqiu Cao

Twisted hypercube-like networks (THLNs) are a large class of network topologies, which subsume some well-known hypercube variants. This paper is concerned with the longest cycle in an n -dimensional ( n -D) THLN with up to 2 n − 9 faulty elements. Let G be an n -D THLN, n ≥ 7. Let F be a subset of V ( G ) ⋃ E ( G ), | F | ≤ 2 n − 9. We prove that G − F contains a Hamiltonian cycle if δ ( G − F ) ≥ 2, and G − F contains a near Hamiltonian cycle if δ ( G − F ) ≤ 1. Our work extends some previously known results.

TCS Journal 2010 Journal Article

Solving the minimum bisection problem using a biologically inspired computational model

  • Xingchang Liu
  • Xiaofan Yang
  • Shenglin Li
  • Yong Ding

The traditional trend of DNA computing aims at solving computationally intractable problems. The minimum bisection problem (MBP) is a well-known NP-hard problem, which is intended to partition the vertices of a given graph into two equal halves so as to minimize the number of those edges with exactly one end in each half. Based on a biologically inspired computational model, this paper describes a novel algorithm for the minimum bisection problem, which requires a time cost and a DNA strand length that are linearly proportional to the instance size.

v2026.09.13