Spatial–temporal transformer for end-to-end sign language recognitionComplex & Intelligent Systems - Tập 9 - Trang 4645-4656 - 2023
Zhenchao Cui, Wenbo Zhang, Zhaoxin Li, Zhaoqi Wang
Continuous sign language recognition (CSLR) is an essential task for communication between hearing-impaired and people without limitations, which aims at aligning low-density video sequences with high-density text sequences. The current methods for CSLR were mainly based on convolutional neural networks. However, these methods perform poorly in balancing spatial and temporal features during visual feature extraction, making them difficult to improve the accuracy of recognition. To address this issue, we designed an end-to-end CSLR network: Spatial–Temporal Transformer Network (STTN). The model encodes and decodes the sign language video as a predicted sequence that is aligned with a given text sequence. First, since the image sequences are too long for the model to handle directly, we chunk the sign language video frames, i.e., ”image to patch”, which reduces the computational complexity. Second, global features of the sign language video are modeled at the beginning of the model, and the spatial action features of the current video frame and the semantic features of consecutive frames in the temporal dimension are extracted separately, giving rise to fully extracting visual features. Finally, the model uses a simple cross-entropy loss to align video and text. We extensively evaluated the proposed network on two publicly available datasets, CSL and RWTH-PHOENIX-Weather multi-signer 2014 (PHOENIX-2014), which demonstrated the superior performance of our work in CSLR task compared to the state-of-the-art methods.
Optimization-driven distribution of relief materials in emergency disastersComplex & Intelligent Systems - Tập 9 - Trang 2249-2256 - 2021
Yan Yan, Xinyue Di, Yuanyuan Zhang
The distribution of relief materials is an important part of post-disaster emergency rescue. To meet the needs of the relief materials in the affected areas after a sudden disaster and ensure its smooth progress, an optimized dispatch model for multiple periods and multiple modes of transportation supported by the Internet of Things is established according to the characteristics of relief materials. Through the urgent production of relief materials, market procurement, and the use of inventory collection, the needs of the disaster area are met and the goal of minimizing system response time and total cost is achieved. The model is solved using CPLX software, and numerical simulation and results are analyzed using the example of the COVID-19 in Wuhan City, and the dispatching strategies are given under different disruption scenarios. The results show that the scheduling optimization method can meet the material demand of the disaster area with shorter time and lower cost compared with other methods, and can better cope with the supply interruptions that occur in post-disaster rescue.
A branch-and-price algorithm for two-echelon electric vehicle routing problemComplex & Intelligent Systems - Tập 9 Số 3 - Trang 2475-2490 - 2023
Zhiguo Wu, Juliang Zhang
AbstractMotivated by express and e-commerce companies’ distribution practices, we study a two-echelon electric vehicle routing problem. In this problem, fuel-powered vehicles are used to transport goods from a depot to intermediate facilities (satellites) in the first echelon, whereas electric vehicles, which have limited driving ranges and need to be recharged at recharging stations, are used to transfer goods from the satellites to customers in the second echelon. We model the problem as an arc flow model and decompose the model into a master problem and pricing subproblem. We propose a branch-and-price algorithm to solve it. We use column generation to solve the restricted master problem to provide lower bounds. By enumerating all the subsets of the satellites, we generate feasible columns by solving the elementary shortest path problem with resource constraints in the first echelon. Then, we design a bidirectional labeling algorithm to generate feasible routes in the second echelon. Comparing the performance of our proposed algorithm with that of CPLEX in solving a set of small-sized instances, we demonstrate the former’s effectiveness. We further assess our algorithm in solving two sets of larger scale instances. We also examine the impacts of some model parameters on the solution.
Establishment of the model on the expression and guidance of contemporary college students’ demands in the cyberspace environmentComplex & Intelligent Systems - Tập 9 - Trang 2993-3010 - 2021
Zhichao Cheng, Xinyang Liu
Faced with the most recent changes of the times, expectations of the nation and mission of universities, college students have been playing a major role in their respective university and become increasingly engaged in the development of universities and colleges. They are critical thinkers who are willing to undertake their responsibilities, and they have a strong sense of equality, legal awareness and consciousness for protecting their rights. In addition, in terms of the campus environment where they live, the needs of these college students vary from each other, and their demands for interest deserve much attention from both universities and the entire society. This paper intends to explore the status-quo of how contemporary college students’ demands are expressed, guided and handled in the cyberspace environment, and based on our analysis, we aim to put forward targeted suggestions of optimization. We have adopted the method of questionnaire survey to investigate the mechanism on the expression and guidance of contemporary college students’ demands in the cyberspace environment. By using such softwares as Excel, SPSS and Amos in our statistical analysis, we have established the model on the expression and guidance of contemporary college students’ demands in the cyberspace environment, which provides theoretical support for the endeavor of colleges and universities in this respect.
A hybrid model integrating FMEA and HFACS to assess the risk of inter-city bus accidentsComplex & Intelligent Systems - Tập 8 - Trang 2451-2470 - 2022
James J. H. Liou, Perry C. Y. Liu, Shiaw-Shyan Luo, Huai-Wei Lo, Yu-Zeng Wu
The incidence of inter-city bus accidents receives a lot of attention from the public because they often cause heavy casualties. The Human Factors Analysis and Classification System (HFACS) is the prevailing tool used for traffic accident risk assessment. However, it has several shortcomings, for example: (1) it can only identify the potential failure modes, but lacks the capability for quantitative risk assessment; (2) it neglects the severity, occurrence and detection of different failure modes; (3) it is unable to identify the degree of risk and priorities of the failure modes. This study proposes a novel hybrid model to overcome these problems. First, the HFACS is applied to enumerate the failure modes of inter-city bus operation. Second, the Z-number-based best–worst method is used to determine the weights of the risk factors based on the failure mode and effects analysis results. Then, a Z-number-based weighted aggregated sum product Assessment is utilized to calculate the degree of risk of the failure modes and the priorities for improvement. The results of this study determine the top three ranking failure modes, which are personal readiness from pre-conditions for unsafe behavior, human resources from organizational influence, and driver decision-making error from unsafe behavior. Finally, data for inter-city buses in Taiwan in a case study to illustrate the usefulness and effectiveness of the proposed model. In addition, some management implications are provided.
Linear local tangent space alignment with autoencoderComplex & Intelligent Systems - Tập 9 - Trang 6255-6268 - 2023
Ruisheng Ran, Jinping Wang, Bin Fang
Linear local tangent space alignment (LLTSA) is a classical dimensionality reduction method based on manifold. However, LLTSA and all its variants only consider the one-way mapping from high-dimensional space to low-dimensional space. The projected low-dimensional data may not accurately and effectively “represent” the original samples. This paper proposes a novel LLTSA method based on the linear autoencoder called LLTSA-AE (LLTSA with Autoencoder). The proposed LLTSA-AE is divided into two stages. The conventional process of LLTSA is viewed as the encoding stage, and the additional and important decoding stage is used to reconstruct the original data. Thus, LLTSA-AE makes the low-dimensional embedding data “represent” the original data more accurately and effectively. LLTSA-AE gets the recognition rates of 85.10, 67.45, 75.40 and 86.67% on handwritten Alphadigits, FERET, Georgia Tech. and Yale datasets, which are 9.4, 14.03, 7.35 and 12.39% higher than that of the original LLTSA respectively. Compared with some improved methods of LLTSA, it also obtains better performance. For example, on Handwritten Alphadigits dataset, compared with ALLTSA, OLLTSA, PLLTSA and WLLTSA, the recognition rates of LLTSA-AE are improved by 4.77, 3.96, 7.8 and 8.6% respectively. It shows that LLTSA-AE is an effective dimensionality reduction method.
ST-V-Net: incorporating shape prior into convolutional neural networks for proximal femur segmentationComplex & Intelligent Systems - - 2023
Chen Zhao, Joyce H. Keyak, Jian Tang, Tadashi Kaneko, Sundeep Khosla, Shreyasee Amin, Elizabeth J. Atkinson, Lan‐Juan Zhao, Michael Serou, Chaoyang Zhang, Hui Shen, Hong‐Wen Deng, Weihua Zhou
AbstractWe aim to develop a deep-learning-based method for automatic proximal femur segmentation in quantitative computed tomography (QCT) images. We proposed a spatial transformation V-Net (ST-V-Net), which contains a V-Net and a spatial transform network (STN) to extract the proximal femur from QCT images. The STN incorporates a shape prior into the segmentation network as a constraint and guidance for model training, which improves model performance and accelerates model convergence. Meanwhile, a multi-stage training strategy is adopted to fine-tune the weights of the ST-V-Net. We performed experiments using a QCT dataset which included 397 QCT subjects. During the experiments for the entire cohort and then for male and female subjects separately, 90% of the subjects were used in ten-fold stratified cross-validation for training and the rest of the subjects were used to evaluate the performance of models. In the entire cohort, the proposed model achieved a Dice similarity coefficient (DSC) of 0.9888, a sensitivity of 0.9966 and a specificity of 0.9988. Compared with V-Net, the Hausdorff distance was reduced from 9.144 to 5.917 mm, and the average surface distance was reduced from 0.012 to 0.009 mm using the proposed ST-V-Net. Quantitative evaluation demonstrated excellent performance of the proposed ST-V-Net for automatic proximal femur segmentation in QCT images. In addition, the proposed ST-V-Net sheds light on incorporating shape prior to segmentation to further improve the model performance.
Học tập chủ động rộng rãi với tiến hóa đa mục tiêu cho phân loại dữ liệu dòng Dịch bởi AI Complex & Intelligent Systems - - Trang 1-18 - 2023
Jian Cheng, Zhiji Zheng, Yinan Guo, Jiayang Pu, Shengxiang Yang
Trong một môi trường phát trực tuyến, các đặc điểm và nhãn của các phiên bản có thể thay đổi theo thời gian, tạo thành các biến đổi khái niệm. Các nghiên cứu trước đây về học tập dòng dữ liệu thường giả định rằng nhãn thật của mỗi phiên bản có sẵn hoặc dễ dàng thu được, điều này không thực tế trong nhiều ứng dụng thực tiễn do chi phí thời gian và lao động tốn kém cho việc gán nhãn. Để giải quyết vấn đề này, một phương pháp học tập chủ động rộng rãi dựa trên tối ưu hóa tiến hóa đa mục tiêu được trình bày để phân loại dòng dữ liệu không tĩnh. Mỗi phiên bản mới đến tại mỗi bước thời gian sẽ được lưu trữ vào một khối theo thứ tự. Khi khối đầy đủ, phân bố dữ liệu của nó sẽ được so sánh với các phân bố trước đó thông qua phát hiện biến đổi cấp địa phương nhanh chóng để tìm kiếm biến đổi khái niệm tiềm năng. Với việc tính đến sự đa dạng của các phiên bản và sự liên quan của chúng tới khái niệm mới, một thuật toán tiến hóa đa mục tiêu được giới thiệu để tìm kiếm các phiên bản ứng cử viên có giá trị nhất. Trong số đó, các phiên bản đại diện được chọn ngẫu nhiên để truy vấn nhãn thật của chúng, và sau đó cập nhật mô hình học tập rộng rãi cho việc thích ứng với biến đổi. Đặc biệt, số lượng các phiên bản đại diện được xác định bởi sự ổn định của các khối lịch sử liền kề. Kết quả thực nghiệm cho 7 tập dữ liệu tổng hợp và 5 tập dữ liệu thực tế cho thấy phương pháp đề xuất vượt trội hơn năm phương pháp tiên tiến nhất về độ chính xác phân loại và chi phí gán nhãn nhờ vào việc xác định chính xác các vùng biến đổi và ngân sách gán nhãn được điều chỉnh linh hoạt.
#học tập dòng dữ liệu #biến đổi khái niệm #tối ưu hóa tiến hóa #phân loại dữ liệu #mô hình học tập chủ động
FF-RRT*: a sampling-improved path planning algorithm for mobile robots against concave cavity obstacleComplex & Intelligent Systems - Tập 9 - Trang 7249-7267 - 2023
Jiping Cong, Jianbo Hu, Yingyang Wang, Zihou He, Linxiao Han, Maoyu Su
The slow convergence rate and large cost of the initial solution limit the performance of rapidly exploring random tree star (RRT*). To address this issue, this paper proposes a modified RRT* algorithm (defined as FF-RRT*) that creates an optimal initial solution with a fast convergence rate. An improved hybrid sampling method is proposed to speed up the convergence rate by decreasing the iterations and overcoming the application limitation of the original hybrid sampling method towards concave cavity obstacle. The improved hybrid sampling method combines the goal bias sampling strategy and random sampling strategy, which requires a few searching time, resulting in a faster convergence rate than the existing method. Then, a parent node is created for the sampling node to optimize the path. Finally, the performance of FF-RRT* is validated in four simulation environments and compared with the other algorithms. The FF-RRT* shortens 32% of the convergence time in complex maze environment and 25% of the convergence time in simple maze environment compared to F-RRT*. And in a complex maze with a concave cavity obstacle, the average convergence time of Fast-RRT* in this environment is 134% more than the complex maze environment compared to 12% with F-RRT* and 34% with FF-RRT*. The simulation results show that FF-RRT* possesses superior performance compared to the other algorithms, and also fits with a much more complex environment.
Towards an assessment framework of reuse: a knowledge-level analysis approachComplex & Intelligent Systems - Tập 6 - Trang 87-95 - 2019
Ghassan Beydoun, Achim Hoffmann, Rafael Valencia Garcia, Jun Shen, Asif Gill
The process of assessing the suitability of reuse of a software component is complex. Indeed, software systems are typically developed as an assembly of existing components. The complexity of the assessment process is due to lack of clarity on how to compare the cost of adaptation of an existing component versus the cost of developing it from scratch. Indeed, often pursuit of reuse can lead to excessive rework and adaptation, or developing suites of components that often get neglected. This paper is an important step towards modelling the complex reuse assessment process. To assess the success factors that can underpin reuse, we analyze the cognitive factors that belie developers’ behavior during their decision-making when attempting to reuse. This analysis is the first building block of a broader aim to synthesize a framework to institute activities during the software development lifecycle to support reuse.