Search

In recent years, solar photovoltaic (PV) energy, as a clean energy source, has received widespread attention and experienced rapid growth worldwide. However, the rapid growth of PV power deployment also brings important challenges to the maintenance of PV panels, and in order to solve this problem, this paper proposes an innovative algorithm based on PA-YOLO. First, we propose to use PA-YOLO's asymptotic feature pyramid network (AFPN) instead of YOLOv7's backbone network to support direct interactions of nonadjacent layers and avoid large semantic gaps between nonadjacent layers. For the occlusion problem of dense targets in the dataset, we introduce a repulsive loss function, which successfully reduces the occurrence of false detection situations. Finally, we propose a customized convolutional block equipped with an EMA mechanism to enhance the perceptual and expressive capabilities of the model. Experimental results on the dataset show that our proposed model achieves excellent performance with an average accuracy (mAP) of 94.5%, which is 6.8% higher than YOLOv7. In addition, our algorithm also succeeds in drastically reducing the model size from 71.3 MB to 48.4 MB, which well demonstrates the effectiveness of the model. [ABSTRACT FROM AUTHOR]

This paper proposes a blockchain-based identity authentication (BA) scheme for IoT devices to solve the authentication security problem of IoT devices. The BA scheme uses hashing and digital signature algorithms to achieve integrity and nonrepudiation of authentication messages. Blockchain technology is used to achieve decentralised and distributed storage and management of authentication data. Besides, the BA scheme uses the idea of trust domains and trust credentials to establish a master-slave connection between IoT devices. The BA scheme is then compared with the existing four schemes and analysed from six perspectives to show that the BA scheme has better security. Also, the results show that the BA scheme has reasonable computational and storage overhead. Finally, the advantages of the BA scheme over traditional centralised and existing blockchain-based authentication schemes are compared and analysed. The results show that it can perfectly solve the problem of overreliance on trusted third parties in traditional authentication schemes. [ABSTRACT FROM AUTHOR]

In this paper, a novel UAV path planning algorithm based on improved cellular ant colony algorithm and dynamic window algorithm (ICACO-IDWA) is proposed to solve the problem of dynamically changing threat during actual flight. The main innovations of this paper are as follows. (a) The hexagon grid method is proposed to model the UAV flight space, which solves the problem of inconsistent simulation time step. (b) A novel ICACO-IDWA algorithm is proposed. In the first stage, the optimal path is obtained by the improved cellular ant colony algorithm (ICACO). In the second stage, the improved dynamic window algorithm (IDWA) is used to optimize the optimal path considering dynamic threat. Through the algorithm, the UAV path planning with dynamic threat change is realized. Finally, simulation results verify the effectiveness of the proposed model and algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of motion intention recognition for cluster targets with splitting behaviour and lack of motion prior information. This is a challenge to the classical Bayesian inference based intention recognition algorithms because they rely heavily on a priori knowledge. In order to solve these problems, a joint algorithm of deep echo state network optimized by adaptive genetic algorithm (AGADESN) and DBSCAN clustering algorithm is proposed in this paper. We use improved Olfati-Saber model with direction noise to generate cluster motion and use the cluster motion data to drive AGADESN algorithm to predict cluster destination, which achieves higher destination prediction accuracy than DESN algorithm. We innovatively design the motion similarity distance (MSD) and take the destination prediction output as one of the distance inputs, alleviating the lack of differentiation among different cluster targets caused by only relying on speed and position distance at the early stage of cluster motion. Based on the MSD, DBSCAN clustering algorithm is used to identify clusters in the field of view to determine whether splitting behaviour occurs. Simulation results demonstrate the effectiveness of the proposed algorithm in cluster target motion intention recognition and its superiority over DESN algorithm and DBSCAN algorithm only based on speed and position distance. [ABSTRACT FROM AUTHOR]

In order to effectively solve the problem of relatively large errors in individual positioning strategies in indoor environments, this paper applies the genetic optimization neural network algorithm to indoor location based on multi-source information fusion. The range of the geomagnetic fitness is constrained based on the results obtained by using the wireless WiFi positioning for combination and matching, which can reduce the value of the matching error effectively. Subsequently, the global optimal value of the indoor network is calculated based on the genetic algorithm, which can optimize the initial value and threshold of the neural network after genetic optimization so as to improve the accuracy of the network to the greatest extent possible while accelerating the convergence speed at the same time. After the optimization processing is completed, fusion training can be performed on the coordinates of the actual positions based on the obtained combination positioning situation and the predicted positioning result in the indoor network. Finally, the optimal positioning result can be obtained accordingly. Through the analysis of practical cases, it can be known that the mean square error predicted based on the genetic optimization neural network calculated by using the genetic algorithm can be effectively reduced by 76%, and the accuracy of the fusion positioning can be increased by 48% on average compared with the accuracy of a single positioning strategy. Hence, the method put forward in this paper has effectively improved the positioning accuracy, which suggests that its positioning performance is superior. [ABSTRACT FROM AUTHOR]

The research on artistic psychological intervention to judge emotional fluctuations by extracting emotional features from interactive vocal signals has become a research topic with great potential for development. Based on the interactive vocal music instruction theory of emotion recognition, this paper studies the design of artistic psychological intervention system. This paper uses the vocal music emotion recognition algorithm to first train the interactive recognition network, in which the input is a row vector composed of different vocal music characteristics, and finally recognizes the vocal music of different emotional categories, which solves the problem of low data coupling in the artistic psychological intervention system. Among them, the vocal music emotion recognition experiment based on the interactive recognition network is mainly carried out from six aspects: the number of iterative training, the vocal music instruction rate, the number of emotion recognition signal nodes in the artistic psychological intervention layer, the number of sample sets, different feature combinations, and the number of emotion types. The input data of the system is a training class learning video, and actions and expressions need to be recognized before scoring. In the simulation process, before the completion of the sample indicators is unbalanced, the R language statistical analysis tool is used to balance the existing unbalanced data based on the artificial data synthesis method, and 279 uniformly classified samples are obtained. The 279 ∗ 7 dataset was used for statistical identification of the participants. The experimental results show that under the guidance of four different interactive vocal music, the vocal emotion recognition rate is between 65.85%-91.00%, which promotes the intervention of music therapy on artistic psychological intervention. [ABSTRACT FROM AUTHOR]

