Search

Surface roughness is a major factor controlling the shear strength of discontinuities. Various methods have so far been presented for determining surface roughness based on 2D profiles. These methods use statistical, fractal, geostatistical, directional, and spectral features of the surface profiles most of which were established through the relationship between the features and Barton standard profiles. To overcome some of the shortcomings of the standard JRC profiles, this paper presents a new method based on the investigation of 2D profiles within “pattern recognition” framework for rock surface recognition. In this way, more than 9000 profiles were gathered from 84 natural rock samples for the calculation of the features, and the joint roughness coefficient was back-calculated from test results. A representative feature vector and profile of a surface were defined, and two methods of principal component analysis (PCA) and liner discriminant analysis (LDA) were applied in order to prepare inputs for the rock surface classification. Then, minimum mean distance (MMD) and K-nearest neighbors (KNN) were used for the classification. The results show that the latter provides lower classification error (44.4% when a level difference between the predicted and back-calculated classes is accepted) due to reducing the effect of dissimilar samples. Comparison of the results with those of single-variable equations that are based on statistical (δ and Z 2 ) and directional parameters θ max ∗ 1 + C with 53.57%, 52.38%, and 48.8% errors, respectively, proves that the proposed procedure is an efficient tool for the estimation of JRC. Furthermore, based on the results obtained from the pattern recognition analysis, 10 natural and artificial reference profiles attained based on a fully quantified approach were proposed as a replacement for the current JRC profiles. [ABSTRACT FROM AUTHOR]

In the field of artificial intelligence, pattern recognition is widely used to extract the abstract information in those high dimensional inputs of image, voice, or video. However, the interpretability of pattern recognition still remains understudied. The incomplete features extracted from system input still limit the recognition performance. To reject the disturbance of feature incompleteness, an error compensation is realized into the pattern recognition model under a quantum computation framework. The quantum-based recognition system fulfills the information transmission from input to output with the transformation of quantum states. Then, a compensation for the quantum state is used to reject those intermediate errors in the pattern recognition task. The experiment results in this paper indicate an effectiveness of the proposed method, with which the compensated Quantum Neural Network obtains a better performance. The proposed method brings a more robust recognition system under unknown disturbances. [ABSTRACT FROM AUTHOR]

Measuring geotechnical and natural hazard engineering features, along with pattern recognition algorithms, allows us to categorize the stability of slopes into two main classes of interest: stable or at risk of collapse. The problem of slope stability can be further generalized to that of assessing landslide susceptibility. Many different methods have been applied to these problems, ranging from simple to complex, and often with a scarcity of available data. Simple classification methods are preferred for the sake of both parsimony and interpretability, as well as to avoid drawbacks such as overtraining. In this paper, an experimental comparison was carried out for three simple but powerful existing variants of the well-known nearest neighbor rule for classifying slope/landslide data. One of the variants enhances the representational capacity of the data using so-called feature line segments, while all three consider the concept of a territorial hypersphere per prototype feature point. Additionally, this experimental comparison is entirely reproducible, as Python implementations are provided for all the methods and the main simulation, and the experiments are performed using three publicly available datasets: two related to slope stability and one for landslide susceptibility. Results show that the three variants are very competitive and easily applicable. [ABSTRACT FROM AUTHOR]

In this paper, we present a new approach for defining a dual proximity measure for intuitionistic fuzzy sets. The new approach utilizes an extended form of the restricted equivalence functions and receives their values as a two tuple. The two values in the two tuple are due to the dual character of the proximity measure under consideration. In fact, the computation of proximity between two intuitionistic fuzzy sets simultaneously provides the value of similarity as well as non-similarity between the intuitionistic fuzzy sets. So, the novel approach proposed in this paper provides a comprehensive information theoretic evaluation of intuitionistic fuzzy sets. Further, we investigate the application of the novel measure in pattern recognition and clustering analysis. We also contrast the performance of the proposed measure with the state-of-art in view of the structured linguistic variables, pattern classification and clustering analysis. The comparative analysis shows that the newly introduced two-valued proximity measure performs better in certain circumstances and encompasses the dualism of the human cognition. [ABSTRACT FROM AUTHOR]

Keyword Spotting (KWS) is here considered as a basic technology for Probabilistic Indexing (PrIx) of large collections of handwritten text images to allow fast textual access to the contents of these collections. Under this perspective, a probabilistic framework for lexicon-based KWS in text images is presented. The presentation aims at providing formal insights which help understanding classical statements of KWS (from which PrIx borrows fundamental concepts), as well as the relative challenges entailed by these statements. The development of the proposed framework makes it clear that word recognition or classification implicitly or explicitly underlies any formulation of KWS. Moreover, it suggests that the same statistical models and training methods successfully used for handwriting text recognition can advantageously be used also for PrIx, even though PrIx does not generally require or rely on any kind of previously produced image transcripts. Experiments carried out using these approaches support the consistency and the general interest of the proposed framework. Results on three datasets traditionally used for KWS benchmarking are significantly better than those previously published for these datasets. In addition, good results are also reported on two new, larger handwritten text image datasets (Bentham and Plantas), showing the great potential of the methods proposed in this paper for indexing and textual search in large collections of untranscribed handwritten documents. Specifically, we achieved the following Average Precision values: IAMDB: 0.89, George Washington: 0.91, Parzival: 0.95, Bentham: 0.91 and Plantas: 0.92. [ABSTRACT FROM AUTHOR]

This paper considers the use of machine learning for diagnosis of diseases that is based on the analysis of a complete gene expression profile. This distinguishes our study from other approaches that require a preliminary step of finding a limited number of relevant genes (tens or hundreds of genes). We conducted experiments with complete genetic expression profiles (20 531 genes) that we obtained after processing transcriptomes of 801 patients with known oncologic diagnoses (oncology of the lung, kidneys, breast, prostate, and colon). Using the indextron (instant learning index system) for a new purpose, i.e., for complete expression profile processing, provided diagnostic accuracy that is 99.75% in agreement with the results of histological verification. [ABSTRACT FROM AUTHOR]

