Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Information compensation-based panoramic image super-resolution reconstruction network
Yu FAN, Chunyi CHEN, Xiaojuan HU, Yanfeng LI, Haiyang YU, Ripei ZHANG, Yunbiao LIU
Journal of Computer Applications    2025, 45 (12): 3978-3986.   DOI: 10.11772/j.issn.1001-9081.2024111684
Abstract26)   HTML0)    PDF (3226KB)(16)       Save

Panoramic images, due to their unique projection format, suffer from severe geometric distortions. The existing 2D image super-resolution networks fail to account for the geometric distortion characteristics of panoramic images, making them unsuitable for super-resolution reconstruction of such images. Unlike 2D super-resolution networks, panoramic image super-resolution models must focus on the feature differences across different latitude regions and address issues such as insufficient feature capture at different scales and insufficient learning of contextual information. To address the above issues, an Information Compensation-based Panoramic image Super-resolution reconstruction network (ICPSnet) was proposed. Firstly, based on the geometric characteristics of panoramic images, a position awareness mechanism was introduced to calculate the position weight of each pixel in the latitude direction, thereby enhancing the model’s attention to different latitude regions. Secondly, to address the insufficient feature extraction issue at diverse scales, a Cross-Scale Collaborative Attention (CSCA) module was designed, which utilized a multi-kernel convolutional attention mechanism of different receptive fields to obtain rich cross-scale features. Additionally, to improve quality of the reconstructed image, an Information Compensation (IC) block was designed to enhance the network’s ability to learn contextual information by improving the Atrous Spatial Pyramid Pooling (ASPP). Experimental results on two benchmark datasets, ODI-SR and SUN360, show that when the amplification factor is 4 and 8, ICPSnet improves the Weighted-to-Spherically-uniform Peak Signal-to-Noise Ratio (WS-PSNR) by 0.14 dB, 0.64 dB, and 0.25 dB, 0.26 dB, respectively, compared to current state-of-the-art OSRT (Omnidirectional image Super-Resolution Transformer). It can be seen that compared to other networks, ICPSnet has superior visual performance with reconstructed images better representing the texture details of high-latitude regions.

Table and Figures | Reference | Related Articles | Metrics
Aspect sentiment triplet extraction model with multi-view linguistic features and sentiment lexicon
Zhengyue ZHANG, Juhong PENG, Zixu DING, Xinyu FAN, Changyu HU
Journal of Computer Applications    2025, 45 (12): 3779-3785.   DOI: 10.11772/j.issn.1001-9081.2024121863
Abstract53)   HTML1)    PDF (729KB)(7)       Save

In Natural Language Processing (NLP) tasks, Aspect Sentiment Triplet Extraction (ASTE) aims to identify the relationships among aspect terms, opinion terms, and sentiment polarity in text, serving as a crucial step in realizing fine-grained sentiment analysis. In current mainstream methods, end-to-end models generally suffer from insufficient understanding of linguistic features and poor handling of the sparsity in sentiment expressions, which limits models’ accuracy and robustness. At the same time, pipeline models are prone to error propagation. To address these issues, an ASTE model with Multi-View Linguistic Features and Sentiment Lexicon (MVLF-SL) was proposed. In this model, multi-view linguistic features were utilized to enhance the model’s ability to understand context and implicit semantics, while additional prior knowledge of sentiment was provided by a sentiment lexicon. Firstly, Graph Convolutional Network (GCN) was used to represent multi-view linguistic features and obtain enhanced linguistic features. Secondly, a dynamic fusion strategy was adopted to integrate the enhanced linguistic features with the sentiment lexicon. Thirdly, multi-layer GCN was employed to enhance the feature representations of aspect and opinion terms by incorporating adjacency relations and node features. Finally, a Boundary-Driven Table-Filling (BDTF) method, improved with a Biaffine Attention (BA) mechanism, was used for decoding and extracting the triplets. Experimental results on four subsets (14res, 14lap, 15res, and 16res) of the ASTE-DATA-V2 dataset show that compared with the BDTF model, MVLF-SL has the F1-scores improved by 0.57, 2.08, 2.20, and 1.74 percentage points, respectively. It can be seen that the proposed model achieves better performance in ASTE, and fully utilizes linguistic features and external sentiment knowledge.

Table and Figures | Reference | Related Articles | Metrics
Reconstruction algorithm for highly undersampled magnetic resonance images based on residual graph convolutional neural network
Xiaoyu FAN, Suzhen LIN, Yanbo WANG, Feng LIU, Dawei LI
Journal of Computer Applications    2023, 43 (4): 1261-1268.   DOI: 10.11772/j.issn.1001-9081.2022020309
Abstract503)   HTML7)    PDF (2569KB)(159)    PDF(mobile) (2309KB)(4)    Save

