Bo Wang

Bo Wang

Auto-generated profile, based on publicly available information

Bo Wang

The University of Hong Kong

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 August 2023 in Algorithmica
Verified
Journal Article
Closed access
PDF file
TCT-H. Hubert Chan
T-H. Hubert Chan
SLSilvio Lattanzi
Silvio Lattanzi
MSMauro Sozio
Mauro Sozio
BWBo Wang
Bo Wang

1 January 2022
Verified
Book Chapter
Closed access
PDF file
TCT-H. Hubert Chan
T-H. Hubert Chan
SLSilvio Lattanzi
Silvio Lattanzi
MSMauro Sozio
Mauro Sozio
BWBo Wang
Bo Wang

5 December 2023
Verified
Conference Paper
Open access
QWQijie Wei
Qijie Wei
JYJingyuan Yang
Jingyuan Yang
BWBo Wang
Bo Wang
JWJinrui Wang
Jinrui Wang
JZJianchun Zhao
Jianchun Zhao
XLXirong Li
Xirong Li
This paper addresses the emerging task of recognizing multiple retinal diseases from wide-field (WF) and ultra-wide-field (UWF) fundus images. For an effective use of existing large amount of labeled color fundus photo (CFP) data and the relatively small amount of WF and UWF data, we propose a supervised domain adaptation method named Cross-domain Collaborative Learning (CdCL). Inspired by the success of fixed-ratio based mixup in unsupervised domain adaptation, we re-purpose this strategy for the current task. Due to the intrinsic disparity between the field-of-view of CFP and WF/UWF images, a scale bias naturally exists in a mixup sample that the anatomic structure from a CFP image will be considerably larger than its WF/UWF counterpart. The CdCL method resolves the issue by Scale-bias Correction, which employs Transformers for producing scale-invariant features. As demonstrated by extensive experiments on multiple datasets covering both WF and UWF images, the proposed method compares favorably against a number of competitive baselines.

29 February 2024
Verified
Book Chapter
Closed access
PDF file
TCT-H. Hubert Chan
T-H. Hubert Chan
GGGramoz Goranci
Gramoz Goranci
SJShaofeng H.-C. Jiang
Shaofeng H.-C. Jiang
BWBo Wang
Bo Wang
QXQuan Xue
Quan Xue

26 August 2023
Verified
Book Chapter
Closed access
PDF file
TCT-H. Hubert Chan
T-H. Hubert Chan
ESEnze Sun
Enze Sun
BWBo Wang
Bo Wang

30 November 2023 in arXiv
Verified
Preprint
Open access
PDF file
TCT-H. Hubert Chan
T-H. Hubert Chan
GGGramoz Goranci
Gramoz Goranci
SJShaofeng H. -C. Jiang
Shaofeng H. -C. Jiang
BWBo Wang
Bo Wang
QXQuan Xue
Quan Xue
The Euclidean Steiner tree problem asks to find a min-cost metric graph that connects a given set of \emph{terminal} points $X$ in $\mathbb{R}^d$, possibly using points not in $X$ which are called Steiner points. Even though near-linear time $(1 + ε)$-approximation was obtained in the offline setting in seminal works of Arora and Mitchell, efficient dynamic algorithms for Steiner tree is still open. We give the first algorithm that (implicitly) maintains a $(1 + ε)$-approximate solution which is accessed via a set of tree traversal queries, subject to point insertion and deletions, with amortized update and query time $O(\poly\log n)$ with high probability. Our approach is based on an Arora-style geometric dynamic programming, and our main technical contribution is to maintain the DP subproblems in the dynamic setting efficiently. We also need to augment the DP subproblems to support the tree traversal queries.