Understanding the glassy nature of neural networks is pivotal both for theoretical and computational advances in Machine Learning and Theoretical Artificial Intelligence. Keeping the focus on dense associative Hebbian neural networks (i.e. Hopfield networks with polynomial interactions of even degree P > 2 ), the purpose of this paper is twofold: at first we develop rigorous mathematical approaches to address properly a statistical mechanical picture of the phenomenon of replica symmetry breaking (RSB) in these networks, then—deepening results stemmed via these routes—we aim to inspect the glassiness that they hide. In particular, regarding the methodology, we provide two techniques: the former (closer to mathematical physics in spirit) is an adaptation of the transport PDE to this case, while the latter (more probabilistic in its nature) is an extension of Guerra’s interpolation breakthrough. Beyond coherence among the results, either in replica symmetric and in the one-step replica symmetry breaking level of description, we prove the Gardner’s picture (heuristically achieved through the replica trick) and we identify the maximal storage capacity by a ground-state analysis in the Baldi-Venkatesh high-storage regime. In the second part of the paper we investigate the glassy structure of these networks: at difference with the replica symmetric scenario (RS), RSB actually stabilizes the spin-glass phase. We report huge differences w.r.t. the standard pairwise Hopfield limit: in particular, it is known that it is possible to express the free energy of the Hopfield neural network (and, in a cascade fashion, all its properties) as a linear combination of the free energies of a hard spin glass (i.e. the Sherrington–Kirkpatrick model) and a soft spin glass (the Gaussian or ”spherical” model). While this continues to hold also in the first step of RSB for the Hopfield model, this is no longer true when interactions are more than pairwise (whatever the level of description, RS or RSB). For dense networks solely the free energy of the hard spin glass survives. As the Sherrington–Kirkpatrick spin glass is full-RSB (i.e. Parisi theory holds for that model), while the Gaussian spin-glass is replica symmetric, these different representation theorems prove a huge diversity in the underlying glassiness of associative neural networks. [ABSTRACT FROM AUTHOR]

With the vigorous development of the Internet, multimedia technology, and virtual reality technology, digital museum has been born and gradually entered the stage of rapid development. As a typical application of 3D virtual scene in the field of traditional culture protection and communication, 3D virtual museum has become an important trend in the development of museums in recent years. Three-dimensional virtual museum can maximize the development of museum functions and better play the museum's cultural communication and heritage protection and other functions. Faced with such rich cultural relic resources, how to construct 3D virtual museum quickly becomes an important research problem. Virtual reality technology integrates the latest research and development achievements of digital image graphics processing technology, computer technology, artificial intelligence, multimedia technology, sensor technology, and other information technologies, which provides powerful support and help for us to create and experience virtual world. The combination of virtual reality technology and cultural heritage protection has created a new research field. Based on this, this paper studies personalized healthcare museum exhibition system design based on the VR and deep learning-driven multimedia and multimodal sensing. The novel computational model is designed to improve the systematic performance of the VR framework, and the application scenarios are tested. Through the verification, the performance is tested. [ABSTRACT FROM AUTHOR]

Since 2019, the Russian–Italian experiment "UV Atmosphere" (Mini-EUSO) has been operational on the International Space Station. The primary instrument of this experiment is a wide-angle telescope positioned toward nadir. Its main objective is to generate an ultraviolet map of the Earth's nocturnal atmosphere radiation. This map serves as a crucial element in the preparation of a large-scale experiment involving the study of extremely high-energy cosmic rays using an orbiting telescope. Similar to the preceding TUS experiment, the "UV Atmosphere" instrument detects signals from various atmospheric processes in the ultraviolet range, including the luminosity of meteors. In this paper, we describe two simple neural networks that effectively extract meteor signals from the overall data stream. The proposed approach can also be applied to identify track-like signals of various origins in the data obtained from fluorescent and Cherenkov telescopes. [ABSTRACT FROM AUTHOR]

With the development of the big data era, the manufacturing industry is focusing on integrating the technologies related to the evolving intelligent industry. Intelligent manufacturing is the latest form of advanced manufacturing development. In order to pay attention to the design and evaluation status of manufacturing system, we understand the connotation of manufacturing system from the perspective of actual manufacturing production and sales. In this paper, the evaluation model and algorithm of Intelligent Manufacturing System Based on pattern recognition and big data are proposed. In the process of studying the information transmission of intelligent manufacturing system, the evaluation hierarchy algorithm of intelligent control system is improved with reference to several modeling methods. Finally, an intelligent manufacturing system suitable for processing big data is designed. In the experiment in workshop A, with the help of computer simulation of artificial intelligent activities, the intelligent manufacturing system analyzes the processing and production data, obtains the dynamic requirements of products in the machining workshop, and provides judgment basis for the construction of dynamic units in enterprises. The experimental results show that after the change of the production organization model using the seasonal change forecasting method, the introduction of the smart manufacturing system, the sales production of this shop has been increasing, and in the 20th month has increased seven times more than the initial, while the overall situation of the predicted sales and actual sales and costs, the superiority of using the smart manufacturing evaluation model is derived. [ABSTRACT FROM AUTHOR]

In order to effectively identify the pattern of personalized adaptive learning in online education and improve the recommendation satisfaction of personalized learning resources in online education platform, this paper studies the pattern recognition method of personalized adaptive learning in online education. The learning behavior pattern data in the online education platform are mined, preprocessed, clustered and made correlation analysis, and the obtained data are used to construct the learner's personalized adaptive learning characteristics model; on this basis, the framework of learning pattern recognition model is constructed to recognize the personalized adaptive learning pattern from four aspects: cognitive level, learning style, interactive behavior pattern characteristics and online social learning characteristics. The experimental test results show that this method can effectively identify the personalized adaptive learning patterns of learners, including interactive learning behavior patterns and online social learning patterns. The personalized learning resources recommended by the online education platform according to the identification results of this paper have obtained the learners' satisfaction score of a high level at 93.27%. [ABSTRACT FROM AUTHOR]

Tool wear is inevitable in cutting process. If tool wear failure is not detected in time, it will lead to abnormal cutting process and affect the machining efficiency and quality seriously. The intelligent monitoring of tool wear can make the machining system perceive the real-time status of tools in advance and make early warning and decision-making, which is an effective way to ensure the efficient operation of machining and manufacturing system. By reviewing the research status of intelligent monitoring of tool wear, the key technical principles and methods of multisource-correlation signal selection, feature extraction and pattern recognition are classified. On the basis, the current application status of tool wear monitoring is discussed. In view of its shortcomings, this paper puts forward the prospect of the future, in order to provide a theoretical basis and reference for the development of tool wear intelligent monitoring technology and intelligent manufacturing industry. [ABSTRACT FROM AUTHOR]

