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 505 records · Page 28Linked to original sources

Knowledge-driven automated extraction of the human cerebral ventricular system from MR images.

This work presents an efficient and automated method to extract the human cerebral ventricular system from MRI driven by anatomic knowledge. The ventricular system is divided into six three-dimensional regions; six ROIs are defined based on the anatomy and literature studies regarding variability of the cerebral ventricular system. The distribution histogram of radiological properties is calculated in each ROI, and the intensity thresholds for extracting each region are automatically determined. Intensity inhomogeneities are accounted for by adjusting intensity threshold to match local situation. The extracting method is based on region-growing and anatomical knowledge, and is designed to include all ventricular parts, even if they appear unconnected on the image. The ventricle extraction method was implemented on the Window platform using C++, and was validated qualitatively on 30 MRI studies with variable parameters.

Adolescent↗

Comparison of derivative preprocessing and automated polynomial baseline correction method for classification and quantification of narcotics in solid mixtures.

This work offers a real-world comparison of derivative preprocessing and a new polynomial method described by Lieber and Mahadevan-Jansen (LMJ) for baseline correction of Raman spectra with widely varying backgrounds. This comparison is based on their outcomes in factor analysis, analyte discrimination, and quantification. Both correction methods are applied to a Raman spectra data set taken from 85 solid samples of illegal narcotics diluted with various materials. It is found that neither approach outperforms the other, as they give similar principal component analysis (PCA) models and quantification errors: cocaine and heroin show cross-validation errors of approximately 8%, while MDMA is quantified to a cross-validation error of approximately 3-4%. The LMJ method does offer several other advantages, the most significant being the retention of original peak shapes after the correction, which simplifies the interpretation of the preprocessed spectra. The LMJ method is therefore recommended for use as a baseline correction method in future research with Raman spectroscopy.

Algorithms↗

Annotation, submission and screening of repetitive elements in Repbase: RepbaseSubmitter and Censor.

BACKGROUND: Repbase is a reference database of eukaryotic repetitive DNA, which includes prototypic sequences of repeats and basic information described in annotations. Updating and maintenance of the database requires specialized tools, which we have created and made available for use with Repbase, and which may be useful as a template for other curated databases. RESULTS: We describe the software tools RepbaseSubmitter and Censor, which are designed to facilitate updating and screening the content of Repbase. RepbaseSubmitter is a java-based interface for formatting and annotating Repbase entries. It eliminates many common formatting errors, and automates actions such as calculation of sequence lengths and composition, thus facilitating curation of Repbase sequences. In addition, it has several features for predicting protein coding regions in sequences; searching and including Pubmed references in Repbase entries; and searching the NCBI taxonomy database for correct inclusion of species information and taxonomic position. Censor is a tool to rapidly identify repetitive elements by comparison to known repeats. It uses WU-BLAST for speed and sensitivity, and can conduct DNA-DNA, DNA-protein, or translated DNA-translated DNA searches of genomic sequence. Defragmented output includes a map of repeats present in the query sequence, with the options to report masked query sequence(s), repeat sequences found in the query, and alignments. CONCLUSION: Censor and RepbaseSubmitter are available as both web-based services and downloadable versions. They can be found at http://www.girinst.org/repbase/submission.html (RepbaseSubmitter) and http://www.girinst.org/censor/index.php (Censor).

Animals↗

Camera-based calibration techniques for seamless multiprojector displays.

Multiprojector, large-scale displays are used in scientific visualization, virtual reality, and other visually intensive applications. In recent years, a number of camera-based computer vision techniques have been proposed to register the geometry and color of tiled projection-based display. These automated techniques use cameras to "calibrate" display geometry and photometry, computing per-projector corrective warps and intensity corrections that are necessary to produce seamless imagery across projector mosaics. These techniques replace the traditional labor-intensive manual alignment and maintenance steps, making such displays cost-effective, flexible, and accessible. In this paper, we present a survey of different camera-based geometric and photometric registration techniques reported in the literature to date. We discuss several techniques that have been proposed and demonstrated, each addressing particular display configurations and modes of operation. We overview each of these approaches and discuss their advantages and disadvantages. We examine techniques that address registration on both planar (video walls) and arbitrary display surfaces and photometric correction for different kinds of display surfaces. We conclude with a discussion of the remaining challenges and research opportunities for multiprojector displays.

