Chong Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Chong Zhao has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
Fei Hou
Key Laboratory of System Software (CAS) and State Key Laboratory of Computer Science ISCAS China
1 shared publication- Fei Hou
Institute of Software, Chinese Academy of Sciences, Beijing, China
1 shared publication Panpan Xu
Key Laboratory of System Software (CAS) and State Key Laboratory of Computer Science ISCAS China
1 shared publication- Shengchun Wang
College of Computer Science and Technology, Xi’an University of Science and Technology, Xi’an 710054, China
1 shared publication Wencheng Wang
Key Laboratory of System Software (CAS), State Key Laboratory of Computer Science Institute of Software, Chinese Academy of Sciences Beijing China
1 shared publication- Wencheng Wang
Institute of Software, Chinese Academy of Sciences, Beijing, China
1 shared publication
Latest Publications
- 30 November 2025
- Published by Wiley in Computer Graphics Forum
Adaptive Use of LBO Bases by Shape Feature Scales for High‐Quality and Efficient Shape Correspondence
Bases from the eigenfunctions of the Laplace–Beltrami operator (LBO), called LBO bases, are popularly used to construct functional mappings for shape correspondence. Although many efforts have been made to improve LBO basis construction and their application in shape correspondence, they often overlook the role of shape feature scales in determining the suitability of LBO bases. This mismatch between the selected LBO bases and shape features results in poor representation, hindering shape correspondence and requiring more iterations for convergence, ultimately reducing efficiency. In this paper, we present an attention‐based module that adaptively learns weights based on the scales of shape features to better utilise LBO bases. This ensures that the selected LBO bases have frequencies that align with the scales of shape features, addressing the mismatch problem and improving feature representation. By filtering out LBO bases with incompatible frequencies, our approach enhances shape correspondence while reducing the number of iterations required for convergence, thereby improving efficiency. Additionally, the selected LBO bases can be easily integrated with existing methods, such as the test‐time adaptation strategy, to further enhance shape correspondence. Experimental results demonstrate that our method achieves higher‐quality results than state‐of‐the‐art methods while at a high efficiency.
- 30 November 2025
- Published by Wiley in Computer Graphics Forum
Adaptive Use of LBO Bases by Shape Feature Scales for High‐Quality and Efficient Shape Correspondence
Bases from the eigenfunctions of the Laplace–Beltrami operator (LBO), called LBO bases, are popularly used to construct functional mappings for shape correspondence. Although many efforts have been made to improve LBO basis construction and their application in shape correspondence, they often overlook the role of shape feature scales in determining the suitability of LBO bases. This mismatch between the selected LBO bases and shape features results in poor representation, hindering shape correspondence and requiring more iterations for convergence, ultimately reducing efficiency. In this paper, we present an attention‐based module that adaptively learns weights based on the scales of shape features to better utilise LBO bases. This ensures that the selected LBO bases have frequencies that align with the scales of shape features, addressing the mismatch problem and improving feature representation. By filtering out LBO bases with incompatible frequencies, our approach enhances shape correspondence while reducing the number of iterations required for convergence, thereby improving efficiency. Additionally, the selected LBO bases can be easily integrated with existing methods, such as the test‐time adaptation strategy, to further enhance shape correspondence. Experimental results demonstrate that our method achieves higher‐quality results than state‐of‐the‐art methods while at a high efficiency.
- 1 October 2024
- Published by Wiley in Computer Graphics Forum
- Vol. 43 (7)
Distinguishing Structures from Textures by Patch‐based Contrasts around Pixels for High‐quality and Efficient Texture filtering
It is still challenging with existing methods to distinguish structures from texture details, and so preventing texture filtering. Considering that the textures on both sides of a structural edge always differ much from each other in appearances, we determine whether a pixel is on a structure edge by exploiting the appearance contrast between patches around the pixel, and further propose an efficient implementation method. We demonstrate that our proposed method is more effective than existing methods to distinguish structures from texture details, and our required patches for texture measurement can be smaller than the used patches in existing methods by at least half. Thus, we can improve texture filtering on both quality and efficiency, as shown by the experimental results, e.g., we can handle the textured images with a resolution of 800 × 600 pixels in real‐time. (The code is available at https://github.com/hefengxiyulu/MLPC)
- 1 October 2024
- Published by Wiley in Computer Graphics Forum
- Vol. 43 (7)
Distinguishing Structures from Textures by Patch‐based Contrasts around Pixels for High‐quality and Efficient Texture filtering
It is still challenging with existing methods to distinguish structures from texture details, and so preventing texture filtering. Considering that the textures on both sides of a structural edge always differ much from each other in appearances, we determine whether a pixel is on a structure edge by exploiting the appearance contrast between patches around the pixel, and further propose an efficient implementation method. We demonstrate that our proposed method is more effective than existing methods to distinguish structures from texture details, and our required patches for texture measurement can be smaller than the used patches in existing methods by at least half. Thus, we can improve texture filtering on both quality and efficiency, as shown by the experimental results, e.g., we can handle the textured images with a resolution of 800 × 600 pixels in real‐time. (The code is available at https://github.com/hefengxiyulu/MLPC)