Weiwei Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Weiwei Zhou has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Yanping Li
MoE Key Lab of Artificial Intelligence, AI Institute, Shanghai Jiao Tong University, Shanghai, China
3 shared publications - Yizhang Liu
College of Computer and Data Science, Fuzhou University, Fuzhou, China
3 shared publications - Shengjie Zhao
Tongji University, Shanghai, China
2 shared publications - Yuli Wang
Fuzhou University
1 shared publication
Latest Publications
- 31 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 33 (10709908) , 1461-1465
CCTformer: Calibrated Context-Aware Transformer for Correspondence Pruning
Correspondence pruning is a core problem in computer vision, aiming to distinguish correct matches from a large set of initial correspondences. Recent Transformer-based methods, such as VSFormer, have shown remarkable performance by jointly modeling visual appearance and spatial relationships. Nevertheless, these methods often depend on abstract, scene-level visual representations, which are insufficiently precise for validating individual correspondences. In addition, their context aggregation modules often struggle to capture multi-granularity corresponding features, particularly under complex geometric variations. To overcome these limitations, we propose the Calibrated Context-aware Transformer with two key components. The Calibrated Visual Cues Extractor samples features directly at putative match locations to provide well-aligned, correspondence-specific visual cues. The Dual-Perspective Graph Transformer replaces conventional graph attention to better model both node-level and edge-level interactions. Together, these modules enable more robust local-global context fusion. Extensive experiments on YFCC100 M and SUN3D show that CCTformer consistently outperforms the baseline and other state-of-the-art methods.
- 31 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 33 (10709908) , 1461-1465
CCTformer: Calibrated Context-Aware Transformer for Correspondence Pruning
Correspondence pruning is a core problem in computer vision, aiming to distinguish correct matches from a large set of initial correspondences. Recent Transformer-based methods, such as VSFormer, have shown remarkable performance by jointly modeling visual appearance and spatial relationships. Nevertheless, these methods often depend on abstract, scene-level visual representations, which are insufficiently precise for validating individual correspondences. In addition, their context aggregation modules often struggle to capture multi-granularity corresponding features, particularly under complex geometric variations. To overcome these limitations, we propose the Calibrated Context-aware Transformer with two key components. The Calibrated Visual Cues Extractor samples features directly at putative match locations to provide well-aligned, correspondence-specific visual cues. The Dual-Perspective Graph Transformer replaces conventional graph attention to better model both node-level and edge-level interactions. Together, these modules enable more robust local-global context fusion. Extensive experiments on YFCC100 M and SUN3D show that CCTformer consistently outperforms the baseline and other state-of-the-art methods.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 33, 4331-4335
CGSNet: Cross-Graph Spatial and Sparse Network for Two-View Geometry Estimation
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 33, 4331-4335
CGSNet: Cross-Graph Spatial and Sparse Network for Two-View Geometry Estimation
- Open Access
- 28 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 7754-7763
RoSe: Rotation-Invariant Sequence-Aware Consensus for Robust Correspondence Pruning
Correspondence pruning has recently drawn considerable attention as a crucial step in image matching. Existing methods typically achieve this by constructing neighborhoods for each feature point and imposing neighborhood consistency. However, the nearest-neighbor matching strategy often results in numerous many-to-one correspondences, thereby reducing the reliability of neighborhood information. Furthermore, the smoothness constraint fails in cases of large-scale rotations, leading to misjudgments. To address the above issues, this paper proposes a novel robust correspondence pruning method termed RoSe, which is based on rotation-invariant sequence-aware consensus. We formulate the correspondence pruning problem as a mathematical optimization problem and derive a closed-form solution. Specifically, we devise a rectified local neighborhood construction strategy that effectively enlarges the distribution between inliers and outliers. Meanwhile, to accommodate large-scale rotation, we propose a relative sequence-aware consistency as an alternative to existing smoothness constraints, which can better characterize the topological structure of inliers. Experimental results on image matching and registration tasks demonstrate the effectiveness of our method. Robustness analysis involving diverse feature descriptors and varying rotation degrees further showcases the efficacy of our method.
- 28 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 7754-7763
Open AccessRoSe: Rotation-Invariant Sequence-Aware Consensus for Robust Correspondence Pruning
Correspondence pruning has recently drawn considerable attention as a crucial step in image matching. Existing methods typically achieve this by constructing neighborhoods for each feature point and imposing neighborhood consistency. However, the nearest-neighbor matching strategy often results in numerous many-to-one correspondences, thereby reducing the reliability of neighborhood information. Furthermore, the smoothness constraint fails in cases of large-scale rotations, leading to misjudgments. To address the above issues, this paper proposes a novel robust correspondence pruning method termed RoSe, which is based on rotation-invariant sequence-aware consensus. We formulate the correspondence pruning problem as a mathematical optimization problem and derive a closed-form solution. Specifically, we devise a rectified local neighborhood construction strategy that effectively enlarges the distribution between inliers and outliers. Meanwhile, to accommodate large-scale rotation, we propose a relative sequence-aware consistency as an alternative to existing smoothness constraints, which can better characterize the topological structure of inliers. Experimental results on image matching and registration tasks demonstrate the effectiveness of our method. Robustness analysis involving diverse feature descriptors and varying rotation degrees further showcases the efficacy of our method.