Sort:
Open Access Research Article Issue
CF-DAN: Facial-expression recognition based on cross-fusion dual-attention network
Computational Visual Media 2024, 10(3): 593-608
Published: 08 February 2024
Abstract PDF (5.7 MB) Collect
Downloads:20

Recently, facial-expression recognition (FER) has primarily focused on images in the wild, including factors such as face occlusion and image blurring, rather than laboratory images. Complex field environments have introduced new challenges to FER. To address these challenges, this study proposes a cross-fusion dual-attention network. The network comprises three parts: (1) a cross-fusion grouped dual-attention mechanism to refine local features and obtain global information; (2) a proposed C2 activation function construction method, which is a piecewise cubic polynomial with three degrees of freedom, requiring less computation with improved flexibility and recognition abilities, which can better address slow running speeds and neuron inactivation problems; and (3) a closed-loop operation between the self-attention distillation process and residual connections to suppress redundant information and improve the generalization ability of the model. The recognition accuracies on the RAF-DB, FERPlus, and AffectNet datasets were 92.78%, 92.02%, and 63.58%, respectively. Experiments show that this model can provide more effective solutions for FER tasks.

Regular Paper Issue
Quasi-Developable B-Spline Surface Design with Control Rulings
Journal of Computer Science and Technology 2022, 37(5): 1221-1238
Published: 30 September 2022
Abstract Collect

We propose a method for generating a ruled B-spline surface fitting to a sequence of pre-defined ruling lines and the generated surface is required to be as developable as possible. Specifically, the terminal ruling lines are treated as hard constraints. Different from existing methods that compute a quasi-developable surface from two boundary curves and cannot achieve explicit ruling control, our method controls ruling lines in an intuitive way and serves as an effective tool for computing quasi-developable surfaces from freely-designed rulings. We treat this problem from the point of view of numerical optimization and solve for surfaces meeting the distance error tolerance allowed in applications. The performance and the efficacy of the proposed method are demonstrated by the experiments on a variety of models including an application of the method for the path planning in 5-axis computer numerical control (CNC) flank milling.

Open Access Research Article Issue
Improved fuzzy clustering for image segmentation based on a low-rank prior
Computational Visual Media 2021, 7(4): 513-528
Published: 05 August 2021
Abstract PDF (23.9 MB) Collect
Downloads:55

Image segmentation is a basic problem in medical image analysis and useful for disease diagnosis. However, the complexity of medical images makes image segmentation difficult. In recent decades, fuzzy clustering algorithms have been preferred due to their simplicity and efficiency. However, they are sensitive to noise. To solve this problem, many algorithms using non-local information have been proposed, which perform well but are inefficient. This paper proposes an improved fuzzy clustering algorithm utilizing non-local self-similarity and a low-rank prior for image segmentation. Firstly, cluster centers are initialized based on peak detection. Then, a pixel correlation model between corresponding pixels is constructed, and similar pixel sets are retrieved. To improve efficiency and robustness, the proposed algorithm uses a novel objective function combining non-local information and a low-rank prior. Experiments on synthetic images and medical images illustrate that the algorithm can improve efficiency greatly while achieving satisfactory results.

Open Access Research Article Issue
Image smoothing based on global sparsity decomposition and a variable parameter
Computational Visual Media 2021, 7(4): 483-497
Published: 17 May 2021
Abstract PDF (29.6 MB) Collect
Downloads:50

Smoothing images, especially with rich texture, is an important problem in computer vision. Obtaining an ideal result is difficult due to complexity, irregularity, and anisotropicity of the texture. Besides, some properties are shared by the texture and the structure in an image. It is a hard compromise to retain structure and simultaneously remove texture. To create an ideal algorithm for image smoothing, we face three problems. For images with rich textures, the smoothing effect should be enhanced. We should overcome inconsistency of smoothing results in different parts of the image. It is necessary to create a method to evaluate the smoothing effect. We apply texture pre-removal based on global sparse decomposition with a variable smoothing parameter to solve the first two problems. A parametric surface constructed by an improved Bessel method is used to determine the smoothing parameter. Three evaluation measures: edge integrity rate, texture removal rate, and gradient value distribution are proposed to cope with the third problem. We use the alternating direction method of multipliers to complete the whole algorithm and obtain the results. Experiments show that our algorithm is better than existing algorithms both visually and quantitatively. We also demonstrate our method’s ability in other applications such as clip-art compression artifact removal and content-aware image manipulation.

Open Access Research Article Issue
Kernel-blending connection approximated by a neural network for image classification
Computational Visual Media 2020, 6(4): 467-476
Published: 14 September 2020
Abstract PDF (706.1 KB) Collect
Downloads:50