Acquisition, classification, and analysis of seismic data are crucial tasks in volcano monitoring. The large number of seismic signals that are continuously acquired during the first monitoring stage poses a huge challenge for the human experts that must classify and analyze them. Several automatic classification systems have been proposed in the literature to alleviate such an overwhelming workload, each one characterized by different levels of accuracy, computational complexity, and interpretability. Considering this last perspective, which represents one of the recent key issues in geoscience, it is possible to find many accurate methods (in terms of classification accuracy) which however represent black boxes, not permitting a clear interpretation. On the other hand, there are other approaches, such as those based on support vector machines (SVM), random forests (RF), and K-nearest neighbor (KNN), which permit the interpretation of results, rules, and models at different levels. Among these last techniques, KNN approaches for volcanic signal classification typically do not achieve the satisfactory classification results obtained with RF and SVM. One possible reason is that in this context, the KNN rule has usually been applied in its basic version, not exploiting the different advanced KNN variants that have been introduced in recent years. This paper takes one step along this direction, investigating the suitability of a number of advanced versions of the KNN rule for the problem of classifying seismic-volcanic signals. The usefulness of these rules, in comparison with the original KNN rule as well as other interpretable classifiers, is evaluated within a real-world scenario involving a five-class dataset of seismic signals acquired at the Nevado del Ruiz volcano, Colombia. The results show that the classification accuracy of basic KNN is largely improved by these advanced variants, even surpassing that obtained with other classifiers like RF and SVM. [ABSTRACT FROM AUTHOR]

Systematic pattern recognition as well as the corresponding description of determined patterns entail numerous challenges in the application context of high-dimensional communication data. These can cause increased effort, especially with regard to machine-based processing concerning the determination of regularities in underlying datasets. Due to the increased expansion of dimensions in multidimensional data spaces, determined patterns are no longer interpretable by humans. Taking these challenges into account, this paper investigates to what extent pre-defined communication patterns can be interpreted for the application area of high-dimensional business communication data. An analytical perspective is considered by taking into account a holistic research approach and by subsequently applying selected Machine Learning methods from Association Rule Discovery, Topic Modelling and Decision Trees with regard to the overall goal of semi-automated pattern labelling. The results show that meaningful descriptions can be derived for the interpretation of pre-defined patterns. [ABSTRACT FROM AUTHOR]

Among the most classic measures in single valued neutrosophic sets (SVNS) theory, the distance is an important tool to compare and calculate degree of difference between SVNS. Although there exist some types of distance for single valued neutrosophic sets, most of them lack of strictly axiomatic definition and exist counter-intuitive cases. In this paper, a novel distance between single valued neutrosophic sets based on matrix norm is given. Then we proved that the new distance satisfies the axiomatic definition of the metric. Finally, the distance is applicated to pattern recognition and medical diagnoses. [ABSTRACT FROM AUTHOR]

Raman spectroscopy can characterize the rich molecular vibration information of soybean milk powder samples, but difficulties arise in its direct use for sample classification and identification. Therefore, it is urgent to develop an intelligent identification technology based on Raman spectroscopy. For brand identification of soybean milk powder, this work investigates and discusses a variety of spectral processing technologies including wavelet denoising, normalization, principal component analysis, and the results show that appropriate spectral processing can improve the recognition accuracy of the random forest algorithm. Under the optimal conditions (db2 wavelet, normalization, principal component analysis, 30 decision trees), the best recognition effect of soybean milk brand identification can be achieved. The Raman spectral signal acquisition time of each sample is 40 s, and the spectra pretreatment and identification operation time only takes a few minutes. The analytical approach established in this paper has the advantages of convenient and fast Raman spectra acquisition, fast and accurate model identification. [ABSTRACT FROM AUTHOR]

Nowadays, political parties have widely adopted social media for their party promotions and election campaigns. During the election, Twitter and other social media platforms are used for political coverage to promote the party and its candidates. This research discusses and estimates the stability of many volumetric social media approaches to forecast election results from social media activities. Numerous machine learning approaches are applied to opinions shared on social media for predicting election results. This paper presents a machine learning model based on sentiment analysis to predict Pakistan's general election results. In a general election, voters vote for their favorite party or candidate based on their personal interests. Social media has been extensively used for the campaign in Pakistan general election 2018. Using a machine learning technique, we provide a five-step process to analyze the overall election results, whether fair or unfair. The work is concluded with detailed experimental results along with discussion on the outcomes of sentiment analysis for real-world forecasting and approval of general elections in Pakistan. [ABSTRACT FROM AUTHOR]

The orthogonal moments have recently achieved outstanding predictive performance and become an indispensable tool in a wide range of imaging and pattern recognition applications, including image reconstruction, image classification and object detection. We present in this paper, a new set of orthogonal functions, called "Orthogonal helmet functions." Using these functions we introduce three new sets of orthogonal moments and their invariants to scaling, rotation and translation for image representation and recognition, named, respectively, "the orthogonal helmet-Fourier moments" for the gray-level images, the multi-channel orthogonal helmet-Fourier moments and the quaternion orthogonal helmet-Fourier moments (QHFMs) for the color images. We introduce a series of experimental tests in image analysis and pattern recognition to validate the theoretical framework of our approach. The performance of these feature vectors is compared with the existing orthogonal invariant moments. The results of the comparative study show the efficiency and the superiority of our three orthogonal invariant moments. Thanks to our orthogonal moments QHFMs, we were able to lift the image recognition quality with rate can reach 2.06 %. [ABSTRACT FROM AUTHOR]

The systematic processing of unstructured communication data as well as the milestone of pattern recognition in order to determine communication groups in negotiations bears many challenges in Machine Learning. In particular, the so-called curse of dimensionality makes the pattern recognition process demanding and requires further research in the negotiation environment. In this paper, various selected renowned clustering approaches are evaluated with regard to their pattern recognition potential based on high-dimensional negotiation communication data. A research approach is presented to evaluate the application potential of selected methods via a holistic framework including three main evaluation milestones: the determination of optimal number of clusters, the main clustering application, and the performance evaluation. Hence, quantified Term Document Matrices are initially pre-processed and afterwards used as underlying databases to investigate the pattern recognition potential of clustering techniques by considering the information regarding the optimal number of clusters and by measuring the respective internal as well as external performances. The overall research results show that certain cluster separations are recommended by internal and external performance measures by means of a holistic evaluation approach, whereas three of the clustering separations are eliminated based on the evaluation results. [ABSTRACT FROM AUTHOR]

