Jinghui Zhou

dblp:210/4974 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
6since 2021 · last 2026
0000-0003-2917-1957ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Comprehensive Delay-Aware Net Weighting Framework for Timing-Driven Global Placement
Lixin Chen, Keyu Peng, Jinghui Zhou, Shuting Cai, Ziran Zhu
ASP-DAC3
2026 A Timing-Driven Hierarchical Macro Placement Framework for Large-Scale Complex IP Blocks
Lixin Chen, Jinghui Zhou, Ziran Zhu
ASP-DAC3
2026 GPU-Accelerated Global Routing with Balanced Timing and Congestion Optimization
abstract
As integrated circuit (IC) designs continue to scale in complexity, global routing faces increasing challenges in managing timing and congestion simultaneously. This paper proposes a GPU-accelerated global routing framework that effectively balances timing optimization and congestion mitigation. The proposed framework begins with a preprocessing stage that partitions ultralarge nets, followed by timing path construction, and decomposes nets based on estimated pin slack to enhance scalability and timing sensitivity. For critical nets, we propose a timing and congestion driven GPU-accelerated hybrid 3D pattern routing method. Specifically, an Elmore-based timing weight calculation method is proposed to efficiently capture the timing criticality of routing paths, and the resulting weights are ordered for more targeted and effective timing optimization. Then, a well-designed cost scheme is proposed to better balance timing and congestion. Finally, we develop a GPU-accelerated hybrid 3D pattern routing strategy that combines L -shape and sparse Z -shape patterns to improve routing efficiency. After routing critical nets, the remaining non-critical nets are routed using a congestion-driven GPU-accelerated routing engine that supports flexible detours to alleviate congestion and utilize residual routing resources. Compared with the champion of the ISPD 2025 contest, experimental results on the ISPD 2025 contest benchmarks show that our algorithm achieves 19.4% better weighted scores and 1 6. 2 % faster runtime.
Jinghui Zhou, Fuxing Huang, Lixin Chen, Xinglin Zheng, Ziran Zhu
ASP-DAC1
2023 Multi-dictionary induced low-rank representation with multi-manifold regularization
Jinghui Zhou, Xiangjun Shen, Sixing Liu, Liangjun Wang, Qian Zhu 0003, Ping Qian
Appl. Intell.1
2021 Single-Shot Face Anti-Spoofing for Dual Pixel Camera
abstract
In this study, we propose a neural network-based face anti-spoofing algorithm using dual pixel (DP) sensor images. The proposed algorithm has two stages: depth reconstruction and depth classification. The first network takes a DP image pair as input and generates a depth map with a baseline of approximately 1 mm. Then, the classification network is trained to distinguish real individuals and planar attack shapes to produce a binary output. A DP image is utilized to estimate the depth map; thus, the proposed face anti-spoofing method is simple and robust. Experimental results demonstrate that the generated depth map helps distinguish real human faces from nonface attack, including images recaptured from photos or screens. The proposed algorithm achieves better anti-spoofing performance compared with other stereo and phase-based depth estimation schemes.
Xiaojun Wu 0004, Jinghui Zhou, Jun Liu 0116, Fangyi Ni, Haoqiang Fan
IEEE Trans. Inf. Forensics Secur.2
2021 Cross-Domain Object Representation via Robust Low-Rank Correlation Analysis
abstract
Cross-domain data has become very popular recently since various viewpoints and different sensors tend to facilitate better data representation. In this article, we propose a novel cross-domain object representation algorithm (RLRCA) which not only explores the complexity of multiple relationships of variables by canonical correlation analysis (CCA) but also uses a low rank model to decrease the effect of noisy data. To the best of our knowledge, this is the first try to smoothly integrate CCA and a low-rank model to uncover correlated components across different domains and to suppress the effect of noisy or corrupted data. In order to improve the flexibility of the algorithm to address various cross-domain object representation problems, two instantiation methods of RLRCA are proposed from feature and sample space, respectively. In this way, a better cross-domain object representation can be achieved through effectively learning the intrinsic CCA features and taking full advantage of cross-domain object alignment information while pursuing low rank representations. Extensive experimental results on CMU PIE, Office-Caltech, Pascal VOC 2007, and NUS-WIDE-Object datasets, demonstrate that our designed models have superior performance over several state-of-the-art cross-domain low rank methods in image clustering and classification tasks with various corruption levels.
Xiangjun Shen, Jinghui Zhou, Zhongchen Ma, Bing-Kun Bao, Zhengjun Zha
ACM Trans. Multim. Comput. Commun. Appl.2