After the occurrence of major sudden disasters, the dispatching and distribution of disaster relief materials are particularly important, but in the process of distribution, there may be excessive distribution of similar emergency materials, unbalanced distribution volume of relief materials in different disaster-affected points, high distribution cost, and low effective distribution rate. In order to solve the above problems, based on the application of big data, this paper proposes a three-level network postdisaster material scheduling and distribution model and an improved NSGA-II algorithm. The model takes the loss degree of the disaster area and the dynamic change rate of the demand for postdisaster relief materials as the constraints, takes the demand prediction of postdisaster relief materials, the optimization of distribution path, distribution nodes, and the satisfaction of victims as the objectives, and designs the sample average approximation method and the improved NSGA-II algorithm. In order to verify the effectiveness of the proposed model and strategy, through the comparative experiment of NSGA and PSO, it can be seen from the experimental results that the three-level network allocation model and the improved NSGA-II algorithm (nondominated sorting genetic algorithm II) proposed in this paper can not only solve the existing postdisaster relief material allocation and scheduling problem but also reduce the space-time complexity of the problem. [ABSTRACT FROM AUTHOR]

The platform inertial-stellar composite guidance is a composite guidance method supplemented by stellar correction on the basis of inertial navigation, which can effectively improve the accuracy of responsive launch vehicles. In order to solve the problem of rapid determining the optimal navigation star in the system, this paper proposes an algorithm based on the equivalent information compression theory. At first, this paper explains why the single-star scheme can achieve the same accuracy as the dual-star scheme. At the same time, the analytical expression of the optimal navigation star with significant initial error is derived. In addition, the available optimal navigation star determination strategy is also designed according to the arrow-borne navigation star database. The proposed algorithm is evaluated by two representative responsive launch vehicle trajectory simulations. The simulation results demonstrate that the proposed algorithm can determine the optimal navigation star quickly, which greatly shorten the preparation time before the rapid launch of vehicles and improve the composite guidance accuracy. [ABSTRACT FROM AUTHOR]

Traditional ice and snow path planning methods still have internal environmental problems in intelligent path planning, such as weak innovation ability, imperfect management, long planning path, unreasonable security structure, and low degree of specialization. Therefore, more and more ice and snow sports lovers are eager to solve this problem. This paper designs a path planning method based on three-dimensional ice and snow model. The path planning method of moving snow and ice based on MNN (Multiclass Neural Networks) algorithm is studied from many aspects. MNN algorithm is used for comprehensive analysis and evaluation. The mobile phone provides data information on key nodes, air resistance, momentum change, ice and snow movement track, and so on. The results show that the ice and snow path planning system based on MNN algorithm designed in this paper has the advantages of high feasibility, high data accuracy, and good prediction effect and can effectively improve the efficiency of ice and snow path planning. [ABSTRACT FROM AUTHOR]

Technical movement analysis requires specialized domain knowledge and processing a large amount of data, and the advantages of AI in processing data can improve the efficiency of data analysis. In this paper, we propose a feature pyramid network-based temporal action detection (FPN-TAD) algorithm, which is used to solve the problem that the action proposal module has a low recall rate for small-scale temporal target action regions in the current video temporal action detection algorithm research. This paper is divided into three parts. The first part is an overview of the algorithm; the second part elaborates the network structure and the working principle of the FPN-TAD algorithm; and the third part gives the experimental results and analysis of the algorithm. [ABSTRACT FROM AUTHOR]

In order to solve the problem that the subspace-like direction of arrival (DOA) estimation performs poor due to the error of sources number, this paper proposes a new super-resolution DOA estimation algorithm based on the diagonal-symmetric loading (DSL). Specifically, orthogonality principle of the minimum eigenvector of the specific covariance matrix and the source number estimation based on the improved K-means method were adopted to construct the spatial spectrum. Then, by considering the signal-to-interference-to-noise ratio (SINR), the theoretical basis for selecting parameters was given and verified by numerical experiment. To evaluate the effectiveness of the proposed algorithm, this paper compared it with the methods of minimum variance distortionless response (MVDR) and new signal subspace processing (NSSP). Experimental results prove that the proposed DSL has higher resolution and better estimation accuracy than the MVDR and NSSP. [ABSTRACT FROM AUTHOR]

The biggest view of the whole world on science and technology and sports is that science and technology and sports both represent national strength. At present, the integration of sports and science and technology has not reached a certain height, especially in the prediction of sports behavior and injury assessment, and the investment in science and technology is still lacking. This leads to a high number of injuries caused by sports every year. However, swarm intelligence algorithm has made few breakthrough achievements in the past few years, and the combination of sports behavior and swarm intelligence algorithm can just solve this problem. It is very important to choose the algorithm for predicting and assessing sports behavior. We should choose an efficient algorithm with high stability, high convergence speed, and optimization ability. In this paper, the IPSGWO algorithm is proposed to realize this application. IPSGWO algorithm is based on the GWO algorithm, with appropriate strategies and ideas, to maximize the improvement. In this paper, the convergence curve of PSO, GWO, and IPSGWO is tested to determine whether the IPSGWO algorithm has more stable and higher performance, and the simulation experiment is used to determine whether the IPSGWO algorithm is suitable for prediction and injury assessment compared with the other two. From the experimental results, the IPSGWO algorithm does have higher performance; because of this, it is more accurate for prediction and injury assessment. [ABSTRACT FROM AUTHOR]

With the rapid development of neural network technology, we have widely used this technology in various fields. In the field of language translation, the research on automatic detection technology of English verb grammatical errors is in a hot stage. The traditional manual detection cannot be applied to the current environment. Therefore, this paper proposes an automatic detection technology of English verb grammatical errors based on recurrent neural network (RNN) algorithm to solve this problem. Firstly, the accuracy and feedback speed of traditional manual detection and recurrent neural network RNN algorithm are compared. Secondly, a detection model which can be calculated according to grammatical order combined with context is designed. Finally, when the output verb result is inconsistent with the original text, it can automatically mark the error detection effect. The experimental results show that the algorithm model studied in this paper can effectively improve the detection accuracy and feedback efficiency and is more applicable and effective than the traditional manual detection method. [ABSTRACT FROM AUTHOR]

