scispace - formally typeset
Search or ask a question
Institution

Xidian University

EducationXi'an, China
About: Xidian University is a education organization based out in Xi'an, China. It is known for research contribution in the topics: Antenna (radio) & Synthetic aperture radar. The organization has 32099 authors who have published 38961 publications receiving 431820 citations. The organization is also known as: University of Electronic Science and Technology at Xi'an & Xīān Diànzǐ Kējì Dàxué.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, a frequency selective surface absorber (FSSA) with bandpass characteristic between two neighboring absorption bands is proposed, which is implemented by loading lumped resistors and LC resonators in the FSSA structure.
Abstract: A novel method of designing a frequency selective surface absorber (FSSA) with bandpass characteristic between two neighboring absorption bands is proposed in this letter. This method is implemented by loading lumped resistors and LC resonators in the FSSA structure. An equivalent circuit model together with an analytical design method is developed for further illustration. The performance of the FSSA structure is tested using a free-space measurement system. Experiments show a bandpass response at the center frequency of 6.74 GHz with a fractional bandwidth of 5% and two absorption bands over 3.33–6.26 and 7.09–10.36 GHz with an absorption rate of more than 80%, which indicates a good agreement with the simulation results.

119 citations

Journal ArticleDOI
TL;DR: Experimental results indicate that the proposed deblocking method is very effective in dealing with the image deblocking problem from compressed images.
Abstract: Image compression based on block-based Discrete Cosine Transform (BDCT) inevitably produces annoying blocking artifacts because each block is transformed and quantized independently. This paper proposes a new deblocking method for BDCT compressed images based on sparse representation. To remove blocking artifacts, we obtain a general dictionary from a set of training images using the K-singular value decomposition (K-SVD) algorithm, which can effectively describe the content of an image. Then, an error threshold for orthogonal matching pursuit (OMP) is automatically estimated to use the dictionary for image deblocking by the compression factor of compressed image. Consequently, blocking artifacts are significantly reduced by the obtained dictionary and the estimated error threshold. Experimental results indicate that the proposed method is very effective in dealing with the image deblocking problem from compressed images.

119 citations

Journal ArticleDOI
TL;DR: This work proposes an enhanced authentication scheme which achieves user anonymity and untraceablity in TMIS, and is a secure and efficient authentication scheme with user privacy preservation which is practical for TMIS.
Abstract: The telecare medical information system (TMIS) aims to establish telecare services and enable the public to access medical services or medical information at remote sites. Authentication and key agreement is essential to ensure data integrity, confidentiality, and availability for TMIS. Most recently, Chen et al. proposed an efficient and secure dynamic ID-based authentication scheme for TMIS, and claimed that their scheme achieves user anonymity. However, we observe that Chen et al.'s scheme achieves neither anonymity nor untraceability, and is subject to the identity guessing attack and tracking attack. In order to protect user privacy, we propose an enhanced authentication scheme which achieves user anonymity and untraceablity. It is a secure and efficient authentication scheme with user privacy preservation which is practical for TMIS.

119 citations

Journal ArticleDOI
Jie Feng1, Haipeng Yu1, Lin Wang1, Xianghai Cao1, Xiangrong Zhang1, Licheng Jiao1 
TL;DR: A novel multiclass spatial–spectral GAN (MSGAN) method is proposed that achieves encouraging classification performance compared with several state-of-the-art methods, especially with the limited training samples.
Abstract: Generative adversarial networks (GANs) are famous for generating samples by training a generator and a discriminator via an adversarial procedure. For hyperspectral image classification, the collection of samples is always difficult. However, directly applying GAN to hyperspectral image classification exists two problems. One is that the generated samples lack discriminative information. Meanwhile, the discriminator has no discriminative ability for multiclassification. Another is that spatial and spectral information requires to be considered in hyperspectral image classification simultaneously. To address these problems, a novel multiclass spatial–spectral GAN (MSGAN) method is proposed. In MSGAN, two generators are devised to generate the samples containing spatial and spectral information, respectively, and the discriminator is devised to extract joint spatial–spectral features and output multiclass probabilities. Moreover, novel adversarial objectives for multiclass are defined. The discriminator is devised to predict training samples belonging to true classes and generated samples belonging to all the classes with the same probability. The generators are devised to make the discriminator mistake. By adversarial learning between the discriminator and generators, the classification performance of the discriminator is promoted with the assistance of discriminative generated samples. Experimental results on hyperspectral images demonstrate that the proposed method achieves encouraging classification performance compared with several state-of-the-art methods, especially with the limited training samples.

119 citations

Journal ArticleDOI
Junkun Yan1, Hongwei Liu1, Bo Jiu1, Bo Chen1, Zheng Liu1, Zheng Bao1 
TL;DR: Numerical results show that the worst case tracking accuracy can be efficiently improved by the proposed simultaneous multibeam resource allocation (SMRA) algorithm.
Abstract: A colocated multiple-input multiple-output (MIMO) radar system has the ability to address multiple beam information. However, the simultaneous multibeam working mode has two finite working resources: the number of beams and the total transmit power of the multiple beams. In this scenario, a resource allocation strategy for the multibeam working mode with the task of tracking multiple targets is developed in this paper. The basis of our technique is to adjust the number of beams and their directions and the transmit power of each beam through feedback, with the purpose of improving the worst tracking performance among the multiple targets. The Bayesian Cramer–Rao lower bound (BCRLB) provides us with a lower bound on the estimated mean square error (MSE) of the target state. Hence, it is derived and utilized as an optimization criterion for the resource allocation scheme. We prove that the resulting resource optimization problem is nonconvex but can be reformulated as a set of convex problems. Therefore, optimal solutions can be obtained easily, which greatly aids real-time resource management. Numerical results show that the worst case tracking accuracy can be efficiently improved by the proposed simultaneous multibeam resource allocation (SMRA) algorithm.

119 citations


Authors

Showing all 32362 results

NameH-indexPapersCitations
Zhong Lin Wang2452529259003
Jie Zhang1784857221720
Bin Wang126222674364
Huijun Gao12168544399
Hong Wang110163351811
Jian Zhang107306469715
Guozhong Cao10469441625
Lajos Hanzo101204054380
Witold Pedrycz101176658203
Lei Liu98204151163
Qi Tian96103041010
Wei Liu96153842459
MengChu Zhou96112436969
Chunying Chen9450830110
Daniel W. C. Ho8536021429
Network Information
Related Institutions (5)
Beihang University
73.5K papers, 975.6K citations

92% related

Southeast University
79.4K papers, 1.1M citations

91% related

Harbin Institute of Technology
109.2K papers, 1.6M citations

91% related

City University of Hong Kong
60.1K papers, 1.7M citations

90% related

Nanyang Technological University
112.8K papers, 3.2M citations

90% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023117
2022529
20213,751
20203,816
20194,017
20183,382