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

Ziyang Li 0001

dblp:90/10939-1 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0001-3084-1308ORCID · verified

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
Face, body and person analysis · 44% Vision and language · 44% Graph learning · 13%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language
cross-modal retrieval
0.812024
Text-to-Image Person Re-Identification Based on Multimodal Graph Convolutional Network · IEEE Trans. Multim. 2024
Computer vision › Vision and language › cross-modal matching
image-text matching
0.812024
Text-to-Image Person Re-Identification Based on Multimodal Graph Convolutional Network · IEEE Trans. Multim. 2024
Computer vision › Face, body and person analysis
person re-identification
0.812024
Text-to-Image Person Re-Identification Based on Multimodal Graph Convolutional Network · IEEE Trans. Multim. 2024
Computer vision › Face, body and person analysis › person re-identification › multi-modal person re-identification
text-to-image person re-identification
0.812024
Text-to-Image Person Re-Identification Based on Multimodal Graph Convolutional Network · IEEE Trans. Multim. 2024
Machine learning › Graph learning › graph neural network
graph convolutional network
0.212024
Text-to-Image Person Re-Identification Based on Multimodal Graph Convolutional Network · IEEE Trans. Multim. 2024
Machine learning › Graph learning
multimodal graph
0.212024
Text-to-Image Person Re-Identification Based on Multimodal Graph Convolutional Network · IEEE Trans. Multim. 2024

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

similarity distribution matching · 0.8mutual information · 0.8graph convolutional network · 0.8
YearPublicationVenuePosition
2024 Text-to-Image Person Re-Identification Based on Multimodal Graph Convolutional Network
abstract
Text-to-image person re-identification (ReID) is a common subproblem in the field of person re-identification and image-text retrieval. Recent approaches generally follow the structure of a dual-stream network, extracting image and text features. There is no deep interaction between images and text in this approach, making it difficult for the network to learn a highly semantic feature representation. In addition, for both image data and text data, the feature extraction process is modeled in a regular way, such as using Transformer to extract sequence embeddings. However, this type of modeling disregards the inherent relationships among multimodal input embeddings. A more flexible approach to mining multimodal data, which uniformly treats the data as graphs, is proposed. In this way, the extraction and interaction of multimodal information are accomplished by means of messages passing between graph nodes. First, a unified multimodal feature extraction and fusion network is proposed based on the graph convolutional network, which enables the progression of multimodal information from ‘local’ to ‘global’. Second, an asymmetric multilevel alignment module, which focuses on more accurate ‘local’ information from a ‘global’ perspective, is proposed to progressively divide the multimodal information at each level. Last, a cross-modal representation matching strategy based on similarity distribution and mutual information is proposed to achieve cross-modal alignment. The proposed algorithm in this paper is simple and efficient, and the testing results on three public datasets (CUHK-PEDES, ICFG-PEDES and RSTPReID) show that it can achieve SOTA-level performance.
Guang Han 0002, Ziyang Li 0001, Haitao Zhao 0004, Sam Kwong
IEEE Trans. Multim.3