Search

Multimodal biometric recognition has attracted more and more attention in recent years because of its security and accuracy. Compared with the single use of fingerprint or finger vein feature recognition, the multi-modal feature recognition method based on fingerprint and finger vein significantly improves the recognition performance. However, most of the multi-modal feature recognition networks have the disadvantages of large number of parameters and high training cost. In this paper, a narrow-channel lightweight network NLNet for fingerprint and finger vein recognition is proposed. The network adopts asymmetric narrow channel structure for lightweight design, and combines shallow network to improve the discriminating nature of the extracted features, which significantly reduces the model parameters and computation. In addition, a lightweight feature extraction module for building feature extraction branches is designed for NLNet. This module takes dimensional transformation feature extraction as the backbone, and the joint extension module and attention mechanism obtain low-redundancy multi-scale feature information. In terms of feature fusion, a feature fusion method based on PatchPooling is proposed. This method combines the characteristics of modal images, and uses Spatial dimension local mapping to increase the utilization rate of low-dimensional features, which effectively improves the richness of classified features. In this paper, experiments were carried out on the SDUMLA-HMT, NUPT-FPV, FVC HKP and HDPR-310 multimodal finger datasets, and the recognition accuracy was high as 97.72 %, 99.10 %, 99.67 % and 99.74 %, respectively. In addition, the effectiveness of the model is verified by comparing with other advanced methods. [ABSTRACT FROM AUTHOR]

This paper introduces a related model of membrane calculation in the defect detection and positioning of industrial components. It has the characteristics of distributed and parallel computing, and can efficiently search for better solutions in a given feature space. Inspired by the membrane clustering algorithm, this paper proposes a greedy membrane clustering algorithm and names it GMCA. GMCA is applied after the extraction of local features of normal samples. It uses a greedy strategy to construct a sub-feature set that describes the local characteristics of normal samples. During training, GMCA can learn the membrane cluster center of normal image blocks and each sub-feature within the cluster. At test time, the anomaly map is obtained by calculating the distance from the test sample block to the corresponding cluster center and the maximum distance from the cluster center to the nearest neighbor in the training sample. This solves the limitation of traditional algorithms requiring dataset alignment. In the unsupervised dataset MvTec AD, samples can be divided into object categories and texture categories according to the background of images. The pixel-level anomaly location index (AUROC) of this method on object category data reaches 98.3%. The image-level anomaly detection index (AUROC) on texture category data reaches 99.1%. • We design a computational model of membrane clustering using the evolutionary mechanisms and communicative mechanisms of cells. • GMCA has the global optimization characteristics of high accuracy and fast convergence of the membrane clustering algorithm. • GMCA has the local optimization characteristics of the greedy strategy. • GMCA solves the limitation of traditional defect detection and positioning methods that require dataset alignment. • Numerous experiments show the proposed GMCA performs competitively in industrial defect detection and location prediction. [ABSTRACT FROM AUTHOR]

The maturity of 5G technology provides a guarantee for increasingly large communication networks, while the resources required for communication and computation are also increasing, and reasonable resource allocation can improve the efficiency of network communication and reduce the consumption of communication resources. Existing deep learning methods have been able to predict network traffic to a certain extent, so as to solve the communication efficiency and resource consumption problems in the field of integrated sensing, communication and computation (ISCC) through rational resource allocation. However, the following problems still exist: (1) The feature learning ability of the prediction model is insufficient, and the prediction accuracy needs to be improved. (2) Powerful and complex deep learning methods lead to an increase in the prediction cost of the model. To address these problems, this paper proposes a deep learning method based on a lightweight hybrid attention network. In order to capture the key features of 5G data more effectively, an efficient hybrid attention mechanism (EHA) is proposed. After this attention is applied to convolution, the key information can be well enhanced. We use depthwise separable convolution in feature extraction, which greatly improves the efficiency of lightweight convolution layer (LC) in feature extraction. Combined with the efficient hybrid attention mechanism (EHA), the proposed model has better lightweight properties. Experimental results show that the model proposed in this paper has lower RMSE and MAE values on the three datasets, as well as fewer parameters and computational effort compared to the baseline scheme. [ABSTRACT FROM AUTHOR]

