Search

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]

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]

In recent years, Deep Neural Networks (DNN) have emerged as a practical method for image recognition. The raw data, which contain sensitive information, are generally exploited within the training process. However, when the training process is outsourced to a third-party organization, the raw data should be desensitized before being transferred to protect sensitive information. Although masks are widely applied to hide important sensitive information, preventing inpainting masked images is critical, which may restore the sensitive information. The corresponding models should be adjusted for the masked images to reduce the degradation of the performance for recognition or classification tasks due to the desensitization of images. In this paper, we propose a mask-based image desensitization approach while supporting recognition. This approach consists of a mask generation algorithm and a model adjustment method. We propose exploiting an interpretation algorithm to maintain critical information for the recognition task in the mask generation algorithm. In addition, we propose a feature selection masknet as the model adjustment method to improve the performance based on the masked images. Extensive experimentation results based on multiple image datasets reveal significant advantages (up to 9.34% in terms of accuracy) of our approach for image desensitization while supporting recognition. [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]

3D object recognition and pattern recognition are active and fast-growing research areas in the field of computer vision. It is mandatory to define the pattern class, feature extraction, design classifiers, clustering, and selection of test datasets and evaluate performance for any pattern recognition system. The pattern recognition system recognizes the object, so it is required to extract the features in such a way that it will be suitable for a particular recognition method. Features can be retrieved either locally or globally. The object recognition technique is divided into two parts: the local feature extraction method and the global feature extraction method. Many researchers have done admirable work in the field of local and global feature extraction. Local feature-based techniques are more suitable for the real-world scene. The Global feature-based methods are more suitable for retrieving the 3D model & identifying the object's shape when the object's geometric structure is fragile. A lot of research has been done on pattern recognition in the last 50 years. Still, no single technique can be used for all types of applications, such as bioinformatics, data mining, speech recognition, remote sensing, multimedia applications, text detection, localization, etc. The main agenda of this paper is to summarize the 3D object recognition methodologies. This paper provides a complete study of 3D object recognition based on local and global feature-based methods and different techniques of pattern recognition. We have tried to summarize the results of different technologies and the future scope of this paper's particular technique. We enlisted the accessible online 3D database and their attributes, evaluation parameters of the 3D datasets. This paper will immensely help the researchers to Identify the research gap and limitations in pattern recognition and object recognition so that the researchers will be motivated to do something new in this field. [ABSTRACT FROM AUTHOR]

Sign language is a non-verbal communication tool used by the deaf. A robust sign language recognition framework is needed to develop Human–Robot Interaction (HRI) platforms that are able to interact with humans via sign language. Iranian sign language (ISL) is composed of both static postures and dynamic gestures of the hand and fingers. In this paper, we present a robust framework using a Deep Neural Network (DNN) to recognize dynamic ISL gestures captured by motion capture gloves in Real-Time. To this end, first, a dataset of fifteen ISL classes was collected in time series; then, this dataset was virtually augmented and pre-processed using the "state-image" method to produce a unique collection of images, each image corresponding to a specific set of sequential data representing a class. Next, by implementing a continuous Genetic algorithm, an optimal deep neural network with the minimum number of weights (trainable parameters) and the maximum overall accuracy was found. Finally, the dataset was fed to the DNN to train the model. The results showed that the optimization process was successful at finding a DNN structure highly suitable for this application, with 99.7% accuracy on the verification (test) data. Then, after implementing the module in a robotic architecture, an HRI experiment was conducted to assess the system's performance in real-time applications. Preliminary statistical analysis on the standard UTAUT model for eight participants showed that the system can recognize ISL signs quickly and accurately during human–robot interaction. The proposed methodology can be used for other sign languages as no specific characteristics of ISL were used in the preprocessing or training stage. [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 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]

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]