Magnetic Resonance Imaging (MRI) is widely used in the diagnosis of complex diseases because of its non-invasiveness and good soft tissue contrast. Due to the low speed of MRI, most of the acceleration is currently performed by highly undersampled Magnetic Resonance (MR) signals in k-space. However, the representative algorithms often have the problem of blurred details when reconstructing highly undersampled MR images. Therefore, a highly undersampled MR image reconstruction algorithm based on Residual Graph Convolutional Neural nETwork (RGCNET) was proposed. Firstly, auto-encoding technology and Graph Convolutional neural Network (GCN) were used to build a generator. Secondly, the undersampled image was input into the feature extraction (encoder) network to extract features at the bottom layer. Thirdly, the high-level features of MR images were extracted by the GCN block. Fourthly, the initial reconstructed image was generated through the decoder network. Finally, the final high-resolution reconstructed image was obtained through a dynamic game between the generator and the discriminator. Test results on FastMRI dataset show that at 10%, 20%, 30%, 40% and 50% sampling rates, compared with spatial orthogonal attention mechanism based MRI reconstruction algorithm SOGAN(Spatial Orthogonal attention Generative Adversarial Network), the proposed algorithm decreases 3.5%, 26.6%, 23.9%, 13.3% and 14.3% on Normalized Root Mean Square Error (NRMSE), increases 1.2%, 8.7%, 6.9%, 2.9% and 3.2% on Peak Signal-to-Noise Ratio (PSNR) and increases 0.8%, 2.9%, 1.5%, 0.5% and 0.5% on Structural SIMilarity (SSIM) respectively. At the same time, subjective observation also proves that the proposed algorithm can preserve more details and have more realistic visual effects.

Table and Figures | Reference | Related Articles | Metrics
Unsupervised salient object detection based on graph cut refinement and differentiable clustering
Xiaoyu LI, Tiyu FANG, Yingjie XIA, Jinping LI
Journal of Computer Applications    2021, 41 (12): 3571-3577.   DOI: 10.11772/j.issn.1001-9081.2021061054
Abstract555)   HTML12)    PDF (1317KB)(186)       Save

Concerning that the traditional saliency detection algorithm has low segmentation accuracy and the deep learning-based saliency detection algorithm has strong dependence on pixel-level manual annotation data, an unsupervised saliency object detection algorithm based on graph cut refinement and differentiable clustering was proposed. In the algorithm, the idea of “coarse” to “fine” was adopted to achieve accurate salient object detection by only using the characteristics of a single image. Firstly, Frequency-tuned algorithm was used to obtain the salient coarse image according to the color and brightness of the image itself. Then, the candidate regions of the salient object were obtained by binarization according to the image’s statistical characteristics and combination of the central priority hypothesis. After that, GrabCut algorithm based on single image for graph cut was used for segmenting the salient object finely. Finally, in order to overcome the difficulty of imprecise detection when the background was very similar to the object, the unsupervised differentiable clustering algorithm with good boundary segmentation effect was introduced to further optimize the saliency map. Experimental results show that compared with the existing seven algorithms, the optimized saliency map obtained by the proposed algorithm is closer to the ground truth, achieving an Mean Absolute Error (MAE) of 14.3% and 23.4% on ECSSD and SOD datasets, respectively.

Table and Figures | Reference | Related Articles | Metrics
Exoskeleton robot gait detection based on improved whale optimization algorithm
HE Hailin, ZHENG Jianbin, YU Fangli, YU Lie, ZHAN Enqi
Journal of Computer Applications    2019, 39 (7): 1905-1911.   DOI: 10.11772/j.issn.1001-9081.2018122474
Abstract604)      PDF (999KB)(420)       Save