Statistical process control (SPC) has proven to be an effective tool for measuring, controlling, and improving a process through the application of statistical procedures. The most valuable SPC tool is control charts, however, if data assumptions are not met, alterations of the statistical performance of traditional control charts may be expected. In practice, the independence assumption is commonly violated in many discrete and continuous industrial processes. Recently, machine learning has been applied in the field of control chart pattern recognition (CCPR) in order to detect and identify abnormal patterns associated with assignable causes. In several instances, the performance of SVMs has been proven superior to other machine learning algorithms. In this paper, a SVM-GA-based monitoring system is presented for fault identification in AR(1) auto-correlated processes. A two stages classification scheme is presented. The initial classification stage is centered on abnormal pattern identification. The integration of a genetic algorithm in this stage boosts the performance of the SVM by simultaneously optimizing the input feature vector, the classifiers' hyper-parameters, and the window size. A second stage provides additional information on the detected abnormal pattern in order to facilitate the fault diagnosis. The results showed a good accuracy performance on both classification stages. The proposed monitoring system yielded better classification accuracies for positive autocorrelation levels than it did for their negative counterparts. The worst classification accuracies were obtained when autocorrelation was not present. [ABSTRACT FROM AUTHOR]

The supervised dictionary learning methods have made considerable achievements in the field of pattern recognition. In order to make the learned coefficients have intraclass similarity and interclass incoherence, many dictionary learning methods have been proposed using different structured constraints. However, these constraints often have the disadvantages of complexity, time-consuming, and poor interpretability. More importantly, the existing dictionary learning often ignores the inherent structure of the label matrix. In this paper, we propose a dictionary pair learning based on the structured classifier and perform classifier learning and structured coefficients learning simultaneously. Our main idea is to use the extended label matrix and the invertible constraints on the classification transformation matrix to utilize the structure of the label matrix to impose structured constraints on coefficients. Moreover, the l 21 -norm is added to force the analysis dictionary to focus on more important features. Experimental results on multiple databases prove that our proposed method has better classification performance than several state-of-the-art dictionary learning methods. [ABSTRACT FROM AUTHOR]

In this paper, we outline the overview of the problem of intraplate seismicity and summarize our studies aimed at identifying potential earthquake sources in three regions located in continental environments. We study the French Massif Central situated within the West-European platform, the Gujarat area located at the northwestern edge of the Indian shield, and northeast Egypt located in the northeastern part of the African continent. These regions exhibit different levels of seismic activity. The French Massif Central reveals the lowest rate of seismicity, northeast Egypt exposes a low-to-moderate seismicity, and Gujarat reveals moderate seismicity with rare occurrence of strong events. We use a phenomenological approach for identifying possible locations of earthquakes, which is based on the pattern recognition applied to morphostructural data. The approach hypothesizes the nucleation of strong earthquakes at morphostructural nodes forming at the intersections of morphostructural lineaments, which are delineated by morphostructural zoning. Nodes are characterized by the pertinent geophysical and geological parameters, on the basis of which pattern recognition algorithm pinpoints capable nodes, i.e., the nodes where events of a certain sizes may occur. Seismic hazard assessment of continental regions is impeded because their seismic history is normally very pure. In such a situation, information on capable nodes is a necessary input for seismic hazard assessment. The example of northeast Egypt shows the exploiting capable nodes to assess seismic hazard by the Neo-Deterministic Seismic Hazard Assessment Methodology. [ABSTRACT FROM AUTHOR]

In this paper, the mathematical model used in finding the common vectors of classes in pattern recognition problems is reconsidered to obtain possible alternative solutions for the common vectors. Since the number of unknowns is always one larger than the number of equations in the mathematical model, the best solution to the problem seems to be the pseudo-inverse solutions. We obtained two forms of common vectors, called "pseudo-common vectors," using the proposed idea. Computational simplifications are accomplished as shown in the paper since we know that taking pseudo-inverses is an exhaustive procedure especially in the high-dimensional vector spaces. The two forms of pseudo-common vectors obtained in the paper are used in the classification of the data given in TI-Digit, AR-Face, and MNIST databases separately in order to see their effectiveness. [ABSTRACT FROM AUTHOR]

In this paper, a Competitive Neural Network circuit based on voltage-controlled memristors is proposed, of which the synapse structure is one memristor (1M). The designed circuit consists of the forward calculation part and the weight updating part. The forward calculation part is designed according to the winner-take-all mechanism, in which the m-LIF model and PMOS transistors with switching characteristics are combined to achieve the lateral inhibition. The weight updating part is designed based on the Hebbian learning rule. By using the voltage controlled switches, only the synaptic memristors connected to the winner output neuron obtained from the forward calculation part are adjusted. The whole circuit does not require the participation of CPU, FPGA or other microcontrollers, providing the possibility to realize computing-in-memory and parallel computing. We perform simulation experiments of unsupervised online learning of 5*3 pixels patterns and 28*28 pixels patterns based on the designed circuit in PSPICE. The changing trend of the network weights during the training phase and the high recognition accuracy in the recognition phase verify the network can effectively learn and recognize different patterns. [ABSTRACT FROM AUTHOR]

Gray-level co-occurrence matrix (GLCM) is one of the oldest techniques used for texture analysis. It has two important parameters, i.e., distance and direction. In this paper, various combinations of distance and directional angles used for GLCM calculation are analyzed in order to recognize certain patterned images based on their textural features. In the proposed approach, the work is divided into two modules: determining the pattern of the image and pattern retrieval from the dataset. Patterns considered in this paper are horizontal striped, vertical striped, right and left diagonally striped, checkered and other images. For recognizing the pattern, the proposed approach has achieved a percentage accuracy of 96, 98, 96, 90, 96 and 94 for horizontal striped, vertical striped, right and left diagonally striped, checkered and other irregular patterns (not fully stripped), respectively. The proposed approach has a practical implementation in the fashion industry so to filter the search according to the pattern of the cloth. [ABSTRACT FROM AUTHOR]