Feature selection and lung nodule recognition are the core modules of the lung computer-aided detection (Lung CAD) system. To improve the performance of the Lung CAD system, algorithmic research is carried out for the above two parts, respectively. First, in view of the poor interpretability of deep features and the incomplete expression of clinically defined handcrafted features, a feature cascade method is proposed to obtain richer feature information of nodules as the final input of the classifier. Second, to better map the global characteristics of samples, the multiple kernel learning support vector machine (MKL-SVM) algorithm with a linear convex combination of polynomial kernel and sigmoid kernel is proposed. Furthermore, this paper applied the methods for speed contraction factor and roulette strategy, and a mixture of simulated annealing (SA) and particle swarm optimization (PSO) is used for global optimization, so as to solve the problem that the PSO is easy to lose particle diversity and fall into the local optimal solution as well as improve the model's training speed. Therefore, the MKL-SVM algorithm is presented in this paper, which is based on swarm intelligence optimization is proposed for lung nodule recognition. Finally, the algorithm construction experiments are conducted on the cooperative hospital dataset and compared with 8 advanced algorithms on the public dataset LUNA16. The experimental results show that the proposed algorithms can improve the accuracy of lung nodule recognition and reduce the missed detection of nodules. [ABSTRACT FROM AUTHOR]

The feature selection problem is a fundamental issue in many research fields. In this paper, the feature selection problem is regarded as an optimization problem and addressed by utilizing a large-scale many-objective evolutionary algorithm. Considering the number of selected features, accuracy, relevance, redundancy, interclass distance, and intraclass distance, a large-scale many-objective feature selection model is constructed. It is difficult to optimize the large-scale many-objective feature selection optimization problem by using the traditional evolutionary algorithms. Therefore, this paper proposes a modified vector angle-based large-scale many-objective evolutionary algorithm (MALSMEA). The proposed algorithm uses polynomial mutation based on variable grouping instead of naive polynomial mutation to improve the efficiency of solving large-scale problems. And a novel worst-case solution replacement strategy using shift-based density estimation is used to replace the poor solution of two individuals with similar search directions to enhance convergence. The experimental results show that MALSMEA is competitive and can effectively optimize the proposed model. [ABSTRACT FROM AUTHOR]

To solve the problem of micro-electro-mechanical system (MEMS) gyroscope noise, this paper presents a variational mode decomposition (VMD) method based on crow search algorithm. First, the signal was decomposed by variational mode decomposition for optimization of crow search algorithm (CSA-VMD) method. The parameters required by the VMD method (penalty parameter α and decomposition number K) are given by the crow search algorithm, and then the signal is decomposed into the superposition of multiple subsignals, called intrinsic mode functions (IMFs). The sample entropy (SE) corresponding to each IMF is then obtained. By calculating the sample entropy, the noise signal can be divided into pure noise part, mixing part, and temperature drift part. Second, Savitzky–Golay smoothing denoising (SG) is used to filter the mixed noise signal to eliminate the influence of noise. Third, for the filtering of the drift part, the least square support vector machine optimized by the crow search algorithm (CSA-LSSVM) was used to filter, so as to reduce the effect of temperature drift. Finally, the processed signal is reconstructed to achieve the goal of denoising. Through the results, it can be found that the optimized VMD and LSSVM using CSA algorithm can achieve more effective denoising. After using the method proposed in this paper, the angular random walk value is 1.1175 ∗ 10−4°/h/√Hz, and the bias stability is 0.0017°/h. Compared with the original signal, the two signals are optimized by 98.1% and 98.2%, respectively. It can be seen from the experimental results that the proposed CSA-VMD method, SG method, and CSA-LSSVM method can effectively eliminate noise effects. [ABSTRACT FROM AUTHOR]

In recent years, the Internet of Things technology can effectively innovate applications and services. The Internet of Things technology has become more and more popular. It provides an effective and direct bridge between the physical world and virtual objects in cyberspace. With the increase in the intensity of dragon boat training and the increasingly fierce competition, the possibility of injury is increasing. Dragon boat racing is a noncontact team sport based on strength and technology. The purpose of this paper is to solve the problem of people's lack of understanding of the sports injuries and causes of dragon boat athletes. We used the data fusion algorithm and cluster maintenance optimization algorithm to study the application of Internet of Things technology in the cause of dragon boat sports injury. In order to save energy, extend the network life cycle, shorten service interruption time, and increase data packet transmission, the cluster maintenance optimization algorithm in this paper mainly improves and optimizes the startup time of cluster maintenance, which depends on the maintenance cost. The experiment result shows that the etiological detection system proposed in this paper matches the actual sports injury results well. The experiment result shows that the research on the cause of injury in dragon boat sports based on Internet of Things technology can detect the damage law well and can have a more comprehensive understanding for the cause of injury, which helps to prevent injuries better and take effective treatments. In the analysis part, it can be concluded that the detection system is very accurate in detecting the cause, and the accuracy rate is basically 100%. [ABSTRACT FROM AUTHOR]

Variational mode decomposition (VMD) has been applied in the field of rolling bearing fault diagnosis because of its good ability of frequency segmentation. Mode number K and quadratic penalty term α have a significant influence on the decomposition result of VMD. At present, the commonly used method is to determine these two parameters adaptively through intelligent optimization algorithm, namely, the parameter-adaptive VMD (PAVMD) method. The key of the PAVMD method is the setting of an objective function, and the traditional PAVMD method is prone to overdecomposition or underdecomposition. To solve these problems, an improved parameter-adaptive VMD (IPAVMD) method is proposed. A new objective function, the maximum average envelope kurtosis (MAEK), is proposed in this paper. The new objective function fully considers the equivalent filtering characteristics of VMD, and squared envelope kurtosis has good antinoise performance. In the optimization method, this paper uses an improved particle swarm optimization (PSO) algorithm. The MAEK and PSO can make sure the IPAVMD method reaches the best complete decomposition of the signal without an underdecomposition or overdecomposition problem. Through the analysis of simulation data and experimental data, the performance of the IPAVMD and the traditional PAVMD is compared. The comparison results show that the proposed IPAVMD has better performance and stronger robustness than the traditional method and is suitable for both single-fault and multiple-fault cases of rolling bearings. The research results have certain theoretical significance and application value for improving the fault diagnosis effect of rolling bearings. [ABSTRACT FROM AUTHOR]