In order to solve problems in traditional gait detection algorithms, such as simplification of information, low accuracy, being easy to fall into local optimum, a gait detection algorithm for exoskeleton robot called Support Vector Machine optimized by Improved Whale Optimization Algorithm (IWOA-SVM) was proposed. The selection, crossover and mutation of Genetic Algorithm (GA) were introduced to Whale Optimization Algorithm (WOA) to optimize the penalty factor and kernel parameters of Support Vector Machine (SVM), and then classification models were established by SVM with optimized parameters, expanding the search scope and reduce the probability of falling into local optimum. Firstly, the gait data was collected by using hybrid sensing technology. With the combination of plantar pressure sensor, knee joint and hip joint angle sensors, motion data of exoskeleton robot was acquired as the input of gait detection system. Then, the gait phases were divided and tagged according to the threshold method. Finally, the plantar pressure signal was integrated with hip and knee angle signals as input, and gait detection was realized by IWOA-SVM algorithm. Through the simulation experiments of six standard test functions, the results demonstrate that Improved Whale Optimization Algorithm (IWOA) is superior to GA, Particle Swarm Optimization (PSO) algorithm and WOA in robustness, optimization accuracy and convergence speed. By analyzing the gait detection results of different wearers, the accuracy is up to 98.8%, so the feasibility and practicability of the proposed algorithm in the new generation exoskeleton robot are verified. Compared with Support Vector Machine optimized by Genetic Algorithm (GA-SVM), Support Vector Machine optimized by Particle Swarm Optimization (PSO-SVM) and Support Vector Machine optimized by Whale Optimization Algorithm (WOA-SVM), the proposed algorithm has the gait detection accuracy improved by 5.33%, 2.70% and 1.44% respectively. The experimental results show that the proposed algorithm can effectively detect the gait of exoskeleton robot and realize the precise control and stable walking of exoskeleton robot.

Reference | Related Articles | Metrics
Hidden process detection technique based on memory search
He-Jun Hu Ming-Yu Fan
Journal of Computer Applications   
Abstract1735)      PDF (598KB)(1880)       Save
To research the existing hidden process detection techniques and its anti-detection techniques in Windows, a new detect method based on the memory search was brought forth and its performance was improved. This technique made use of the inherent characteristics of process to traverse the system address space for establishing integrated process list, and then detected hidden process. Experiments show that this detection method is of higher reliability, efficiency and integrity.
Related Articles | Metrics
Backoff algorithm of MAC protocol in Ad Hoc networks based on logarithmic function
XU Lei Hong-yu FANG Xiao-hui LI
Journal of Computer Applications   
Abstract1967)      PDF (583KB)(862)       Save
Based on logarithmic function, a new backoff algorithm was presented by introducing the parameter which could change with the network state, in allusion to the deficiencies of Binary Exponential Backoff algorithm of IEEE 802.11 MAC. This algorithm dynamically changed the initial value of collision window and the increasing extent of backoff by using the logarithmic function which took the numbers of network nodes as variable and reduced the probability of collision of data transmission, and the network simulations were carried out by the OPNET software. The results of simulation show that the backoff algorithm based on logarithmic function is obviously effective in improving the capability of throughput and fairness of Ad Hoc network, reducing network delay and the ratio of packet loss, and the capability of new backoff algorithm is better than that of Binary Exponential Backoff algorithm.
Related Articles | Metrics
Social network matching model using dynamic Bayesian network
WU Jun-Wei Yu Fang
Journal of Computer Applications   
Abstract1667)      PDF (443KB)(1270)       Save
In order to help a new client in the social network finding the best matching circle of social communication for itself, the Dynamic Bayesian Network (DBN) theory was introduced. The group set up by several hobbies' degrees was described as the eigenvector of the circle's property and DBNs with auxiliary information were set up for each circle using this eigenvector. The best matching result is the DBNs maximal output. Objective and subjective experiments show that this model can achieve satisfactory result for the matching task.
Related Articles | Metrics
Application of dynamic-clustering-based fitness-sharing genetic algorithm to wind vector retrieval for scatterometer
Xue-tong Xie Wen-xian Yu Li-qing Guo Yu Fang
Journal of Computer Applications   
Abstract1107)      PDF (622KB)(1193)       Save
Wind vector retrieval is the key to scatterometer data processing. The design of traditional wind vector retrieval algorithm excessively depends on the detailed distribution shape of the objective function. Taking SeaWinds as an example, according to the multiple solution problem of wind vector retrieval and its ambiguity solution property, a wind vector retrieval algorithm was designed, which was based on the dynamic clustering niche genetic algorithm. By using some Level 2A data and the corresponding Level 2B data, the algorithm was validated. The experimental results indicate that the algorithm achieves good wind field results without using any transcendental knowledge of the objective function.
Related Articles | Metrics
Research and application of a cross-platform embedded GIS data model
Wen-yu SHEN Yu Fang Chang-jun Jiang Hong-zhong Chen
Journal of Computer Applications   
Abstract1645)      PDF (917KB)(991)       Save
The types of embedded device platform become more and more diversified. In order to make GIS systems developed run on several kinds of platforms, this paper put forward a cross-platform embedded GIS data model. This model isolated the data processing part, which was irrelevant to display, and based on which, it was further divided into higher layer interface model and lower layer data engine model. This model is able to not only meet user's requirement of secondary development but also cross several operating systems and integrate several heterogeneous GIS data resources. Finally, the platform-independence of the model is certified, through the implementation of a traffic navigation system.
Related Articles | Metrics