Yanfei Zuo
Research Subjects
Research Interests
Yanfei Zuo has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Anping Yang
School of Computer Science and Technology, Donghua University, Shanghai, China
1 shared publication - Dan Li
Department of Computer Science, Wenzhou-Kean University, Wenzhou, China
1 shared publication - Jingxin Liu
School of AI and Advanced Computing, Xi’an Jiaotong-Liverpool University, Suzhou, China
1 shared publication - Junfeng Zhou
School of Computer Science and Technology, Donghua University, 2999 Renmin North Road, Songjiang District, Shanghai 201620, China
1 shared publication - Linlin Shen
Shenzhen University, Shenzhen, China
1 shared publication - Ming Du
School of Computer Science and Technology, Donghua University, 2999 Renmin North Road, Songjiang District, Shanghai 201620, China
1 shared publication
Latest Publications
- 24 December 2024
- Published by Springer Nature in Neural Computing and Applications
- Vol. 37 (6) , 4651-4661
MLPFormer: MLP-integrated transformer for colorectal histopathology whole slide image segmentation
- 24 December 2024
- Published by Springer Nature in Neural Computing and Applications
- Vol. 37 (6) , 4651-4661
MLPFormer: MLP-integrated transformer for colorectal histopathology whole slide image segmentation
- 15 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 25 (5) , 1673-1685
Weakly Supervised Histopathology Image Segmentation With Sparse Point Annotations
Digital histopathology image segmentation can facilitate computer-assisted cancer diagnostics. Given the difficulty of obtaining manual annotations, weak supervision is more suitable for the task than full supervision is. However, most weakly supervised models are not ideal for handling severe intra-class heterogeneity and inter-class homogeneity in histopathology images. Therefore, we propose a novel end-to-end weakly supervised learning framework named WESUP. With only sparse point annotations, it performs accurate segmentation and exhibits good generalizability. The training phase comprises two major parts, hierarchical feature representation and deep dynamic label propagation. The former uses superpixels to capture local details and global context from the convolutional feature maps obtained via transfer learning. The latter recognizes the manifold structure of the hierarchical features and identifies potential targets with the sparse annotations. Moreover, these two parts are trained jointly to improve the performance of the whole framework. To further boost test performance, pixel-wise inference is adopted for finer prediction. As demonstrated by experimental results, WESUP is able to largely resolve the confusion between histological foreground and background. It outperforms several state-of-the-art weakly supervised methods on a variety of histopathology datasets with minimal annotation efforts. Trained by very sparse point annotations, WESUP can even beat an advanced fully supervised segmentation network.
- 15 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 25 (5) , 1673-1685
Weakly Supervised Histopathology Image Segmentation With Sparse Point Annotations
Digital histopathology image segmentation can facilitate computer-assisted cancer diagnostics. Given the difficulty of obtaining manual annotations, weak supervision is more suitable for the task than full supervision is. However, most weakly supervised models are not ideal for handling severe intra-class heterogeneity and inter-class homogeneity in histopathology images. Therefore, we propose a novel end-to-end weakly supervised learning framework named WESUP. With only sparse point annotations, it performs accurate segmentation and exhibits good generalizability. The training phase comprises two major parts, hierarchical feature representation and deep dynamic label propagation. The former uses superpixels to capture local details and global context from the convolutional feature maps obtained via transfer learning. The latter recognizes the manifold structure of the hierarchical features and identifies potential targets with the sparse annotations. Moreover, these two parts are trained jointly to improve the performance of the whole framework. To further boost test performance, pixel-wise inference is adopted for finer prediction. As demonstrated by experimental results, WESUP is able to largely resolve the confusion between histological foreground and background. It outperforms several state-of-the-art weakly supervised methods on a variety of histopathology datasets with minimal annotation efforts. Trained by very sparse point annotations, WESUP can even beat an advanced fully supervised segmentation network.
- Open Access
- 28 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 172110-172122
$HT$ : A Novel Labeling Scheme for k-Hop Reachability Queries on DAGs
Given a directed acyclic graph ( DAG), a k-hop reachability query u?kv is used to answer whether there exists a path from u to v with length ≤k. Answering k-hop reachability queries is a fundamental graph operation and has been extensively studied during the past years. Considering that existing approaches still suffer from inefficiency in practice when processing large graphs, we propose a novel labeling scheme, namely HT, to accelerate k-hop reachability queries answering. HT uses a constrained 2hop distance label to maintain the length of shortest paths between a set of hop nodes and other nodes, and for the remaining reachability information, HT uses a novel topological level to accelerate graph traversal. Further, we propose to enhance HT by two optimization techniques. The experimental results show that compared with the state-of-the-art approaches, HT works best for most graphs when answering k-hop reachability queries with small index size and reasonable index construction time.
- 28 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 172110-172122
Open Access$HT$ : A Novel Labeling Scheme for k-Hop Reachability Queries on DAGs
Given a directed acyclic graph ( DAG), a k-hop reachability query u?kv is used to answer whether there exists a path from u to v with length ≤k. Answering k-hop reachability queries is a fundamental graph operation and has been extensively studied during the past years. Considering that existing approaches still suffer from inefficiency in practice when processing large graphs, we propose a novel labeling scheme, namely HT, to accelerate k-hop reachability queries answering. HT uses a constrained 2hop distance label to maintain the length of shortest paths between a set of hop nodes and other nodes, and for the remaining reachability information, HT uses a novel topological level to accelerate graph traversal. Further, we propose to enhance HT by two optimization techniques. The experimental results show that compared with the state-of-the-art approaches, HT works best for most graphs when answering k-hop reachability queries with small index size and reasonable index construction time.