Due to its capability of machining hard-to-cut materials as well as its high machining efficiency as compared with conventional electrical discharge machining (EDM) processes, fast electrical discharge drilling (fast EDM drilling) is widely applied in industries such as mold and die as well as aerospace component manufacturing. The breakout detection is an essential technique for hole completion judgment and back-strike prevention. This paper presents a novel method, called classification of machining state graphs (CMSG), for online detection of breakout events. A machining state graph (MSG) is formed by the recent changing patterns of feature signals, which would change abruptly when breakout happens. Then, the detection problem is solved by classification of real-time MSGs. In this paper, the feature signals were selected to be normal discharge ratio, short circuit ratio, and servo feedrate of the tool electrode. The signals were preprocessed in order to improve the detection accuracy and reduce the decision lag. A classification model was built to classify MSGs. To simplify the modeling process and improve the generalization ability of the detector, a pattern recognition (PR) algorithm was adopted as the core algorithm for classification. The classification model of the detector was acquired through offline training and loaded on the start-up of the control system for online detection. Performance judgment criteria were proposed and experimental results proved the high performance of the proposed method. [ABSTRACT FROM AUTHOR]

Iris image-based biometric systems are commonly used in applications that demand security, authentication, recognition and faster login access. In solving these real-time problems, the impact of soft computing techniques which employ cognitive skills is very high. Although this system has been commercialized, the scope for improvement is still plenty. This paper introduces the reader to different segments of an iris recognition system and reviews the techniques involved with each segment. It reports on how research articles validate the robustness of an iris-based recognition system. As these systems are fallible, it also shows the vulnerabilities associated with each segment and provides insights to develop much better intelligent and robust techniques which will make the system more accurate. This paper also shows that in spite of versatility of soft computing techniques, it is not fully exploited for iris recognition systems. The present challenges and directions for future research are also discussed. [ABSTRACT FROM AUTHOR]

Mobile Internet allows users to connect to the Internet anytime and anywhere. It has penetrated into every corner of human social life, and has had a tremendous impact, which has aroused great attention from all over the world. This paper introduces the concept of mobile Internet architecture, reference model and basic knowledge of technical characteristics; and then expounds the development status of key technologies of mobile Internet, combining the development trend of the world of information and network technology, the mobile Internet technology development are forecasted. Mobile Internet is a combination of mobile communication and traditional Internet which is the IT field at present and in the future for a long period of time. The rapid growth of data show that the global mobile Internet is still in the primary stage, there is still many problems to be solved and is not clear. This paper first introduces the basic concept of mobile Internet, including the definition, function the characteristics and architecture; basic research system given in the mobile Internet, discusses its components, including mobile terminals, access network, application service and the security and privacy aspects of the research status, existing problems and solutions. Finally, we discuss the research and development trend of mobile Internet in the future. The experimental results validated the performance of the proposed method, it outperforms compared with the other state-of-the-art models. [ABSTRACT FROM AUTHOR]

Due to the digitization of data and the dynamic requirements of the users, cloud computing is one of the most used technologies in the present scenario. Cloud computing provides a platform to store, process, and share data remotely for heterogeneous users and provides services according to the requests generated by those users. However, its rapid growth has led to one of the major challenges in the environment; the security and privacy of the data. To address the security and privacy concerns, in this paper, our major contribution is a trusted computing framework namely Secure Framework using Behavior and Role Analysis (SFBRA) for cloud data security. The framework utilizes user log monitoring data, pattern recognition algorithms, and role-based access mechanisms to detect malicious and suspicious activities of different users. Our proposed framework provides two levels of security for cloud users. In Level-1, we calculate the trust value of the logged-in users by analyzing the existing log table and pattern of request access. In Level-2, we calculate the trust of the request (storage, processing, sharing) data packet using behavior analysis of the user and a role-based access mechanism and finally detect the malicious activities. The efficacy of our proposed framework is demonstrated through experimentation, where we compare our framework with existing research works. The results show 95% accuracy in potential attack detection and prevention,approximately 8 Mbps throughput, and 0.003% packet drop on average. [ABSTRACT FROM AUTHOR]

Studies recently accomplished on the Enteric Nervous System have shown that chronic degenerative diseases affect the Enteric Glial Cells (EGC) and, thus, the development of recognition methods able to identify whether or not the EGC are affected by these type of diseases may be helpful in its diagnoses. In this work, we propose the use of pattern recognition and machine learning techniques to evaluate if a given animal EGC image was obtained from a healthy individual or one affect by a chronic degenerative disease. In the proposed approach, we have performed the classification task with handcrafted features and deep learning-based techniques, also known as non-handcrafted features. The handcrafted features were obtained from the textural content of the ECG images using texture descriptors, such as the Local Binary Pattern (LBP). Moreover, the representation learning techniques employed in the approach are based on different Convolutional Neural Network (CNN) architectures, such as AlexNet and VGG16, with and without transfer learning. The complementarity between the handcrafted and non-handcrafted features was also evaluated with late fusion techniques. The datasets of EGC images used in the experiments, which are also contributions of this paper, are composed of three different chronic degenerative diseases: Cancer, Diabetes Mellitus, and Rheumatoid Arthritis. The experimental results, supported by statistical analysis, show that the proposed approach can distinguish healthy cells from the sick ones with a recognition rate of 89.30% (Rheumatoid Arthritis), 98.45% (Cancer), and 95.13% (Diabetes Mellitus), being achieved by combining classifiers obtained on both feature scenarios. [ABSTRACT FROM AUTHOR]

