The recursive nature of descriptions : a fixed point /

"UIUC-ENG-R-75-2539."

Texture analysis and cartographic feature extraction /

"January 1985."

Proceedings on "Emerging Patterns in AIPR". Abstracts

On cover, 1978 : NBS-EIA

The Role of IL-25 in Colitis-Associated Colon Cancer and Pulmonary Inflammation

Thesis (Ph.D.)--University of Washington, 2016-06

Mannose-binding lectin gene polymorphism predicts hospital admissions for COPD infections

Infection frequently causes exacerbations of chronic obstructive pulmonary disease (COPD). Mannose-binding lectin (MBL) is a pattern-recognition receptor that assists in clearing microorganisms. Polymorphisms in the MBL2 gene reduce serum MBL levels and are associated with risk of infection. We studied whether the MBL2 codon 54 B allele affected serum MBL levels, admissions for infective exacerbation in COPD and disease susceptibility. Polymorphism frequency was determined by PCR-RFLP in 200 COPD patients and 104 smokers with normal lung function. Serum MBL was measured as mannan-binding activity in a subgroup of 82 stable COPD patients. Frequency of COPD admissions for infective exacerbation was ascertained for a 2-year period. The MBL2 codon 54 B allele reduced serum MBL in COPD patients. In keeping, patients carrying the low MBL-producing B allele had increased risk of admission for infective exacerbation (OR 4.9, P-corrected = 0.011). No association of MBL2 genotype with susceptibility to COPD was detected. In COPD, serum MBL is regulated by polymorphism at codon 54 in its encoding gene. Low MBL-producing genotypes were associated with more frequent admissions to hospital with respiratory infection, suggesting that the MBL2 gene is disease-modifying in COPD. MBL2 genotype should be explored prospectively as a prognostic marker for infection risk in COPD.

Genetic algorithm optimization of adaptive multi-scale GLCM features

We introduce a new second-order method of texture analysis called Adaptive Multi-Scale Grey Level Co-occurrence Matrix (AMSGLCM), based on the well-known Grey Level Co-occurrence Matrix (GLCM) method. The method deviates significantly from GLCM in that features are extracted, not via a fixed 2D weighting function of co-occurrence matrix elements, but by a variable summation of matrix elements in 3D localized neighborhoods. We subsequently present a new methodology for extracting optimized, highly discriminant features from these localized areas using adaptive Gaussian weighting functions. Genetic Algorithm (GA) optimization is used to produce a set of features whose classification worth is evaluated by discriminatory power and feature correlation considerations. We critically appraised the performance of our method and GLCM in pairwise classification of images from visually similar texture classes, captured from Markov Random Field (MRF) synthesized, natural, and biological origins. In these cross-validated classification trials, our method demonstrated significant benefits over GLCM, including increased feature discriminatory power, automatic feature adaptability, and significantly improved classification performance.

Speeding up the EM algorithm for mixture model-based segmentation of magnetic resonance images