Picture fuzzy sets (PFSs), as a generalization of traditional fuzzy sets and intuitionistic fuzzy sets (IFSs), offer a powerful framework for modeling and dealing with imprecise and uncertain information and have been widely used in various fields. Nevertheless, how to effectively measure the differences or similarities between PFSs is still a challenging and urgent problem. Despite that some distance measures for PFSs have been developed, some of them have counterintuitive and unreasonable results and even partially fail to satisfy the axiomatic definition of distance measures. To handle these limitations, in this paper, we propose two distance measures of PFSs motivated by the merits of Jensen–Shannon divergence. Specifically, the first distance measure of the PFSs considers the positive degree, neutral degree and negative degree. The second distance measure introduces the refusal degree on this basis. Moreover, the proposed distance measures not only satisfy the axiomatic definition but also overcome the counterintuitive results of existing distance measures. Finally, two kinds of applications related to pattern recognition and medical diagnosis are used to verify the performance of the proposed distance measures. [ABSTRACT FROM AUTHOR]

Divergence measure between intuitionistic fuzzy sets (IFSs) is important due to its wide range of applications in various fields including pattern recognition, image segmentation, decision-making and clustering. This paper introduces the characterization of belief and plausible intuitionistic fuzzy sets (BP-IFSs) to explore novel logarithmic and non-logarithmic divergence measures between two BP-IFSs. These measures are regarded as highly useful approaches to express ambiguous information within the framework of Dempster–Shafer Theory (DST). An axiomatic definition based on proposed divergence measures is also stated within a frame work of newly established theory. Furthermore, the proposed divergence measures are utilized in three different applications: (i) an example related to the recognition of BP-IFS patterns is provided to demonstrate the practicality of the proposed method in pattern recognition. (ii) An example of Hierarchical agglomerative clustering is also provided. (iii) Introduces an innovative Belief and Plausible Combinative Distance-based Assessment (BP-CODAS) method based on proposed measures for resolving Multicriteria Decision Making (MCDM) problems connected to child labor in under developed countries. The examples provided in these different directions are sufficient to demonstrate the effectiveness, applicability and viability of the suggested methods within the framework of generalized DST. [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]

Printed fabrics often have rich colors and variable patterns in different sizes and shapes, which make it difficult to achieve accurate pattern recognition and color measurement using traditional spectrophotometers and digital cameras. This paper develops a grid-based density peaks clustering (GDPC) algorithm to automatically recognize patterns and extract colors of multispectral images of printed fabrics. The multispectral images captured by a self-developed multispectral imaging system is firstly converted into color images in CIELAB color space and three principal components are calculated by applying principal component analysis to reduce the dimensions of the multispectral images. During the multispectral image processing, the noise pixels are removed by calculating the local stability of each pixel, and then the remaining stable pixels are clustered using proposed GDPC algorithm based on three CIELAB color channels and three principal components. Compared with widely-used color clustering algorithms, the proposed GDPC algorithm can recognize the color patterns from more intricate multispectral printed fabric images with higher accuracy and less computational time. [ABSTRACT FROM AUTHOR]