Segmentation of dried amnion biomaterial tends to produce invalid (outlier) contour point detections due to texture and colour inhomogeneity of the biomaterial. In this paper, a novel implementation of a non-stationary Bayesian learning process for outlier contour point removal of amnion segmentations is presented. This outlier removal method is independent to algorithms used for the contour detection. The Bayesian process uses a non-stationary kernel to learn a function with complex shape that maps image features in a region-of-interest around each contour point to a discrete output. Based on this output, a contour point can be determined as valid or invalid (outlier). The hyper-parameters of the non-stationary kernel are learned by maximising the marginal likelihood of the combined likelihood of data and the prior of the kernel parameters. Moreover, a novel combination of gradient-ascend and harmonic heuristic search methods is presented to find the optimal hyper-parameters. To validate the method, experiments are conducted to detect and ignore invalid contour points on amnion biomaterial images. A comparison of the proposed method with a logistic regression classification as the baseline is performed. The results show that the proposed method can significantly improve the contour detection by removing outliers and, hence, can reduce waste of uncut biomaterials. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new set of fractional-order continuous orthogonal moments for image representation. These are called fractional-order Jacobi moments (FrJMs) and are defined from the fractional-order orthogonal Jacobi polynomials. We also propose a method for the fast and precise calculation of FrJMs based on recursive calculations of fractional-order Jacobi polynomials and on the separability property of FrJMs. Then, we will derive invariants of FrJMs with respect to rotation, scale and translation (RST) in order to apply them for classification tasks. Just as important, we have presented a systematic parameter selection method for finding the optimal fractional parameter values with respect to pattern recognition applications. Finally, an experimental and comparative study was carried out to test the capacity of FrJMs for the image reconstruction, extraction of global and local image characteristics, invariance to RST, sensitivity to noise, ability to recognize similar grayscale images and the computational times of the new descriptors. The proposed descriptors outperformed the recent orthogonal moments with fractional orders. [ABSTRACT FROM AUTHOR]

In this paper, a new distance measure of three-parameter interval numbers is proposed, which considers not only the particularity of the center of gravity in a three-parameter interval number but also the influence of risk attitudes of decision makers. Some properties of the proposed distance measure are also proved from the perspective of metric spaces. Based on the proposed distance measure of three-parameter interval numbers, a new type of distance measure of LR-type fuzzy numbers is introduced. By considering different left and right shape functions in the proposed distance measure of LR-type fuzzy numbers, some new distance measures of triangular fuzzy numbers and normal fuzzy numbers are obtained. It is shown from some examples that the proposed distance measures of triangular fuzzy numbers and normal fuzzy numbers may overcome drawbacks of some existing similarity measures of triangular fuzzy numbers and normal fuzzy numbers. [ABSTRACT FROM AUTHOR]

This paper introduces a scheme for semi-supervised data representation. It proposes a flexible nonlinear embedding model that imitates the principle of spectral graph convolutions. Structured data are exploited in order to determine nonlinear and linear models. The introduced scheme takes advantage of data graphs at two different levels. First, it incorporates manifold regularization that is naturally encoded by the graph itself. Second, the regression model is built on the convolved data samples that are obtained by the joint use of the data and their associated graph. The proposed semi-supervised embedding can tackle challenges related to over-fitting in image data spaces. The proposed graph convolution-based semi-supervised embedding paves the way to new theoretical and application perspectives related to the nonlinear embedding. Indeed, building flexible models that adopt convolved data samples can enhance both the data representation and the final performance of the learning system. Several experiments are conducted on six image datasets for comparing the introduced scheme with many state-of-art semi-supervised approaches. These experimental results show the effectiveness of the introduced data representation scheme. [ABSTRACT FROM AUTHOR]

Images recognition and classification require an extraction technique of feature vectors of these images. These vectors must be invariant to the three geometric transformations: rotation, translation and scaling. Several authors used the theory of orthogonal moments to extract the feature vectors of images. Jacobi moments are orthogonal moments, which have been widely applied in imaging and pattern recognition. However, the invariance to rotation of Cartesian Jacobi moments is very difficult to obtain. In this paper, we obtain at first a set of transformed orthogonal Jacobi polynomials, called "Adapted Jacobi polynomials". Based on these polynomials, a set of orthogonal moments is presented, named adapted Jacobi moments (AJMs). These moments are orthogonal on the rectangle 0 , N × 0 , M , where N × M is the size of the described image. We also provide a new series of feature vectors of images based on adapted Jacobi orthogonal invariants moments, which are a linear combination of geometric moment invariants, where the latest ones are invariant under rotation, translation and scaling of the described image. Based on k-NN algorithm, we apply a new 2D image classification system. We introduce a set of experimental tests in pattern recognition. The obtained results express the efficiency of our method. The performance of these feature vectors is compared with someones extracted from Hu, Legendre and Tchebichef invariant moments using three different 2D image databases: MPEG7-CE shape database, Columbia Object Image Library (COIL-20) database and ORL database. The results of the comparative study show the performance and superiority of our orthogonal invariant moments. [ABSTRACT FROM AUTHOR]

Orthogonal moments and their invariants to geometric transformations for gray-scale images are widely used in many pattern recognition and image processing applications. In this paper, we propose a new set of orthogonal polynomials called adapted Gegenbauer–Chebyshev polynomials (AGC). This new set is used as a basic function to define the orthogonal adapted Gegenbauer–Chebyshev moments (AGCMs). The rotation, scaling, and translation invariant property of (AGCMs) is derived and analyzed. We provide a novel series of feature vectors of images based on the adapted Gegenbauer–Chebyshev orthogonal moments invariants (AGCMIs). We practice a novel image classification system using the proposed feature vectors and the fuzzy k-means classifier. A series of experiments is performed to validate this new set of orthogonal moments and compare its performance with the existing orthogonal moments as Legendre invariants moments, the Gegenbauer and Tchebichef invariant moments using three different image databases: the MPEG7-CE Shape database, the Columbia Object Image Library (COIL-20) database and the ORL-faces database. The obtained results ensure the superiority of the proposed AGCMs over all existing moments in representation and recognition of the images. [ABSTRACT FROM AUTHOR]

Inspired by quaternion algebra and the idea of fractional-order transformation, we propose a new set of quaternion fractional-order generalized Laguerre orthogonal moments (QFr-GLMs) based on fractional-order generalized Laguerre polynomials. Firstly, the proposed QFr-GLMs are directly constructed in Cartesian coordinate space, avoiding the need for conversion between Cartesian and polar coordinates; therefore, they are better image descriptors than circularly orthogonal moments constructed in polar coordinates. Moreover, unlike the latest Zernike moments based on quaternion and fractional-order transformations, which extract only the global features from color images, our proposed QFr-GLMs can extract both the global and local color features. This paper also derives a new set of invariant color-image descriptors by QFr-GLMs, enabling geometric-invariant pattern recognition in color images. Finally, the performances of our proposed QFr-GLMs and moment invariants were evaluated in simulation experiments of correlated color images. Both theoretical analysis and experimental results demonstrate the value of the proposed QFr-GLMs and their geometric invariants in the representation and recognition of color images. [ABSTRACT FROM AUTHOR]