Mixture models implemented via the expectation-maximization (EM) algorithm are being increasingly used in a wide range of problems in pattern recognition such as image segmentation. However, the EM algorithm requires considerable computational time in its application to huge data sets such as a three-dimensional magnetic resonance (MR) image of over 10 million voxels. Recently, it was shown that a sparse, incremental version of the EM algorithm could improve its rate of convergence. In this paper, we show how this modified EM algorithm can be speeded up further by adopting a multiresolution kd-tree structure in performing the E-step. The proposed algorithm outperforms some other variants of the EM algorithm for segmenting MR images of the human brain. (C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Using the EM Algorithm to Train Neural Networks: Misconceptions and a New Algorithm for Multiclass Classification

The expectation-maximization (EM) algorithm has been of considerable interest in recent years as the basis for various algorithms in application areas of neural networks such as pattern recognition. However, there exists some misconceptions concerning its application to neural networks. In this paper, we clarify these misconceptions and consider how the EM algorithm can be adopted to train multilayer perceptron (MLP) and mixture of experts (ME) networks in applications to multiclass classification. We identify some situations where the application of the EM algorithm to train MLP networks may be of limited value and discuss some ways of handling the difficulties. For ME networks, it is reported in the literature that networks trained by the EM algorithm using iteratively reweighted least squares (IRLS) algorithm in the inner loop of the M-step, often performed poorly in multiclass classification. However, we found that the convergence of the IRLS algorithm is stable and that the log likelihood is monotonic increasing when a learning rate smaller than one is adopted. Also, we propose the use of an expectation-conditional maximization (ECM) algorithm to train ME networks. Its performance is demonstrated to be superior to the IRLS algorithm on some simulated and real data sets.

Assessing computational tools for the discovery of transcription factor binding sites

The prediction of regulatory elements is a problem where computational methods offer great hope. Over the past few years, numerous tools have become available for this task. The purpose of the current assessment is twofold: to provide some guidance to users regarding the accuracy of currently available tools in various settings, and to provide a benchmark of data sets for assessing future tools.

The applicability of recurrent neural networks for biological sequence analysis

Selection of machine learning techniques requires a certain sensitivity to the requirements of the problem. In particular, the problem can be made more tractable by deliberately using algorithms that are biased toward solutions of the requisite kind. In this paper, we argue that recurrent neural networks have a natural bias toward a problem domain of which biological sequence analysis tasks are a subset. We use experiments with synthetic data to illustrate this bias. We then demonstrate that this bias can be exploitable using a data set of protein sequences containing several classes of subcellular localization targeting peptides. The results show that, compared with feed forward, recurrent neural networks will generally perform better on sequence analysis tasks. Furthermore, as the patterns within the sequence become more ambiguous, the choice of specific recurrent architecture becomes more critical.

A First Order Predicate Logic Formulation of the 3D Reconstruction Problem and its Solution Space

This paper defines the 3D reconstruction problem as the process of reconstructing a 3D scene from numerous 2D visual images of that scene. It is well known that this problem is ill-posed, and numerous constraints and assumptions are used in 3D reconstruction algorithms in order to reduce the solution space. Unfortunately, most constraints only work in a certain range of situations and often constraints are built into the most fundamental methods (e.g. Area Based Matching assumes that all the pixels in the window belong to the same object). This paper presents a novel formulation of the 3D reconstruction problem, using a voxel framework and first order logic equations, which does not contain any additional constraints or assumptions. Solving this formulation for a set of input images gives all the possible solutions for that set, rather than picking a solution that is deemed most likely. Using this formulation, this paper studies the problem of uniqueness in 3D reconstruction and how the solution space changes for different configurations of input images. It is found that it is not possible to guarantee a unique solution, no matter how many images are taken of the scene, their orientation or even how much color variation is in the scene itself. Results of using the formulation to reconstruct a few small voxel spaces are also presented. They show that the number of solutions is extremely large for even very small voxel spaces (5 x 5 voxel space gives 10 to 10(7) solutions). This shows the need for constraints to reduce the solution space to a reasonable size. Finally, it is noted that because of the discrete nature of the formulation, the solution space size can be easily calculated, making the formulation a useful tool to numerically evaluate the usefulness of any constraints that are added.

Off-line signature verification and forgery detection using fuzzy modeling

Automatic signature verification is a well-established and an active area of research with numerous applications such as bank check verification, ATM access, etc. This paper proposes a novel approach to the problem of automatic off-line signature verification and forgery detection. The proposed approach is based on fuzzy modeling that employs the Takagi-Sugeno (TS) model. Signature verification and forgery detection are carried out using angle features extracted from box approach. Each feature corresponds to a fuzzy set. The features are fuzzified by an exponential membership function involved in the TS model, which is modified to include structural parameters. The structural parameters are devised to take account of possible variations due to handwriting styles and to reflect moods. The membership functions constitute weights in the TS model. The optimization of the output of the TS model with respect to the structural parameters yields the solution for the parameters. We have also derived two TS models by considering a rule for each input feature in the first formulation (Multiple rules) and by considering a single rule for all input features in the second formulation. In this work, we have found that TS model with multiple rules is better than TS model with single rule for detecting three types of forgeries; random, skilled and unskilled from a large database of sample signatures in addition to verifying genuine signatures. We have also devised three approaches, viz., an innovative approach and two intuitive approaches using the TS model with multiple rules for improved performance. (C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Extreme learning machine for predicting HLA-peptide binding

Machine learning techniques have been recognized as powerful tools for learning from data. One of the most popular learning techniques, the Back-Propagation (BP) Artificial Neural Networks, can be used as a computer model to predict peptides binding to the Human Leukocyte Antigens (HLA). The major advantage of computational screening is that it reduces the number of wet-lab experiments that need to be performed, significantly reducing the cost and time. A recently developed method, Extreme Learning Machine (ELM), which has superior properties over BP has been investigated to accomplish such tasks. In our work, we found that the ELM is as good as, if not better than, the BP in term of time complexity, accuracy deviations across experiments, and most importantly - prevention from over-fitting for prediction of peptide binding to HLA.

Low mannose-binding lectin function is associated with sepsis in adult patients

Mannose-binding lectin (MBL) is an innate immune system pattern recognition molecule that kills a wide range of pathogens via the lectin complement pathway. MBL deficiency is associated with severe infection but the best measure of this deficiency is undecided. We investigated the influence of MBL functional deficiency on the development of sepsis in 195 adult patients, 166 of whom had bloodstream infection and 35 had pneumonia. Results were compared with 236 blood donor controls. MBL function (C4b deposition) and levels were measured by enzyme-linked immunosorbent assay. Using receiver-operator characteristics of MBL function in healthy controls, we identified a level of < 0.2 U mu L-1 as a highly discriminative marker of low MBL2 genotypes. Median MBL function was lower in sepsis patients (0.18 U mu L-1) than in controls (0.48 U mu L-1, P < 0.001). MBL functional deficiency was more common in sepsis patients than controls (P < 0.001). MBL functional deficient patients had significantly higher sequential organ failure assessment (SOFA) scores and higher MBL function and levels were found in patients with SOFA scores predictive of good outcome. Deficiency of MBL function appears to be associated with bloodstream infection and the development of septic shock. High MBL levels may be protective against severe sepsis. © 2006 Federation of European Microbiological Societies Published by Blackwell Publishing Ltd. All rights reserved.