The mechanism of L2-norm loss can be explained from the perspective of maximizing margin and minimizing margin variance, which is equivalent to the idea of margin distribution. Recent studies suggest that the margin distribution is more vital for the generalization performance of models. Inspired by the idea, a nonparallel support vector machine (NPSVM) with L2-norm loss is proposed in this paper, termed as L2-NPSVM. We first reconstruct a L2-norm loss for NPSVM. The L2-norm loss can make full use of the margin distribution information in the training samples. Based on the L2-norm loss, we formulate the L2-NPSVM algorithm. L2-NPSVM is a more reliable training model with stronger generalization ability. Since L2-norm loss is used to measure the empirical risk in the objective function, L2-NPSVM can also reduce the impact of outliers. Furthermore, due to the L2-norm loss, the dual coordinate descent (DCD) method can be applied to linear and nonlinear L2-NPSVM. Under the premise of high accuracy, DCD can accelerate the solving process. At last, we conduct a series of comparative experiments on UCI datasets, noise-added UCI datasets and real-world datasets, which demonstrate the feasibility and effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Similarity measures are very effective and meaningful tool used for evaluating the closeness between any two attributes which are very important and valuable to manage awkward and complex information in real-life problems. Therefore, for better handing of fuzzy information in real life, Ullah et al. (Complex Intell Syst 6(1): 15–27, 2020) recently introduced the concept of complex Pythagorean fuzzy set (CPyFS) and also described valuable and dominant measures, called various types of distance measures (DisMs) based on CPyFSs. The theory of CPyFS is the essential modification of Pythagorean fuzzy set to handle awkward and complicated in real-life problems. Keeping the advantages of the CPyFS, in this paper, we first construct an example to illustrate that a DisM proposed by Ullah et al. does not satisfy the axiomatic definition of complex Pythagorean fuzzy DisM. Then, combining the 3D Hamming distance with the Hausdorff distance, we propose a new DisM for CPyFSs, which is proved to satisfy the axiomatic definition of complex Pythagorean fuzzy DisM. Moreover, similarly to some DisMs for intuitionistic fuzzy sets, we present some other new complex Pythagorean fuzzy DisMs. Finally, we apply our proposed DisMs to a building material recognition problem and a medical diagnosis problem to illustrate the effectiveness of our DisMs. Finally, we aim to compare the proposed work with some existing measures is to enhance the worth of the derived measures. [ABSTRACT FROM AUTHOR]

This paper presents an approach for identifying fingerprints through the extraction of geometric and statistical features of characteristic Minutiae. The proposed approach is in accordance with statistical features to extract important points from the skeleton of a fingerprint's image. Through the addition of geometric features as a kind of preprocessing to this approach, the images are divided into distinct regions. In this approach, statistical parameters like min, max, mean and standard deviation are applied in order to compute the general abstract of the features. Another achievement in this article is the presentation of a similarity measure in identification tools which is only used for methods based on matching patterns. The Optimized version of the proposed method achieved near zero EER percentage in some of the datasets. [ABSTRACT FROM AUTHOR]

A speaker identification framework that combines both high- and low-level features, for state-of-the-art variability analysis and classification is proposed in this paper. The proposed framework introduces a workable solution that targets robust speaker variability classification using speech samples recorded in suboptimal conditions. A translated Ibibio (New Benue-Congo, Nigeria) version of "The Tiger and the Mouse"—a prosodically balanced corpus that demonstrates the prosody of read-aloud English was used in this study with speech samples obtained from 50 participants (25 males and 25 females). Identity-vectors (i-vectors) or low dimensional signal patterns were extracted and used as baselines for investigating speakers' variability patterns across various classifiers (Decision Tree: DT, Support Vector Machine: SVM, k-Nearest Neighbour: k-NN, and Deep Neural Network: DNN) and kernels. Treatment of the baselines with high level features (speech duration, F0, intensity) was also experimented for word, syllable, and phoneme units. Results obtained revealed that DTs and some variants of SVM gave high classification accuracies (above 70%). Hence, the hypothesis of universal Gaussianity appears inexact, as the linear predictor that is optimal in the mean square error sense may not hold for Ibibio. Further treatments of the baselines with Linear Discriminant Analysis (LDA) and Cosine Distant Scoring (CDS) yielded very poor classification results, except for the k-NN and Gaussian SVM classifiers which performed well for the LDA treated baselines. [ABSTRACT FROM AUTHOR]