• The paper presents a lightweight model with satisfactory performance in complex industrial noise environments. • Data fusion using data from multiple sensors for more complete fault information. • Design a unique grayscale feature map based on IMF components to obtain multi-sensor and multi-frequency band fault features. • Design a UL-GoogLeNet lightweight fault diagnosis model based on GoogLeNet and ULSAM. As artificial intelligence and sensor technology develop rapidly, intelligent fault diagnosis methods based on deep learning are widely used in industrial production. However, in practical industrial applications, the complex noise environment affects the performance of the diagnostic model, and the huge model parameters cannot meet the requirements of low cost and high performance in industrial production. To address the above problems, this paper proposes a lightweight intelligent fault diagnosis model using multi-sensor data fusion that not only meets the lightweight requirements of "small, light, and fast", but also realizes high accuracy diagnosis in noisy environments. Firstly, the vibration signals from different sensors of rolling bearings are processed using the variational mode decomposition (VMD) to design a unique method of constructing grayscale feature maps based on each intrinsic modal function (IMF) component. Then, the ultra-lightweight GoogLeNet model (UL-GoogLeNet) is constructed to adjust the traditional GoogLeNet structure, while the Ultra-lightweight subspace attention module (ULSAM) is introduced to reduce the model parameters and enhance the feature extraction capability. UL-GoogLeNet is trained and tested by dividing the grayscale feature maps into training and testing sets to realize the intelligent recognition of different fault types in rolling bearings. Experiments are conducted on two datasets and compared with multiple methods, and the final experimental results prove the effectiveness and superiority of the proposed method in this paper. [ABSTRACT FROM AUTHOR]

Recently, deep learning methods have achieved excellent performance in single image super-resolution (SISR), but most existing methods suffer from heavy computational costs and memory storage. To address this problem, some lightweight SR methods have been proposed, among which convolutional neural network (CNN) with attention mechanisms has received increasing attention. However, the existing CNN-based lightweight network and attention mechanism still have redundancy in feature extraction and enhancement. This paper presents Efficient Self-calibrated and Hierarchical Refinement Network (ESHR) for Lightweight Super-Resolution that includes three effective designs. First, we propose a more effective feature extraction basic module called Self-calibrated Residual Block (SRB), which can achieve superior performance when replacing other common convolution modules such as traditional convolution, BSConv and DSConv. Second, we propose a more lightweight spatial attention mechanism called Squeeze-Excitation Spatial Attention (SESA), which can interact and enhance features more effectively in spatial dimensions to improve the representation ability of the model. Third, we design an Efficient Hierarchical Refinement Block (EHRB) to integrate and utilize multi-level features, which can achieve better performance than single-level refinement without increasing the number of parameters. Extensive experiments demonstrate that the proposed method outperforms state-of-the-art CNN-based methods quantitatively and qualitatively. [ABSTRACT FROM AUTHOR]

In recent years, graph convolutional networks (GCNs) have made remarkable achievements in the hyperspectral image (HSI) classification task. However, existing GCN-based methods cannot adequately encode similarity edge relationship between superpixels, and few of them use hierarchical mechanism to extract complementary features. This paper addresses these issues and proposes a hierarchical structural graph neural network with local relation enhancement (HSLRE) for HSI classification. Specifically, the features of the pixel-level graph structures are extracted and then embedded into the superpixel-level graph structure to ensure that it does not lose the fine texture features of the original HSI. Secondly, a novel hierarchical framework, which consists of multiple coarsening and refining stages, is proposed to extract multi-level features. In the first coarsening stage, the relational graph convolution (RGC) is introduced to enhance local relations and obtain discriminative features from the superpixel-level graph. In the subsequent coarsening stages, graph convolution (GC) is used to extract features. The refining stages correspond to the coarsening stages, which are used to restore the graphs to their original structures. Finally, to enhance the fluidity of feature information, the fully connected layers and two different types of graph convolutional layers are utilized to extract the linear and nonlinear features of the nodes in parallel, which are fused in a weighted way to form effective features. Experimental results on several benchmark HSI datasets illustrate the effectiveness of the HSLRE. [ABSTRACT FROM AUTHOR]

Feature extraction has a significant impact on the accuracy of Content-Based Image Retrieval (CBIR) algorithms since the content of images is encoded in feature vectors. In this paper, an effective method for texture feature extraction is proposed based on local patterns. In the proposed method, first the image is formed in different scales, then the texture features are extracted from the scales of the image. Finally, extracted features of different scales are concatenated to construct the final feature vector. To evaluate the proposed method, five datasets including Corel-1k, Brodatz, VisTex, Corel-10k, STex, Caltech256, and Oliva are used. In the evaluation process, the effect of different scales and different coding schemes on retrieval precision is investigated. The proposed method is compared with existing CBIR models based on local patterns. The proposed method achieves the best precision of 64.16%, 81.66%, 88.59%, 30.63%, and 69.63%, 13.59%, and 64.10% on the Corel-1k, Brodatz, VisTex, Corel-10k, STex, Caltech256, and Oliva datasets, respectively. [ABSTRACT FROM AUTHOR]

