Redundancy Problem Research Articles

Splicable random windowing row selection circuit for large array CMOS image sensor

This paper presents a splicable random window row selection circuit applied to large array CMOS image sensors (CIS) for exposure and readout of certain pixel rows in large array CIS. The row selection circuit consists of coarse decoding and fine decoding circuits, utilizing two-stage address selection operations for precise row selection. The coarse decoding address is used to enable the splicing module of the large array CIS, while the fine decoding address is used to enable a specific row in the selected splicing module. This solves the problem of output redundancy caused by the same row address bits in different splicing blocks in the large array CIS. The paper introduces an improved bilateral driving technique, reducing the transmission delay to 1/4 of single-sided driving while ensuring timing consistency with coarse decoding circuits. This technique is applied to large arrays of CIS with dimensions of 8520 × 9448, successfully realizing the random window function.

Document-Level Relation Extraction with Deep Gated Graph Reasoning

Extracting the relations of two entities on the sentence-level has drawn increasing attention in recent years but remains facing great challenges on document-level, due to the inherent difficulty in recognizing the relations of two entities across multiple sentences. Previous works show that employing the graph convolutional neural network can help the model capture unstructured dependent information of entities. However, they usually employed the non-adaptive weight edges to build the correlation weight matrix which suffered from the problem of information redundancy and gradient disappearance. To solve this problem, we propose a deep gated graph reasoning model for document-level relation extraction, namely, BERT-GGNNs, which employ an improved gated graph neural network with a learnable correlation weight matrix to establish multiple deep gated graph reason layers. The proposed deep gated graph reasoning layers make the model easier to reasoning the relations between entities hidden in the document. Experiments show that the proposed model outperforms most of strong baseline models, and our proposed model is 0.3% and 0.3% higher than the famous LSR-BERT model on the F1 and Ing F1, respectively.

Joint Extraction of Entities and Relations Based on Multi-feature Fusion

Joint extraction of entities and relations is essential for understanding massive text corpora. In recent years, the span-based joint models have achieved excellent results in the entity and relation extraction task. However, the previous literature and experimental results suggest that the usage of span-based method in entity and relation extraction may produce more redundant entities, although it can solve the overlapping problem of entities. In order to solve the problem of entity redundancy, this paper proposes a joint extraction model based on multi-feature fusion. The overall network follows the framework as SpERT, which is the state-of-the-art model for joint entity and relation extraction. In addition to the word embedding features in SpERT, the proposed model also considers the part-of-speech features. We believe that the part-of-speech features in entities are helpful for entity recognition and can effectively alleviate the entity redundancy problem. The proposed model is evaluated on two public data sets, CoNLL04 and ADE. The experimental results show that the proposed joint extraction model based on multi-feature fusion significantly outperforms current state-of-the-art methods.

A unified study of the redundant control input problem with different conditions in the stabilizable case

This paper investigates the redundant control input problem in the sense of linear quadratic regulator optimal control. Increasing redundant control inputs leads to a decrease in the quadratic performance index. However, in some cases, this also increases the norm of the feedback matrix, resulting in actuator saturation. To solve the problem, a comparative analysis of the latest research results on the redundant control input problem under different conditions is first presented. Secondly, new tighter upper bounds of the positive (semi-)definite solution of the continuous algebraic Riccati equation (CARE) corresponding to the redundant control input problem are studied uniformly in the stabilizable case. Thirdly, based on them, a class of sufficient conditions to guarantee that the norm of the feedback matrix decreases is presented. Finally, numerical experiments demonstrate the effectiveness and superiority of our conclusions. Meanwhile, a simulation experiment demonstrates that systems with redundant control inputs can achieve good control performance.

A Deep Learning Method for Building Extraction from Remote Sensing Images by Fuzing Local and Global Features

As important disaster-bearing bodies, buildings are the focus of attention in seismic disaster risk assessment and emergency rescue. It is of great practical significance to extract buildings quickly and accurately with complex textures and variable scales and shapes from high-resolution remote sensing images. We proposed an improved TransUnet model based on multiscale grouped convolution and attention named MATUnet to retain more local detail features and enhance the representation ability of global features, while reducing the network parameters. We designed the multiscale grouped convolutional feature extraction module with attention (GAM) to enhance the representation of detailed features. The convolutional positional encoding module (PEG) was added to redetermine the number of transformer, it solved the problem of local feature information loss and the difficulty of convergence of the network. The channel attention module (CAM) of the decoder enhanced the salient information of the features and solved the problem of information redundancy after feature fusion. We experimented through MATUnet on the WHU building dataset and Massachusetts dataset. MATUnet achieved the best IOU results of 92.14% and 83.22%, respectively, and achieved better than the other generalized and state-of-the-art networks under the same conditions. We also have achieved good segmentation results on the GF2 Xichang building dataset.