Color images usually have large storage sizes as they are composed of three planes in the raw image format represented with the red, green, and blue components. Traditional color image compression schemes can be used to save the storage size of the color images. Unfortunately, most of these schemes are lossy in nature, which affects the details of color images. This paper presents a different treatment to the color image storage problem depending on the original color image formation process. In the color image formation process, not all the red, green, and blue components of the color images are acquired, simultaneously. Only, one component at each pixel position is acquired and Color Filter Array (CFA) interpolation is used to estimate the other two components using interpolation algorithms like Minimized-Laplacian Residual Interpolation (MLRI) and Linear Interpolation with Laplacian Second Order Correction (LILSOC). We adopt a similar strategy in this paper for reducing the storage sizes of color images by 66.67% of their original sizes. The sensitivity of the pattern recognition process to the proposed color image storage and interpolation strategy is studied in this paper. A cepstral feature extraction algorithm is adopted in this paper for extracting features from the interpolated patterns for further classification. Moreover, two types of classifiers are considered and compared in this paper for the pattern recognition: Artificial Neural Networks (ANNs), and Support Vector Machines (SVMs). Simulation results reveal the success of the proposed strategy for color image storage and interpolation in obtaining high-quality color images in addition to the high Recognition Rates (RR) of color patterns after interpolation. This success encourages the use of the proposed color image storage strategy in storing large volumes of color databases. [ABSTRACT FROM AUTHOR]

Abstract—On February 6, 2023, two devastating earthquakes struck southern central Turkey, nine hours apart. The ground shaking from these earthquakes even swept over a significant part of northwestern Syria. In this paper, we consider the locations of the epicenters of these earthquakes against the prediction of the М ≥ 6.5 earthquake epicenters in Anatolia and adjacent regions, which was made in 1973 by I.M. Gelfand, V.I. Keilis-Borok and their colleagues using the Kora-3 pattern recognition algorithm based on morphostructural zoning data. We also present the results of early detection of the periods with an increased probability of the strongest earthquakes as determined by the medium-term prediction algorithm for the M8 earthquakes. It is found that the epicenters of the February 6, 2023 earthquakes occurred in a node identified in 1973 as potentially earthquake-prone for М ≥ 6.5, and both events occurred within the spatial and temporal coverage of the warning area diagnosed by the M8 algorithm in July 2021. [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]

Discovering patterns and detecting anomalies in individual travel behavior is a crucial problem in both research and practice. In this paper, we address this problem by building a probabilistic framework to model individual spatiotemporal travel behavior data (e.g., trip records and trajectory data). We develop a two-dimensional latent Dirichlet allocation (LDA) model to characterize the generative mechanism of spatiotemporal trip records of each traveler. This model introduces two separate factor matrices for the spatial dimension and the temporal dimension, respectively, and use a two-dimensional core structure at the individual level to effectively model the joint interactions and complex dependencies. This model can efficiently summarize travel behavior patterns on both spatial and temporal dimensions from very sparse trip sequences in an unsupervised way. In this way, complex travel behavior can be modeled as a mixture of representative and interpretable spatiotemporal patterns. By applying the trained model on future/unseen spatiotemporal records of a traveler, we can detect her behavior anomalies by scoring those observations using perplexity. We demonstrate the effectiveness of the proposed modeling framework on a real-world license plate recognition (LPR) data set. The results confirm the advantage of statistical learning methods in modeling sparse individual travel behavior data. This type of pattern discovery and anomaly detection applications can provide useful insights for traffic monitoring, law enforcement, and individual travel behavior profiling. [ABSTRACT FROM AUTHOR]

The classification of data stream susceptible to the concept drift phenomenon has been a field of intensive research for many years. One of the dominant strategies of the proposed solutions is the application of classifier ensembles with the member classifiers validated on their actual prediction quality. This paper is a proposal of a new ensemble method – Covariance-signature Concept Selector – which, like state-of-the-art solutions, uses both the model accumulation paradigm and the detection of changes in the data posterior probability, but in the integrated procedure. However, instead of ensemble fusion, it performs a static classifier selection, where model similarity assessment to the currently processed data chunk serves as a concept selector. The proposed method was subjected to a series of computer experiments assessing its temporal complexity and efficiency in classifying streams with synthetic and real concepts. The conducted experimental analysis allows concluding the advantage of this proposal over state-of-the-art methods in the identified pool of problems and high potential in practical applications. [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]