The detection of defects in solar cells based on machine vision has become the main direction of current development, but the graphical feature extraction of micro-cracks, especially cracks with complex shapes, still faces formidable challenges due to the difficulties associated with the complex background, non-uniform texture, and poor contrast between crack defects and background. In this paper, a novel detection scheme based on machine vision to detect multi-crossing cracks for multi-crystalline solar cells was proposed. First, faced with periodic noise, we improved the filter method in the frequency domain and eliminated the background interference of fingers by filtering out the periodic noise while retaining the integrity of the crack signal. To address the anisotropy of multi-crossing cracks, we designed a special grid-shaped, convolution kernel filter to accurately extract crack features at low contrast and in the presence of a complex textured background. Finally, to address the missing features from the central region of multi-crossing cracks, we designed a method based on the orientation information of mask pattern to implement feature reconstruction for the central region of the crack. The experimental results showed that, compared to other crack detection methods, the strategy designed herein exhibited a better detection performance and stronger robustness. [ABSTRACT FROM AUTHOR]

In this paper, a new method for automatic filter coefficient calculation in lifting scheme wavelet transform for image lossless compression is proposed. Actually, there is no specific rule for setting filter coefficients (a, b). Therefore, this work proposes an automatic method to calculate the filter coefficients depending on the spectral analysis of each image. Also, filter coefficients are determined for five decomposition levels and for each quadrant through applying the discrete wavelet transform in the lossless image compression problem. Spectral patterns are computed and fixed into small length vectors for building different wavelet decomposition levels; these vectors are automatically computed using a 1-NN classifier. Experimental results over standard images show that calculating the wavelet filter coefficients using the proposed method generates higher compression rates (in entropy and bitstream values) against standard wavelet and linear prediction filters. [ABSTRACT FROM AUTHOR]

In this paper, we define the concept of Pythagorean fuzzy point. We define a similarity measure between Pythagorean fuzzy points, and we give an application of this similarity measure in pattern recognition. We also introduce a new type of continuity for the functions defined between two Pythagorean fuzzy topological spaces. Moreover, we introduce the concept of Moore–Smith convergence in Pythagorean fuzzy topological space, and we investigate the relationship between convergence of nets and continuity. [ABSTRACT FROM AUTHOR]

Typically, image-based smoke detection is formulated as a frame classification task that aims to automatically assign the captured frames to the predefined "smoke" or "smoke-free" classes. This classification is based on the visual content of the images. In other words, the keystone of such a solution is the choice of the visual descriptor(s) used to encode the visual characteristics of the smoke into numerical vectors. In this paper, we propose to learn a new feature space to represent the visual descriptors extracted from the video frames in an unsupervised manner. This mapping is intended to yield better discrimination between smoke-free images and those showing smoke patterns. The proposed approach is inspired by the linear hyperspectral unmixing techniques. It defines the axes of the new feature space as the vertices of a minimum-volume simplex enclosing all image pixels in the frame. The obtained empirical results prove that the proposed feature mapping approach reinforces the discrimination power of the visual descriptors and produces better smoke detection performance. In addition, the proposed approach exhibits the valuable ability to automatically determine the most relevant visual descriptors. [ABSTRACT FROM AUTHOR]

Dimensionality reduction plays a major role in face recognition. Discriminant analysis (DA) and principal component analysis (PCA) are two of the most important approaches in this field. In particular, subclass discriminant analysis (SDA) is a well-known scheme for feature extraction and dimensionality reduction. It is widely used in many high-dimensional data-driven applications, namely face recognition and image retrieval. It is also found to be applicable under various scenarios. However, it has high cost in time and space given the need for an eigendecomposition involving the scatter matrices, known as the singularity problem. This limitation is caused by the high-dimensional space of data, particularly when dimensions exceed the number of observations. Recent advances widely reported that 2D methods with matrix-based representation perform better than the traditional 1D vector-based ones. In this paper, we propose a novel 2D-SDA algorithm to avoid the "curse of dimensionality" and address the singularity issue. The performance of the proposed algorithm is evaluated for face recognition in terms of recognition performance and computational cost. Experiments are conducted on four benchmark face databases and compared to several competitive 1D and 2D methods based on PCA and DA. Results show that 2DSVD achieves the best recognition performance at low dimensions. In particular, 2D-SDA works significantly better on large-sized data sets where intra-class variation is the most important. [ABSTRACT FROM AUTHOR]

In the world of information retrieval, recognizing hand-written digits stands as an interesting application of machine learning (deep learning). Though this is already a matured field, a way to recognize digits using an effective optimization using soft computing technique is a challenging task. Training such a system with larger data often fails due to higher computation and storage. In this paper, a recurrent deep neural network with hybrid mini-batch and stochastic Hessian-free optimization (MBSHF) is for accurate and faster convergence of predictions as outputs. A second-order approximation is used for achieving better performance for solving quadratic equations which greatly depends on computation and storage. Also, the proposed technique uses an iterative minimization algorithm for faster convergence using a random initialization though huge additional parameters are involved. As a solution, a convex approximation of MBSHF optimization is formulated and its performance on experimenting with the standard MNIST dataset is discussed. A recurrent deep neural network till a depth of 20 layers is successfully trained using the proposed MBSHF optimization, resulting in a better quality performance in computation and storage. The results are compared with other standard optimization techniques like mini-batch stochastic gradient descent (MBSGD), stochastic gradient descent (SGD), stochastic Hessian-free optimization (SHF), Hessian-free optimization (HF), nonlinear conjugate gradient (NCG). The proposed technique produced higher recognition accuracy of 12.2% better than MBSGD, 27.2% better than SHF, 35.4% better than HF, 40.2% better than NCG and 32% better than SGD on an average when applied to 50,000 testing sample size. [ABSTRACT FROM AUTHOR]

Although there are many researches on the similarity measure for intuitionistic fuzzy sets, some of them have some defects. To overcome these shortcomings, based on the Euclidean distance between intuitionistic fuzzy set and three special intuitionistic fuzzy sets, a new similarity measure for intuitionistic fuzzy sets is proposed in this paper. The proposed similarity measure is compared with the existing similarity measures in intuitionistic fuzzy environment by numerical examples. Moreover, we apply the proposed similarity measure to pattern recognition problems in intuitionistic fuzzy environment. The experimental results show that the proposed similarity measure for intuitionistic fuzzy sets is reasonable and effective. [ABSTRACT FROM AUTHOR]

