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

Wangyang Zuo

dblp:304/3546 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0001-8887-2409ORCID · corroborated

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

Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

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.

Network and information security
1 paper
Biometric security · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 77% Web and social media mining · 23%

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

TopicWeightPapersLastEvidence papers
Biometric security › anti-spoofing
fingerprint presentation attack detection
0.712023
Prototype-Guided Autoencoder for OCT-Based Fingerprint Presentation Attack Detection · IEEE Trans. Inf. Forensics Secur. 2023
Biometric security
fingerprint recognition
0.712023
Prototype-Guided Autoencoder for OCT-Based Fingerprint Presentation Attack Detection · IEEE Trans. Inf. Forensics Secur. 2023
Information retrieval › web search
scholarly search
0.612022
Tell Me How to Survey: Literature Review Made Simple with Automatic Reading Path Generation · ICDE 2022
Web and social media mining
citation network analysis
0.212022
Tell Me How to Survey: Literature Review Made Simple with Automatic Reading Path Generation · ICDE 2022

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

representation consistency constraint · 0.7prototype-guided autoencoder · 0.7memory module · 0.7denoising autoencoder · 0.7graph optimization · 0.6
YearPublicationVenuePosition
2023 Prototype-Guided Autoencoder for OCT-Based Fingerprint Presentation Attack Detection
abstract
Anti-spoofing ability is vital for fingerprint identification systems. Conventional fingerprint scanning devices can only obtain information from the fingertip surfaces, and their performance is susceptible to skin conditions and presentation attacks (PAs). However, optical coherence tomography (OCT) can scan subcutaneous tissue and obtain 3D fingerprint structures, naturally enhancing its PA detection (PAD) ability from the perspective of hardware. Existing unsupervised PAD methods are based on image reconstruction. However, the reconstruction error is easily affected by OCT noise and the rich details of OCT images. Therefore we propose feature-based reconstruction to alleviate this problem, called the prototype-guided autoencoder. The model consists of a memory module and a denoising autoencoder without the requirement of PA fingerprints. As only bona fide fingerprints are available during the training phase, the memory module contains the prototype features of the bona fide fingerprints. During the inference phase, as the prototype memory module is frozen, the reconstructed representation of the bona fide input is close to the bona fide fingerprint features. Calculating the distance between the original features and the prototype reconstructed representation of the sample can achieve PAD. To obtain a better decision making boundary, we propose a representation consistency constraint, which reduces the bona fide representation reconstruction distance closer, so that it is easier to differentiate between fingerprints and PAs.
Yipeng Liu 0002, Wangyang Zuo, Ronghua Liang, Haohao Sun, Zhanqing Li
IEEE Trans. Inf. Forensics Secur.2
2022 Tell Me How to Survey: Literature Review Made Simple with Automatic Reading Path Generation
abstract
Recent years have witnessed the dramatic growth of paper volumes with plenty of new research papers published every day, especially in the area of computer science. How to glean papers worth reading from the massive literature to do a quick survey or keep up with the latest advancement about a specific research topic has become a challenging task. Existing academic search engines return relevant papers by individually calculating the relevance between each paper and query. However, such systems usually omit the prerequisite chains of a research topic and cannot form a meaningful reading path. In this paper, we introduce a new task named Reading Path Generation (RPG) which aims at automatically producing a path of papers to read for a given query. To serve as a research benchmark, we further propose SurveyBank, a dataset consisting of large quantities of survey papers in the field of computer science as well as their citation relationships. Furthermore, we propose a graph-optimization-based approach for reading path generation which takes the relationship between papers into account. Extensive evaluations demonstrate that our approach outperforms other baselines. A real-time Reading Path Generation (RePaGer) system has been also implemented with our designed model. Our source code and SurveyBank dataset can be found here11https://github.com/JiayuanDing100/Reading-Path-Generation.
Jiayuan Ding, Tong Xiang, Zijing Ou, Wangyang Zuo, Ruihui Zhao, Chenghua Lin 0002, Yefeng Zheng 0001, Bang Liu 0003
ICDE4