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

Yifan Min

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

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

Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Artificial intelligence
1 paper
Efficient and distributed learning · 67% Segmentation and scene understanding · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
active learning
0.412020
Visual Saliency Detection via Kernelized Subspace Ranking With Active Learning · IEEE Trans. Image Process. 2020
Machine learning › Efficient and distributed learning › active learning › active data collection
pool-based active learning
0.412020
Visual Saliency Detection via Kernelized Subspace Ranking With Active Learning · IEEE Trans. Image Process. 2020
Computer vision › Segmentation and scene understanding
saliency detection
0.412020
Visual Saliency Detection via Kernelized Subspace Ranking With Active Learning · IEEE Trans. Image Process. 2020

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

region-based CNN features · 0.4kernelized subspace ranking · 0.4RankSVM · 0.4
YearPublicationVenuePosition
2020 Visual Saliency Detection via Kernelized Subspace Ranking With Active Learning
abstract
Saliency detection task has witnessed a booming interest for years, due to the growth of the computer vision community. In this paper, we introduce a new saliency model that performs active learning with kernelized subspace ranker (KSR) referred to as KSR-AL. This pool-based active learning algorithm ranks the informativeness of unlabeled data by considering both uncertainty sampling and information density, thereby minimizing the cost of labeling. The informative images are selected to train the KSR iteratively and incrementally. The learning model of this algorithm is designed on object-level proposals and region-based convolutional neural network (R-CNN) features, by jointly learning a Rank-SVM classifier and a subspace projection. When the active learning process meets its stopping criteria, the saliency map of each image is generated by a weight fusion of its top-ranked proposals, whose ranking scores are graded by the learned ranker. We show that the KSR-AL achieves a reduction in annotation, as well as improvement in performance, compared with the supervised learning scheme. Besides, the proposed algorithm also outperforms the state-of-the-art methods. These improvements are demonstrated by extensive experiments on six publicly available benchmark datasets.
Lihe Zhang, Tiantian Wang 0002, Yifan Min, Huchuan Lu
IEEE Trans. Image Process.4