Xi'an Jiaotong University

About: Xi'an Jiaotong University is a education organization based out in Xi'an, China. It is known for research contribution in the topics: Heat transfer & Dielectric. The organization has 85440 authors who have published 99682 publications receiving 1579683 citations. The organization is also known as: '''Xi'an Jiaotong University''' & Xi'an Jiao Tong University.

Block-Row Sparse Multiview Multilabel Learning for Image Classification

Abstract: In image analysis, the images are often represented by multiple visual features (also known as multiview features), that aim to better interpret them for achieving remarkable performance of the learning. Since the processes of feature extraction on each view are separated, the multiple visual features of images may include overlap, noise, and redundancy. Thus, learning with all the derived views of the data could decrease the effectiveness. To address this, this paper simultaneously conducts a hierarchical feature selection and a multiview multilabel (MVML) learning for multiview image classification, via embedding a proposed a new block-row regularizer into the MVML framework. The block-row regularizer concatenating a Frobenius norm ( ${F}$ -norm) regularizer and an $\boldsymbol {\ell }_{\textbf {2,1}}$ -norm regularizer is designed to conduct a hierarchical feature selection, in which the ${F}$ -norm regularizer is used to conduct a high-level feature selection for selecting the informative views (i.e., discarding the uninformative views) and the $\boldsymbol {\ell }_{\textbf {2,1}}$ -norm regularizer is then used to conduct a low-level feature selection on the informative views. The rationale of the use of a block-row regularizer is to avoid the issue of the over-fitting (via the block-row regularizer), to remove redundant views and to preserve the natural group structures of data (via the ${F}$ -norm regularizer), and to remove noisy features (the $\boldsymbol {\ell }_{\textbf {2,1}}$ -norm regularizer), respectively. We further devise a computationally efficient algorithm to optimize the derived objective function and also theoretically prove the convergence of the proposed optimization method. Finally, the results on real image datasets show that the proposed method outperforms two baseline algorithms and three state-of-the-art algorithms in terms of classification performance.

Modified HSS iteration methods for a class of complex symmetric linear systems

Abstract: In this paper, we introduce and analyze a modification of the Hermitian and skew-Hermitian splitting iteration method for solving a broad class of complex symmetric linear systems. We show that the modified Hermitian and skew-Hermitian splitting (MHSS) iteration method is unconditionally convergent. Each iteration of this method requires the solution of two linear systems with real symmetric positive definite coefficient matrices. These two systems can be solved inexactly. We consider acceleration of the MHSS iteration by Krylov subspace methods. Numerical experiments on a few model problems are used to illustrate the performance of the new method.