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

Yongchun Chen

dblp:364/5094 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

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

Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.

Computer networks
1 paper
Physical-layer communications · 75% Cellular and mobile networks · 25%
Artificial intelligence
1 paper
Trustworthy machine learning · 61% Face, body and person analysis · 30% Deep learning architectures and training · 9%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel estimation
0.912025
Efficient Massive MIMO CSI Estimation With Pilot Power Allocation · IEEE Trans. Commun. 2025
Physical-layer communications › channel estimation › MIMO channel estimation
massive MIMO channel estimation
0.912025
Efficient Massive MIMO CSI Estimation With Pilot Power Allocation · IEEE Trans. Commun. 2025
Cellular and mobile networks › power control
pilot power allocation
0.912025
Efficient Massive MIMO CSI Estimation With Pilot Power Allocation · IEEE Trans. Commun. 2025
Physical-layer communications
signal processing for communications
0.912025
Efficient Massive MIMO CSI Estimation With Pilot Power Allocation · IEEE Trans. Commun. 2025
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.712023
Refining Noisy Labels With Label Reliability Perception for Person Re-Identification · IEEE Trans. Multim. 2023
Machine learning › Trustworthy machine learning › learning from noisy data
noisy label refinement
0.712023
Refining Noisy Labels With Label Reliability Perception for Person Re-Identification · IEEE Trans. Multim. 2023
Computer vision › Face, body and person analysis
person re-identification
0.712023
Refining Noisy Labels With Label Reliability Perception for Person Re-Identification · IEEE Trans. Multim. 2023
Machine learning › Deep learning architectures and training
feature fusion
0.212023
Refining Noisy Labels With Label Reliability Perception for Person Re-Identification · IEEE Trans. Multim. 2023

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

randomized matrix approximation · 0.9power allocation · 0.9least squares · 0.9label reliability perception · 0.7k-nearest neighbor evaluation · 0.7feature-fusion block · 0.7
YearPublicationVenuePosition
2025 Efficient Massive MIMO CSI Estimation With Pilot Power Allocation
abstract
Accurate estimation of channel state information (CSI) is crucial to realize the full potential of massive multiple-input multiple-output (MIMO) communication systems. Despite the high accuracy of existing CSI estimators, the high computational complexity makes them impractical for real-world massive MIMO systems. So, developing a highly accurate and low-complexity estimator has been a long-standing challenge in the field of massive MIMO. In this paper, we present a channel estimation scheme that significantly reduces computational complexity while achieving high accuracy. Firstly, we design a two-stage training protocol whereby only part of the transmit and receive antennas are activated for signal emission or reception. Secondly, we apply the low-complexity Least-Square (LS) estimator to acquire two sub-blocks of the channel matrix. Relying on the inherent low-rank property of channel matrix, the complete channel matrix is reconstructed via a randomized matrix approximation technique. Thirdly, we consider three different power allocation schemes to further optimize the pilot power in 2-stage training process. The theoretical bounds of estimation error for our CSI estimator are derived, and the optimal power allocation strategy is thus obtained by minimizing this error bound. Numerical simulations are provided to demonstrate our proposed method. As shown, the theoretical error bound is tight, and the optimal power allocation can achieve the substantial gain. Our CSI estimator incurs the same complexity as the popular LS estimator, whilst the estimation accuracy is improved by ~5 dB, which has the great promise to new-generation massive MIMO communications.
Ziping Wei, Bin Li 0002, Yongchun Chen, Sheng Wu 0001, Chenglin Zhao, Zizhen Li, Kaiqi Guo, Bingsen Liu
IEEE Trans. Commun.3
2023 Refining Noisy Labels With Label Reliability Perception for Person Re-Identification
abstract
Most person re-identification (Re-ID) approaches rely excessively on a great quantity of annotated training data. However, due to sampling errors or annotated errors, the label noise is unavoidable, which usually causes a dramatic decrease in the performance of existing Re-ID methods. To address this problem, we propose the label reliability perception (LRP) for person Re-ID by refining noisy labels. Specifically, a feature-fusion block (FFB) is proposed to enhance the discrimen- ability of pedestrians' features by expanding the network's attention span due to the fused feature, which is generated by overlapping the coarse-grained feature obtained by global average pooling and fine-grained features obtained by evenly dividing the feature map in the height dimension and performing global max pooling. In addition, the label dual perception (LDP) is proposed to refine noisy labels instead of filtering samples by evaluating the reliability of each training sample's label. Specifically, we meticulously design five evaluation modes for each sample to perceive the reliability of the labels of thek-nearest neighbor images. Finally, we utilize the most reliable label to replace the noisy label and optimize the network. Extensive experiments prove the superiority of the proposed model over the competing methods; for instance, on Market1501, our method achieves 88.8% rank-1 accuracy and 70.5% mAP (4.7% and 4.3% improvements over the state-of-the-arts) under noise ratio 20%, and similarly on DukeMTMC-ReID, our method achieves 77.7% and 60.3%.
Yongchun Chen, Min Liu 0008, Fei Wang 0124, Anan Liu, Yaonan Wang 0001
IEEE Trans. Multim.1