Microscope vision analysis is applied in many fields. The traditional way is to use the human eye to observe and manually focus to obtain the image of the observed object. However, with the observation object becoming more and more subtle, the magnification of the microscope is required to be larger and larger. The method of manual focusing cannot guarantee the best focusing position of the microscope in use. Therefore, in this paper, we are studying the existing autofocusing technology and the autofocusing method of microscope based on image processing, which is different from the traditional manual focusing method. The autofocusing method of microscope based on image processing does not need the information such as the target position and the focal length of optical system, to directly focus the collected image. First of all, in order to solve the problem of large computation and difficult real time of traditional wavelet based image sharpness evaluation algorithm, this paper proposes an improved wavelet based image sharpness evaluation algorithm; secondly, in view of the situation that the window selected by traditional focusing window selection method is fixed, this paper adopts an adaptive focusing window selection method to increase the focusing window. Finally, this paper studies the extremum search strategy. In order to avoid the interference of the local extremum in the focusing curve, this paper proposes an improved hill-climbing algorithm to achieve the accuracy of focusing search. The simulation results show that the improved wavelet transform image definition evaluation algorithm can improve the definition evaluation performance, and the improved mountain climbing algorithm can reduce the impact of local extremum and improve the accuracy of the search algorithm. All in all, it can be concluded that the method based on image processing proposed in this paper has a good focusing effect, which can meet the needs of anti-interference and extreme value search of microscope autofocus. [ABSTRACT FROM AUTHOR]

Attitude measurement is an important core technology of vehicle flight. It is of great significance to ensure the vehicle's accurate orbit entry and orbit change, high-performance flight, reliable ground communication, high-precision ground observation, and successful completion of various space missions. Star sensor is the core component to realize an autonomous attitude measurement of the vehicle. Autonomous star map recognition is a key technology in star sensor technology, and it is also the focus and difficulty of research. When the star sensor enters the initial attitude acquisition mode, according to the algorithm, the star sensor can quickly obtain the initial attitude and enter the normal working mode. This paper proposes a star pattern recognition algorithm based on the radial companion-circumferential feature with a noise compensation code to address the low recognition rate caused by position noise in the process of constructing star patterns in the traditional star pattern recognition algorithm based on the radial feature. In order to solve the problem of slow matching search speed, a maximum matching number algorithm has been innovatively adopted, which can improve the search efficiency in the process of star pattern recognition. Thus, the capacity of the star pattern recognition feature library is effectively reduced, and the stability and recognition rate of the improved star pattern recognition algorithm are further improved. The improved star pattern recognition algorithm first establishes radial and circumferential feature vectors based on the bit vector, then adds the noise compensation code according to the companion star position error, then modifies the radial and circumferential feature vectors, and finally calculates the minimum similarity difference between the feature vector of the star pattern observed by the star sensor and the feature vector of the navigation star in the feature library to obtain the unique star pattern recognition result. The identification star database adopts the maximum matching number algorithm, which can improve the search efficiency, reduce the amount of redundant matching, and shorten the matching time. The simulation results show that even in the presence of star position and magnitude noise, the improved star pattern recognition algorithm with radial companion-circumferential feature maintains a high recognition rate of more than 97 percent, demonstrating that the algorithm's robustness is superior to other algorithms. The revised method described in this work outperforms the classic triangle algorithm and the radial feature star pattern recognition algorithm without compensation code in terms of algorithm robustness, recognition success rate, and recognition time. [ABSTRACT FROM AUTHOR]

Due to the limitation of sports movement, the current simulation technology of sports entities is prone to deficiencies in capturing dynamic motion figures and is prone to lack of accuracy. It is also affected by external noise and brightness. To solve these problems, this paper proposes a sports entity simulation based on the fish swarm algorithm and compares the figure effectiveness, figure segmentation, core point, and noise reduction effect of the two in the shooting figure. Through the comparison, it is found that the figure is more appropriate to the real moving figure, the motion capture is more accurate, and the number of core points is related to the accuracy of motion capture. The more core points, the more accurate the motion capture, and the noise reduction effect is also increased by 20.3%, which reduces the impact of brightness on the motion simulation. The difference in the effect of the traditional simulation technology (particle swarm algorithm) and the entity simulation based on the fish swarm algorithm was also compared. The combination with the artificial fish swarm algorithm is to simulate the moving entity and learn from some reference data. By comparing the data between the two after the experiment, it is concluded that the fish swarm algorithm is more effective in the simulation of sports entities. [ABSTRACT FROM AUTHOR]

Finding the location of sensors in wireless sensor networks (WSNs) is a major test, particularly in a wide region. A salient clustering approach is laid out to achieve better performance in such a network using an evolutional algorithm. This paper developed a clustered network called neighborhood grid cluster which has a node assuming the part of a cluster center focused in every grid. Grid-based clustering is less difficult and possesses a lot of benefits compared to other clustering techniques. Besides, we proposed a localization algorithm that centers around assessing the target area by considering the least estimated distance embedded with the genetic algorithm. Performance standards incorporate the energy representation, connectivity stratagem, and distance measure as fitness functions that assess our localization problem to demonstrate its viability. Simulation results confirm that our approach further improves localization accuracy, energy utilization, node lifetime, and localization coverage. [ABSTRACT FROM AUTHOR]

Multimodal tasks based on attention mechanism and language face numerous problems. Based on multimodal hierarchical attention mechanism and genetic neural network, this paper studies the application of image segmentation algorithm in data completion and 3D scene reconstruction. The algorithm refers to the process of concentrating attention that humans subjectively pay attention to and calculates the difference between each pixel in the genetic neural network test image in the color space and the average value of the target image, which solves the problem of static feature maps and dynamic feature maps of image sequences. In addition, in view of the problem that the number of attention enhancement feature extraction modules is too large and the parameters are too large, the recursive mechanism is used as the feature extraction branch, and new model parameters are not added when the network depth is increased. The simulation results show that the accuracy of the improved image saliency detection algorithm based on the attention mechanism reaches 89.7%, and the difference between the average value of the single-point pixel and the target image is reduced to 0.132, which further promotes the practicability and reliability of the image segmentation model. [ABSTRACT FROM AUTHOR]

In this paper, a single-vehicle static partial repositioning problem (SPRP) is investigated, which distinguishes the user dissatisfaction generated by different stations. The overall objective of the SPRP is to minimize the weighted sum of the total operational time and the total absolute deviation from the target number of bikes at all stations. An iterated local search is developed to solve this problem. A novel loading and unloading quantity adjustment operator is proposed to further improve the quality of the solution. Experiments are conducted on a set of instances from 30 to 300 stations to demonstrate the effectiveness of the proposed customized solution algorithm as well as the adjustment operator. Using a small example, this paper also reveals that the unit penalty cost has an effect on the repositioning strategies. [ABSTRACT FROM AUTHOR]