Algorithms↗

Automated reassembly of file fragmented images using greedy algorithms.

The problem of restoring deleted files from a scattered set of fragments arises often in digital forensics. File fragmentation is a regular occurrence in hard disks, memory cards, and other storage media. As a result, a forensic analyst examining a disk may encounter many fragments of deleted digital files, but is unable to determine the proper sequence of fragments to rebuild the files. In this paper, we investigate the specific case where digital images are heavily fragmented and there is no file table information by which a forensic analyst can ascertain the correct fragment order to reconstruct each image. The image reassembly problem is formulated as a k-vertex disjoint graph problem and reassembly is then done by finding an optimal ordering of fragments. We provide techniques for comparing fragments and describe several algorithms for image reconstruction based on greedy heuristics. Finally, we provide experimental results showing that images can be reconstructed with high accuracy even when there are thousands of fragments and multiple images involved.

Algorithms↗

Automated microaneurysm detection using local contrast normalization and local vessel detection.

Screening programs using retinal photography for the detection of diabetic eye disease are being introduced in the UK and elsewhere. Automatic grading of the images is being considered by health boards so that the human grading task is reduced. Microaneurysms (MAs) are the earliest sign of this disease and so are very important for classifying whether images show signs of retinopathy. This paper describes automatic methods for MA detection and shows how image contrast normalization can improve the ability to distinguish between MAs and other dots that occur on the retina. Various methods for contrast normalization are compared. Best results were obtained with a method that uses the watershed transform to derive a region that contains no vessels or other lesions. Dots within vessels are handled successfully using a local vessel detection technique. Results are presented for detection of individual MAs and for detection of images containing MAs. Images containing MAs are detected with sensitivity 85.4% and specificity 83.1%.

Algorithms↗

Automated video analysis of age-related motor deficits in monkeys using EthoVision.

Previous studies comparing age-related changes in locomotor function in nonhuman primates have generally relied on subjective human observations or rudimentary infrared motion sensors. Here, we used the automated video-tracking system EthoVision to objectively quantify locomotor activity in 6 young, 6 middle-aged and 12 aged female rhesus monkeys. The video records were analyzed for distance traveled, movement speed and vertical activity. Our results showed that the young monkeys (4.9 +/- 0.1 years old) traveled twice the distance and moved 48% faster than the middle-aged monkeys (15.7 +/- 0.5 years old), and traveled thrice the distance and moved 67% faster than the aged monkeys (26.3 +/- 0.9 years old). In addition, young monkeys were vertically more active (20/60 min) than both the middle-aged (7/60 min) and the aged (1/60 min) monkeys. Furthermore, the locomotor performance of the individual animals significantly correlated with increasing age for all three measures. We conclude that EthoVision is a reliable and objective tracking method for detecting age-related differences in locomotor movements in rhesus macaques, and possibly in humans.

Aging↗

Optic nerve head segmentation.

Reliable and efficient optic disk localization and segmentation are important tasks in automated retinal screening. General-purpose edge detection algorithms often fail to segment the optic disk due to fuzzy boundaries, inconsistent image contrast or missing edge features. This paper presents an algorithm for the localization and segmentation of the optic nerve head boundary in low-resolution images (about 20 microns/pixel). Optic disk localization is achieved using specialized template matching, and segmentation by a deformable contour model. The latter uses a global elliptical model and a local deformable model with variable edge-strength dependent stiffness. The algorithm is evaluated against a randomly selected database of 100 images from a diabetic screening programme. Ten images were classified as unusable; the others were of variable quality. The localization algorithm succeeded on all bar one usable image; the contour estimation algorithm was qualitatively assessed by an ophthalmologist as having Excellent-Fair performance in 83% of cases, and performs well even on blurred images.

