Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Pattern Recognition, Automated”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 451 records · Page 25Linked to original sources
PubMed2006

EEG transient event detection and classification using association rules.

In this paper, a methodology for the automated detection and classification of transient events in electroencephalographic (EEG) recordings is presented. It is based on association rule mining and classifies transient events into four categories: epileptic spikes, muscle activity, eye blinking activity, and sharp alpha activity. The methodology involves four stages: 1) transient event detection; 2) clustering of transient events and feature extraction; 3) feature discretization and feature subset selection; and 4) association rule mining and classification of transient events. The methodology is evaluated using 25 EEG recordings, and the best obtained accuracy was 87.38%. The proposed approach combines high accuracy with the ability to provide interpretation for the decisions made, since it is based on a set of association rules.

Algorithms↗
PubMed2006

Dynamics of facial expression: recognition of facial actions and their temporal segments from face profile image sequences.

Automatic analysis of human facial expression is a challenging problem with many applications. Most of the existing automated systems for facial expression analysis attempt to recognize a few prototypic emotional expressions, such as anger and happiness. Instead of representing another approach to machine analysis of prototypic facial expressions of emotion, the method presented in this paper attempts to handle a large range of human facial behavior by recognizing facial muscle actions that produce expressions. Virtually all of the existing vision systems for facial muscle action detection deal only with frontal-view face images and cannot handle temporal dynamics of facial actions. In this paper, we present a system for automatic recognition of facial action units (AUs) and their temporal models from long, profile-view face image sequences. We exploit particle filtering to track 15 facial points in an input face-profile sequence, and we introduce facial-action-dynamics recognition from continuous video input using temporal rules. The algorithm performs both automatic segmentation of an input video into facial expressions pictured and recognition of temporal segments (i.e., onset, apex, offset) of 27 AUs occurring alone or in a combination in the input face-profile video. A recognition rate of 87% is achieved.

Algorithms↗
PubMed2006

In vitro calculus detection with a moved smart ultrasonic device.

STUDY OBJECTIVE: The objective of subgingival instrumentation of periodontally diseased root surfaces is to remove the adhering microbial biofilm and calcified deposits. Recently, we have described an automated calculus detection system under static conditions. Clinically however, the tip of the system has to be moved over tooth surfaces. It was thus necessary to study the entire system in motion. METHODS: The detection device is based on a conventional dental piezoelectric ultrasonic handpiece with a conventional scaler insert. The impulse response of the mechanical oscillation system is analysed by a fuzzy logic-based computerized algorithm, which classifies various surfaces. The present study investigates dental surface recognition properties of the new system with the tip being moved over teeth surfaces in vitro. Following a training set of 7977 measurements (3960 calculus, 4017 cement) on 200 extracted teeth, 1363 measurements were conducted on 34 teeth unknown to the system. RESULTS: The surfaces cementum and calculus were correctly classified in 78% within the training set and in 81% within the set unknown, with a kappa value of 0.68. CONCLUSION: It was shown that this method of automatic recognition of tooth surfaces is able to distinguish between different tooth surfaces in vitro independently from tip movements.

Dental Calculus↗
PubMed2006

A real-time automated system for the recognition of human facial expressions.

A fully automated, multistage system for real-time recognition of facial expression is presented. The system uses facial motion to characterize monochrome frontal views of facial expressions and is able to operate effectively in cluttered and dynamic scenes, recognizing the six emotions universally associated with unique facial expressions, namely happiness, sadness, disgust, surprise, fear, and anger. Faces are located using a spatial ratio template tracker algorithm. Optical flow of the face is subsequently determined using a real-time implementation of a robust gradient model. The expression recognition system then averages facial velocity information over identified regions of the face and cancels out rigid head motion by taking ratios of this averaged motion. The motion signatures produced are then classified using Support Vector Machines as either nonexpressive or as one of the six basic emotions. The completed system is demonstrated in two simple affective computing applications that respond in real-time to the facial expressions of the user, thereby providing the potential for improvements in the interaction between a computer user and technology.

Algorithms↗
PubMed2003

A robust statistics-based global energy function for the alignment of serially acquired autoradiographic sections.