In the order picking process of the warehouse center, considering the rapid increase in the volume of orders arriving at the picking center at the time of the promotional festival, a hybrid operation mode with multiple picking tables is used to meet the picking requirements of the huge number of real-time orders. Therefore, in this paper, a hybrid picking mode is proposed, taking into account both the idle degree of picking stations and their order item centers of gravity, and a new reinforcement learning algorithm embedding mechanism (PRL) with placeholder control is designed to solve the problem of a huge number of real-time item orders arriving at the picking center system on promotional holidays and in inconsistent quantities, and numerical simulations are performed for this algorithm. The experimental results show that the PRL algorithm in hybrid picking mode can handle a huge number of orders simultaneously and improve picking efficiency effectively. [ABSTRACT FROM AUTHOR]

Human action recognition is an important part for computers to understand the behavior of people in pictures or videos. In a single image, there is no context information for recognition, so its accuracy still needs to be greatly improved. In this paper, a single-image human action recognition method based on improved ResNet and skeletal keypoints is proposed, and the accuracy is improved by several methods. We improved the backbone network ResNet-50 and CPN to a certain extent and constructed a multitask network to suit the human action recognition task, which not only improves the accuracy but also balances the total number of parameters and solves the problem of large network and slow operation. In this paper, the improvement methods of ResNet-50, CPN, and whole network are tested, respectively. The results show that the single-image human action recognition based on improved ResNet and skeletal keypoints can accurately identify human action in the case of different human movements, different background light, and occlusion. Compared with the original network and the main human action recognition algorithms, the accuracy of our method has its certain advantages. [ABSTRACT FROM AUTHOR]

In many space missions, spacecraft are required to have the ability to avoid various obstacles and finally reach the target point. In this paper, the path planning of spacecraft attitude maneuver under boundary constraints and pointing constraints is studied. The boundary constraints and orientation constraints are constructed as finite functions of path evaluation. From the point of view of optimal time and shortest path, the constrained attitude maneuver problem is reduced to optimal time and path solving problem. To address this problem, a metaheuristic maneuver path planning method is proposed (cross-mutation grey wolf algorithm (CMGWO)). In the CMGWO method, we use angular velocity and control torque coding to model attitude maneuver, which increases the difficulty of solving the problem. In order to deal with this problem, the grey wolf algorithm is used for mutation and evolution, so as to reduce the difficulty of solving the problem and shorten the convergence time. Finally, simulation analysis is carried out under different conditions, and the feasibility and effectiveness of the method are verified by numerical simulation. [ABSTRACT FROM AUTHOR]

In the past few decades, metaheuristic algorithms (MA) have been developed tremendously and have been successfully applied in many fields. In recent years, a large number of new MA have been proposed. Slime mould algorithm (SMA) is a novel swarm-based intelligence optimization algorithm. SMA solves the optimization problem by imitating the foraging and movement behavior of slime mould. It can effectively obtain a promising global optimal solution. However, it still suffers some shortcomings such as the unstable convergence speed, the imprecise search accuracy, and incapability of identifying a local optimal solution when faced with complicated optimization problems. With the purpose of overcoming the shortcomings of SMA, this paper proposed a multistrategy enhanced version of SMA called ESMA. The three enhanced strategies are chaotic initialization strategy (CIS), orthogonal learning strategy (OLS), and boundary reset strategy (BRS). The CIS is used to generate an initial population with diversity in the early stage of ESMA, which can increase the convergence speed of the algorithm and the quality of the final solution. Then, the OLS is used to discover the useful information of the best solutions and offer a potential search direction, which enhances the local search ability and raises the convergence rate. Finally, the BRS is used to correct individual positions, which ensures the population diversity and enhances the overall search capabilities of ESMA. The performance of ESMA was validated on the 30 IEEE CEC2014 functions and three IIR model identification problems, compared with other nine well-regarded and state-of-the-art algorithms. Simulation results and analysis prove that the ESMA has a superior performance. The three strategies involved in ESMA have significantly improved the performance of the basic SMA. [ABSTRACT FROM AUTHOR]

Clustering of tumor samples can help identify cancer types and discover new cancer subtypes, which is essential for effective cancer treatment. Although many traditional clustering methods have been proposed for tumor sample clustering, advanced algorithms with better performance are still needed. Low-rank subspace clustering is a popular algorithm in recent years. In this paper, we propose a novel one-step robust low-rank subspace segmentation method (ORLRS) for clustering the tumor sample. For a gene expression data set, we seek its lowest rank representation matrix and the noise matrix. By imposing the discrete constraint on the low-rank matrix, without performing spectral clustering, ORLRS learns the cluster indicators of subspaces directly, i.e., performing the clustering task in one step. To improve the robustness of the method, capped norm is adopted to remove the extreme data outliers in the noise matrix. Furthermore, we conduct an efficient solution to solve the problem of ORLRS. Experiments on several tumor gene expression data demonstrate the effectiveness of ORLRS. [ABSTRACT FROM AUTHOR]

This paper presents an efficient outer space branch-and-bound algorithm for globally solving a minimax linear fractional programming problem (MLFP), which has a wide range of applications in data envelopment analysis, engineering optimization, management optimization, and so on. In this algorithm, by introducing auxiliary variables, we first equivalently transform the problem (MLFP) into the problem (EP). By using a new linear relaxation technique, the problem (EP) is reduced to a sequence of linear relaxation problems over the outer space rectangle, which provides the valid lower bound for the optimal value of the problem (EP). Based on the outer space branch-and-bound search and the linear relaxation problem, an outer space branch-and-bound algorithm is constructed for globally solving the problem (MLFP). In addition, the convergence and complexity of the presented algorithm are given. Finally, numerical experimental results demonstrate the feasibility and efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

A decentralized control strategy can effectively solve the control problem of the large-scale time delayed structures. In this paper, combining the overlapping decentralized control method, linear matrix inequality (LMI) method, and H∞ control algorithm, overlapping decentralized H∞ control approach of the time delayed structures has been established. The feedback gain matrixes of all subsystems are obtained by this method based on genetic algorithm optimization tools and the specific goal of optimization control. The whole vibration control system of the time delayed structures is divided into a series of overlapping subsystems by overlapping decentralized control strategy. The feedback gain matrixes of each subsystem can be obtained by using H∞ control algorithm to calculate each subsystem. The vibration control of a twenty layers' antiseismic steel structure Benchmark model was analyzed with the numerical method. The results show that the proposed method can be applied to control system with time delay. The overlapping decentralized control strategies acquire the similar control effects with that of the centralized control strategy. Moreover, the flexibility of the controller design has been enhanced by using overlapping decentralized control strategies. [ABSTRACT FROM AUTHOR]