Algorithms↗

Ontology-based structured cosine similarity in document summarization: with applications to mobile audio-based knowledge management.

Development of algorithms for automated text categorization in massive text document sets is an important research area of data mining and knowledge discovery. Most of the text-clustering methods were grounded in the term-based measurement of distance or similarity, ignoring the structure of the documents. In this paper, we present a novel method named structured cosine similarity (SCS) that furnishes document clustering with a new way of modeling on document summarization, considering the structure of the documents so as to improve the performance of document clustering in terms of quality, stability, and efficiency. This study was motivated by the problem of clustering speech documents (of no rich document features) attained from the wireless experience oral sharing conducted by mobile workforce of enterprises, fulfilling audio-based knowledge management. In other words, this problem aims to facilitate knowledge acquisition and sharing by speech. The evaluations also show fairly promising results on our method of structured cosine similarity.

Algorithms↗

An automated data extraction system from 12 lead ECG images.

A software based normalized ECG data acquisition system is developed for both normal and abnormal ECG records. This system can transfer wave data recorded on paper to the digital time database. A flatbed scanner is used to form an image database of each 12 lead ECG signal. These TIF formatted gray tone images are then converted into two tone binary images with the help of histogram analysis. Smearing runlength technique is used to remove the vertical and horizontal line segments of graphical papers. Thinning algorithm is applied to each image to obtain the skeleton (1 pixel representation) of each image, which is essential to avoid excess data points in the database. After extracting pixel to pixel co-ordinate information of images of each of the signal of 12 lead ECG records, the data are sorted to regenerate the signal. From standard deviation of the database a graphical analysis is performed to examine the consistency of our database.

Adult↗

Feature selection and nearest centroid classification for protein mass spectrometry.

BACKGROUND: The use of mass spectrometry as a proteomics tool is poised to revolutionize early disease diagnosis and biomarker identification. Unfortunately, before standard supervised classification algorithms can be employed, the "curse of dimensionality" needs to be solved. Due to the sheer amount of information contained within the mass spectra, most standard machine learning techniques cannot be directly applied. Instead, feature selection techniques are used to first reduce the dimensionality of the input space and thus enable the subsequent use of classification algorithms. This paper examines feature selection techniques for proteomic mass spectrometry. RESULTS: This study examines the performance of the nearest centroid classifier coupled with the following feature selection algorithms. Student-t test, Kolmogorov-Smirnov test, and the P-test are univariate statistics used for filter-based feature ranking. From the wrapper approaches we tested sequential forward selection and a modified version of sequential backward selection. Embedded approaches included shrunken nearest centroid and a novel version of boosting based feature selection we developed. In addition, we tested several dimensionality reduction approaches, namely principal component analysis and principal component analysis coupled with linear discriminant analysis. To fairly assess each algorithm, evaluation was done using stratified cross validation with an internal leave-one-out cross-validation loop for automated feature selection. Comprehensive experiments, conducted on five popular cancer data sets, revealed that the less advocated sequential forward selection and boosted feature selection algorithms produce the most consistent results across all data sets. In contrast, the state-of-the-art performance reported on isolated data sets for several of the studied algorithms, does not hold across all data sets. CONCLUSION: This study tested a number of popular feature selection methods using the nearest centroid classifier and found that several reportedly state-of-the-art algorithms in fact perform rather poorly when tested via stratified cross-validation. The revealed inconsistencies provide clear evidence that algorithm evaluation should be performed on several data sets using a consistent (i.e., non-randomized, stratified) cross-validation procedure in order for the conclusions to be statistically sound.

Algorithms↗

Automatic wheeze detection based on auditory modelling.

