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

Zungang Wang

dblp:326/4860 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · unresolved

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

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

Artificial intelligence
1 paper
Representation and self-supervised learning · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › subspace learning
low-rank representation
0.612022
Orthogonal Low-Rank Projection Learning for Robust Image Feature Extraction · IEEE Trans. Multim. 2022
Image and video processing › feature extraction
image feature extraction
0.612022
Orthogonal Low-Rank Projection Learning for Robust Image Feature Extraction · IEEE Trans. Multim. 2022
Mathematical optimization › optimization under uncertainty
robust optimization
0.212022
Orthogonal Low-Rank Projection Learning for Robust Image Feature Extraction · IEEE Trans. Multim. 2022

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

weighted truncated schatten p-norm · 1.7orthogonal low-rank projection · 1.7correntropy · 1.7
YearPublicationVenuePosition
2022 Orthogonal Low-Rank Projection Learning for Robust Image Feature Extraction
abstract
Projecting the original data into a low-dimensional target space for feature extraction is a common method. Recently, presentation-based approaches have been widely concerned and many feature extraction algorithms based on this have been proposed. However, in the process of acquiring real data, the pollution of complex noise cannot always be avoided, which will greatly increase the difficulty of feature extraction and even lead to failed feature extraction results. Thus, a robust image feature extraction model based on Orthogonal Low-Rank Projection Learning (OLRPL) is proposed, in which the introduction of orthogonal matrix can encourage the preservation of the main components of the sample. Particularly, the row sparsity constraint introduced on the projection matrix can encourage the features to be more compact, discriminative and interpretable. In particular, the Weighted Truncated Schattenp-norm (WTSN) is proposed to better solve the optimization problem of low-rank constraints. At the same time, the correntropy is applied in OLRPL to suppress the complex noise in the data and thus improve the robustness of the model. Finally, we specially design a robust classification loss function so that our model can be fitted the supervised scene effectively. Experiments on five general databases have proved that OLRPL has better effectiveness and robustness than existing advanced methods.
Huaijiang Sun, Zungang Wang, Mingwei Qin
IEEE Trans. Multim.4