Influence maximization (IM) is fundamental to social network applications. It aims to find multiple seed nodes with an enormous impact cascade to maximize these nodes' spread of influence in social networks. Traditional methods for solving influence maximization of the social network, such as the distance method, greedy method, and PageRank method, may suffer from issues of low calculation accuracy and high computational cost. In this paper, we propose a new bacterial foraging optimization algorithm to solve the IM problem based on the complete-three-layer-influence (CTLI) evaluation model. In this algorithm, a novel grid-based reproduction strategy and a direction-adjustment-based chemotaxis strategy are devised to enhance the algorithm's searchability. Finally, we conduct comprehensive experiments on four social network cases to verify the effectiveness of the proposed algorithm. The experimental results show that our proposed algorithm effectively solves the social network's influence maximization. [ABSTRACT FROM AUTHOR]

Cooperative coevolution (CC) is an effective framework for solving large-scale global optimization (LSGO) problems. However, CC with static decomposition method is ineffective for fully nonseparable problems, and CC with dynamic decomposition method to decompose problems is computationally costly. Therefore, a two-stage decomposition (TSD) method is proposed in this paper to decompose LSGO problems using as few computational resources as possible. In the first stage, to decompose problems using low computational resources, a hybrid-pool differential grouping (HPDG) method is proposed, which contains a hybrid-pool-based detection structure (HPDS) and a unit vector-based perturbation (UVP) strategy. In the second stage, to decompose the fully nonseparable problems, a known information-based dynamic decomposition (KIDD) method is proposed. Analytical methods are used to demonstrate that HPDG has lower decomposition complexity compared to state-of-the-art static decomposition methods. Experiments show that CC with TSD is a competitive algorithm for solving LSGO problems. [ABSTRACT FROM AUTHOR]

Error-Correcting Output Codes has become a well-known, established technique for multiclass classification due to its simplicity and efficiency. Each binary split contains different original classes. A noncompetent classifier emerges when it classifies an instance whose real class does not belong to the metasubclasses which is used to learn the classifier. How to reduce the error caused by the noncompetent classifiers under diversity big enough is urgent for ECOC classification. The weighted decoding strategy can be used to reduce the error caused by the noncompetence contradiction through relearning the weight coefficient matrix. To this end, a new weighted decoding strategy taking the classifier competence reliability into consideration is presented in this paper, which is suitable for any coding matrix. Support Vector Data Description is applied to compute the distance from an instance to the metasubclasses. The distance reflects the competence reliability and is fused as the weight in the base classifier combination. In so doing, the effect of the competent classifiers on classification is reinforced, while the bias induced by the noncompetent ones is decreased. Reflecting the competence reliability, the weights of classifiers for each instance change dynamically, which accords with the classification practice. The statistical simulations based on benchmark datasets indicate that our proposed algorithm outperforms other methods and provides new thought for solving the noncompetence problem. [ABSTRACT FROM AUTHOR]

The basic notions in rough set theory are lower and upper approximation operators defined by a fixed binary relation. This paper proposes an intuitionistic fuzzy rough set (IFRS) model which is a combination of intuitionistic fuzzy set (IFS) and rough set. We approximate an IFS by using soft binary relations instead of fixed binary relations. By using this technique, we get two pairs of intuitionistic fuzzy (IF) soft sets, called the upper approximation and lower approximation with respect to foresets and aftersets. Properties of newly defined rough set model (IFRS) are studied. Similarity relations between IFS with respect to this rough set model (IFRS) are also studied. Finally, an algorithm is constructed depending on these approximations of IFSs and score function for decision-making problems, although a method of decision-making algorithm has been introduced for fuzzy sets already. But, this new IFRS model is more accurate to solve the problem because IFS has degree of nonmembership and degree of hesitant. [ABSTRACT FROM AUTHOR]

Influence maximization (IM) is fundamental to social network applications. It aims to find multiple seed nodes with an enormous impact cascade to maximize these nodes' spread of influence in social networks. Traditional methods for solving influence maximization of the social network, such as the distance method, greedy method, and PageRank method, may suffer from issues of low calculation accuracy and high computational cost. In this paper, we propose a new bacterial foraging optimization algorithm to solve the IM problem based on the complete-three-layer-influence (CTLI) evaluation model. In this algorithm, a novel grid-based reproduction strategy and a direction-adjustment-based chemotaxis strategy are devised to enhance the algorithm's searchability. Finally, we conduct comprehensive experiments on four social network cases to verify the effectiveness of the proposed algorithm. The experimental results show that our proposed algorithm effectively solves the social network's influence maximization. [ABSTRACT FROM AUTHOR]

This paper considers a reconnaissance scenario where multiple unmanned aerial vehicles (UAVs) provide services cooperatively for multiple users with different priorities. Although users all expect to acquire their needed information in a short time, the degree of urgency to meet their demands is different when taking their diverse priorities into account. A priority-driven multiuser satisfaction model is designed, where users' satisfaction is quantified based on their different priorities, information acquisition demands, and the time they obtain their desired information. To ensure high priority users' fast information acquisition while avoiding excessive delay in low priority users' information acquisition, a batchwise information backhaul strategy is adopted. In each batch, a UAV is selected as the data ferry through a consultative mechanism to carry information back to users. This reconnaissance process is formulated as a cooperative path planning problem, where the optimization objective is maximizing users' total satisfaction, while an intelligent algorithm is proposed to solve this problem effectively. The simulation results show that compared with traditional path planning algorithms without considering user satisfaction, our proposed algorithm can guarantee faster information acquisition for users with higher priorities, which leads to higher satisfaction. In addition, the applicability of our proposed reconnaissance strategy and path planning algorithm in different situations is also analyzed. [ABSTRACT FROM AUTHOR]