Automatic wheeze detection has several potential benefits compared with reliance on human auscultation: it is experience independent, an automated historical record can easily be kept, and it allows quantification of wheeze severity. Previous attempts to detect wheezes automatically have had partial success but have not been reliable enough to become widely accepted as a useful tool. In this paper an improved algorithm for automatic wheeze detection based on auditory modelling is developed, called the frequency- and duration-dependent threshold algorithm. The mean frequency and duration of each wheeze component are obtained automatically. The detected wheezes are marked on a spectrogram. In the new algorithm, the concept of a frequency- and duration-dependent threshold for wheeze detection is introduced. Another departure from previous work is that the threshold is based not on global power but on power corresponding to a particular frequency range. The algorithm has been tested on 36 subjects, 11 of whom exhibited characteristics of wheeze. The results show a marked improvement in the accuracy of wheeze detection when compared with previous algorithms.

Algorithms↗

Intensity non-uniformity correction in MRI: existing methods and their validation.

Magnetic resonance imaging is a popular and powerful non-invasive imaging technique. Automated analysis has become mandatory to efficiently cope with the large amount of data generated using this modality. However, several artifacts, such as intensity non-uniformity, can degrade the quality of acquired data. Intensity non-uniformity consists in anatomically irrelevant intensity variation throughout data. It can be induced by the choice of the radio-frequency coil, the acquisition pulse sequence and by the nature and geometry of the sample itself. Numerous methods have been proposed to correct this artifact. In this paper, we propose an overview of existing methods. We first sort them according to their location in the acquisition/processing pipeline. Sorting is then refined based on the assumptions those methods rely on. Next, we present the validation protocols used to evaluate these different correction schemes both from a qualitative and a quantitative point of view. Finally, availability and usability of the presented methods is discussed.

Algorithms↗

Automated 3-D reconstruction of the surface of live early-stage amphibian embryos.

Although three-dimensional (3-D) reconstructions of the surfaces of live embyos are vital to understanding embryo development, morphogenetic tissue movements and other factors have prevented the automation of this task. Here, we report an integrated set of software algorithms that overcome these challenges, making it possible to completely automate the reconstruction of embryo surfaces and other textured surfaces from multiview images. The process involves: 1) building accurate point correspondences using a robust deformable template block matching algorithm; 2) removing outliers using fundamental matrix calculations in conjunction with a RANSAC algorithm; 3) generating 3-D point clouds using a bundle adjustment algorithm that includes camera position and distortion corrections; 4) meshing the point clouds into triangulated surfaces using a Tight Cocone algorithm that produces water tight models; 5) refining surfaces using midpoint insertion and Laplacian smoothing algorithms; and 6) repeating these steps until a measure of convergence G, the rms difference between successive reconstructions, is below a specified threshold. Reconstructions were made of 2.2-mm diameter, neurulation-stage axolotl (amphibian) embryos using 44 multiview images collected with a robotic microscope. A typical final model (sixth iteration) contained 3787 points and 7562 triangles and had an error measure of G = 5.9 microm.

Algorithms↗

Automated processing of the single-lead electrocardiogram for the detection of obstructive sleep apnoea.

A method for the automatic processing of the electrocardiogram (ECG) for the detection of obstructive apnoea is presented. The method screens nighttime single-lead ECG recordings for the presence of major sleep apnoea and provides a minute-by-minute analysis of disordered breathing. A large independently validated database of 70 ECG recordings acquired from normal subjects and subjects with obstructive and mixed sleep apnoea, each of approximately eight hours in duration, was used throughout the study. Thirty-five of these recordings were used for training and 35 retained for independent testing. A wide variety of features based on heartbeat intervals and an ECG-derived respiratory signal were considered. Classifiers based on linear and quadratic discriminants were compared. Feature selection and regularization of classifier parameters were used to optimize classifier performance. Results show that the normal recordings could be separated from the apnoea recordings with a 100% success rate and a minute-by-minute classification accuracy of over 90% is achievable.

Adult↗

Automatic segmentation of thalamus from brain MRI integrating fuzzy clustering and dynamic contours.