Research on body-worn sensors has shown how they can be used for the detection of falls in the elderly, which is a relevant health problem. However, most systems are trained with simulated falls, which differ from those of the target population. In this paper, we tackle the problem of fall detection using a combination of novelty detectors. A novelty detector can be trained only with activities of daily life (ADL), which are true movements recorded in real life. In addition, they allow adapting the system to new users, by recording new movements and retraining the system. The combination of several detectors and features enhances performance. The proposed approach has been compared with a traditional supervised algorithm, a support vector machine, which is trained with both falls and ADL. The combination of novelty detectors shows better performance in a typical cross-validation test and in an experiment that mimics the effect of personalizing the classifiers. The results indicate that it is possible to build a reliable fall detector based only on ADL. [ABSTRACT FROM AUTHOR]

This study is an attempt to determine potential tsunamigenic morphostructural nodes in Greece using pattern recognition algorithms. The earthquakes that have produced local tsunamis in the region were confined to morphostructural nodes whose locations were found by morphostructural zoning. The recognition problem consisted in separating all nodes in the region into the tsunamigenic class and the non-tsunamigenic class based mainly on the geomorphologic parameters of the nodes. The data on tsunamigenic earthquakes in Greece for training the Cora-3 algorithm were taken from the GHTD global historical catalog of tsunamigenic events (http://www.ngdc.noaa.gov/hazard/tsu%5fdb.shtml). The recognition procedure resulted in determining 27 tsunamigenic nodes, with most of these being situated in the southern tip of the Peloponnese Peninsula, as well as in the gulfs of Corinth and Patras. Three tsunamigenic nodes were identified in the area of the Malian Gulf on the Aegean coast of Greece. According to the relevant literature, most local tsunamis in Greece were initiated by submarine slides and slumps due to earthquakes. According to the characteristic geomorphologic features derived in this study, the tsunamigenic nodes are situated in settings of contrasting relief characterized by steep slopes. This favors submarine landslides when subjected to earthquake excitation. The results reported in this paper form a basis for developing a methodology to be used in long-term tsunami hazard assessment, supplying information on local potential tsunamigenic sources required for tsunami regionalization of coastal areas in Greece. [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]

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]