Torque ripple is a defect of switched reluctant motors. DITC (direct instantaneous torque control) is harnessed to solve the problem as a traditional method, which is superior to TSF (torque sharing function). In this paper, a new controller is proposed with modified hysteresis and PWM in DITC. With the modified algorithm, the torque error will be reduced with PWM in DITC. The proposed algorithm is effective to improve sample and 0 status in a period. The modified algorithm is based on application of zero in the asymmetric half bridge, which is implemented as the buffer zone. In case of big torque error, hysteresis will mitigate error under the characteristic of fast responding. In case of small errors, the modified PWM will solve torque error in the equivalent strategy, which has adopted the essence of the impulse equivalent method. The modified controller is designed to reduce responding time and minimize the torque ripple under the proposed algorithm, which has been designed to harness different functions in different torque errors. Based on final simulation and experimental results, responding speed and reduction of output torque ripple are enhanced effectively. [ABSTRACT FROM AUTHOR]

Cubature Kalman filter phase unwrapping (CKFPU) is an effective algorithm in unwrapping the interferograms. The local phase slope estimation is a key factor that affects the unwrapped accuracy. However, the estimation accuracy of local phase slop is relatively low in high noisy and dense stripes areas, which usually leads to the unsatisfactory unwrapped results. In order to effectively solve this issue, the rewrapped map of the unwrapped phase (obtained by CKFPU algorithm), which is a filtered interferogram with clearer fringes and more detailed information, is proposed in this paper to improve the phase slope estimation. In order to solve the problem of imprecise error variance for the new phase slope estimation, an adaptive factor is introduced into the CKFPU algorithm to increase the stability and reliability of the phase unwrapping algorithm. The proposed method is compared with the standard CKFPU algorithm using both simulated and real data. The experimental results validate the feasibility and superiority of the proposed method for processing those high noise dense fringe interferograms. [ABSTRACT FROM AUTHOR]

The reinforcement learning algorithms based on policy gradient may fall into local optimal due to gradient disappearance during the update process, which in turn affects the exploration ability of the reinforcement learning agent. In order to solve the above problem, in this paper, the cross-entropy method (CEM) in evolution policy, maximum mean difference (MMD), and twin delayed deep deterministic policy gradient algorithm (TD3) are combined to propose a diversity evolutionary policy deep reinforcement learning (DEPRL) algorithm. By using the maximum mean discrepancy as a measure of the distance between different policies, some of the policies in the population maximize the distance between them and the previous generation of policies while maximizing the cumulative return during the gradient update. Furthermore, combining the cumulative returns and the distance between policies as the fitness of the population encourages more diversity in the offspring policies, which in turn can reduce the risk of falling into local optimal due to the disappearance of the gradient. The results in the MuJoCo test environment show that DEPRL has achieved excellent performance on continuous control tasks; especially in the Ant-v2 environment, the return of DEPRL ultimately achieved a nearly 20% improvement compared to TD3. [ABSTRACT FROM AUTHOR]

This paper proposed an improved particle swarm optimization (PSO) algorithm to solve the three-dimensional problem of path planning for the fixed-wing unmanned aerial vehicle (UAV) in the complex environment. The improved PSO algorithm (called DCA ∗ PSO) based dynamic divide-and-conquer (DC) strategy and modified A ∗ algorithm is designed to reach higher precision for the optimal flight path. In the proposed method, the entire path is divided into multiple segments, and these segments are evolved in parallel by using DC strategy, which can convert the complex high-dimensional problem into several parallel low-dimensional problems. In addition, A ∗ algorithm is adopted to generated an optimal path from the particle swarm, which can avoid premature convergence and enhance global search ability. When DCA ∗ PSO is used to solve the large-scale path planning problem, an adaptive dynamic strategy of the segment selection is further developed to complete an effective variable grouping according to the cost. To verify the optimization performance of DCA ∗ PSO algorithm, the real terrain data is utilized to test the performance for the route planning. The experiment results show that the proposed DCA ∗ PSO algorithm can effectively obtain better optimization results in solving the path planning problem of UAV, and it takes on better optimization ability and stability. In addition, DCA ∗ PSO algorithm is proved to search a feasible route in the complex environment with a large number of the waypoints by the experiment. [ABSTRACT FROM AUTHOR]

Aiming at the problem that stereo matching accuracy is easily affected by noise and amplitude distortion, a stereo matching algorithm based on HSV color space and improved census transform is proposed. In the cost calculation stage, the color image is first converted from RGB space to HSV space; moreover, the hue channel is used as the matching primitive to establish the hue absolute difference (HAD) cost calculation function, which reduces the amount of calculation and enhances the robustness of matching. Then, to solve the problem of the traditional census transform overrelying on the central pixel and to improve the noise resistance of the algorithm, an improved census method based on neighborhood weighting is also proposed. Finally, the HAD cost and the improved census cost are nonlinearly fused as the initial cost. In the aggregation stage, an outlier elimination method based on confidence interval is proposed. By calculating the confidence interval of the aggregation window, this paper eliminates the cost value that is not in the confidence interval and subsequently filters as well as aggregates the remaining costs to further reduce the noise interference and improve the matching accuracy. Experiments show that the proposed method can not only effectively suppress the influence of noise, but also achieve a more robust matching effect in scenes with changing exposure and lighting conditions. [ABSTRACT FROM AUTHOR]

Public security monitoring is a hot issue that the government and citizens pay close attention to. Multiobject tracking plays an important role in solving many problems for public security. Under crowded scenarios and emergency places, it is a challenging problem to predict and warn owing to the complexity of crowd intersection. There are still many deficiencies in the research of multiobject trajectory prediction, which mostly employ object detection and data association. Compared with the tremendous progress in object detection, data association still relied on hand-crafted constraints such as group, motion, and spatial proximity. Emergencies usually have the characteristics of mutation, target diversification, low illumination, or resolution, which makes multitarget tracking more difficult. In this paper, we harness the advance of the deep learning framework for data association in object tracking by jointly modeling pedestrian features. The proposed deep pedestrian tracking SSD-based model can pair and link pedestrian features in any two frames. The model was trained with open dataset, and the results, accuracy, and speed of the model were compared between normal and emergency or violent environment. The experimental results show that the tracking accuracy of mAP is higher than 95% both in normal and abnormal data sets and higher than that of the traditional detection algorithm. The detection speed of the normal data set is slightly higher than that of the abnormal data set. In general, the model has good tracking results and credibility for multitarget tracking in emergency environment. The research provides technical support for safety assurance and behavior monitoring in emergency environment. [ABSTRACT FROM AUTHOR]

