Search

Authenticity in multimedia information retrieval system is one such parameter which is of utmost in demand. One of such parameters is the biometric based authentication system, as seen in case of human the system proves its importance in almost each and every field. But in case of animals it becomes quite complex to recognize them using unique biometric parameter. This paper presents a modified 10 layered DenseNet deep learning framework which is implemented for the identification of Humpback whale, in an online challenge conducted by the kaggle, using biometric parameter. The proposed dense model minimizes the traditional limitation of vanishing gradient problem and outperforms as compared with other methods exists in the literature. This paper also proposed an hand free flow algorithm for ROI segmentation. In addition, the proposed methodology also uses CLAHE as a preprocessing method and focused on the feature re-usability with an optimized number of parameters used for recognition. During the experimentation, validation of the proposed model is found satisfactory with an accuracy of 93.21%. The test set results are provided by the kaggle with an AUC-ROC result over public and private scoreboard with an accuracy of 94.47% and 92.54% respectively. The comparative result with other deep methodologies suggests that the highest accuracy gained is 95.55% by Se-ResNet50 by some other learderboard and proposed model is found at second place. [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 general, medical pattern is a collection of characters formed using the characters such as 'a', 'c', 'g' and 't'. The length of the pattern varies from one disease to another disease, and the pattern also seems to be different for different patients. Identifying an unusual pattern from the information design is troublesome a decade ago. In this paper, with a specific end goal to enhance the precision of the anomalous distinguishing pattern, an Artificial Immune System (AIS) is framed. In the present study, AIS is used to obtain the abnormal pattern by learning the characteristics of the entire data set. Due to the powerful and adaptive nature of AIS, detecting and identifying abnormal pattern is more accurate. This proposed idea is implemented in MATLAB software and experimented on DNA/RNA dataset and the performance is verified. [ABSTRACT FROM AUTHOR]

This paper presents automatic tumor detection and classification approaches for brain magnetic resonance images (MRI). These approaches are based on hybrid-optimized classification techniques and classify brain MRI to healthy, benign or malignant. The proposed system implements three-optimization techniques combined with Artificial Neural Network (ANN). Multi-Verse Optimizer (MVO), Moth-Flame Optimizer (MFO) and Salp Swarm Algorithm (SSA) are used and compared to examine how these techniques could be successfully employed to enhance the classification accuracy via selecting the optimal parameters of ANN. The proposed techniques are applied to the Harvard database and BRATS challenge dataset to evaluate the performance via Receiver Operation Characteristics (ROC) analysis. The approaches are tested against geometric transformations such as scaling, rotation and warping to show how much the proposed system resists these transformations. Experimentally, the proposed algorithms achieve the highest classification accuracy as compared to the other published ones. Also, the MVO-ANN algorithm outperforms the other proposed algorithms. [ABSTRACT FROM AUTHOR]

The Euler number of a binary image is an important topological feature for many image processing, image analysis, pattern recognition, and computer vision applications. This paper proposes a new run-based Euler number computation algorithm. The conventional run-based algorithm processes rows of the given image one-by-one from top to bottom in a single phase. For each row, it finds the runs in the row and records the start and end locations of each run to compute neighbor runs. In contrast, our algorithm calculates the Euler number of an image in two phases. In the first phase, we process odd rows alternately to find runs and only record its end location. In the second phase, we process each of the remaining even rows to find runs and calculate neighboring runs between the current row and the rows immediately above and below using the recorded run data. Using this method, the number of accesses required to compute the Euler number decreases in almost all cases. Analysis of the time complexity and experimental results demonstrate that our algorithm outperforms conventional Euler number computation algorithms. [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]

In this paper, an online measurement and error compensation system for curve grinding based on pattern recognition was presented and verified by experiments. The measurement system organization and its principle of operation were introduced in detail. The work piece and grinding wheel image were sampled at certain positions to avoid spark influence. In order to increase system resolution, images were sampled only at local areas of the work piece and grinding wheel. A discrimination technology based on a circular tolerance zone was proposed which can solve the problem of local image edge comparison. For image de-noising, a local threshold algorithm was applied to determine new wavelet coefficients. Furthermore, a two-step edge detection method was used to realize sub-pixel precision. Finally, a series of experiments were carried out to examine the detection precision of the image measurement system and its influencing factors. From experiments, it can be said that the proposed method in this paper is effective, and its detection precision is much better than traditional methods. [ABSTRACT FROM AUTHOR]

Aiming at the disadvantages of greedy algorithms in sparse solution, a modified adaptive orthogonal matching pursuit algorithm (MAOMP) is proposed in this paper. It is obviously improved to introduce sparsity and variable step size for the MAOMP. The algorithm estimates the initial value of sparsity by matching test, and will decrease the number of subsequent iterations. Finally, the step size is adjusted to select atoms and approximate the true sparsity at different stages. The simulation results show that the algorithm which has proposed improves the recognition accuracy and efficiency comparing with other greedy algorithms. [ABSTRACT FROM AUTHOR]

Several feature-based pattern recognition algorithms have been developed during the past decade. These algorithms rely on identifying keypoints in an image and assigning a descriptor to each point based on the composition of their surrounding region. Comparison of the descriptors of keypoints found in two images enables these algorithms to match similar objects within those images. The dependence of these algorithms' performance on the similarity of the internal structure of objects makes them susceptible to modifications that change this internal structure. In this paper, we first compare the relative performance of some major feature-based algorithms in finding similar objects surrounded by geometrical noise. Next, we add several noise and transformation types to target objects and re-evaluate the performance of these algorithms under the resulting structural changes. Our results provide insights on the relative strengths of these algorithms in the presence and absence of several noise and transformation types. In addition, these findings allow us to identify modification types that can better inhibit the performance of these algorithms. The resulting insight can be used in applications that need to build resistance against such algorithms, e.g., in developing CAPTCHAs that need to be resistant to recognition attacks. [ABSTRACT FROM AUTHOR]

The paper proposes an improved quantum associative algorithm with distributed query based on model proposed by Ezhov et al. We introduce two modifications of the query that optimized data retrieval of correct multi-patterns simultaneously for any rate of the number of the recognition pattern on the total patterns. Simulation results are given. [ABSTRACT FROM AUTHOR]

This paper deals with plane detection from a monocular image sequence without camera calibration or a priori knowledge about the egomotion. Within a framework of driver assistance applications, it is assumed that the 3D scene is a set of 3D planes. In this paper, the vision process considers obstacles, roads and buildings as planar structures. These planes are detected by exploiting iso-velocity curves after optical flow estimation. A Hough Transform-like frame called c- velocity was designed. This paper explains how this c- velocity, defined by analogy to the v- disparity in stereovision, can represent planes, regardless of their orientation and how this representation facilitates plane extraction. Under a translational camera motion, planar surfaces are transformed into specific parabolas of the c- velocity space. The error and robustness analysis of the proposed technique confirms that this cumulative approach is very efficient for making the detection more robust and coping with optical flow imprecision. Moreover, the results suggest that the concept could be generalized to the detection of other parameterized surfaces than planes. [ABSTRACT FROM AUTHOR]

Recognizing people by gait promises to be useful for identifying individuals from a distance; in this regard, improved techniques are under development. In this paper, an improved method for gait recognition is proposed. Binarized silhouette of a motion object is first represented by four 1-D signals that are the basic image features called the distance vectors. The distance vectors are differences between the bounding box and silhouette, and extracted using four projections to silhouette. Fourier Transform is employed as a preprocessing step to achieve translation invariant for the gait patterns accumulated from silhouette sequences that are extracted from the subjects’ walk in different speed and/or different time. Then, eigenspace transformation is applied to reduce the dimensionality of the input feature space. Support vector machine (SVM)-based pattern classification technique is then performed in the lower-dimensional eigenspace for recognition. The input feature space is alternatively constructed by using two different approaches. The four projections (1-D signals) are independently classified in the first approach. A fusion task is then applied to produce the final decision. In the second approach, the four projections are concatenated to have one vector and then pattern classification with one vector is performed in the lower-dimensional eigenspace for recognition. The experiments are carried out on the most well-known public gait databases: the CMU, the USF, SOTON, and NLPR human gait databases. To effectively understand the performance of the algorithm, the experiments are executed and presented as increasing amounts of the gait cycles of each person available during the training procedure. Finally, the performance of the proposed algorithm is comparatively illustrated to take into consideration the published gait recognition approaches. [ABSTRACT FROM AUTHOR]

This paper deals with the opportunity of extracting useful information from medical data retrieved directly from a stereophotogrammetric system applied to gait analysis. A feature selection method to exhaustively evaluate all the possible combinations of the gait parameters is presented, in order to find the best subset able to classify among diseased and healthy subjects. This procedure will be used for estimating the performance of widely used classification algorithms, whose performance has been ascertained in many real-world problems with respect to well-known classification benchmarks, both in terms of number of selected features and classification accuracy. Precisely, support vector machine, Naive Bayes and K nearest neighbor classifiers can obtain the lowest classification error, with an accuracy greater than 97 %. For the considered classification problem, the whole set of features will be proved to be redundant and it can be significantly pruned. Namely, groups of 3 or 5 features only are able to preserve high accuracy when the aim is to check the anomaly of a gait. The step length and the swing speed are the most informative features for the gait analysis, but also cadence and stride may add useful information for the movement evaluation. [ABSTRACT FROM AUTHOR]

The increasing use of wearable actimetry devices in cohort studies can provide a deep and objective insight in physical activity (PA) patterns. For reliable and reproducible pattern recognition, and to minimize the influence of specific device characteristics, there is a need for a generic method to identify relevant PA events in sensor data sets on the basis of comprehensive features such as PA duration and intensity. The objectives of this paper are to present a method to identify universal event detection thresholds for such parameters, and to attempt to find stable meta-clusters of PA behaviour. PA events of 5, 10, 20 and 30 min with low, medium and high intensity thresholds found in literature and intensity deciles were computed for a random sample ( N = 100) of the NHANES 2005-06 accelerometer data set ( N = 7457). On the basis of all combinations of the above, activity events were detected, and parameters mean duration, mean intensity and event regularity were computed. Results were clustered using x-Means clustering and visualized for 5-, 10-, 20-, and 30-min events. Stable clustering results are obtained with intensity thresholds up to the 8th decile and for event durations up to 10 min. Two stable meta-clusters were detected: 'irregularly active' (intensity at 52nd percentile) and 'regularly active' (intensity at 42nd percentile). Distinct generic thresholds could be identified and are proposed. They may prove useful for further investigations of similar actimetry data sets, minimising the influence of specific device characteristics. The results also confirm that distinct PA event patterns - including event regularity - can be identified using wearable sensor devices, especially when regarding low-intensity, short-term activities which do not correspond to current PA recommendations. Further research is necessary to evaluate actual associations between sensor-based PA parameters and health outcome. The author identified generic intensity and duration thresholds for analysing objective PA data from wearable devices. This may contribute to further analyses of PA patterns along with their relations with health outcome parameters. [ABSTRACT FROM AUTHOR]

Motivated by the support vector data description, a classical one-class support vector machine, and the twin support vector machine classifier, this paper formulates a twin support vector hypersphere (TSVH) classifier, a novel binary support vector machine (SVM) classifier that determines a pair of hyperspheres by solving two related SVM-type quadratic programming problems, each of which is smaller than that of a conventional SVM, which means that this TSVH is more efficient than the classical SVM. In addition, the TSVH successfully avoids matrix inversion compared with the twin support vector machine, which indicates learning algorithms of the SVM can be easily extended to this TSVH. Computational results on several synthetic as well as benchmark data sets indicate that the proposed TSVH is not only faster, but also obtains better generalization. [ABSTRACT FROM AUTHOR]

Fingerprint systems have received a great deal of research and attracted many researchers' effort since they provide a powerful tool for access control and security and for practical applications. A literature review of the techniques used to extract the features of fingerprint as well as recognition techniques is given in this paper. Some of the reviewed research articles have used traditional methods such as recognition techniques, whereas the other articles have used neural networks methods. In addition, fingerprint techniques of enhancement are introduced. [ABSTRACT FROM AUTHOR]

Bad quality spots should be filtered out at early steps in microarray analysis to avoid noisy data. In this paper we implement quality control of individual spots from real microarray images. First of all, we consider the binary classification problem of detecting bad quality spots. We propose the use of ensemble algorithms to perform detection and obtain improved accuracies over previous studies in the literature. Next, we analyze the untackled problem of identifying specific spot defects. One spot may have several faults simultaneously (or none of them) yielding a multi-label classification problem. We propose several extra features in addition to those used for binary classification, and we use three different methods to perform the classification task: five independent binary classifiers, the recent Convex Multi-task Feature Learning (CMFL) algorithm and Convex Multi-task Independent Learning (CMIL). We analyze the Hamming loss and areas under the receiver operating characteristic (ROC) curves to quantify the accuracies of the methods. We find that the three strategies achieve similar results leading to a successful identification of particular defects. Also, using a Random forest-based analysis we show that the newly introduced features are highly relevant for this task. [ABSTRACT FROM AUTHOR]

Building patterns are important features that should be preserved in the map generalization process. However, the patterns are not explicitly accessible to automated systems. This paper proposes a framework and several algorithms that automatically recognize building patterns from topographic data, with a focus on collinear and curvilinear alignments. For both patterns two algorithms are developed, which are able to recognize alignment-of-center and alignment-of-side patterns. The presented approach integrates aspects of computational geometry, graph-theoretic concepts and theories of visual perception. Although the individual algorithms for collinear and curvilinear patterns show great potential for each type of the patterns, the recognized patterns are neither complete nor of enough good quality. We therefore advocate the use of a multi-algorithm paradigm, where a mechanism is proposed to combine results from different algorithms to improve the recognition quality. The potential of our method is demonstrated by an application of the framework to several real topographic datasets. The quality of the recognition results are validated in an expert survey. [ABSTRACT FROM AUTHOR]

This paper focuses on the design and development of an expert system for on-line detection of various control chart patterns so as to enable the quality control practitioners to initiate prompt corrective actions for an out-of-control manufacturing process. Using this expert system developed in Visual BASIC 6, all the nine most commonly observed control chart patterns, e.g., normal, stratification, systematic, increasing trend, decreasing trend, upward shift, downward shift, cyclic, and mixture can be recognized well, employing an optimal set of seven shape features. Based on an observation window of 32 data points, it can plot the control chart, compute the control limits, identify the control chart pattern, calculate the process capability index, determine the maximum run length, and identify the starting point of the maximum run length. After pattern recognition, it can also inform the users about various root assignable causes associated with a particular pattern along with the necessary pre-emptive actions. It opens up wide opportunities for quality improvement and real-time applications in diverse manufacturing processes. This developed expert system is built for a vertical drilling process and its recognition performance is tested using simulated process data. [ABSTRACT FROM AUTHOR]

The segmentation of acoustic emission data collected during mechanical tests is one of the current challenges to allow further analysis of damaged materials. Among the existing clustering methods, one of the most widely used is the k-means algorithm. In this paper, a genetic algorithm-based approach is presented. Data sets derived from experimental AE data are processed to highlight the contributions of the new algorithm. Its superiority over the k-means algorithm is demonstrated for several data sets, and especially when a cluster is significantly smaller than the others, or very far and thus behaves as a group of outliers or if the clusters have very different sizes. This method allows the better clustering of AE data even on complex data sets. [ABSTRACT FROM AUTHOR]

Fisher's linear discriminant analysis (FLDA) has been used in many pattern recognition applications. However, this method cannot be applied for solving the pattern recognition problems when the within-class scatter matrix is singular, i.e., when the so-called small sample size problem occurs. Many FLDA variants that have been proposed in the past to circumvent this problem either suffer from excessive computational load when patterns have a large dimension or lose some useful discriminant information. In this paper, a new systematic framework for the pattern recognition of datasets with linearly independent samples is developed. Within this framework, a discriminant model, in which the samples of the individual classes of a dataset lie on parallel hyperplanes and project to single distinct points of a discriminant subspace of the underlying input space, is shown to exist. Based on this model, three algorithms that do not encounter the adverse effects of the small sample size (SSS) problem are developed to obtain such a discriminant subspace for a given dataset with linearly independent samples. A kernelized algorithm is also developed for the discriminant analysis of datasets for which the samples are not linearly independent. Simulation results are provided to examine the validity of the proposed discriminant model and to demonstrate the effectiveness, both in terms of complexity and classification accuracy, of the linear and nonlinear algorithms designed based on the proposed model. [ABSTRACT FROM AUTHOR]

Hierarchical clustering based on semantic feature thresholds is well applied in data mining. However, this method uses systematic sampling to select the edge points of the region during the region merging phase, resulting in the problems of under-consolidation and computational complexity when region merging based on the Euclidean distance criterion. To solve this problem, an improved hierarchical clustering method is proposed, which adopts the weighted Euclidean distance and optimizes the components of region combination. According to the orientation of the centers of two region clustering and the geometric relation among the edge points, two novel type of edge point selection strategies are established to reduce the number of edge points involved in the operation and ensure that the selected ones possess the minimum Euclidean distance in all edge point combinations. Experimental results show that the main advantages of this research project lie in its high clustering accuracy and less average clustering time. [ABSTRACT FROM AUTHOR]

This paper presents a fast and efficient method for classifying X-ray images using random forests with proposed local wavelet-based local binary pattern (LBP) to improve image classification performance and reduce training and testing time. Most studies on local binary patterns and its modifications, including centre symmetric LBP (CS-LBP), focus on using image pixels as descriptors. To classify X-ray images, we first extract local wavelet-based CS-LBP (WCS-LBP) descriptors from local parts of the images to describe the wavelet-based texture characteristic. Then we apply the extracted feature vector to decision trees to construct random forests, which are an ensemble of random decision trees. Using the random forests with local WCS-LBP, we classified one test image into the category having the maximum posterior probability. Compared with other feature descriptors and classifiers, the proposed method shows both improved performance and faster processing time. [ABSTRACT FROM AUTHOR]

Classical classification methods usually assume that pattern recognition models do not depend on the timing of the data. However, this assumption is not valid in cases where new data frequently become available. Such situations are common in practice, for example, spam filtering or fraud detection, where dependencies between feature values and class numbers are continually changing. Unfortunately, most classical machine learning methods (such as decision trees) do not take into consideration the possibility of the model changing, as a result of so-called concept drift and they cannot adapt to a new classification model. This paper focuses on the problem of concept drift, which is a very important issue, especially in data mining methods that use complex structures (such as decision trees) for making decisions. We propose an algorithm that is able to co-train decision trees using a modified NGE ( Nested Generalized Exemplar) algorithm. The potential for adaptation of the proposed algorithm and the quality thereof are evaluated through computer experiments, carried out on benchmark datasets from the UCI Machine Learning Repository. [ABSTRACT FROM AUTHOR]

Connectionist models are usually based on artificial neural networks. However, there is another route towards parallel distributed processing. This is by considering the origins of the intelligence displayed by the single celled organisms known as protoctists. Such intelligence arises by means of the biochemical interactions within the animal. An artificial model of this might therefore be termed an artificial biochemical network or ABN. This paper describes the attributes of such networks and illustrates their abilities in pattern recognition problems and in generating time-varying signals of a type which can be used in many control tasks. The flexibility of the system is explained using legged robots as an example. The networks are trained using back propagation and evolutionary algorithms such as genetic algorithms. [ABSTRACT FROM AUTHOR]

Margin based feature extraction has become a hot topic in machine learning and pattern recognition. In this paper, we present a novel feature extraction method called Adaptive Margin Maximization (AMM) in which margin is defined to measure the discrimination ability of the features. The motivation comes principally from the iterative weight modification mechanism of the powerful boosting algorithms. In our AMM, the samples are dynamically weighted and features are learned sequentially. After one new feature is learned by maximizing the weighted total margin of data, the weights are updated so that the samples with smaller margins receive larger weights. The feature learned in the next round will thus try to concentrate more on these "hard" samples adaptively. We show that when the data are projected onto the feature space learned by AMM, most examples have large margins, and therefore the nearest neighbor classifier yields small generalization error. This is in contrast to existing margin maximization based feature extraction approaches, in which the goal is to maximize the total margin. Extensive experimental results on benchmark datasets demonstrate the effectiveness of our method. [ABSTRACT FROM AUTHOR]

Recognition of abnormal patterns in control charts provides clues to reveal potential quality problems in the manufacturing processes. One potentially popular approach for recognizing different control chart patterns (CCPs) is to develop heuristics based on various shape features of the patterns. The advantage of this approach is that the users can easily understand how a particular pattern is identified. However, consistency in the recognition performance is found to be considerably poor in the heuristics approach. Since shape features represent the main characteristics of the patterns in a condensed form, artificial neural network (ANN) with features extracted from the process data as input vector representation can facilitate efficient pattern recognition with a smaller network size. In this paper, a set of seven shape features is selected, whose magnitudes are independent of the process mean and standard deviation under a special representation of the sampling interval in the control chart plot. Based on these features, the CCPs are recognized using a multilayered perceptron neural network trained by back-propagation algorithm. The recognizer can recognize all the eight commonly observed CCPs. Extensive performance evaluation of this recognizer is carried out using simulated pattern data. Numerical results indicate that the developed ANN recognizer can perform well in real time process control applications with respect to both recognition accuracy and consistency. [ABSTRACT FROM AUTHOR]

In the context of learning theory many efforts have been devoted to developing classification algorithms able to scale up with massive data problems. In this paper the complementary issue is addressed, aimed at deriving powerful classification rules by accurately learning from few data. This task is accomplished by solving a new mixed integer programming model that extends the notion of discrete support vector machines, in order to derive an optimal set of separating hyperplanes for binary classification problems. According to the cardinality of the set of hyperplanes, the classification region may take the form of a convex polyhedron or a polytope in the original space where the examples are defined. Computational tests on benchmark datasets highlight the effectiveness of the proposed model, that yields the greatest accuracy when compared to other classification approaches. [ABSTRACT FROM AUTHOR]

This paper presents the recognition of speech commands using a modified neural fuzzy network (NFN). By introducing associative memory (the tuner NFN) into the classification process (the classifier NFN), the network parameters could be made adaptive to changing input data. Then, the search space of the classification network could be enlarged by a single network. To train the parameters of the modified NFN, an improved genetic algorithm is proposed. As an application example, the proposed speech recognition approach is implemented in an eBook experimentally to illustrate the design and its merits. [ABSTRACT FROM AUTHOR]

This paper presents a new technique of unified probabilistic models for face recognition from only one single example image per person. The unified models, trained on an obtained training set with multiple samples per person, are used to recognize facial images from another disjoint database with a single sample per person. Variations between facial images are modeled as two unified probabilistic models: within-class variations and between-class variations. Gaussian Mixture Models are used to approximate the distributions of the two variations and exploit a classifier combination method to improve the performance. Extensive experimental results on the ORL face database and the authors' database (the ICT-JDL database) including totally 1,750 facial images of 350 individuals demonstrate that the proposed technique, compared with traditional eigenface method and some well-known traditional algorithms, is a significantly more effective and robust approach for face recognition. [ABSTRACT FROM AUTHOR]

Recognition of preconflict situations has a powerful potential for early warning of violent political conflicts. This paper focuses on the design and application of artificial neural networks as classifiers of preconflict situations. Achieving a desired level of performance of the neural network relies on the appropriate construction of recognition space (selection of indicators) and the choice of network architecture. A fast and effective method for the design of reliable neural recognition systems is described. It is based on genetic algorithm techniques and optimizes both the configuration of input space and the network parameters. The implementation of the methodology provides for increased performance of the classifier in terms of accuracy, generalization capacity, computational and data requirements. [ABSTRACT FROM AUTHOR]

Anomaly detection in time-series data is a relevant problem in many fields such as stochastic data analysis, quality assurance, and predictive modeling. Markov models are an effective tool for time-series data analysis. Previous approaches utilizing Markov models incorporate transition matrices (TMs) at varying dimensionalities and resolutions. Other analysis methods treat TMs as vectors for comparison using search algorithms such as the nearest neighbors comparison algorithm, or use TMs to calculate the probability of discrete subsets of time-series data. We propose an analysis method that treats the elements of a TM as random variables, parameterizing them hierarchically. This approach creates a metric for determining the 'normalcy' of a TM generated from a subset of time-series data. The advantages of this novel approach are discussed in terms of computational efficiency, accuracy of anomaly detection, and robustness when analyzing sparse data. Unlike previous approaches, this algorithm is developed with the expectation of sparse TMs. Accounting for this sparseness significantly improves the detection accuracy of the proposed method. Detection rates in a variety of time-series data types range from (97 % TPR, 2.1 % FPR) to (100 % TPR, <0.1 % FPR) with very small sample sizes (20-40 samples) in data with sparse transition probability matrices. [ABSTRACT FROM AUTHOR]

Homologous series are groups of related compounds that share the same core structure attached to a motif that repeats to different degrees. Compounds forming homologous series are of interest in multiple domains, including natural products, environmental chemistry, and drug design. However, many homologous compounds remain unannotated as such in compound datasets, which poses obstacles to understanding chemical diversity and their analytical identification via database matching. To overcome these challenges, an algorithm to detect homologous series within compound datasets was developed and implemented using the RDKit. The algorithm takes a list of molecules as SMILES strings and a monomer (i.e., repeating unit) encoded as SMARTS as its main inputs. In an iterative process, substructure matching of repeating units, molecule fragmentation, and core detection lead to homologous series classification through grouping of identical cores. Three open compound datasets from environmental chemistry (NORMAN Suspect List Exchange, NORMAN-SLE), exposomics (PubChemLite for Exposomics), and natural products (the COlleCtion of Open NatUral producTs, COCONUT) were subject to homologous series classification using the algorithm. Over 2000, 12,000, and 5000 series with CH2 repeating units were classified in the NORMAN-SLE, PubChemLite, and COCONUT respectively. Validation of classified series was performed using published homologous series and structure categories, including a comparison with a similar existing method for categorising PFAS compounds. The OngLai algorithm and its implementation for classifying homologues are openly available at: https://github.com/adelenelai/onglai-classify-homologues. [ABSTRACT FROM AUTHOR]

Maculopathy is the group of diseases that affects central vision of a person and they are often associated with diabetes. Many researchers reported automated diagnosis of maculopathy from optical coherence tomography (OCT) images. However, to the best of our knowledge there is no literature that presents a complete 3D suite for the extraction as well as diagnosis of macula. Therefore, this paper presents a multilayered convolutional neural networks (CNN) structure tensor Delaunay triangulation and morphing based fully autonomous system that extracts up to nine retinal and choroidal layers along with the macular fluids. Furthermore, the proposed system utilizes the extracted retinal information for the automated diagnosis of maculopathy as well as for the robust reconstruction of 3D macula of retina. The proposed system has been validated on 41,921 retinal OCT scans acquired from different OCT machines and it significantly outperformed existing state of the art solutions by achieving the mean accuracy of 95.27% for extracting retinal and choroidal layers, mean dice coefficient of 0.90 for extracting fluid pathology and the overall accuracy of 96.07% for maculopathy diagnosis. To the best of our knowledge, the proposed framework is first of its kind that provides a fully automated and complete 3D integrated solution for the extraction of candidate macula along with its fully automated diagnosis against different macular syndromes. [ABSTRACT FROM AUTHOR]

In this paper, a modified version of the FCM algorithm is presented to deal with clusters with totally different geometrical properties. The proposed algorithm adopts a novel non-metric distance measure based on the idea of "point symmetry". Experimental results on several data sets are presented to illustrate its effectiveness. [ABSTRACT FROM AUTHOR]

This research proposes the method to extract the characteristics of images to become the intervals. These intervals are used to build the automatic fuzzy genetic algorithm for images (AFGI). In the proposed model, the overlap measure is the criterion to evaluate the closeness of intervals, and the new Davies and Bouldin index is the objective function. The AFGI can determine the proper number of clusters, the images in each cluster, and the probability to belong to clusters of images at the same time. The experiments with different types of images illustrate the steps of AFGI, and show its significant benefit in comparing to other algorithms. [ABSTRACT FROM AUTHOR]

According to the statistics examined by the National Safety Council, Injury Facts in 2017, a significant number of preventable injury-related deaths occurred in home and indoor public areas, and the rate of preventable deaths occurring indoors has increased by 156% since 1999. Indoor smart Internet of Things devices such as security cameras, intelligent speakers, smartphones, and air cleaners are being utilized to seek help during dangerous or emergency situations in indoor settings. Theses Internet of Things devices can also assist single-person household rescues during emergency situations where no one is present for assistance. We propose a real-time algorithm to detect unusual user events which may help in reducing the rate of people dying alone and remaining undiscovered for a long period of time. We designed and developed unusual user behavior patterns related to vision, audio, dust, and activity via Internet of Things sensors and fused these patterns to improve the performance accuracy. We evaluated the proposed individual pattern algorithms and the fusion method through the data collected in indoor smart environments. [ABSTRACT FROM AUTHOR]

A robust, automated pattern recognition system for polysomnography data targeted to the sleep-waking state and stage identification is presented. Five patterns were searched for: slow-delta and theta wave predominance in the background electro-encephalogram (EEG) activity; presence of sleep spindles in the EEG; presence of rapid eye movements in an electro-oculogram; and presence of muscle tone in an electromyogram. The performance of the automated system was measured indirectly by evaluating sleep staging, based on the experts' accepted methodology, to relate the detected patterns in infants over four months of post-term age. The set of sleep-waking classes included wakefulness, REM sleep and non-REM sleep stages I, II, and III-IV. Several noise and artifact rejection methods were implemented, including filters, fuzzy quality indices, windows of variable sizes and detectors of limb movements and wakefulness. Eleven polysomnographic recordings of healthy infants were studied. The ages of the subjects ranged from 6 to 13 months old. Six recordings counting 2665 epochs were included in the training set. Results on a test set (2,369 epochs from five recordings) show an overall agreement of 87.7% (kappa 0.840) between the automated system and the human expert. These results show significant improvements compared with previous work. [ABSTRACT FROM AUTHOR]

We present a new detection method for color-based object detection, which can improve the performance of learning procedures in terms of speed, accuracy, and efficiency, using spatial inference, and algorithm. We applied the model to human skin detection from an image; however, the method can also work for other machine learning tasks involving image pixels. We propose (1) an improved RGB/HSL human skin color threshold to tackle darker human skin color detection problem. (2), we also present a new rule-based fast algorithm (packed k-dimensional tree --- PKT) that depends on an improved spatial structure for human skin/face detection from colored 2D images. We also implemented a novel packed quad-tree (PQT) to speed up the quad-tree performance in terms of indexing. We compared the proposed system to traditional pixel-by-pixel (PBP)/pixel-wise (PW) operation, and quadtree based procedures. The results show that our proposed spatial structure performs better (with a very low false hit rate, very high precision, and accuracy rate) than most state-of-the-art models. [ABSTRACT FROM AUTHOR]

An algorithm to assemble large jigsaw puzzles using curve matching and combinatorial optimization techniques is presented. The pieces are photographed one by one and then the assembly algorithm, which uses only the puzzle piece shape information, is applied. The algorithm was experimented successfully in the assembly of 104-piece puzzles with many almost similar pieces. It was also extended to solve an intermixed puzzle assembly problem and has successfully solved a 208-piece puzzle consisting of two intermixed 104-piece puzzles. Previous results solved puzzles with about 10 pieces, which were substantially different in shape. [ABSTRACT FROM AUTHOR]

We provide an efficient algorithm to detect whether two given trigonometric curves, i.e. two parametrized curves whose components are truncated Fourier series, in any dimension, are affinely equivalent, i.e. whether there exists an affine mapping transforming one of the curves onto the other. If the coefficients of the parametrizations are known exactly (the exact case), the algorithm boils down to univariate gcd computation, so it is efficient and fast. If the coefficients of the parametrizations are known with finite precision, e.g. floating point numbers (the approximate case), the univariate gcd computation is replaced by the computation of approximate gcds. Our experiments show that the method works well, even for high degrees. [ABSTRACT FROM AUTHOR]

Purpose Post-injury health service utilization (HSU) contributes to injury outcomes, but limited studies investigated their relationship. This study aims to group injured patients in transport accidents based on minimal historical information of their HSU so that the groups are meaningfully associated with the outcome of interest. Methods The data include 20,692 injured patients who had compensation claims over 3 years. We propose a hybrid approach, combining unsupervised and supervised machine learning methods. Based on the first week post-injury data, we identify a proper clustering of patients best associated with total cost to recovery, as well as the discovery of HSU patterns. This allows developing models to accurately predict the outcome of interest using the discovered patterns. Furthermore, we propose to use decision tree classifiers to accurately classify future patients into the discovered clusters using their first week post-injury information. Results Our hybrid approach has identified eight patient groups. The compactness of the resulted clusters, assessed by Average Silhouette Width metric, is 0.71 indicating well-defined clusters. The resulted patient groups are highly predictive of injury outcomes. They improve the cost predictability more than twice in comparison with predictors such as gender, age and injury type. These groups also have substantial association with patients' recovery. The transparency and interpretability of decision trees allow integrating the resulting classification rules conveniently in operational processes. Conclusions This study provides a framework to discover knowledge and useful insights for health service providers and policy makers to control injury outcomes, and consequently to reduce the severity of transport accidents. [ABSTRACT FROM AUTHOR]

This article presents a new series of invariant moments, called Fractional-order Generalized Laguerre Moment Invariants (FGLMI), based on Fractional-order Generalized Laguerre polynomials (FGLPs). To begin, we provide the relations and the properties necessary to define the fractional-order generalized Laguerre moments. Then, we present the theoretical framework to derive invariants from fractional-order moments with respect to the change in orientation, size and position based on the algebraic relationships between FGLM and fractional-order geometric moments. In addition, a fast and precise algorithm has been proposed for the calculation of FGLM in order to speed up the calculation time and ensure the numerical stability of the invariant moments. Numerical experiments are carried out to demonstrate the efficiency of FGLM and their proposed invariants compared to existing methods, with regard to the reconstruction of 2D and 3D images, the computation time, the global entity extraction capacity and image localization, invariability property and 2D / 3D image classification performance on different 2D and 3D image databases. The theoretical and experimental results presented clearly show the efficiency of the descriptors proposed for the representation and classification of 2D and 3D images by other types of orthogonal moments. [ABSTRACT FROM AUTHOR]

A new version of the Barrier algorithm is proposed for recognition of strong-earthquake prone regions based on training over a single reliable training class. The modification of the algorithm consists in creating blocks that reveal the geological–geophysical features (attributes) characteristic of the recognized highly seismic objects and provide their quantitative estimates. The recognition of the areas prone to earthquakes with M ≥ 6.0 is carried out for the Altai–Sayan–Baikal region. The results of the recognition are used for assessing the effect of the remote earthquakes that occurred in the Altai–Sayan orogenic region on the stability of structural-tectonic crustal blocks in the contact zone of the West Siberian platform and the Siberian plate. [ABSTRACT FROM AUTHOR]

Breast cancer is one of the life-threatening cancers occurring in women. In recent years, from the surveys provided by various medical organizations, it has become clear that the mortality rate of females is increasing owing to the late detection of breast cancer. Therefore, an automated algorithm is needed to identify the early occurrence of microcalcification, which would assist radiologists and physicians in reducing the false predictions via image processing techniques. In this work, we propose a new algorithm to detect the pattern of a microcalcification by calculating its physical characteristics. The considered physical characteristics are the reflection coefficient and mass density of the binned digital mammogram image. The calculation of physical characteristics doubly confirms the presence of malignant microcalcification. Subsequently, by interpolating the physical characteristics via thresholding and mapping techniques, a three-dimensional (3D) projection of the region of interest (RoI) is obtained in terms of the distance in millimeter. The size of a microcalcification is determined using this 3D-projected view. This algorithm is verified with 100 abnormal mammogram images showing microcalcification and 10 normal mammogram images. In addition to the size calculation, the proposed algorithm acts as a good classifier that is used to classify the considered input image as normal or abnormal with the help of only two physical characteristics. This proposed algorithm exhibits a classification accuracy of 99%. [ABSTRACT FROM AUTHOR]

The article contains a description of two quantum circuits for pattern recognition. The first approach is realized with use of k nearest neighbors algorithm and the second with support vector machine. The task is to distinguish between Hermitian and non-Hermitian matrices. The quantum circuits are constructed to accumulate elements of a learning set. After this process, circuits are able to produce a quantum state which contains the information if a tested element fits to the trained pattern. To improve the efficiency of presented solutions, the matrices were uniquely labeled with feature vectors. The role of the feature vectors is to highlight some features of the objects which are crucial in the process of classification. The circuits were implemented in Python programming language and some numeric experiments were conducted to examine the capacity of presented solutions in pattern recognition. [ABSTRACT FROM AUTHOR]

Lung cancer is the leading cause of cancer-related deaths in the world, and one of its manifestations occurs with the appearance of pulmonary nodules. The classification of pulmonary nodules may be a complex task to specialists due to temporal, subjective, and qualitative aspects. Therefore, it is important to integrate computational tools to the early pulmonary nodule classification process, since they have the potential to characterize objectively and quantitatively the lesions. In this context, the goal of this work is to perform the classification of pulmonary nodules based on image features of texture and margin sharpness. Computed tomography scans were obtained from a publicly available image database. Texture attributes were extracted from a co-occurrence matrix obtained from the nodule volume. Margin sharpness attributes were extracted from perpendicular lines drawn over the borders on all nodule slices. Feature selection was performed by different algorithms. Classification was performed by several machine learning classifiers and assessed by the area under the receiver operating characteristic curve, sensitivity, specificity, and accuracy. Highest classification performance was obtained by a random forest algorithm with all 48 extracted features. However, a decision tree using only two selected features obtained statistically equivalent performance on sensitivity and specificity. [ABSTRACT FROM AUTHOR]

Sign language is the most important means of communication for deaf people. Given the lack of familiarity of non-deaf people with the language of deaf people, designing a translator system which facilitates the communication of deaf people with the surrounding environment seems to be necessary. The system of translating the sign language into spoken languages should be able to identify the gestures in sign language videos. Consequently, this study provides a system based on machine vision to recognize the signs in continuous Persian sign language video. This system generally consists of two main phases of sign words extraction and their classification. Several stages, including tracking and separating the sign words, are conducted in the sign word extraction phase. The most challenging part of this process is separation of sign words from video sequences. To do this, a new algorithm is presented which is capable of detecting accurate boundaries of words in the Persian sign language video. This algorithm decomposes sign language video into the sign words using motion and hand shape features, leading to more favorable results compared to the other methods presented in the literature. In the classification phase, separated words are classified and recognized using hidden Markov model and hybrid KNN-DTW algorithm, respectively. Due to the lack of proper database on Persian sign language, the authors prepared a database including several sentences and words performed by three signers. Simulation of proposed words boundary detection and classification algorithms on the above database led to the promising results. The results indicated an average rate of 93.73 % for accurate words boundary detection algorithm and the average rate of 92.4 and 92.3 % for words recognition using hands motion and shape features, respectively. [ABSTRACT FROM AUTHOR]

Electromyography (EMG)-based control is the core of prostheses, orthoses, and other rehabilitation devices in recent research. Nonetheless, EMG is difficult to use as a control signal given the complex nature of the signal. To overcome this problem, the researchers employed a pattern recognition technique. EMG pattern recognition mainly involves four stages: signal detection, preprocessing feature extraction, dimensionality reduction, and classification. In particular, the success of any pattern recognition technique depends on the feature extraction stage. In this study, a modified time-domain features set and logarithmic transferred time-domain features (LTD) were evaluated and compared with other traditional time-domain features set (TTD). Three classifiers were employed to assess the two feature sets, namely linear discriminant analysis (LDA), k nearest neighborhood, and Naïve Bayes. Results indicated the superiority of the new time-domain feature set LTD, on conventional time-domain features TTD with the average classification accuracy of 97.23 %. In addition, the LDA classifier outperformed the other two classifiers considered in this study. [ABSTRACT FROM AUTHOR]

Strabismus is a pathology that affects approximately 4 % of the population, causing aesthetic problems reversible at any age and irreversible sensory alterations that modify the vision mechanism. The Hirschberg test is one type of examination for detecting this pathology. Computer-aided detection/diagnosis is being used with relative success to aid health professionals. Nevertheless, the routine use of high-tech devices for aiding ophthalmological diagnosis and therapy is not a reality within the subspecialty of strabismus. Thus, this work presents a methodology to aid in diagnosis of syndromic strabismus through digital imaging. Two hundred images belonging to 40 patients previously diagnosed by an specialist were tested. The method was demonstrated to be 88 % accurate in esotropias identification (ET), 100 % for exotropias (XT), 80.33 % for hypertropias (HT), and 83.33 % for hypotropias (HoT). The overall average error was 5.6 Δ and 3.83 Δ for horizontal and vertical deviations, respectively, against the measures presented by the specialist. [ABSTRACT FROM AUTHOR]