The basic aim of this study is to introduce an innovative concept of bipolar T-spherical fuzzy set (BTSFS) which is a hybrid structure of bipolar fuzzy set (BFS) and T-spherical fuzzy Set (TSFS). BTSFS is a unique type of fuzzy set that works with bipolarity of all membership grades (MGs), that is, truth MG, abstained MG and non-membership grade (NMG). This paper scrutinizes a few basic characteristics and essential operations of BTSFSs. The proposed results are compared with the existing fuzzy structures and also the importance of the proposed work is discussed. Further, the idea of new distance measures of BTSFSs has been presented to investigate the geometrical properties of BPFSs. An example related to pattern recognition (PR) based on new distance measures have been examined in the article. Furthermore, some new similarity measures (SMs) based on BTSFSs such as Dice SM and weighted Dice SM have been initiated. We have also studied the propositions related to proposed SMs. A multi-criteria decision-making (MCDM) method based on proposed SMs for BSTSFSs has also been presented in this article. Then, in the end, to check capability and viability, a practical demonstration of the planned approach has also been explained. [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 propose a new time-shared twin memristor crossbar for pattern-recognition applications. By sharing two memristor arrays at different time, the number of memristor arrays can be reduced by half, saving the crossbar area by half, too. To implement the time-shared twin memristor crossbar, we also propose CMOS time-shared subtractor circuit, in this paper. The operation of the time-shared twin memristor crossbar is verified using 3 × 3 memristor array which is made of aluminum film and carbon fiber. Here, the crossbar array is programmed to store three different patterns. When we apply three different input vectors to the array, we can verify that the input vectors are well recognized by the proposed crossbar. Moreover, the proposed crossbar is tested for the recognition of complicated gray-scale images. Here, 10 images with 32 × 32 pixels are applied to the proposed crossbar. The simulation result verifies that the input images are recognized well by the proposed crossbar, even though the noise level of each image is varied from −10 to +10 dB. [ABSTRACT FROM AUTHOR]

This paper is concerned with the problem of improving the convergence properties of evolutionary neural networks, particularly in the context of hybrid neural networks that adopt a diversity of transfer functions at their nodes, i.e.: neural diversity machines. The paper explores the potential of solution complementarity, in the context of pattern recognition problems, and focuses on its incorporation in the selection process of recombination heuristics. In a pattern recognition context, complementarity is defined as the ability of different solutions to correctly classify complementary subsets of patterns. A broad set of experiments was conducted demonstrating that solution selection based on complementarity is statistically significantly better than random selection, in a wide range of conditions, e.g.: different datasets, recombination heuristics and architectural constraints. Although the experiments demonstrated the statistical significance and robustness of the effect, they also indicated that more work is required to increase the degree of the effect and to scale-up to larger and more complex datasets. [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]

Discrete orthogonal moments such as Meixner moments are powerful tools for characterizing image shape features for applications in pattern recognition and image classification. However, in the pattern recognition theory, classification of 2D/3D shapes regardless of their position, size, and orientation represents an important problem. In this paper, a new fast and accurate method is presented to obtain Meixner moments that are invariant to translation and uniform/non-uniform scaling directly from Meixner polynomials. These new invariants of Meixner moments are computed more quickly and require no numerical approximation, unlike the classical invariants of Meixner moments which are computed from geometric moments. This method is extended to compute the three-dimensional of Meixner invariant moments to translation and scaling. The results of experimental studies using scaled uniformly/non-uniformly and translated binary and gray-scale images are discussed to further verify the validity of the new invariants of Meixner moments for classification tasks. [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]

Control chart pattern analysis is a crucial task in statistical process control. There are various types of nonrandom patterns that may appear on the control chart indicating that the process is out of control. The presence of nonrandom patterns manifests that a process is affected by assignable causes, and corrective actions should be taken. From a process control point of view, identification of nonrandom patterns can provide clues to the set of possible causes that must be searched; hence, the troubleshooting time could be reduced in length. In this paper, we discuss two implementation modes of control chart pattern recognition and introduce a new research issue concerning pattern displacement problem in the process of control chart analysis. This paper presents a neural network-based pattern recognizer with selected features as inputs. We propose a novel application of statistical correlation analysis for feature extraction purposes. Unlike previous studies, the proposed features are developed by taking the pattern displacement into account. The superior performance of the feature-based recognizer over the raw data-based one is demonstrated using synthetic pattern data. [ABSTRACT FROM AUTHOR]

The quality of information communication is the key guarantee for the normal operation of a system. Information filtering techniques and methods are important for system failure detection. Kalman filtering is a widely used method of optimal estimation as it is easy to computer programming and data can be updated and processed in real time. In this paper, the financial information system is taken for application of Kalman filtering in detecting the failure. Dynamic detecting models are established as the integration of a process model and a discriminant model. The process model is used to describe a dynamic process of financial failure and the discriminant model is used to describe discriminant rules. A real-time detection method is developed based on Kalman filtering and a general n-step-ahead forecasting algorithm is improved in order for the prospective forecast. The dynamic forecasting and detecting process is implemented through computer programming using the data of China’s communications industries. The results have proved the accuracy and advance of detecting financial failure in such case. [ABSTRACT FROM AUTHOR]

Image pattern recognition in the field of big data has gained increasing importance and attention from researchers and practitioners in many domains of science and technology. This paper focuses on the usage of image pattern recognition for big data applications. In this context, the taxonomy of image pattern recognition and big data is revealed. The applications of image pattern recognition for big data, including multimedia, biometrics, and biology/biomedical, are also highlighted. Moreover, the significance of using pattern-based feature reduction in big data is discussed, and machine-learning techniques in pattern recognition applications are presented. A comparison based on the objectives of the approaches is presented to underline the taxonomy. This paper provides a novel review in exploring image recognition approaches for big data, which can be used in future research. [ABSTRACT FROM AUTHOR]

Face recognition techniques are widely used in many applications, such as automatic detection of crime scenes from surveillance cameras for public safety. In these real cases, the pose and illumination variances between two matching faces have a big influence on the identification performance. Handling pose changes is an especially challenging task. In this paper, we propose the learning warps based similarity method to deal with face recognition across the pose problem. Warps are learned between two patches from probe faces and gallery faces using the Lucas-Kanade algorithm. Based on these warps, a frontal face registered in the gallery is transformed into a series of non-frontal viewpoints, which enables non-frontal probe face matching with the frontal gallery face. Scale-invariant feature transform (SIFT) keypoints (interest points) are detected from the generated viewpoints and matched with the probe faces. Moreover, based on the learned warps, the probability likelihood is used to calculate the probability of two faces being the same subject. Finally, a hybrid similarity combining the number of matching keypoints and the probability likelihood is proposed to describe the similarity between a gallery face and a probe face. Experimental results show that our proposed method achieves better recognition accuracy than other algorithms it was compared to, especially when the pose difference is within 40 degrees. [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]

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]

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]

