yang shen

Prof. Dr. yang shen

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 March 2012 in Science China Information Sciences
Verified
Journal Article
Closed access
PDF file
XLXiao Lin
Xiao Lin
BSBin Sheng
Bin Sheng
LMLiZhuang Ma
LiZhuang Ma
YSyang shen
yang shen
ZCZhiHua Chen
ZhiHua Chen

13 February 2024 in IEEE Access
Verified
Journal Article
Open access
YSyang shen
yang shen
HXHao. Xu
Hao. Xu
YBYanxia. Bao
Yanxia. Bao
ZXZhengnan. Xu
Zhengnan. Xu
YGYuanHu. Gu
YuanHu. Gu
KLKenan Lou
Kenan Lou
Point cloud generation and representation is important in industry areas. Generating and editing high quality 3D shapes is challenging work in deep learning. Inspired by StyleGAN, a style based generative adversarial networks is proposed to generate high quality 3D point cloud. An improved non-linear mapping network learn distribution of points and is used to generate well distributed point cloud point cloud. We also provide a coarse to fine representation for point cloud. According to the experimental results on the ShapeNet Part data set(including aircraft, chair single category and overall 16 categories), our method can generate more uniform point cloud than other GAN methods with less training epoches. The latent code for point cloud has better linear separation,and is more easy to edit.

14 March 2012 in Science China Information Sciences
Verified
Journal Article
Closed access
PDF file
YGYan Gao
Yan Gao
ZCZhiHua Chen
ZhiHua Chen
MCMinGang Chen
MinGang Chen
YSyang shen
yang shen

11 April 2024 in IEEE Access
Verified
Journal Article
Open access
HXHAO XU
HAO XU
JLJIA LIU
JIA LIU
YSyang shen
yang shen
KLKenan Lou
Kenan Lou
YBYanxia Bao
Yanxia Bao
SWShuai Wang
Shuai Wang
Graph Pooling technology plays an important role in graph node classification tasks. Sorting pooling technologies maintain large-value units for pooling graphs of varying sizes. However, by analyzing the statistical characteristic of activated units after pooling, we found that a large number of units dropped by sorting pooling are negative-value units that contain representative information and can contribute considerably to the final decision. To maintain more representative information, we proposed a novel pooling technology, called Geometric Pooling (GP), containing the unique node features with negative values by measuring the similarity of all node features. We reveal the effectiveness of GP from the entropy reduction view. The experiments were conducted on TUdatasets to show the effectiveness of GP. The results showed that the proposed GP outperforms the SOTA graph pooling technologies by $1\%~\sim ~5\%$ with fewer parameters.

14 December 2021 in IEEE Access
Verified
Journal Article
Open access
HXHAO XU
HAO XU
SZShuyue Zhou
Shuyue Zhou
YSyang shen
yang shen
KLKenan Lou
Kenan Lou
RZRuihua Zhang
Ruihua Zhang
SWShuai Wang
Shuai Wang
Attention is an important field to explore the importance of each convolutional kernel channel/weight. The existing attention methods mostly use the Squeeze-and-Excitation (SE) technology to extract the global nonlinear feature vectors as the weights of corresponding feature maps. However, the pooling operators and fully-connected layers used in SE technology extract global features at the cost of much valuable information loss and the parameter amount increase. Actually, the feature map containing full information is a ready-made and better attention for other feature maps in the same layer. Simultaneously the products of feature maps will bring powerful non-linearity. Seeing this, Kernel Product (KP) technology is proposed to simply get useful nonlinear attention. To verify the effectiveness of KP, the proposed KP module is employed on Selective Kernel Networks (SKNets) to take the place of the original SE technology. The variety of SKNets is called Kernel Product Networks (KPNets) in this paper. In addition, identity mapping is used to solve the non-convergence problem in very deep neural networks. The KPNets are evaluated on ImageNet-1k, CIFAR-10, and CIFAR-100. The experiment results show that KPNets outperform many state-of-the-art methods and get a similar but more efficient performance than its SKNets with counterpart.

15 March 2024 in arXiv
Verified
Preprint
Open access
PDF file
TWTengjin Weng
Tengjin Weng
YSyang shen
yang shen
Zhidong ZhaoZhidong Zhao
Zhidong Zhao
ZCZhiming Cheng
Zhiming Cheng
SWShuai Wang
Shuai Wang
Optic disc and cup segmentation plays a crucial role in automating the screening and diagnosis of optic glaucoma. While data-driven convolutional neural networks (CNNs) show promise in this area, the inherent ambiguity of segmenting objects and background boundaries in the task of optic disc and cup segmentation leads to noisy annotations that impact model performance. To address this, we propose an innovative label-denoising method of Multiple Pseudo-labels Noise-aware Network (MPNN) for accurate optic disc and cup segmentation. Specifically, the Multiple Pseudo-labels Generation and Guided Denoising (MPGGD) module generates pseudo-labels by multiple different initialization networks trained on true labels, and the pixel-level consensus information extracted from these pseudo-labels guides to differentiate clean pixels from noisy pixels. The training framework of the MPNN is constructed by a teacher-student architecture to learn segmentation from clean pixels and noisy pixels. Particularly, such a framework adeptly leverages (i) reliable and fundamental insight from clean pixels and (ii) the supplementary knowledge within noisy pixels via multiple perturbation-based unsupervised consistency. Compared to other label-denoising methods, comprehensive experimental results on the RIGA dataset demonstrate our method's excellent performance. The code is available at https://github.com/wwwtttjjj/MPNN