Thalamus is an important neuro-anatomic structure in the brain. In this paper, an automated method is presented to segment thalamus from magnetic resonance images (MRI). The method is based on a discrete dynamic contour model that consists of vertices and edges connecting adjacent vertices. The model starts from an initial contour and deforms by external and internal forces. Internal forces are calculated from local geometry of the model and external forces are estimated from desired image features such as edges. However, thalamus has low contrast and discontinues edges on MRI, making external force estimation a challenge. The problem is solved using a new algorithm based on fuzzy C-means (FCM) unsupervised clustering, Prewitt edge-finding filter, and morphological operators. In addition, manual definition of the initial contour for the model makes the final segmentation operator-dependent. To eliminate this dependency, new methods are developed for generating the initial contour automatically. The proposed approaches are evaluated and validated by comparing automatic and radiologist's segmentation results and illustrating their agreement.

Algorithms↗

Automated semantic analysis of changes in image sequences of neurons in culture.

Quantitative studies of dynamic behaviors of live neurons are currently limited by the slowness, subjectivity, and tedium of manual analysis of changes in time-lapse image sequences. Challenges to automation include the complexity of the changes of interest, the presence of obfuscating and uninteresting changes due to illumination variations and other imaging artifacts, and the sheer volume of recorded data. This paper describes a highly automated approach that not only detects the interesting changes selectively, but also generates quantitative analyses at multiple levels of detail. Detailed quantitative neuronal morphometry is generated for each frame. Frame-to-frame neuronal changes are measured and labeled as growth, shrinkage, merging, or splitting, as would be done by a human expert. Finally, events unfolding over longer durations, such as apoptosis and axonal specification, are automatically inferred from the short-term changes. The proposed method is based on a Bayesian model selection criterion that leverages a set of short-term neurite change models and takes into account additional evidence provided by an illumination-insensitive change mask. An automated neuron tracing algorithm is used to identify the objects of interest in each frame. A novel curve distance measure and weighted bipartite graph matching are used to compare and associate neurites in successive frames. A separate set of multi-image change models drives the identification of longer term events. The method achieved frame-to-frame change labeling accuracies ranging from 85% to 100% when tested on 8 representative recordings performed under varied imaging and culturing conditions, and successfully detected all higher order events of interest. Two sequences were used for training the models and tuning their parameters; the learned parameter settings can be applied to hundreds of similar image sequences, provided imaging and culturing conditions are similar to the training set. The proposed approach is a substantial innovation over manual annotation and change analysis, accomplishing in minutes what it would take an expert hours to complete.

Algorithms↗

Quantitative evaluation of left ventricle performance from two dimensional echo images.

OBJECTIVES: We sought to quantify the left ventricle systolic dysfunction by a geometric index from two-dimensional (2D) echocardiography by implementing an automated fuzzy logic edge detection algorithm for the segmentation. BACKGROUND: The coronary injuries have repercussions on the left ventricle producing changes on wall contractility, the shape of the cavity, and as a whole changes on the ventricular function. METHODS: 2D echocardiogram and M-mode recordings were performed over the control group and those with the dysfunctions. From 2D recordings, individual frames were extracted for at least five cardiac cycles and then segmentation of left ventricle was done by automated fuzzy systems. In each frame, the volumes are measured and a geometric index, eccentricity ratio (ER), was derived. The endocardial fractional shortening (FS), midwall fractional shortening (mFS), and the relative wall thickness (RWT) were also measured in each case. RESULTS: Depressed value of endocardial FS (20.39 +/- 5.43 vs 34.28 +/- 9.36, P = 0.0046), mFS (33 +/- 8.3 vs 52.5 +/- 11.7, P = 0.0047), and the RWT (0.337 +/- 0.096 vs 0.525 +/- 0.119, P = 0.0002) was observed with dysfunction. ER measured at end-diastole (2.86 +/- 0.703 vs 4.14 +/- 0.38) and end-systole (3.14 +/- 0.79 vs 5.48 +/- 0.74) was found to be decreased in the dysfunction group and more significant at the end-systole (P = 0.00017 vs 6.6E-06). CONCLUSION: This work concludes that the regional and global left ventricle systolic dysfunction can be assessed by the ER measured at end-diastole and end-systole from 2D echocardiogram and may contribute to the high rate of cardiovascular disorders.

Adult↗