Implementation of adaptive modulation techniques based on the channel conditions play a key role in future wireless applications. Due to these adaptive techniques, the performance of the receiver depends on the ability of Blind Modulation Recognition (BMR). This paper investigates the performance of different Pattern Recognition Classifiers (PRC) in modulation recognition under multipath fading channels. Investigations carried out on various non-parametric supervised classifiers which include Decision Tree (DT), K-Nearest Neighbor (KNN), Support Vector Machine (SVM) and Ensemble Classifiers. To train the classifiers initially a set of 39 features is extracted and then a set of 11 noise robust features is chosen based on investigations through rough set theory. Performance of proposed PRC's is compared with other classifiers stated in literature to prove their superiority in modulation classification under fading conditions. [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]

The systems based on image processing have numerous applications in the domain of motion control of robots and autonomous vehicles. The current paper is oriented to the solution of the problem that precedes the implementation of automatic avoidance of the on-road obstacles-how to detect them, to track in the sequence of images, and to recognize which of them are stationary, incoming, or outgoing from the camera. The overall algorithm of obstacle classification presented in this paper consists of three basic phases: (1) image segmentation in order to extract the pixels belonging to the image of a road and the objects over it; (2) extraction of characteristic points inside the area of the obstacle, their description and tracking in following frames; and (3) estimation of distances between the camera, the obstacles and their rates of change (relative velocities). The verifications of particular steps of the proposed algorithm are illustrated using real road-traffic images, while the overall algorithm is tested using both synthesized sequences of images and the ones acquired in real driving. [ABSTRACT FROM AUTHOR]

Since rapid growth of IT technologies, the use of multimedia data such as image and videos are explosively increasing. It is an important aspect of not only for users but also researchers. Duplicate images and videos are rapidly increasing and it causes difficulties in retrieval and management as well. It also causes copyright problems. In this paper, we discus prior duplicate video detection techniques and overcome previous research problems using block histogram and dynamic matching approach duplicate video detection method. We improved excessive abstract of previous block mean-value based feature extraction method to be robust in various video transformations. Also, we created feature vector of timely histogram by unit of blocks to reflect video features. We proposed dynamic matching algorithm to match videos which is suitable for large-scale video data. To evaluate our proposal, we used VIREO video datasets which is provided by Hong Kong City University and Carnegie Mellon University and MUSCLE-VCD-2007 dataset which is provided by INRIA. Our method showed 90 % of accuracy on duplicate video detection. Our proposed method showed robustness especially in various video transformations. Also, we tested video clustering test to prove our method and dynamic matching method showed 5 times fast compare to existing method which is suitable for real-time and large-scale video detection process. [ABSTRACT FROM AUTHOR]