UnifiedTT: Visual tracking with unified transformer

Target tracking is an important research task in computer vision. Existing tracking algorithms based on Siamese networks often suffer from the problem of information redundancy between adjacent frames and a lack of ability to capture global dependencies. When similar backgrounds appear around the target, the tracking performance usually significantly decreases. Although target tracking algorithms based on deep convolution and the Transformer have partially addressed these issues, achieving a good balance between the two remains a challenge. In this work, we propose a unified convolution and self-attention Siamese network for target tracking. By utilizing a feature extraction backbone network based on integrated convolution and self-attention styles, we are able to capture globally important regions and key frames while greatly reducing local redundant computations, thereby improving tracking performance. We apply this approach to the task of target tracking and enhance the feature extraction capabilities of both the target template and search template. Experimental results show that our proposed tracking algorithm outperforms some recent classical tracking algorithms, especially achieving improvements of 10.7 % on the high-diversity dataset GOT-10K and 24.7 % on the large-scale and high-quality LaSOT dataset.

Classification of EMG signals with CNN features and voting ensemble classifier

Electromyography (EMG) signals are primarily used to control prosthetic hands. Classifying hand gestures efficiently with EMG signals presents numerous challenges. In addition to overcoming these challenges, a successful combination of feature extraction and classification approaches will improve classification accuracy. In the current work, convolutional neural network (CNN) features are used to reduce the redundancy problems associated with time and frequency domain features to improve classification accuracy. The features from the EMG signal are extracted using a CNN and are fed to the ‘k’ nearest neighbor (KNN) classifier with a different number of neighbors ( 1 N N , 3 N N , 5 N N , and 7 N N ) . It results in an ensemble of classifiers that are combined using a hard voting-based classifier. Based on the benchmark Ninapro DB4 database and CapgMyo database, the proposed framework obtained 91.3 % classification accuracy on CapgMyo and 89.5 % on Ninapro DB4.

Research on Mushroom Image Classification Algorithm Based on Deep Sparse Dictionary Learning

The traditional mushroom feature extraction method has low classification efficiency and unsatisfactory effect. Dictionary learning is widely used in image classification. However, the previous work is to learn dictionaries in the original space, which limits the performance of sparse representation classification. In order to solve the problem of spatial redundancy in traditional convolutional neural networks and the weak performance of deep learning in small samples, an improved dictionary learning algorithm, Deep Sparse Dictionary learning (DSDL), is proposed. The input to DSDL is not a matrix gathered from the original grayscale image or a hand-created feature, but rather a relatively deeper feature extraction via a stack autoencoder. Then, a structured dictionary is designed to reconstruct the deep features according to different categories of distinguishing features. In addition, it is necessary to learn the associated structured projection sparse dictionary to ensure that the decoder updates in the direction of the deconvolution operator error is minimal. By utilizing sparse dictionary learning loss functions and autoencoder loss functions, DSDL can simultaneously learn deep latent features and corresponding dictionary pairs. In the testing phase of DSDL, the minimum errors of deep feature and structured projection components for different classes can be directly represented by basic matrix multiplication operations. Experimental results show that the proposed method achieves a good classification effect on mushroom images, which shows the effectiveness of the method.

Efficient Defect Detection of Rotating Goods under the Background of Intelligent Retail.

Dynamic visual vending machines are rapidly growing in popularity, offering convenience and speed to customers. However, there is a prevalent issue with consumers damaging goods and then returning them to the machine, severely affecting business interests. This paper addresses the issue from the standpoint of defect detection. Although existing industrial defect detection algorithms, such as PatchCore, perform well, they face challenges, including handling goods in various orientations, detection speeds that do not meet real-time monitoring requirements, and complex backgrounds that hinder detection accuracy. These challenges hinder their application in dynamic vending environments. It is crucial to note that efficient visual features play a vital role in memory banks, yet current memory repositories for industrial inspection algorithms do not adequately address the problem of location-specific feature redundancy. To tackle these issues, this paper introduces a novel defect detection algorithm for goods using adaptive subsampling and partitioned memory banks. Firstly, Grad-CAM is utilized to extract deep features, which, in combination with shallow features, mitigate the impact of complex backgrounds on detection accuracy. Next, graph convolutional networks extract rotationally invariant features. The adaptive subsampling partitioned memory bank is then employed to store features of non-defective goods, which reduces memory consumption and enhances training speed. Experimental results on the MVTec AD dataset demonstrate that the proposed algorithm achieves a marked improvement in detection speed while maintaining accuracy that is comparable to state-of-the-art models.

