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

Linlin Ruan

dblp:164/2663 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Security and privacy · 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
Digital forensics and information hiding · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing › feature extraction
image feature extraction
0.712023
Perceptual Image Hashing With Locality Preserving Projection for Copy Detection · IEEE Trans. Dependable Secur. Comput. 2023
Digital forensics and information hiding › content identification
copy detection
0.712023
Perceptual Image Hashing With Locality Preserving Projection for Copy Detection · IEEE Trans. Dependable Secur. Comput. 2023
Digital forensics and information hiding › image hashing
perceptual image hashing
0.712023
Perceptual Image Hashing With Locality Preserving Projection for Copy Detection · IEEE Trans. Dependable Secur. Comput. 2023
Information retrieval
image retrieval
0.212023
Perceptual Image Hashing With Locality Preserving Projection for Copy Detection · IEEE Trans. Dependable Secur. Comput. 2023

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

hamming distance · 2.0gabor filtering · 2.0locality preserving projections · 1.3locality preserving projection · 0.7
YearPublicationVenuePosition
2023 Perceptual Image Hashing With Locality Preserving Projection for Copy Detection
abstract
Perceptual image hashing is an effective and efficient way to identify images in large-scale databases, where two major performances are robustness and discrimination. A better tradeoff between robustness and discrimination is still a severe challenge for the current hashing research. Aiming at this issue, we design a novel perceptual image Hashing with Locality Preserving Projection (LPP) (hereafter HLPP). Specifically, to improve the robustness against content-preserving operations, Gabor filtering is leveraged to adaptively extract the orientation and structure features, which are consistent with the response of human visual system. The LPP is adopted to learn intrinsic local structure from the maximum Gabor filtering response. The use of LPP can discover meaningful low-dimensional information hidden in the maximum Gabor filtering response and thus improves discrimination of HLPP. During hash similarity calculation, the Hamming distance is selected as the metric. The tradeoff performance between robustness and discrimination is validated on benchmark databases, and the results indicate that the proposed HLPP is superior to some state-of-the-art algorithms. In addition, extensive experiments of copy detection also demonstrate that the proposed HLPP can provide higher accuracy than the compared algorithms.
Ziqing Huang, Zhenjun Tang, Xianquan Zhang, Linlin Ruan, Xinpeng Zhang 0001
IEEE Trans. Dependable Secur. Comput.4