This paper proposes a kernel-blending connection approximated by a neural network (KBNN) for image classification. A kernel mapping connection structure, guaranteed by the function approximation theorem, is devised to blend feature extraction and feature classification through neural network learning. First, a feature extractor learns features from the raw images. Next, an automatically constructed kernel mapping connection maps the feature vectors into a feature space. Finally, a linear classifier is used as an output layer of the neural network to provide classification results. Furthermore, a novel loss function involving a cross-entropy loss and a hinge loss is proposed to improve the generalizability of the neural network. Experimental results on three well-known image datasets illustrate that the proposed method has good classification accuracy and generalizability.

Regular Paper Issue
Two-Stream Temporal Convolutional Networks for Skeleton-Based Human Action Recognition
Journal of Computer Science and Technology 2020, 35(3): 538-550
Published: 29 May 2020
Abstract Collect

With the growing popularity of somatosensory interaction devices, human action recognition is becoming attractive in many application scenarios. Skeleton-based action recognition is effective because the skeleton can represent the position and the structure of key points of the human body. In this paper, we leverage spatiotemporal vectors between skeleton sequences as input feature representation of the network, which is more sensitive to changes of the human skeleton compared with representations based on distance and angle features. In addition, we redesign residual blocks that have different strides in the depth of the network to improve the processing ability of the temporal convolutional networks (TCNs) for long time dependent actions. In this work, we propose the two-stream temporal convolutional networks (TS-TCNs) that take full advantage of the inter-frame vector feature and the intra-frame vector feature of skeleton sequences in the spatiotemporal representations. The framework can integrate different feature representations of skeleton sequences so that the two feature representations can make up for each other’s shortcomings. The fusion loss function is used to supervise the training parameters of the two branch networks. Experiments on public datasets show that our network achieves superior performance and attains an improvement of 1.2% over the recent GCN-based (BGC-LSTM) method on the NTU RGB+D dataset.

Regular Paper Issue
Single Image Super-Resolution via Dynamic Lightweight Database with Local-Feature Based Interpolation
Journal of Computer Science and Technology 2019, 34(3): 537-549
Published: 10 May 2019
Abstract Collect

Single image super-resolution is devoted to generating a high-resolution image from a low-resolution one, which has been a research hotspot for its significant applications. A novel method that is totally based on the single input image itself is proposed in this paper. Firstly, a local-feature based interpolation method where both edge pixel property and location information are taken into consideration is presented to obtain a better initialization. Then, a dynamic lightweight database of self-examples is built with the aid of our in-depth study on self-similarity, from which adaptive linear regressions are learned to directly map the low-resolution patch into its high-resolution version. Furthermore, a gradually upscaling strategy accompanied by iterative optimization is employed to enhance the consistency at each step. Even without any external information, extensive experimental comparisons with state-of-the-art methods on standard benchmarks demonstrate the competitive performance of the proposed scheme in both visual effect and objective evaluation.

Regular Paper Issue
Image Smoothing Based on Image Decomposition and Sparse High Frequency Gradient
Journal of Computer Science and Technology 2018, 33(3): 502-510
Published: 11 May 2018
Abstract Collect

Image smoothing is a crucial image processing topic and has wide applications. For images with rich texture, most of the existing image smoothing methods are difficult to obtain significant texture removal performance because texture containing obvious edges and large gradient changes is easy to be preserved as the main edges. In this paper, we propose a novel framework (DSHFG) for image smoothing combined with the constraint of sparse high frequency gradient for texture images. First, we decompose the image into two components: a smooth component (constant component) and a non-smooth (high frequency) component. Second, we remove the non-smooth component containing high frequency gradient and smooth the other component combining with the constraint of sparse high frequency gradient. Experimental results demonstrate the proposed method is more competitive on efficiently texture removing than the state-of-the-art methods. What is more, our approach has a variety of applications including edge detection, detail magnification, image abstraction, and image composition.

Open Access Research Article Issue
High-resolution images based on directional fusion of gradient
Computational Visual Media 2016, 2(1): 31-43
Published: 01 March 2016
Abstract PDF (6.5 MB) Collect
Downloads:44

This paper proposes a novel method for image magnification by exploiting the property that the intensity of an image varies along the direction of the gradient very quickly. It aims to maintain sharp edges and clear details. The proposed method first calculates the gradient of the low-resolution image by fitting a surface with quadratic polynomial precision. Then, bicubic interpolation is used to obtain initial gradients of the high-resolution (HR) image. The initial gradients are readjusted to find the constrained gradients of the HR image, according to spatial correlations between gradients within a local window. To generate an HR image with high precision, a linear surface weighted by the projection length in the gradient direction is constructed. Each pixel in the HR image is determined by the linear surface. Experimental results demonstrate that our method visually improves the quality of the magnified image. It particularly avoids making jagged edges and bluring during magnification.

Total 9