scholarly journals Chromosome Identification Using Hidden Markov Models: Comparison with Neural Networks, Singular Value Decomposition, Principal Components Analysis, and Fisher Discriminant Analysis

2000 ◽  
Vol 80 (11) ◽  
pp. 1629-1641 ◽  
Author(s):  
John M Conroy ◽  
Tamara G Kolda ◽  
Dianne P O'Leary ◽  
Timothy J O'Leary
2015 ◽  
Vol 15 (2) ◽  
pp. 294
Author(s):  
Siska Anraeni ◽  
Ingrid Nurtanio ◽  
Indrabayu Indrabayu

The frequencies of chronic kidney disease are likely to continue to increase worldwide. So people need to take a precaution, which is by maintaining kidney health and early detection of renal impairment by analyzing the composition of the iris is known as iridology. This paper presents a novel approach using a one-dimensional discrete Hidden Markov Model (HMM) classifier and coefficients Singular Value Decomposition (SVD) as a feature for image recognition iris to indicate normal or abnormal kidney. The system has been examined on 200 iris images. The total images of the abnormal kidney condition were 100 images and those for the normal kidney condition were 100 images. The system showed a classification rate up to 100% using total of image for training and testing the system unspecified, resize iris image 56x46 pixels, coefficient values U(1,1), Σ(1,1) and Σ(2,2), quantized values [18 10 7], and classify by 7-state HMM with .pgm format database.


Author(s):  
Reza Satria Rinaldi ◽  
Wagiasih Wagiasih ◽  
Ika Novia Anggraini

ABSTRACTIridology has not been widely applied for the recognition of kidney disorders. identification of kidney disorders through iris image using iridology chart, can make it easier to make diagnosis to find out about kidney disorders. The method used in the process of recognition of kidney disorders through iridology is the Hidden Markov Model (HMM) method, with a HMM parameter determination system using the calculation of the koefisien Singular Value Decomposition (SVD) coefficient. The size of the codebook used is 7, i.e. 16, 32, 64, 128, 256, 512 and 1024. Different sizes of codebooks will result in different recognition times. The time needed will be longer when the size of the codebook is getting bigger. The accuracy of the process of recognition of kidney disorders through iridology using the HMM method in this study is 68.75% for codebook 16, 87.5% for codebook 32, 100% for codebook 128 and 100% for codebook 512. Keywords : iridology, codebook, image processing, singular value decomposition (SVD), Hidden Markov Model (HMM).


2019 ◽  
Author(s):  
Ranjani Murali ◽  
James Hemp ◽  
Victoria Orphan ◽  
Yonatan Bisk

AbstractThe ability to correctly predict the functional role of proteins from their amino acid sequences would significantly advance biological studies at the molecular level by improving our ability to understand the biochemical capability of biological organisms from their genomic sequence. Existing methods that are geared towards protein function prediction or annotation mostly use alignment-based approaches and probabilistic models such as Hidden-Markov Models. In this work we introduce a deep learning architecture (FunctionIdentification withNeuralDescriptions orFIND) which performs protein annotation from primary sequence. The accuracy of our methods matches state of the art techniques, such as protein classifiers based on Hidden Markov Models. Further, our approach allows for model introspection via a neural attention mechanism, which weights parts of the amino acid sequence proportionally to their relevance for functional assignment. In this way, the attention weights automatically uncover structurally and functionally relevant features of the classified protein and find novel functional motifs in previously uncharacterized proteins. While this model is applicable to any database of proteins, we chose to apply this model to superfamilies of homologous proteins, with the aim of extracting features inherent to divergent protein families within a larger superfamily. This provided insight into the functional diversification of an enzyme superfamily and its adaptation to different physiological contexts. We tested our approach on three families (nitrogenases, cytochromebd-type oxygen reductases and heme-copper oxygen reductases) and present a detailed analysis of the sequence characteristics identified in previously characterized proteins in the heme-copper oxygen reductase (HCO) superfamily. These are correlated with their catalytic relevance and evolutionary history. FIND was then applied to discover features in previously uncharacterized members of the HCO superfamily, providing insight into their unique sequence features. This modeling approach demonstrates the power of neural networks to recognize patterns in large datasets and can be utilized to discover biochemically and structurally important features in proteins from their amino acid sequences.Author summary


Author(s):  
Russell Gluck ◽  
John Fulcher

The chapter commences with an overview of automatic speech recognition (ASR), which covers not only the de facto standard approach of hidden Markov models (HMMs), but also the tried-and-proven techniques of dynamic time warping and artificial neural networks (ANNs). The coverage then switches to Gluck’s (2004) draw-talk-write (DTW) process, developed over the past two decades to assist non-text literate people become gradually literate over time through telling and/or drawing their own stories. DTW has proved especially effective with “illiterate” people from strong oral, storytelling traditions. The chapter concludes by relating attempts to date in automating the DTW process using ANN-based pattern recognition techniques on an Apple Macintosh G4™ platform.


2013 ◽  
Vol 2 (3) ◽  
pp. 18-35 ◽  
Author(s):  
Mohamed Adel Taher ◽  
Mostapha Abdeljawad

In this paper, the authors propose a new hybrid strategy (using artificial neural networks and hidden Markov models) for skill automation. The strategy is based on the concept of using an “adaptive desired” that is introduced in the paper. The authors explain how using an adaptive desired can help a system for which an explicit model is not available or is difficult to obtain to smartly cope with environmental disturbances without requiring explicit rules specification (as with fuzzy systems). At the same time, unlike the currently available hidden Markov-based systems, the system does not merely replay a memorized skill. Instead, it takes into account the current system state as reported by sensors. The authors approach can be considered a bridge between the spirit of conventional automatic control theory and fuzzy/hidden Markov-based thinking. To demonstrate the different aspects of the proposed strategy, the authors discuss its application to underwater welding automation.


2000 ◽  
Vol 23 (4) ◽  
pp. 494-495
Author(s):  
Ingmar Visser

Page's manifesto makes a case for localist representations in neural networks, one of the advantages being ease of interpretation. However, even localist networks can be hard to interpret, especially when at some hidden layer of the network distributed representations are employed, as is often the case. Hidden Markov models can be used to provide useful interpretable representations.


Author(s):  
Yosra Abdulaziz Mohammed

Cries of infants can be seen as an indicator of pain. It has been proven that crying caused by pain, hunger, fear, stress, etc., show different cry patterns. The work presented here introduces a comparative study between the performance of two different classification techniques implemented in an automatic classification system for identifying two types of infants' cries, pain, and non-pain. The techniques are namely, Continuous Hidden Markov Models (CHMM) and Artificial Neural Networks (ANN). Two different sets of acoustic features were extracted from the cry samples, those are MFCC and LPCC, the feature vectors generated by each were eventually fed into the classification module for the purpose of training and testing. The results of this work showed that the system based on CDHMM have better performance than that based on ANN. CDHMM gives the best identification rate at 96.1%, which is much higher than 79% of ANN whereby in general the system based on MFCC features performed better than the one that utilizes LPCC features.


Sign in / Sign up

Export Citation Format

Share Document