Autoradiographic analysis of the functional changes occurring in the rat brain are most often performed on coronal sections that allow a good insight into the events occurring at the structural level but lacks the 3D context which is necessary to fully understand the involvement of the brain structures in specific situations like focal seizures with or without generalization. Therefore a robust, fully-automated algorithm for the registration of serially acquired autoradiographic sections is presented. The method accounts for the main difficulties of autoradiographic alignment: corrupted data (cuts and tears), dissimilarities or discontinuities between slices, non parallel or missing slices. The approach relies on the minimization of a global energy function based on robust statistics. The energy function measures the similarity between a slice and its neighborhood in the 3D volume. No particular direction is privileged in the method, so that global offsets, biases in the estimation or error propagations are avoided. The method is evaluated qualitatively and quantitatively on real autoradiographic data. Rat brain autoradiographic volumes are reconstructed with registration errors less than 1 degree in rotation and less than 1 pixel in translation.

Algorithms↗
PubMed2004

Measurement of retinal vessel widths from fundus images based on 2-D modeling.

Changes in retinal vessel diameter are an important sign of diseases such as hypertension, arteriosclerosis and diabetes mellitus. Obtaining precise measurements of vascular widths is a critical and demanding process in automated retinal image analysis as the typical vessel is only a few pixels wide. This paper presents an algorithm to measure the vessel diameter to subpixel accuracy. The diameter measurement is based on a two-dimensional difference of Gaussian model, which is optimized to fit a two-dimensional intensity vessel segment. The performance of the method is evaluated against Brinchmann-Hansen's half height, Gregson's rectangular profile and Zhou's Gaussian model. Results from 100 sample profiles show that the presented algorithm is over 30% more precise than the compared techniques and is accurate to a third of a pixel.

Algorithms↗
PubMed2002

Inferring sub-cellular localization through automated lexical analysis.

MOTIVATION: The SWISS-PROT sequence database contains keywords of functional annotations for many proteins. In contrast, information about the sub-cellular localization is available for only a few proteins. Experts can often infer localization from keywords describing protein function. We developed LOCkey, a fully automated method for lexical analysis of SWISS-PROT keywords that assigns sub-cellular localization. With the rapid growth in sequence data, the biochemical characterisation of sequences has been falling behind. Our method may be a useful tool for supplementing functional information already automatically available. RESULTS: The method reached a level of more than 82% accuracy in a full cross-validation test. Due to a lack of functional annotations, we could infer localization for fewer than half of all proteins in SWISS-PROT. We applied LOCkey to annotate five entirely sequenced proteomes, namely Saccharomyces cerevisiae (yeast), Caenorhabditis elegans (worm), Drosophila melanogaster (fly), Arabidopsis thaliana (plant) and a subset of all human proteins. LOCkey found about 8000 new annotations of sub-cellular localization for these eukaryotes.

Abstracting and Indexing↗
PubMed2006

Detection of breast lesion regions in ultrasound images using wavelets and order statistics.

Accurate detection and segmentation of suspicious regions within the complex and irregular tissues of the breast, as depicted with ultrasonic B scans, typically require human analysis and decision making. Tissue characterization methods for classifying suspicious regions often depend on identifying and then accurately segmenting these regions. Motivated by an ultimate goal to automate this critical identification and segmentation step for tissue characterization problems, this work examines ultrasonic signal characteristics between various regions of breast tissue broadly classified as normal tissue and breast lesions. This paper introduces a nonparametric model based on order statistics (OS) estimated from multiresolution (MR) decompositions of energy-normalized subregions. Experimental results demonstrate the classification performance of the OS-based features extracted from the tumor and normal tissue regions in multiple scans from 84 patients, which resulted in a total of 204 tumor regions (from 43 malignant and 161 benign) and 816 normal tissue regions. Performance results indicate that OS-based features achieved an area under the receiver-operator characteristic curve of 91% in the discrimination between breast lesions and surrounding normal tissues.

Algorithms↗
PubMed2002

Support vector regression applied to the determination of the developmental age of a Drosophila embryo from its segmentation gene expression patterns.

MOTIVATION: In this paper we address the problem of the determination of developmental age of an embryo from its segmentation gene expression patterns in Drosophila. RESULTS: By applying support vector regression we have developed a fast method for automated staging of an embryo on the basis of its gene expression pattern. Support vector regression is a statistical method for creating regression functions of arbitrary type from a set of training data. The training set is composed of embryos for which the precise developmental age was determined by measuring the degree of membrane invagination. Testing the quality of regression on the training set showed good prediction accuracy. The optimal regression function was then used for the prediction of the gene expression based age of embryos in which the precise age has not been measured by membrane morphology. Moreover, we show that the same accuracy of prediction can be achieved when the dimensionality of the feature vector was reduced by applying factor analysis. The data reduction allowed us to avoid over-fitting and to increase the efficiency of the algorithm.

Aging↗
PubMed2003