Hybrid feature selection model for accurate wind speed forecasting from numerical weather prediction dataset

The accurate weather prediction in a localized area is obtained as a challenging role and the exact determination of Wind Speed Forecasting (WSF) is suitable for better power generation and production process. However, the Numerical Weather Prediction (NWP) is a significant model to gather information on surface flows and determine the raw data. But it contains issues such as instability, noise, and irregularity that provide a complex situation in the classification process. So Speedy Correlation-based Filtering-Enhanced Adaptive Sparrow Search Wrapper Algorithm (SCEASS-WA) is proposed to assess the problems of redundancy and correlation. Moreover, the Hybrid Feature Selection Method (HFSM) model is employed in the proposed method to control the noise from the extracted features. In SCEASS, the filter model Speedy Correlation Based Filtering (SCBF) based on Symmetrical Uncertainty (SU) is mainly presented to assess the noise. Also, the Wrapper Method (WM) is determined to improve the adaptation of the Sparrow Search Algorithm (SSA) to update the position for better outcomes. Furthermore, the filter methods are varied frequently by obtaining Damping Harmonic Oscillation Theory (DHOT) that discovered the superior feature subset. Also, the high dimensional datasets are employed that are compared with existing methods to show the superiority of the model. The experimentation results revealed that the proposed method attained a better prediction of weather and enhanced the accuracy forecast.

An optimization method for wireless sensor networks coverage based on genetic algorithm and reinforced whale algorithm.

In response to the problem of coverage redundancy and coverage holes caused by the random deployment of nodes in wireless sensor networks (WSN), a WSN coverage optimization method called GARWOA is proposed, which combines the genetic algorithm (GA) and reinforced whale optimization algorithm (RWOA) to balance global search and local development performance. First, the population is initialized using sine map and piecewise linear chaotic map (SPM) to distribute it more evenly in the search space. Secondly, a non-linear improvement is made to the linear control factor 'a' in the whale optimization algorithm (WOA) to enhance the efficiency of algorithm exploration and development. Finally, a Levy flight mechanism is introduced to improve the algorithm's tendency to fall into local optima and premature convergence phenomena. Simulation experiments indicate that among the 10 standard test functions, GARWOA outperforms other algorithms with better optimization ability. In three coverage experiments, the coverage ratio of GARWOA is 95.73, 98.15, and 99.34%, which is 3.27, 2.32 and 0.87% higher than mutant grey wolf optimizer (MuGWO), respectively.

SWFormer: Stochastic Windows Convolutional Transformer for Hybrid Modality Hyperspectral Classification.

Joint classification of hyperspectral images with hybrid modality can significantly enhance interpretation potentials, particularly when elevation information from the LiDAR sensor is integrated for outstanding performance. Recently, the transformer architecture was introduced to the HSI and LiDAR classification task, which has been verified as highly efficient. However, the existing naive transformer architectures suffer from two main drawbacks: 1) Inadequacy extraction for local spatial information and multi-scale information from HSI simultaneously. 2) The matrix calculation in the transformer consumes vast amounts of computing power. In this paper, we propose a novel Stochastic Window Transformer (SWFormer) framework to resolve these issues. First, the effective spatial and spectral feature projection networks are built independently based on hybrid-modal heterogeneous data composition using parallel feature extraction, which is conducive to excavating the perceptual features more representative along different dimensions. Furthermore, to construct local-global nonlinear feature maps more flexibly, we implement multi-scale strip convolution coupled with a transformer strategy. Moreover, in an innovative random window transformer structure, features are randomly masked to achieve sparse window pruning, alleviating the problem of information density redundancy, and reducing the parameters required for intensive attention. Finally, we designed a plug-and-play feature aggregation module that adapts domain offset between modal features adaptively to minimize semantic gaps between them and enhance the representational ability of the fusion feature. Three fiducial datasets demonstrate the effectiveness of the SWFormer in determining classification results.

Construction and Optimization of a Collaborative Harvesting System for Multiple Robotic Arms and an End-Picker in a Trellised Pear Orchard Environment

