VLDB 2026 Research / reviewers in the wild / expert
Junhe Zhao
dblp:247/5903
· DBLP profile ↗
8ranked-venue papers
3as first author
7since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 8 · 3 first-author · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 6 · 1 first-author · 5 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | DepthPolyp: Pseudo-depth Guided Lightweight Segmentation for Real-Time Colonoscopy
Zhuoyu Wu, Wenhui Ou, Lexi Zhang, Pei-Sze Tan, Dongjun Wu, Junhe Zhao, Wenqi Fang, Raphael C.-W. Phan |
ICPR (7) | 6 |
| 2024 | Machine-Created Universal Language for Cross-Lingual TransferabstractThere are two primary approaches to addressing cross-lingual transfer: multilingual pre-training, which implicitly aligns the hidden representations of various languages, and translate-test, which explicitly translates different languages into an intermediate language, such as English. Translate-test offers better interpretability compared to multilingual pre-training. However, it has lower performance than multilingual pre-training and struggles with word-level tasks due to translation altering word order. As a result, we propose a new Machine-created Universal Language (MUL) as an alternative intermediate language. MUL comprises a set of discrete symbols forming a universal vocabulary and a natural language to MUL translator for converting multiple natural languages to MUL. MUL unifies shared concepts from various languages into a single universal word, enhancing cross-language transfer. Additionally, MUL retains language-specific words and word order, allowing the model to be easily applied to word-level tasks. Our experiments demonstrate that translating into MUL yields improved performance compared to multilingual pre-training, and our analysis indicates that MUL possesses strong interpretability. The code is at: https://github.com/microsoft/Unicoder/tree/master/MCUL. Yaobo Liang, Quanzhi Zhu, Junhe Zhao |
AAAI | 3 |
| 2022 | Towards Compact 1-bit CNNs via Bayesian Learning
Junhe Zhao, Sheng Xu 0007, Baochang Zhang 0001, Jiaxin Gu, David S. Doermann, Guodong Guo |
Int. J. Comput. Vis. | 1 |
| 2022 | Data-adaptive binary neural networks for efficient object detection and recognition
Junhe Zhao, Sheng Xu 0007, Runqi Wang, Baochang Zhang 0001, Guodong Guo, David S. Doermann, Dianmin Sun |
Pattern Recognit. Lett. | 1 |
| 2021 | POEM: 1-bit Point-wise Operations based on Expectation-Maximization for Efficient Point Cloud Processing
Sheng Xu 0007, Junhe Zhao, Yanjing Li, Baochang Zhang 0001, Guodong Guo |
BMVC | 2 |
| 2021 | Layer-Wise Searching for 1-Bit Detectorsabstract1-bit detectors show great promise for resource-constrained embedded devices but often suffer from a significant performance gap compared with their real-valued counterparts. The primary reason lies in the error during binarization. This paper presents a layer-wise searching (LWS) strategy to generate 1-bit detectors that maintain a performance very close to the original real-valued model. The approach introduces angular and amplitude loss functions to increase detector capacity. At 1-bit layers, it exploits a differentiable binarization search (DBS) to minimize the angular error in a student-teacher framework. We also learn the scale factor by minimizing the amplitude loss in the same student-teacher framework. Extensive experiments show that LWS-Det outperforms state-of-the-art 1-bit detectors by a considerable margin on the PASCAL VOC and COCO datasets. For example, the LWS-Det achieves 1-bit Faster-RCNN with ResNet-34 backbone within 2.0% mAP of its real-valued counterpart on the PASCAL VOC dataset. Sheng Xu 0007, Junhe Zhao, Jinhu Lü 0001, Baochang Zhang 0001, Shumin Han, David S. Doermann |
CVPR | 2 |
| 2021 | Uncertainty-aware Binary Neural NetworksabstractBinary Neural Networks (BNN) are promising machine learning solutions for deployment on resource-limited devices. Recent approaches to training BNNs have produced impressive results, but minimizing the drop in accuracy from full precision networks is still challenging. One reason is that conventional BNNs ignore the uncertainty caused by weights that are near zero, resulting in the instability or frequent flip while learning. In this work, we investigate the intrinsic uncertainty of vanishing near-zero weights, making the training vulnerable to instability. We introduce an uncertainty-aware BNN (UaBNN) by leveraging a new mapping function called certainty-sign (c-sign) to reduce these weights' uncertainties. Our c-sign function is the first to train BNNs with a decreasing uncertainty for binarization. The approach leads to a controlled learning process for BNNs. We also introduce a simple but effective method to measure the uncertainty-based on a Gaussian function. Extensive experiments demonstrate that our method improves multiple BNN methods by maintaining stability of training, and achieves a higher performance over prior arts. Junhe Zhao, Linlin Yang 0001, Baochang Zhang 0001, Guodong Guo, David S. Doermann |
IJCAI | 1 |
| 2019 | Bayesian Optimized 1-Bit CNNsabstractDeep convolutional neural networks (DCNNs) have dominated the recent developments in computer vision through making various record-breaking models. However, it is still a great challenge to achieve powerful DCNNs in resource-limited environments, such as on embedded devices and smart phones. Researchers have realized that 1-bit CNNs can be one feasible solution to resolve the issue; however, they are baffled by the inferior performance compared to the full-precision DCNNs. In this paper, we propose a novel approach, called Bayesian optimized 1-bit CNNs (denoted as BONNs), taking the advantage of Bayesian learning, a well-established strategy for hard problems, to significantly improve the performance of extreme 1-bit CNNs. We incorporate the prior distributions of full-precision kernels and features into the Bayesian framework to construct 1-bit CNNs in an end-to-end manner, which have not been considered in any previous related methods. The Bayesian losses are achieved with a theoretical support to optimize the network simultaneously in both continuous and discrete spaces, aggregating different losses jointly to improve the model capacity. Extensive experiments on the ImageNet and CIFAR datasets show that BONNs achieve the best classification performance compared to state-of-the-art 1-bit CNNs. Jiaxin Gu, Junhe Zhao, Baochang Zhang 0001, Jianzhuang Liu, Guodong Guo, Rongrong Ji |
ICCV | 2 |