Automatic registration of microarray images. II. Hexagonal grid.

MOTIVATION: In the first part of this paper the author presented an efficient, robust and completely automated algorithm for spot and block indexing in microarray images with rectangular grids. Although the rectangular grid is currently the most common type of grouping the probes on microarray slides, there is another microarray technology based on bundles of optical fibers where the probes are packed in hexagonal grids. The hexagonal grid provides both advantages and drawbacks over the standard rectangular packing and of course requires adaptation and/or modification of the algorithm of spot indexing presented in the first part of the paper. RESULTS: In the second part of the paper the author presents a version of the spot indexing algorithm adapted for microarray images with spots packed in hexagonal structures. The algorithm is completely automated, works with hexagonal grids of different types and with different parameters of grid spacing and rotation as well as spot sizes. It can successfully trace the local and global distortions of the grid, including non-orthogonal transformations. Similar to the algorithm from part I, it scales linearly with the grid size, the time complexity is O(M), where M is total number of grid points in hexagonal grid. The algorithm has been tested both on CCD and scanned images with spot expression rates as low as 2%. The processing time of an image with about 50 000 hex grid points was less than a second. For images with high expression rates ( approximately 90%) the registration time is even smaller, around a quarter of a second. SUPPLEMENTARY INFORMATION: http://fleece.ucsd.edu/~vit/Registration_Supplement.pdf

Algorithms↗
PubMed2002

Automated identification of single nucleotide polymorphisms from sequencing data.

Single nucleotide polymorphisms (SNPs) provide abundant information about genetic variation. Large scale discovery of high frequency SNPs is being undertaken using various methods. However, the publicly available SNP data are not always accurate, and therefore should be verified. If only a particular gene locus is concerned,locus-specific polymerase chain reaction amplification may be useful. Problem of this method is that the secondary peak has to be measured. We have analyzed trace data from conventional sequencing equipment and found an applicable rule to discern SNPs from noise. We have developed software that integrates this function to automatically identify SNPs. The software works accurately for high quality sequences and also can detect SNPs in low quality sequences. Further, it can determine allele frequency, display this information as a bar graph and assign corresponding nucleotide combinations. It is very useful for identifying de novo SNPs in a DNA fragment of interest.

Algorithms↗
PubMed2005

Automatic initialization algorithm for carotid artery segmentation in CTA images.

Analysis of CT datasets is commonly time consuming because of the required manual interaction. We present a novel and fast automatic initialization algorithm to detect the carotid arteries providing a fully automated approach of the segmentation and centerline detection. First, the volume of interest (VOI) is estimated using a shoulder landmark. The carotid arteries are subsequently detected in axial slices of the VOI by applying a circular Hough transform. To select carotid arteries related signals in the Hough space, a 3-D, direction dependent hierarchical clustering is used. To allow a successful detection for a wide range of vessel diameters, a feedback architecture was introduced. The algorithm was designed and optimized using a training set of 20 patients and subsequently evaluated using 31 test datasets. The detection algorithm, including VOI estimation, correctly detects 88% of the carotid arteries. Even though not all carotid arteries have been correctly detected, the results are very promising.

Algorithms↗
PubMed2004

Copasetic analysis: a framework for the blind analysis of microarray imagery.

From its conception, bioinformatics has been a multidisciplinary field which blends domain expert knowledge with new and existing processing techniques, all of which are focused on a common goal. Typically, these techniques have focused on the direct analysis of raw microarray image data. Unfortunately, this fails to utilise the image's full potential and in practice, this results in the lab technician having to guide the analysis algorithms. This paper presents a dynamic framework that aims to automate the process of microarray image analysis using a variety of techniques. An overview of the entire framework process is presented, the robustness of which is challenged throughout with a selection of real examples containing varying degrees of noise. The results show the potential of the proposed framework in its ability to determine slide layout accurately and perform analysis without prior structural knowledge. The algorithm achieves approximately, a 1 to 3 dB improved peak signal-to-noise ratio compared to conventional processing techniques like those implemented in GenePix when used by a trained operator. As far as the authors are aware, this is the first time such a comprehensive framework concept has been directly applied to the area of microarray image analysis.

Artificial Intelligence↗
PubMed2005

Automated Microarray Image Analysis Toolbox for MATLAB.