In order to meet the needs of intensive mechanized picking in trellised pear orchards, this paper designed a pick-place integrated end-picker based on the analysis of agronomic characteristics of trellised pear gardens and fruit. In order to realize the accurate positioning of pears in picking, based on the kinematic analysis of robot arms and the construction of a private dataset, the YOLOv5s object detection algorithm was used in conjunction with a depth camera to achieve fruit positioning. The hand–eye system calibration was carried out. Aiming at solving the problems of redundancy, inefficiency, and uneven distribution of task volume in the conventional multiple robot arms algorithm, a simulated annealing algorithm was introduced to optimize the picking sequence, and a task allocation method was proposed. On the basis of studying several key parameters affecting the performance of the algorithm, the picking efficiency was greatly optimized. And the effectiveness of the proposed multi-robot collaborative picking method in a trellised pear orchard environment was demonstrated through experiments and simulation verification. The experiments showed that the picking efficiency of the integrated end-picker was increased by about 30%, and the success rate was significantly higher than that of the flexible grippers. The results of this study can be utilized to advance robotic pear-picking research and development.

A feature selection based on genetic algorithm for intrusion detection of industrial control systems

With the popularity of Internet technology, industrial control systems (ICS) have started to access the Internet, which significantly facilitates engineers to manage ICS remotely but also exposes risks. Usually, an intrusion detection system (IDS) is used to secure network systems. Feature selection plays a crucial role in IDSs because detecting anomalies from high-dimensional network traffic features is time-consuming. However, few specific studies have been conducted for ICS. Many redundant features and data imbalance problems in ICS data lead to poor performance and low efficiency of generic IDS classification. In this paper, we design a genetic algorithm-based feature selection method for ICS characteristics. The proposed method incorporates a feature ranking fusion mechanism in the genetic algorithm for eliminating redundant features, enhances the global merit-seeking speed using the growing tree clustering idea, and we also design a new fitness function for ICS characteristics. The effectiveness and advancement of the proposed method are demonstrated on a real ICS dataset.

Multi-Robot Cooperative Multi-Area Coverage Based on Circular Coding Genetic Algorithm

This paper studies the cooperative multi-area coverage problem with obstacles, which requires a group of robots to cover an area while avoiding collisions. This problem is very common in scenarios such as garbage removal, mine clearance, and regional information collection. The currently proposed algorithms usually have the problem of high redundancy and weak scene scalability. This paper designs a cooperative area coverage algorithm for multiple robots. First, a set of rules is proposed to divide the area to be covered into several small areas. Then, a genetic algorithm based on circular coding is designed to allocate these divided areas to several robots. Finally, the coverage path of the robot is designed using the zigzag method, so that the robot can cover the area allocated to it. Through computational experiments, it has been verified that this algorithm has efficiency advantages over state-of-the-art algorithms in certain scenarios and has scalability for different scenarios.

Novel wind-speed prediction system based on dimensionality reduction and nonlinear weighting strategy for point-interval prediction

In the context of today’s energy shortage, wind energy plays a crucial role as one of the most widely used renewable energy sources. However, in order to fully utilize the potential of wind energy, it is necessary to build a precise and reliable wind-speed prediction system. Conventional wind-speed prediction models frequently rely on a solitary model for forecasting, and sometimes these models cannot accurately fit the nonlinear characteristics of the data, resulting in poor prediction performance. Therefore, to address this deficiency, a new wind-speed point-interval prediction system is proposed in this study. The fuzzy information granulation technology is adopted in this system to reduce the dimension of data and solve the problem of redundancy in wind-speed data. In addition, this paper uses the multi-objective dragonfly algorithm and combines sub-models using the multi-nonlinear weight strategy to address the issue of inadequate precision exhibited by an individual prediction model. In order to verify the effectiveness of this wind-speed prediction system, the Penglai wind farm in Shandong Province is used as the dataset to construct the model, and several reference models are selected to conduct point prediction and interval prediction comparison experiments respectively. The experimental results show that the combined prediction system has the best prediction performance, with MAPE values of 14.16%, 15.02% and 15.74%, respectively. Compared with other benchmark models, the average improvement rates for the multi-step prediction were 14.97%, 16.48% and 19.11%, respectively.

DVNE-DRL: dynamic virtual network embedding algorithm based on deep reinforcement learning.

