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) & Computer science. 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: This paper takes a low-rank approach toward SSC and provides a conceptually simple interpretation from a bilateral variance estimation perspective, namely that singular-value decomposition of similar packed patches can be viewed as pooling both local and nonlocal information for estimating signal variances.
Abstract: Simultaneous sparse coding (SSC) or nonlocal image representation has shown great potential in various low-level vision tasks, leading to several state-of-the-art image restoration techniques, including BM3D and LSSC. However, it still lacks a physically plausible explanation about why SSC is a better model than conventional sparse coding for the class of natural images. Meanwhile, the problem of sparsity optimization, especially when tangled with dictionary learning, is computationally difficult to solve. In this paper, we take a low-rank approach toward SSC and provide a conceptually simple interpretation from a bilateral variance estimation perspective, namely that singular-value decomposition of similar packed patches can be viewed as pooling both local and nonlocal information for estimating signal variances. Such perspective inspires us to develop a new class of image restoration algorithms called spatially adaptive iterative singular-value thresholding (SAIST). For noise data, SAIST generalizes the celebrated BayesShrink from local to nonlocal models; for incomplete data, SAIST extends previous deterministic annealing-based solution to sparsity optimization through incorporating the idea of dictionary learning. In addition to conceptual simplicity and computational efficiency, SAIST has achieved highly competent (often better) objective performance compared to several state-of-the-art methods in image denoising and completion experiments. Our subjective quality results compare favorably with those obtained by existing techniques, especially at high noise levels and with a large amount of missing data.

630 citations

Journal ArticleDOI
TL;DR: A comprehensive survey of available D2D related research works ranging from technical papers to experimental prototypes to standard activities is provided, and some open research problems which deserve further studies are outlined.
Abstract: Among the LTE-A communication techniques, Device-to-Device (D2D) communication which is defined to directly route data traffic between spatially closely located mobile user equipments (UEs), holds great promise in improving energy efficiency, throughput, delay, as well as spectrum efficiency As a combination of ad-hoc and centralized communication mechanisms, D2D communication enables researchers to merge together the long-term development achievements in previously disjoint domains of ad-hoc networking and centralized networking To help researchers to have a systematic understanding of the emerging D2D communication, we provide in this paper a comprehensive survey of available D2D related research works ranging from technical papers to experimental prototypes to standard activities, and outline some open research problems which deserve further studies

613 citations

Journal ArticleDOI
TL;DR: It is proved that WNNP is equivalent to a standard quadratic programming problem with linear constrains, which facilitates solving the original problem with off-the-shelf convex optimization solvers and presents an automatic weight setting method, which greatly facilitates the practical implementation of WNNM.
Abstract: As a convex relaxation of the rank minimization model, the nuclear norm minimization (NNM) problem has been attracting significant research interest in recent years. The standard NNM regularizes each singular value equally, composing an easily calculated convex norm. However, this restricts its capability and flexibility in dealing with many practical problems, where the singular values have clear physical meanings and should be treated differently. In this paper we study the weighted nuclear norm minimization (WNNM) problem, which adaptively assigns weights on different singular values. As the key step of solving general WNNM models, the theoretical properties of the weighted nuclear norm proximal (WNNP) operator are investigated. Albeit nonconvex, we prove that WNNP is equivalent to a standard quadratic programming problem with linear constrains, which facilitates solving the original problem with off-the-shelf convex optimization solvers. In particular, when the weights are sorted in a non-descending order, its optimal solution can be easily obtained in closed-form. With WNNP, the solving strategies for multiple extensions of WNNM, including robust PCA and matrix completion, can be readily constructed under the alternating direction method of multipliers paradigm. Furthermore, inspired by the reweighted sparse coding scheme, we present an automatic weight setting method, which greatly facilitates the practical implementation of WNNM. The proposed WNNM methods achieve state-of-the-art performance in typical low level vision tasks, including image denoising, background subtraction and image inpainting.

608 citations

Journal ArticleDOI
TL;DR: A novel image fusion algorithm based on the nonsubsampled contourlet transform (NSCT) is proposed, aiming at solving the fusion problem of multifocus images, and significantly outperforms the traditional discrete wavelets transform-based and the discrete wavelet frame transform- based image fusion methods.

593 citations

Journal ArticleDOI
TL;DR: The capability of a deep convolutional neural network (CNN) combined with three types of data augmentation operations in SAR target recognition is investigated, showing that it is a practical approach for target recognition in challenging conditions of target translation, random speckle noise, and missing pose.
Abstract: Many methods have been proposed to improve the performance of synthetic aperture radar (SAR) target recognition but seldom consider the issues in real-world recognition systems, such as the invariance under target translation, the invariance under speckle variation in different observations, and the tolerance of pose missing in training data. In this letter, we investigate the capability of a deep convolutional neural network (CNN) combined with three types of data augmentation operations in SAR target recognition. Experimental results demonstrate the effectiveness and efficiency of the proposed method. The best performance is obtained by using the CNN trained by all types of augmentation operations, showing that it is a practical approach for target recognition in challenging conditions of target translation, random speckle noise, and missing pose.

582 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,817
20194,017
20183,382