A doctor could say that a patient is sick while he/she is healthy or could say that the patient is healthy while he/she is sick, by mistake. So it is important to generate a system that can give a good diagnosis, in this case for abnormal eye movements. An abnormal eye movement is when the patient wants to move the eye to up or down and the eye does not move or the eye moves to other place. In this paper, a method for the pattern recognition is used to provide a better diagnosis for patients related with the abnormal eye movements. The real data of signals of two eye movements (up and down) of patients are obtained using a mindset ms-100 system. A new method that uses one intelligent algorithm for online pattern recognition is proposed. The difference between the proposed method and the previous works is that, in other works, both behaviors (up and down) are trained with one intelligent algorithm, while in this work, up behavior is trained with one intelligent algorithm and down behavior is trained with other intelligent algorithm; it is because the multi-output system can always be decomposed into a collection of single-output systems with the advantage to use different parameters for each one if necessary. The intelligent algorithm used by the proposed method could be any of the following: the adaline network denoted as AN, the multilayer neural network denoted as NN, or the Sugeno fuzzy inference system denoted as SF. So the comparison results of the proposed method using each of the intelligent algorithms for online pattern recognition of two eye movements are presented. [ABSTRACT FROM AUTHOR]

Background: The bearing is an important component of mechanical transmission, and its condition is closely related to the safe operation of the equipment. However, the nonlinear vibration signal of the bearing leads to low accuracy of fault diagnosis because it is difficult to extract bearing characteristics. Method: To solve this problem, a bearing fault diagnosis method based on variational mode decomposition (VMD) fuzzy entropy (FE) and improved deep belief networks (DBN) is proposed. Since the information on bearing characteristics is overlaid by strong noise, VMD is used to process the vibration signal and calculate the FE of the modal components. Then, an improved butterfly optimization algorithm (BOA) with a mixed strategy is proposed, and the improved BOA is applied to optimize the hyper-parameters of the DBN to obtain the optimized DBN model. Finally, the optimized DBN is used as a pattern recognition algorithm for fault diagnosis. Results: The two experimental results show that this method can effectively diagnose bearing faults. The diagnosis rates are 98.33 % and 100 %, respectively, which provide theoretical support for bearing fault diagnosis. [ABSTRACT FROM AUTHOR]

Non-stationary models often capture better spatial variation of real world spatial phenomena than stationary ones. However, the construction of such models can be tedious as it requires modeling both statistical trend and stationary stochastic component. Non-stationary models are an important issue in the recent development of multiple-point geostatistical models. This new modeling paradigm, with its reliance on the training image as the source for spatial statistics or patterns, has had considerable practical appeal. However, the role and construction of the training image in the non-stationary case remains a problematic issue from both a modeling and practical point of view. In this paper, we provide an easy to use, computationally efficient methodology for creating non-stationary multiple-point geostatistical models, for both discrete and continuous variables, based on a distance-based modeling and simulation of patterns. In that regard, the paper builds on pattern-based modeling previously published by the authors, whereby a geostatistical realization is created by laying down patterns as puzzle pieces on the simulation grid, such that the simulated patterns are consistent (in terms of a similarity definition) with any previously simulated ones. In this paper we add the spatial coordinate to the pattern similarity calculation, thereby only borrowing patterns locally from the training image instead of globally. The latter would entail a stationary assumption. Two ways of adding the geographical coordinate are presented, (1) based on a functional that decreases gradually away from the location where the pattern is simulated and (2) based on an automatic segmentation of the training image into stationary regions. Using ample two-dimensional and three-dimensional case studies we study the behavior in terms of spatial and ensemble uncertainty of the generated realizations. [ABSTRACT FROM AUTHOR]