Xin Chang

Xin Chang

Auto-generated profile, based on publicly available information

Xin Chang

Department of Electronics Information and Engineering, Xi’an Technological University, Xi’an City, P.R. China, 710032

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
20 November 2020 in IEEE Access
Verified
Journal Article
Open access
QXQinkun Xiao
Qinkun Xiao
XCXin Chang
Xin Chang
XZXue Zhang
Xue Zhang
XLXing Liu
Xing Liu
There are two basic problems in sign language recognition (SLR): (a) isolated word SLR and (b) continuous SLR. Most of the existing continuous SLR methods are extensions of the isolated word SLR methods. These methods use the isolated word SLR results as the basic module and obtain the sentence recognition results through sentence segmentation and word alignment. However, sentence segmentation and word alignment are often not accurate, resulting in a low sentence recognition accuracy. At the same time, continuous SLR usually requires strict sample labels, leading to the difficult task of manual labeling and limited training data availability. To address these challenges, this paper proposes a bidirectional spatial–temporal LSTM fusion attention network (Bi-ST-LSTM-A) for continuous SLR. This approach avoids problems such as sentence segmentation, word alignment, and tedious manual labeling. Our contributions are summarized as follows: (1) we proposed a sign language video feature representation method using a convolutional neural network (CNN) and spatial–temporal LSTM (ST-LSTM) information fusion technology; and (2) we constructed a uniform neural machine translation framework that can be used for complex continuous SLR and gesture recognition of nonspecific people in nonspecific environments. Experiments were carried out on some large continuous sign language datasets. The sign language recognition accuracy reached 81.22% on the 500 CSL dataset, 76.12% on the RWTH-PHOENIX-Weather dataset and 75.32% on the RWTH-PHOENIX-Weather-2014T dataset, thereby illustrating the effectiveness of the proposed framework.

1 February 2013
Verified
Conference Paper
Closed access
MEMasoumeh Ebrahimi
Masoumeh Ebrahimi
XCXin Chang
Xin Chang
Masoud DaneshtalabMasoud Daneshtalab
Masoud Daneshtalab
JPJuha Plosila
Juha Plosila
PLPasi Liljeberg
Pasi Liljeberg
Hannu TenhunenHannu Tenhunen
Hannu Tenhunen
Traditional methods in 3D NoCs simply use a deterministic routing algorithm to deliver packets from a source to a destination node. However, deterministic methods are unable to distribute the traffic load over the network, which results in degrading the performance. In this paper, we present a fully adaptive routing algorithm for 3D NoCs, named DyXYZ. In DyXYZ, the congestion information at the input buffer of the neighboring routers is used as congestion metric to select among the output channels. This algorithm is proven to be deadlock free by using 4, 4, and 2 virtual channels along the X, Y, and Z dimensions, respectively.

7 September 2021 in IEEE Access
Verified
Journal Article
Open access
XCXin Chang
Xin Chang
QXQinkun Xiao
Qinkun Xiao
YZYilin Zhu
Yilin Zhu
JXJielei Xiao
Jielei Xiao
At present, the theory and application of fractional-order neural networks remain in the exploratory stage. We study the asymptotic stability of fractional-order neural networks with Riemann-Liouville (R-L) derivatives. For non-delayed and delayed systems, we propose an asymptotic stability criterion based on the combination of the Lyapunov method and linear matrix inequality (LMI) method. The highlights include the following: (1) for fractional-order neural networks with time delay, the existence and uniqueness of solutions are proven by using matrix analysis theory and contraction mapping theorem, and (2) based on the unique solution, a suitable Lyapunov functional is constructed. Based on the inequality theorem and LMI method, two sets of asymptotic stability criteria for fractional-order neural networks are proven, which avoids the difficulty of solving the fractional derivative by the Leibniz law. Finally, the results are verified using numerical simulations.

1 October 2015
Verified
Conference Paper
Closed access
MDMikhael Daouri
Mikhael Daouri
FEFernando A. Escobar
Fernando A. Escobar
XCXin Chang
Xin Chang
Carlos ValderramaCarlos Valderrama
Carlos Valderrama
Branch-and-Bound (B&B) algorithms are one of the most employed techniques in optimization problems. Its complexity increases exponentially with problem size and features a challenging dynamic memory management caused by recursive processing. Most solutions focus on parallel branch evaluation in multi-core CPUs or GPUs. To the best of our knowledge, to the date, no works have employed FPGAs to implement the BB technique. In this paper, we propose a mixed hardware-software architecture to solve the Flow-Shop Scheduling Problem (FSP). We use Vivado HLS to construct a simple processing element (PE) for lower bound computation and integrate it with an ARM processor system. A Xilinx ZYNQ-7020 device is used to synthesize 10 PEs and reach an acceleration of about 5× over bare-metal execution on the same platform. In addition, we propose a pseudo-branching technique for higher computation overlapping attaining speed ups of 10.3× for a maximum problem size of 20 jobs in 20 machines.