Elephant herding optimization (EHO) has received widespread attention due to its few control parameters and simple operation but still suffers from slow convergence and low solution accuracy. In this paper, an improved algorithm to solve the above shortcomings, called Gaussian perturbation specular reflection learning and golden-sine-mechanism-based EHO (SRGS-EHO), is proposed. First, specular reflection learning is introduced into the algorithm to enhance the diversity and ergodicity of the initial population and improve the convergence speed. Meanwhile, Gaussian perturbation is used to further increase the diversity of the initial population. Second, the golden sine mechanism is introduced to improve the way of updating the position of the patriarch in each clan, which can make the best-positioned individual in each generation move toward the global optimum and enhance the global exploration and local exploitation ability of the algorithm. To evaluate the effectiveness of the proposed algorithm, tests are performed on 23 benchmark functions. In addition, Wilcoxon rank-sum tests and Friedman tests with 5% are invoked to compare it with other eight metaheuristic algorithms. In addition, sensitivity analysis to parameters and experiments of the different modifications are set up. To further validate the effectiveness of the enhanced algorithm, SRGS-EHO is also applied to solve two classic engineering problems with a constrained search space (pressure-vessel design problem and tension-/compression-string design problem). The results show that the algorithm can be applied to solve the problems encountered in real production. [ABSTRACT FROM AUTHOR]

This paper analyzes the transverse vibration laws of 5000 m ladder-shaped mining pipe under different towing velocities and accelerations in the ocean, thinking of the pipe as the beam model, discretized based on the FEM. The algorithm is used to solve the problem to obtain the transverse vibration law. The research shows that the mining pipe overall transverse vibration trend decreases first and then increases, the minimum vibration value occurs at 3000 m, and the maximum occurs at the top. Increasing the towing velocity, acceleration, and ore bin weight will increase the transverse vibration value. The vibration intensity produced by the same acceleration in the constant acceleration and deceleration stages is different, and the damping effect after adding the same damping is also different. In the range of 0.01 m/s2–0.1 m/s2, the vibration reduction effect after adding damping in the constant deceleration stage is more significant, and in the range of 0.1 m/s2-0.2 m/s2, the vibration reduction effect after adding damping in the constant acceleration stage is more significant. In the stage of the constant acceleration or deceleration, when adding the same damping, the vibration intensity generated by the large acceleration is still far greater than the vibration intensity generated by the small acceleration, so the mining ship should keep the small acceleration for towing motion. [ABSTRACT FROM AUTHOR]

Vehicular ad-hoc networks (VANETs) are the crucial part of intelligent transportation systems (ITS), which are brought to enhance the security, efficiency, and comfort of transportation. VANETs have aroused extensive attention in the world recently. One of the challenges in practice is real time and low delay, which strongly requires VANETs to be efficient. Existing schemes have properly solved the problem which is how to aggregate the signatures and verify the aggregated signature. However, few solutions are proposed to pinpoint all invalid signatures if existing. The algorithms that can find all invalid signatures are not efficient enough. Following consideration of the above deficiencies of existing approaches, this paper proposes a factorial bitwise divisions (FBD) algorithm and its optimized version and early-stopping factorial bitwise divisions (EFBD) algorithm. Both algorithms are parallel-friendly. Compared with the binary-based batch verification algorithm, the experimental results demonstrate that the proposed algorithms achieve better performance in both theory and practice at low invalid signatures' rate. Especially, in the parallel condition, when the number of invalid signatures is 1, the proposed algorithms cost only one aggregation-verification delay, while the comparison is more than log 2 n times. [ABSTRACT FROM AUTHOR]

Vehicular ad-hoc networks (VANETs) are the crucial part of intelligent transportation systems (ITS), which are brought to enhance the security, efficiency, and comfort of transportation. VANETs have aroused extensive attention in the world recently. One of the challenges in practice is real time and low delay, which strongly requires VANETs to be efficient. Existing schemes have properly solved the problem which is how to aggregate the signatures and verify the aggregated signature. However, few solutions are proposed to pinpoint all invalid signatures if existing. The algorithms that can find all invalid signatures are not efficient enough. Following consideration of the above deficiencies of existing approaches, this paper proposes a factorial bitwise divisions (FBD) algorithm and its optimized version and early-stopping factorial bitwise divisions (EFBD) algorithm. Both algorithms are parallel-friendly. Compared with the binary-based batch verification algorithm, the experimental results demonstrate that the proposed algorithms achieve better performance in both theory and practice at low invalid signatures' rate. Especially, in the parallel condition, when the number of invalid signatures is 1, the proposed algorithms cost only one aggregation-verification delay, while the comparison is more than log 2 n times. [ABSTRACT FROM AUTHOR]

A variety of open relation extraction systems have been developed in the last decade. And deep learning, especially with attention model, has gained much success in the task of relation classification. Nevertheless, there is, yet, no research reported on classifying open relation tuples to our knowledge. In this paper, we propose a novel semieager learning algorithm (SemiE) to tackle the problem of open relation classification. Different from the eager learning approaches (e.g., ANNs) and the lazy learning approaches (e.g., kNN), the SemiE offers the benefits of both categories of learning scheme, with its significantly lower computational cost (O(n)). This algorithm can also be employed in other classification tasks. Additionally, this paper presents an adapted attention model to transform relation phrases into vectors by using word embedding. The experimental results on two benchmark datasets show that our method outperforms the state-of-the-art methods in the task of open relation classification. [ABSTRACT FROM AUTHOR]

The set packing problem (SPP) is a significant NP-hard combinatorial optimization problem with extensive applications. In this paper, we encode the set packing problem as the maximum weighted independent set (MWIS) problem and solve the encoded problem with an efficient algorithm designed to the MWIS problem. We compare the independent set-based method with the state-of-the-art algorithms for the set packing problem on the 64 standard benchmark instances. The experimental results show that the independent set-based method is superior to the existing algorithms in terms of the quality of the solutions and running time obtained the solutions. [ABSTRACT FROM AUTHOR]

In this paper, a new relaxation model based on mean curvature for adaptive image restoration is proposed. To solve the problem efficiently, an alternating direction method of multipliers (ADMMs) is proposed. Furthermore, a rigorous convergence theory of the proposed algorithm is established. We also give the complexity analysis of our proposed method. Experimental results are provided to demonstrate the effectiveness and efficiency of the proposed method over a state-of-the-art method on synthetic and natural images. [ABSTRACT FROM AUTHOR]