The work presented in this paper aims at enhancing the performance of end-to-end (E2E) speech recognition task for children's speech under low resource conditions. For majority of the languages, there is hardly any speech data from child speakers. Furthermore, even the available children's speech corpora are limited in terms of the number of hours of data. On the other hand, large amounts of adults' speech data are freely available for research as well as commercial purposes. As a consequence, developing an effective E2E automatic speech recognition (ASR) system for children becomes a very challenging task. One may develop an ASR system using adults' speech and then use it to transcribe children's data, but this leads to very poor recognition rates due to the stark differences in the acoustic attributes of adults' and children's speech. In order to overcome these hurdles and to develop a robust children's ASR system employing E2E architecture, we have resorted to several out-of-domain and in-domain data augmentation techniques. For out-of-domain data augmentation, we have explicitly modified adults' speech to render it acoustically similar to that of children's speech before pooling into training. On the other hand, in the case of in-domain data augmentation, we have slightly modified the pitch and duration of children's speech in order to create more data capturing greater diversity. Data augmentation approaches helps in mitigating the ill-effects resulting from the scarcity of data from child domain to a certain extent. This, in turn, reduces the error rates by a large margin. In addition to data augmentation, we have also studied the efficacy of Gamma-tone frequency cepstral coefficients (GFCC) and frequency domain linear prediction (FDLP) technique along with the most commonly used Mel-frequency cepstral coefficients (MFCC) for front-end speech parameterization. Both MFCC as well as GFCC capture and model the spectral envelope of speech. On the other hand, application of linear prediction on the frequency domain representation of speech signal helps to effectively capture the temporal envelope during front-end feature extraction. Employing FDLP features that model the temporal envelope provides important cues for the perception and understanding of stop bursts and, at times, complete phonemes. This motivated us to perform a comparative experimental study of the effectiveness of the three aforementioned front-end acoustic features. In our experimental explorations, the use of proposed data augmentation in combination of FDLP features has shown a relative improvement in character error rate by 67.6% over the baseline system. The combination of data augmentation with MFCC or GFCC features is observed to result in lower recognition performances. [ABSTRACT FROM AUTHOR]

Glaucoma is a prevalent eye disease that is responsible for causing blindness worldwide. To diagnose glaucoma, the cup-to-disc ratio (CDR) is an important factor. We introduce MRSNet, a novel segmentation network that incorporates encoding and decoding structures. The key innovation of this network is the application of convolutional block with large kernel convolutional attention to the task of medical image segmentation for optic cup and disc. By combining the benefits of residual and self-attention, our network achieves improved performance. The coding region of the network utilizes convolutional block with large kernel convolutional attention, enabling the extraction of multi-scale features with lower computational resources while also enhancing spatial attention. The self-attention layer acts as a transition between the encoding and decoding regions, capturing long connection information and providing additional image details. To further enhance segmentation performance, we employ a multi-resolution image combination approach and adaptively extract the input form using the compression and excitation module. Additionally, we propose a novel approach that combines the principle of consistency of deep supervision mechanisms with cross-entropy and Dice loss to guide the network towards accurate segmentation. In this study, we utilized a five-fold cross-validation method to train our network model. We then performed experimental validation and evaluation on three widely-used datasets, namely REFUGE, DRISHTI-GS, and RIM-ONE-r3. Our model achieved impressive results in the cup-to-disc ratio metric, which accurately reflects the segmentation effect. Specifically, we achieved scores of 0.0242, 0.0941, and 0.0158 for the aforementioned datasets, respectively. These scores outperformed some current classical algorithms. The experimental results demonstrate that the method proposed in this paper has the capability to extract more comprehensive information about the optic cup and disc, with the ability to generalize across different datasets. Furthermore, it shows that the convolutional block with large kernel convolutional attention module can be effectively utilized for the segmentation task of optic cup and disc. These findings provide a valuable research foundation for future researchers. [ABSTRACT FROM AUTHOR]