A dual hesitant fuzzy set (DHFS) describes the uncertainty in the real world by using the membership degree and nonmembership degree. It can collect fuzzy information comprehensively and apply them into decision-making tasks efficiently. In this article, we extract some characteristics, such as the average function, variance function, hesitancy degree to describe a dual hesitant fuzzy element, and develop novel distance measures of DHFSs based on these characteristics. Further, we investigate their properties and prove the triangle inequality of distance measure. Finally, we apply it in practical medical diagnosis to illustrate the validity of our proposed distance measures.

Pseudo-inverse learners (PILs) are a kind of feedforward neural network trained with the pseudoinverse learning algorithm, which can be traced back to 1995 originally. PIL is an approach for nongradient descent learning, and its main advantage is the lower computational cost and fast learning procedure, which is especially relevant in the edge computing research field. However, PIL is mostly applied to a deterministic learning problem, while in the real world, the greatest case that is of concern is the uncertainty learning problem. In this work, under the framework of the synergetic learning system (SLS), we introduce an approximated synergetic learning scheme, which can transform uncertainty learning into deterministic learning. We call this new learning framework the Bayesian PIL, and the advantages are also demonstrated in this work.

In recent decades, image segmentation has aroused great interest of many researchers, and has become an important part of machine learning, pattern recognition, and computer vision. Among many methods of image segmentation, fuzzy C-means (FCM) algorithm is undoubtedly a milestone in unsupervised method. With the further study of FCM, various different kinds of FCM algorithms are put forward to deal with the specific problems in image segmentation. Because there exist uncertainties in different regions of the image and similarity in the same region, reducing the uncertainty is still the main problem in image segmentation. Considering that Pythagorean fuzzy set (PFS) is a powerful tool to deal with uncertainty, in this paper, we use PFS to describe the uncertainty of image segmentation, including introducing fuzzification and defuzzification process and Pythagorean fuzzy element to describe the membership degree of pixel, combine the neighborhood information with weights and Pythagorean fuzzy distance, and propose Pythagorean fuzzy C-means (PFCM) algorithm. Finally, we apply PFCM algorithm in image segmentation, such as different size images and Berkeley Segmentation Data Set to illustrate the effectiveness and applicability of our proposed algorithm. Meanwhile, we do comparison analysis between PFCM, fully convolution network and Deep-image-Prior networks, these results show that our proposed PFCM has good intuition and effectiveness.

Video interpolation is an important problem in computer vision, which helps overcome the temporal limitation of camera sensors. Existing video interpolation methods usually assume uniform motion between consecutive frames and use linear models for interpolation, which cannot well approximate the complex motion in the real world. To address these issues, we propose a quadratic video interpolation method which exploits the acceleration information in videos. This method allows prediction with curvilinear trajectory and variable velocity, and generates more accurate interpolation results. For high-quality frame synthesis, we develop a flow reversal layer to estimate flow fields starting from the unknown target frame to the source frame. In addition, we present techniques for flow refinement. Extensive experiments demonstrate that our approach performs favorably against the existing linear models on a wide variety of video datasets.

In Bayesian theory, the maximum posterior estimator uses prior information to estimate the noise in the machine learning model by adding the regularization term. The regularization terms L1and L2correspond to Laplacian prior and Guassian prior, respectively. In existing deep learning models, in order to use the gradient descent optimization algorithm and achieve good results, most models take L2regularization as the regularization term of the network model to fit the complex Guassian noise. However in practice, the Laplace noise and the Guassian noise are both considered as data noise. For multi-layer perceptrons, the difficulty caused by adding L1and L2into the optimization function of the network is solved by proposing an ensemble model for error modeling through adopting the divide and conquer strategy. First, several base learners are trained to fit different noise distributions of data, then the final results can be obtained by taking the results of each base leaner as new data to train a meta leaner, and get the final results. Among them, coordinate regression method is used to solve L1loss, while the pseudo-inverse learning algorithm is employed to solve L2loss. Both methods are nongradient optimization algorithms. The comparison results of the model on several data sets show that the proposed ensemble model achieves better performance.

Most blind deconvolution methods usually pre-define a large kernel size to guarantee the support domain. Blur kernel estimation error is likely to be introduced, yielding severe artifacts in deblurring results. In this paper, we first theoretically and experimentally analyze the mechanism to estimation error in oversized kernel, and show that it holds even on blurry images without noises. Then to suppress this adverse effect, we propose a low rank-based regularization on blur kernel to exploit the structural information in degraded kernels, by which larger-kernel effect can be effectively suppressed. And we propose an efficient optimization algorithm to solve it. Experimental results on benchmark datasets show that the proposed method is comparable with the state-of-the-arts by accordingly setting proper kernel size, and performs much better in handling larger-size kernels quantitatively and qualitatively. The deblurring results on real-world blurry images further validate the effectiveness of the proposed method.

Pulsars search has always been one of the most concerned problem in the field of astronomy. Nowadays, with the development of astronomical instruments and observation technology, the amount of data is getting bigger and bigger. Radio pulsar surveys have generated and will generate vast amounts of data. To handle big data, developing new technologies and frameworks to efficiently and accurately analyze these data become increasing urgent. The number of positive and negative samples in pulsar candidate data set is very unbalanced, if we only use these a few positive samples to train a deep neural network (DNN), the trained DNN is prone because of the problem of overfitting and will affect the generalization ability. Motivated by the mixtures of experts network architecture, we proposed a hierarchical model for pulsar candidate selection which assembles a set of trained base classifiers. Moreover, training a neural network always takes a lot of time because of using gradient descent (GD) based algorithm. In this work, we utilize the pseudoinverse learning algorithm instead of GD based algorithm to train proposed model. With the designed network architecture and adopted training algorithm, our model has the advantages not only with high steady-state precision but also good generalization performance.

