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

Yuanqiang Fang

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

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

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 77% Machine learning and data management · 23%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models › neural retrieval
diffusion-based retrieval
0.312018
Cascaded Feature Augmentation with Diffusion for Image Retrieval · ACM Multimedia 2018
Machine learning and data management › feature transformation
feature augmentation
0.312018
Cascaded Feature Augmentation with Diffusion for Image Retrieval · ACM Multimedia 2018
Information retrieval
image retrieval
0.312018
Cascaded Feature Augmentation with Diffusion for Image Retrieval · ACM Multimedia 2018
Information retrieval
reranking
0.312018
Cascaded Feature Augmentation with Diffusion for Image Retrieval · ACM Multimedia 2018
Information retrieval › image retrieval
large-scale image retrieval
0.112018
Cascaded Feature Augmentation with Diffusion for Image Retrieval · ACM Multimedia 2018

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

cascaded feature augmentation · 0.3cascaded cluster diffusion · 0.3
YearPublicationVenuePosition
2018 Cascaded Feature Augmentation with Diffusion for Image Retrieval
abstract
Recently, as an effective re-ranking technique, diffusion has attracted considerable attention in research on image retrieval. It inherits from random surfer model and is effective to deeply explore data manifold structure. However, as a common practice, diffusion is performed at query time which relies heavily on initial retrieval shortlists and suffers the bottleneck of online time-efficiency. To this end, in this paper, we present a more generalized method named CFA (cascaded feature augmentation) based on diffusion. First of all, we transfer diffusion process from online stage to offline stage and innovatively utilize output of diffusion to augment database features in a cascaded mode, which can eliminate iteration process at query time radically. Second, to scale the diffusion method to large image database, we propose a cascaded cluster diffusion technique for feature augmentation which largely reduces computational cost. Third, we extend our cascaded feature augmentation scheme to cases with multiple features without involving extra memory and time cost. Our CFA is compatible with other re-ranking methods. Extensive experiments on four public datasets demonstrate the effectiveness of our proposed algorithm.
Yuanqiang Fang, Wengang Zhou 0001, Yijuan Lu, Jinhui Tang 0001, Qi Tian 0001, Houqiang Li
ACM Multimedia1