Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhiwen Xu

dblp:65/698 · DBLP profile ↗
← Back
11ranked-venue papers
3as first author
3since 2021 · last 2025
—ORCID · conflict

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

Applied, interdisciplinary, general and emerging computing · 5 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 since 2021Systems, architecture and hardware · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video processing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › image registration
lucas-kanade registration
0.212014
Dynamically Removing False Features in Pyramidal Lucas-Kanade Registration · IEEE Trans. Image Process. 2014
Image and video processing › motion estimation
optical flow
0.212014
Dynamically Removing False Features in Pyramidal Lucas-Kanade Registration · IEEE Trans. Image Process. 2014
Image and video processing
image registration
0.112014
Dynamically Removing False Features in Pyramidal Lucas-Kanade Registration · IEEE Trans. Image Process. 2014

Methods — techniques the papers use, named apart from their topics

confidence prediction · 0.2coarse-to-fine registration · 0.2
YearPublicationVenuePosition
2025 A bayesian approach for dual-knowledge-aided target detection and performance analysis in heterogeneous environments
Pucheng Jing, Yongchan Gao, Jun Liu 0004, Lei Zuo 0001, Zhiwen Xu
Signal Process.5
2025 An Adaptive Nearest Point Routing Method Based on Charging Nest Deployment Optimization for UAVs Power Tower Inspection
Hui Zhang 0023, Zhiwen Xu, Bo Chen 0047, Hean Hua, Hang Zhong, Wenhao Mo, Yaonan Wang 0001
IEEE Trans. Ind. Informatics2
2025 Smart Contract Vulnerability Detection Based on Dual Adversarial Domain Adaptation
abstract
With the widespread application of smart contracts and the expansion of asset management scale, various new attacks continue to emerge, and a method that can adapt to new vulnerabilities more quickly is urgently needed. Although deep learning methods have shown superior performance in vulnerability detection, their dependence on a large number of labeled samples limits their applicability in new vulnerability scenarios. Therefore, this article introduces a dual adversarial domain adaptation (DADA) approach. This approach consists of two generators and two discriminators. First, the source generator is pretrained with extensive labeled known vulnerability samples in the source domain to extract discriminative features, and its parameters are shared with the target generator. Subsequently, the features of the source and target domain samples are input into the source discriminator, and the target generator is guided to learn domain-invariant features through adversarial training; at the same time, the target domain discriminator is introduced to further weaken its dependence on the distribution of source domain features, thereby improving its adaptability to new vulnerabilities. We conducted experimental evaluations on public datasets, and the results show that our proposed method outperforms six mainstream deep learning-based detection methods. We applied domain adaptation methods to smart contract vulnerability detection for the first time, providing a reference for small sample learning in this field in the future.
Siyu Jiang, Zhiwen Xu, Jiahui Chen 0002
IEEE Trans. Reliab.3
2014 Dynamically Removing False Features in Pyramidal Lucas-Kanade Registration
abstract
Pyramidal Lucas-Kanade (LK) optical flow is a real-time registration technique widely employed by a variety of cutting edge consumer applications. Traditionally, the LK algorithm is applied selectively to image feature points that have strong spatial variation, which include outliers in textured areas. To detect and discard the falsely selected features, previous methods generally assess the goodness of each feature after the flow computation is completed. Such a screening process incurs additional cost. This paper provides a handy (but not obvious) tool for the users of the LK algorithm to remove false features without degrading the algorithm's efficiency. We propose a confidence predictor, which evaluates the ill-posedness of an LK system directly from the underlying data, at a cost lower than solving the system. We then incorporate our confidence predictor into the course-to-fine LK registration to dynamically detect false features and terminate their flow computation at an early stage. This improves the registration accuracy by preventing the error propagation and maintains (or increases) the computation speed by saving the runtime on false features. Experimental results on state-of-the-art benchmarks validate that our method is more accurate and efficient than related works.
Yan Niu, Zhiwen Xu, Xiangjiu Che
IEEE Trans. Image Process.2
2007 Image Restoration with Intensity Preservation from Fluorescein Angiogram Sequences
abstract
Intensity degradations are a familiar problem for fluorescein angiogram sequences. In this paper, we attempt to restore a noisy fluorescein angiogram, and to keep the high intensity pixels from degrading. To this end, we incorporate a new constraint, called intensity constraint, to Miller's regularization formulation with a smoothness constraint. Considering the specified requirement for fluorescein angiograms, we also modify the Q-th order converging algorithm for implementation purpose. In our scheme, including its formulation and implementation, image restoration can not only handle the traditional problems, such as blur and noise, but also achieve an important feature, intensity preservation. The experiments show that our approach has satisfactory results in the two aspects.
Xiaoxin Guo, Zhiwen Xu, Xiangjiu Che, Xiaoying Hu
ICME2
2005 Image Registration Based on Pseudo-Polar FFT and Analytical Fourier-Mellin Transform
Xiaoxin Guo, Zhiwen Xu, Yinan Lu, Zhanhui Liu, Yunjie Pang
ICIC (1)2
2005 Super-Resolution Reconstruction from Fluorescein Angiogram Sequences
Xiaoxin Guo, Zhiwen Xu, Yinan Lu, Zhanhui Liu, Yunjie Pang
ICIC (1)2
2005 The Dynamic Cache Algorithm of Proxy for Streaming Media
Zhiwen Xu, Xiaoxin Guo, Zhengxuan Wang, Yunjie Pang
ICIC (1)1
2004 An adaptive soft-morphological-gradient-filter-for-edge-detection
abstract
In this paper, a novel adaptive soft morphological gradient (ASMG) filter is proposed, based on a combination of the idea of the soft morphological filtering and the adaptive technique. ASMG filtering is an efficient nonlinear sharpening method, which can be applied for edge detection. By employing four directional structuring elements, ASMG filtering has the capability of selecting the directional structuring element with the maximum response, whose direction varies depending on the change of directional edges. In addition, by comparing the variance of the moving structuring window with the base variance, the ASMG filter provides an adaptive algorithm for morphological operations. The experimental results show that the ASMG filter is better than the traditional operators in edge detection and noise suppression.
Xiaoxin Guo, Zhiwen Xu, Yunjie Pang
ICIG2
2004 The Transmitted Strategy of Proxy Cache Based on Segmented Video
Zhiwen Xu, Xiaoxin Guo, Yunjie Pang, Zhengxuan Wang
NPC1
2004 The Strategy of Batch Using Dynamic Cache for Streaming Media
Zhiwen Xu, Xiaoxin Guo, Yunjie Pang, Zhengxuan Wang
NPC1