UNLABELLED: The Automated Microarray Image Analysis (AMIA) Toolbox for MATLAB is a flexible, open-source, microarray image analysis tool that allows the user to customize analyses of microarray image sets. This tool provides several methods to identify and quantify spot statistics, as well as extensive diagnostic statistics and images to evaluate data quality and array processing. The open, modular nature of AMIA provides access to implementation details and encourages modification and extension of AMIA's capabilities. AVAILABILITY: The AMIA Toolbox is freely available at http://www.pnl.gov/statistics/amia. The AMIA Toolbox requires MATLAB 6.5 (R13) (MathWorks, Inc. Natick, MA), as well as the Statistics Toolbox 4.1 and Image Processing Toolbox 4.1 for MATLAB or more recent versions. CONTACT: amanda.white@pnl.gov

Algorithms↗
PubMed2006

Segmentation of retinal blood vessels by combining the detection of centerlines and morphological reconstruction.

This paper presents an automated method for the segmentation of the vascular network in retinal images. The algorithm starts with the extraction of vessel centerlines, which are used as guidelines for the subsequent vessel filling phase. For this purpose, the outputs of four directional differential operators are processed in order to select connected sets of candidate points to be further classified as centerline pixels using vessel derived features. The final segmentation is obtained using an iterative region growing method that integrates the contents of several binary images resulting from vessel width dependent morphological filters. Our approach was tested on two publicly available databases and its results are compared with recently published methods. The results demonstrate that our algorithm outperforms other solutions and approximates the average accuracy of a human observer without a significant degradation of sensitivity and specificity.

Algorithms↗
PubMed2004

Measurement of mesothelioma on thoracic CT scans: a comparison of manual and computer-assisted techniques.

Our purpose in this study was to evaluate the variability of manual mesothelioma tumor thickness measurements in computed tomography (CT) scans and to assess the relative performance of six computerized measurement algorithms. The CT scans of 22 patients with malignant pleural mesothelioma were collected. In each scan, an initial observer identified up to three sites in each of three CT sections at which tumor thickness measurements were to be made. At each site, five observers manually measured tumor thickness through a computer interface. Three observers repeated these measurements during three separate sessions. Inter- and intra-observer variability in the manual measurement of tumor thickness was assessed. Six automated measurement algorithms were developed based on the geometric relationship between a specified measurement site and the automatically extracted lung regions. Computer-generated measurements were compared with manual measurements. The tumor thickness measurements of different observers were highly correlated (r > or = 0.99); however, the 95% limits of agreement for relative inter-observer difference spanned a range of 30%. Tumor thickness measurements generated by the computer algorithms also correlated highly with the average of observer measurements (r > or = 0.93). We have developed computerized techniques for the measurement of mesothelioma tumor thickness in CT scans. These techniques achieved varying levels of agreement with measurements made by human observers.

Adult↗
PubMed2005

Automated classification and analysis of the calcium response of single T lymphocytes using a neural network approach.

The gene activities in T lymphocytes that regulate immune responses are influenced by Ca2+ ([Ca2+]i). The intracellular calcium signals are highly heterogeneous and vitally important in determining the immune outcome. The signals in individual cells can be measured using fluorescence microscopy but to group the cells into classes with similar signal kinetics is currently laborious. Here, we demonstrate a method for the automated classification of the responses into four categories formerly identified by an expert's inspection. This method comprises characterising the response by a second-order model, performing frequency analysis, and using derived features as inputs to two multilayer perceptron neural networks (NNs). We compare the algorithm's performance on an example data set against the human classification: it was found to classify identically more than 70% of the data, despite small sample sizes in two categories and significant overlap between the other two classes. The group characterized by an oscillating signal showed the presence of a number of frequencies, which may be important in determining gene activation. A classification threshold enables the automatic identification of patterns with a low-classification certainty. Future refinement of the algorithm may allow the identification of more classes, which may be important in different immune responses associated with disease.

Algorithms↗
PubMed2005

Automated processing of shoeprint images based on the Fourier transform for use in forensic science.

The development of a system for automatically sorting a database of shoeprint images based on the outsole pattern in response to a reference shoeprint image is presented. The database images are sorted so that those from the same pattern group as the reference shoeprint are likely to be at the start of the list. A database of 476 complete shoeprint images belonging to 140 pattern groups was established with each group containing two or more examples. A panel of human observers performed the grouping of the images into pattern categories. Tests of the system using the database showed that the first-ranked database image belongs to the same pattern category as the reference image 65 percent of the time and that a correct match appears within the first 5 percent of the sorted images 87 percent of the time. The system has translational and rotational invariance so that the spatial positioning of the reference shoeprint images does not have to correspond with the spatial positioning of the shoeprint images of the database. The performance of the system for matching partial-prints was also determined.

Algorithms↗