The main feature of Pythagorean fuzzy sets is that it is characterized by five parameters, namely membership degree, nonmembership degree, hesitancy degree, strength of commitment about membership, and direction of commitment. In this paper, we first investigate four existing comparison methods for ranking Pythagorean fuzzy sets and point out by examples that the method proposed by Yager, which considers the influence fully of the five parameters, is more efficient than the other ones. Later, we propose a variety of distance measures for Pythagorean fuzzy sets and Pythagorean fuzzy numbers, which take into account the five parameters of Pythagorean fuzzy sets. Based on the proposed distance measures, we present some similarity measures of Pythagorean fuzzy sets. Furthermore, a multiple criteria Pythagorean fuzzy group decision-making approach is proposed. Finally, a numerical example is provided to illustrate the validity and applicability of the presented group decision-making method.

In this paper, we present a novel method on image calibration, utilizing Total Least Square (TLS) method and Feedforward Neural Network, to solve the aberration problem of LAMOST two-dimensional astronomical spectral images. In our method, training sample set is generated with domain knowledge, from which a number of discrete points are are extracted from spectral images with fiber tracing method, and output vectors are formed by the corresponding calibrated points, obtained by utilizing the TLS method. The Feed-forward Neural Network is trained to obtain the transformation matrix, casting about for the matching relationship between the input and output sets. We also perform comparative experiments on fiber tracing and spectrum extraction results between calibrated spectral images and uncalibrated spectral images, the results show an advantage of higher accuracy and precision by our proposed method.

Deep learning scheme has received significant attention during these years, particularly as a way of building hierarchical representations from unlabeled data for a variety of signal and information processing tasks. However, deep neural networks suffer from slow learning speed since most used training algorithms are based on variations of the gradient descent algorithms which require iterative optimization and thus are time-consuming. In addition, a series of control parameters need to be specified empirically which lacks of the theoretical guidance, and current learning algorithms for deep networks are not very suitable to incremental learning scenario. To address these issues, we propose a fast learning scheme in this paper. The basic idea of our approach is to pre-train basic units such as auto-encoders of the deep architecture in an analytical way without any iterative optimization procedure. This scheme is also extended to an incremental learning version. The experimental result shows the superiority of our approach over the state-of-the-art gradient descent based algorithms. To demonstrate the impact of our algorithm on complicated real world applications, we give an example of its performance in astronomical spectra pattern recognition.

Kernel independent component analysis (KICA) has an important application in blind source separation, in which how to select the optimal kernel, including the kernel functional form and its parameters, is the key issue for obtaining the optimal performance. In practices, a single kernel is usually chosen as the kernel model of KICA in light of experience. However, selecting a suitable kernel model is a more difficult problem if one has not sufficient experience. To deal with this problem, an evolution based method to select the kernel model of KICA is proposed in this paper. There are two main features of the proposed method: one is that using a multiple kernel model, a convex combination of several single kernels, replaces the single kernel model; another is that particle swarm optimization (PSO) algorithm is utilized to find the combination weights of the composite kernel. Experiments conducted on separating one-dimensional mixed signals, nature images, and spectroscopic CCD images showed that using multiple kernels model with PSO kernel selection algorithm can enhance the performance of KICA.

In this paper, a sub-dictionary based sparse coding method is proposed for image representation. The novel sparse coding method substitutes a new regularization item for L1-norm in the sparse representation model. The proposed sparse coding method involves a series of sub-dictionaries. Each sub-dictionary contains all the training samples except for those from one particular category. For the test sample to be represented, all the sub-dictionaries should linearly represent it apart from the one that does not contain samples from that label, and this sub-dictionary is called irrelevant sub-dictionary. This new regularization item restricts the sparsity of each sub-dictionary's residual, and this restriction is helpful for classification. The experimental results demonstrate that the proposed method is superior to the previous related sparse representation based classification.

In this paper, a novel image stitching method is proposed, which utilizes scale-invariant feature transform (SIFT) feature and single-hidden layer feedforward neural network (SLFN) to get higher precision of parameter estimation. In this method, features are extracted from the image sets by the SIFT descriptor and form into the input vector of the SLFN. The output of the SLFN is those translation, rotation and scaling parameters with respect to reference and registered image sets. We also apply a fast learning scheme, called pseudoinverse learning, to train SLFN to get higher training efficiency. Comparative experiments are performed between our proposed method and the traditional random sample consensus (RANSAC) based method. The results show that our method has the advantage not only at accuracy but also remarkably at fast speed.

In classification of a multispectral remote sensing image, it is usually difficult to obtain higher classification accuracy if we only consider the image's spectral feature or texture feature alone. In this paper, we present a new approach by applying the Ant Colony Optimization (ACO) algorithm to find a multi-feature vector composed of spectral and texture features in order to get a better result in the classification. The experimental results show that ACO algorithm is helpful in subset searching of the features used to classify the multispectral remote sense image. Using the combination of the spectral and texture features obtained by ACO in classification always produces a better accuracy.

Software metrics are collected at various phases of the software development process. These metrics contain the information of the software and can be used to predict software quality in the early stage of software life cycle. Intelligent computing techniques such as data mining can be applied in the study of software quality by analyzing software metrics. Clustering analysis, which can be considered as one of the data mining techniques, is adopted to build the software quality prediction models in the early period of software testing. In this paper, a new clustering method called Affinity Propagation is investigated for the analysis of two software metric datasets extracted from real-world software projects. Meanwhile, K-Means clustering method is also applied for comparison. The numerical experiment results show that the Affinity Propagation algorithm can be applied well in software quality prediction in the very early stage, and it is more effective on reducing Type II error.