In this paper, a system is proposed for extracting insulators on power transmission lines from photographs captured by an unmanned aerial vehicle. The approximate regions of the insulators are first determined by a support vector machine with the histogram of oriented gradients as the feature descriptor. Then, the specific regions of insulators are detected and extracted by the GrabCut algorithm. In advance, some constraint conditions, such as the value ranges of color component values as well as the relationships between the component values in three color models, need to be specified. In our system, an interactive interface is developed to help determine these conditions. According to the experimental results, our system is capable of removing most of the backgrounds and extracting the insulators from photographs. [ABSTRACT FROM AUTHOR]

The automatic creation of a repository of the building's floor plan helps a lot to the architects to reuse them. The basic approach is to extract and recognize texts, symbols or graphics to retrieve the information of the floor plan from the images. This paper proposes a floor plan information retrieval algorithm. The proposed algorithm is based on shape extraction and room identification. α -shape is used for finding an accurate shape. From the detected shapes, actual areas of rooms are calculated. Later, a regression model-based binary room classification model is proposed to classify them into room-type, i.e., bedroom, drawing room, kitchen, and non-room-type, i.e., parking porch, bathroom, study room and prayer room. The proposed model is tested on the CVC-FP dataset with an average room detection accuracy of 85.71% and room recognition accuracy of 88%. [ABSTRACT FROM AUTHOR]

Medical decision support systems have been a core of intense research for years. The ongoing study shows that artificial intelligence has been accustomed to probe risk factors for hypertension. Factors, like health-damaging personal behaviors and changes in lifestyle and environment, are major contributors to chronic diseases. The goal of this research was to forecast the risk of developing hypertension by revealing hidden patterns in medical datasets. Quality of the data is the key to enhance the performance of learning model. But most healthcare data suffer from class imbalance problem, which induce the need for an intelligent model which can learn from such grimy data. This paper incorporates a novel approach by combing learning model and rule-based mining to offer decision support. Typically, the proposed work comprises two main implications. First suggests an intelligent learning model using boosting-based support vector machine to diagnose and expose multi-class categories in the imbalanced datasets. Finally, the enhanced predictive model is built upon the classification solution which will portray the innate data similarities. An intelligent fuzzy-based approach was employed to recognize frequent behavioral patterns. Based on these rules, valid decisions could be made to prevent hypertension. The suggested enhanced model is evaluated using a real-time hypertension dataset obtained through primary health centers. With the combination of ensemble strategies, the proposed intelligent learning model attains high classification accuracy for the imbalanced dataset above the traditional model. Thus, the efficient integration of personalized behavior with health data could provide a better understanding regarding patient health. In future this can serve as an eye toward personalized medicine. [ABSTRACT FROM AUTHOR]

The matrix-pattern-oriented Ho–Kashyap classifier (MatMHKS), using two-sided weight vectors to constrain the matrixized samples, can deal with not only the vectorized sample but also the matrixized sample. For vectorized sample, by converting the vectorized mode into matrixized mode, MatMHKS relieves the curse of dimensionality and extends the expressive modes of sample. Although MatMHKS has been demonstrated to be effective in the classification performance, it consumes a lot of time to alternately update two weight vectors in each iteration. Moreover, MatMHKS is not suitable in dealing with imbalanced problems. Finally, there does not exist effective analysis of generalization risk for matrixized classifiers. To this end, this paper proposes an efficient matrixized Ho–Kashyap classifier (EMatMHKS), which separately updates the two-sided weight vectors to avoid repeatedly calculating the inverse matrix in MatMHKS, thus significantly improving the training speed. Moreover, by introducing a weight matrix, both balanced and imbalanced situations can be tackled. Finally, PAC-Bayes bound is used to reflect the error upper bound of matrixized and vectorized classifiers. Both balanced and imbalanced data sets are used to validate the effectiveness and the efficiency of the proposed EMatMHKS in the experiment. [ABSTRACT FROM AUTHOR]

Previous pattern recognition algorithms using surface electromyography (sEMG) have been developed for subsets of predefined hand movements without considering muscle structure. In order to decode hand movements, it is important to know which movements are appropriate for PR due to the different independence of movements between individuals and the high correlated characteristics of sEMG patterns between movements. This paper proposes a method to personally rank the order of hand movements from subsets (31 finger flexion, 31 finger extension, and 4 wrist movements in this paper). The movements were sorted into a ranked order with respect to the locations of the electrodes on the proximal forearm and the distal forearm. We evaluated the classification error as the number of desired movements (N m) changed. The maximum N m with an error lower than 10% was 20 for the proximal forearm and 10 for the distal forearm from ranked movements of individuals. Our method could help to identify the optimized order of hand movements considering the personal characteristics of each individual. [ABSTRACT FROM AUTHOR]

In statistical process monitoring, data mining algorithms are applied for control chart pattern recognition (CCPR) not only to detect but also to identify abnormal patterns associated with assignable causes. Recently, the use of support vector machines (SVMs) has achieved remarkable results in statistical process control applications due to its excellent generalization performance. Although there is a lot of research that highlights the superiority of support vector machine over other algorithms used in systems based on data mining control, there are no studies that analyze the design elements of a SVM classifier. Consequently, a comprehensive review, classification and an analysis of information found in the literature are presented in this paper regarding to the SVM classifier. The aim of this research is to provide researchers a starting point to potentiate the performance of the SVM classifier for assuring the best possible classification and improving the detection efficiency. Sixty-one research articles from 2001 to 2015 are critically analyzed based on their methodology following a classification scheme derived from the support vector classification framework. The analysis showed that the feature extraction and selection play a crucial role on the performance of classifiers. Studies revealed that using extracted features or a combination of raw data and feature extraction achieves better classification performances than using only raw data as an input. On the other hand, there is an ample gap to extend the research on internal structure configurations under various types of kernels, multi-classification, and ensemble approaches. Finally, this paper evidences that the application of nature inspired algorithms for kernel parameter selection in auto-correlated SVM-based process monitoring systems remains unexplored. [ABSTRACT FROM AUTHOR]