Virtual network embedding (VNE), as the key challenge of network resource management technology, lies in the contradiction between online embedding decision and pursuing long-term average revenue goals. Most of the previous work ignored the dynamics in Virtual Network (VN) modeling, or could not automatically detect the complex and time-varying network state to provide a reasonable network embedding scheme. In view of this, we model a network embedding framework where the topology and resource allocation change dynamically with the number of network users and workload, and then introduce a deep reinforcement learning method to solve the VNE problem. Further, a dynamic virtual network embedding algorithm based on Deep Reinforcement Learning (DRL), named DVNE-DRL, is proposed. In DVNE-DRL, VNE is modeled as a Markov Decision Process (MDP), and then deep learning is introduced to perceive the current network state through historical data and embedded knowledge, while utilizing reinforcement learning decision-making capabilities to implement the network embedding process. In addition, we improve the method of feature extraction and matrix optimization, and consider the characteristics of virtual network and physical network together to alleviate the problem of redundancy and slow convergence. The simulation results show that compared with the existing advanced algorithms, the acceptance rate and average revenue of DVNE-DRL are increased by about 25% and 35%, respectively.

Retrieving land surface temperatures from IASI hyperspectral thermal infrared data using an AFNO-transformer model.

An adaptive Fourier neural operator (AFNO)-transformer model was developed to retrieve land surface temperature (LST) data from infrared atmospheric sounding interferometer (IASI) observations. A weight selection scheme based on linearization of the radiative transfer equation was proposed to solve the hyperspectral data channel redundancy problem. The IASI brightness temperatures and Advanced Very High Resolution Radiometer onboard MetOp (AVHRR/MetOp) LST product were selected to construct the training and test datasets. The AFNO-transformer performed effective token mixing through self-attention and effectively solved the global convolution problem in the Fourier domain, which can better learn complex nonlinear equations and achieve time-series forecasting. The root mean square error indicated that the LST in Eastern Spain and North Africa could be retrieved with an error of less than 2.5 K compared with the AVHRR/MetOp LST product. Moreover, the validation results from other time period data showed that the retrieval accuracy of this model can be less than 3 K. The proposed model provides a novel approach for hyperspectral LST retrieval.

Study of Meat and Carcass Quality-Related Traits in Turkey Populations through Discriminant Canonical Analysis.

The present research aimed to determine the main differences in meat and carcass quality traits among turkey genotypes worldwide and describe the clustering patterns through the use of a discriminant canonical analysis (DCA). To achieve this goal, a comprehensive meta-analysis of 75 documents discussing carcass and meat characteristics in the turkey species was performed. Meat and carcass attributes of nine different turkey populations were collected and grouped in terms of the following clusters: carcass dressing traits, muscle fiber properties, pH, color-related traits, water-retaining characteristics, texture-related traits, and meat chemical composition. The Bayesian ANOVA analysis reported that the majority of variables statistically differed (p < 0.05), and the multicollinearity analysis revealed the absence of redundancy problems among variables (VIF < 5). The DCA reported that cold carcass weight, slaughter weight, sex-male, carcass/piece weight, and the protein and fat composition of meat were the traits explaining variability among different turkey genotypes (Wilks' lambda: 0.488, 0.590, 0.905, 0.906, 0.937, and 0.944, respectively). The combination of traits in the first three dimensions explained 94.93% variability among groups. Mahalanobis distances cladogram-grouped populations following a cluster pattern and suggest its applicability as indicative of a turkey genotype's traceability.

Optimized clustering sample selection for spectral reflectance recovery

The accuracy of spectral recovery depends heavily on the selection of an appropriate sample set, so the optimized sample selection by clustering strategy can improve the spectral recovery results. This paper presents a sample optimization method that combines hierarchical clustering and K-mean angle similar clustering to achieve this process. The proposed method employs the hierarchical clustering to divide the training sample dataset into 15 subspaces and obtain 15 subspace centroids. The similarity distance is then calculated between the testing sample and each subspace samples, and the subspace with the sample having the smallest distance is selected. The testing sample is utilized as a priori centroid, which clusters the optimal subspace by competition with the centroid of the subspace selected. This iterative process continues until the centroid of the subspace remains unaltered. Finally, the training samples within the optimal subspace use to recover spectral reflectance through Euclidean distance weighting. Experimental results demonstrate that the proposed method outperforms existing methods in terms of spectral and colorimetric accuracy, as well as stability and robustness. This research provides a solution to the problem of data redundancy in the spectral recovery process and enhances the accuracy and efficiency of spectral recovery.