no code implementations • 30 May 2023 • Yanwen Li, Luyang Luo, Huangjing Lin, Pheng-Ann Heng, Hao Chen
To guide the segmentation branch to learn from richer high-resolution features, we propose a feature affinity module and a scale affinity module to enhance the multi-task learning of the dual branches.
no code implementations • 27 Nov 2022 • Yanwen Li, Siyang Gao, Zhongshun Shi
In this paper, we theoretically analyze these myopic procedures and prove that they also satisfy the optimality conditions of R&S, just like some other popular R&S methods.
no code implementations • 27 Nov 2022 • Yanwen Li, Siyang Gao
It builds the optimality conditions for the number of samples allocated to each design, and the sample allocation that satisfies the optimality conditions is shown to asymptotically maximize the probability of correct selection for the best design.
no code implementations • 14 Jun 2022 • Yanwen Li, Siyang Gao
Due to the complex calculation of KG, theoretical analysis of this algorithm is difficult, and existing results are mostly about the asymptotic performance of it, e. g., consistency, asymptotic sample allocation, etc.
1 code implementation • 7 Apr 2021 • Yanwen Li, Luyang Luo, Huangjing Lin, Hao Chen, Pheng-Ann Heng
The novel coronavirus disease 2019 (COVID-19) characterized by atypical pneumonia has caused millions of deaths worldwide.