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 415 records · Page 23Linked to original sources

Using statistical and knowledge-based approaches for literature-based discovery.

The explosive growth in biomedical literature has made it difficult for researchers to keep up with advancements, even in their own narrow specializations. While researchers formulate new hypotheses to test, it is very important for them to identify connections to their work from other parts of the literature. However, the current volume of information has become a great barrier for this task and new automated tools are needed to help researchers identify new knowledge that bridges gaps across distinct sections of the literature. In this paper, we present a literature-based discovery system called LitLinker that incorporates knowledge-based methodologies with a statistical method to mine the biomedical literature for new, potentially causal connections between biomedical terms. We demonstrate LitLinker's ability to capture novel and interesting connections between diseases and chemicals, drugs, genes, or molecular sequences from the published biomedical literature. We also evaluate LitLinker's performance by using the information retrieval metrics of precision and recall.

Abstracting and Indexing↗

Automated seed placement for colon segmentation in computed tomography colonography.

RATIONALE AND OBJECTIVE: To present an algorithm to automatically locate seeds for colon segmentation in computed tomography colonography (CTC). MATERIALS AND METHODS: The algorithm automatically locates two points (seeds) inside the colon lumen. Because of their high distention and fixed anatomic position, we focus on the cecum and rectum for automatic seed placement. We use two-dimensional morphological operators that find pockets of colonic air of sufficient size. For the rectum, we search within an inferiorly and centrally located CT slice. For the cecum, we search in a group of CT slices in the middle of the scanned volume on the patient's right side. We applied our automated algorithm to segment the colon in 292 consecutive cases of CTC (146 prone, 146 supine). RESULTS: After automated seed placement, 83.2% (243 of 292) of the colons were segmented completely and 9.6% (28 of 292) were segmented partially. The unsegmented colon parts were present in datasets where the colon was collapsed in more than one place or because seeds could not be placed in regions filled with fluid. In the remaining 7.2% (21 of 292) of cases, the automatic segmentation leaked outside the colon because of a limitation of the contrast-enhanced fluid detection algorithm. CONCLUSION: Fully automatic seed placement for colonic segmentation is feasible in the majority of cases without seeding of undesired extracolonic air.

Adult↗

Automated classification of alternative splicing and transcriptional initiation and construction of visual database of classified patterns.

MOTIVATION: Large-scale detection and classification of alternative splicing and transcriptional initiation (ASTI) is the first step towards detailed studies of the functional implication and mechanisms of these phenomena. RESULTS: We have developed an algorithm that classifies all observed units of ASTI into an extendable set of distinct types (e.g. cassette type) by converting a collection of alignments between a genomic DNA sequence and cDNA sequences into binary description. This description system can uniquely and compactly encode not only typical patterns but also any rare patterns that are usually collectively assigned to 'others.' More than 150 distinct ASTI types were found when this system was applied to genome-wide detection of ASTI units in human and five other eukaryotes. AVAILABILITY: The data detected by this system are available through ASTRA (http://alterna.cbrc.jp/), a database equipped with a Java-based browser that can interactively reorganize the order of displayed splicing patterns on demand.

Algorithms↗

Automated interpretation of mass spectra of complex mixtures by matching of isotope peak distributions.

Mass spectrometry is now firmly established as a powerful technique for the identification and characterization of proteins when used in conjunction with sequence databases. Various approaches involving stable-isotope labeling have been developed for quantitative comparisons between paired samples in proteomic expression analysis by mass spectrometry. However, interpretation of such mass spectra is far from being fully automated, mainly due to the difficulty of analyzing complex patterns resulting from the overlap of multiple peaks arising from the assortment of natural isotopes. In order to facilitate the interpretation of a complex mass spectrum of such a mixture, such as an MS spectrum of a stable-isotope-enriched ion species, we report on the development of a software application, 'Matching' (web accessible), that enables the automatic matching of theoretical isotope envelopes to multiple ion peaks in a raw spectrum. It is particularly useful for resolving the relative abundances of narrow-split paired peaks caused by enrichment with a stable isotope, such as 18O, 13C, 2H, or 15N.

Algorithms↗

An automatic block and spot indexing with k-nearest neighbors graph for microarray image analysis.

MOTIVATION: In this paper, we propose a fully automatic block and spot indexing algorithm for microarray image analysis. A microarray is a device which enables a parallel experiment of ten to hundreds of thousands of test genes in order to measure gene expression. Due to this huge size of experimental data, automated image analysis is gaining importance in microarray image processing systems. Currently, most of the automated microarray image processing systems require manual block indexing and, in some cases, spot indexing. If the microarray image is large and contains a lot of noise, it is very troublesome work. In this paper, we show it is possible to locate the addresses of blocks and spots by applying the Nearest Neighbors Graph Model. Also, we propose an analytic model for the feasibility of block addressing. Our analytic model is validated by a large body of experimental results. RESULTS: We demonstrate the features of automatic block detection, automatic spot addressing, and correction of the distortion and skewedness of each microarray image.

Algorithms↗

Self-organizing and self-correcting classifications of biological data.

MOTIVATION: Rapid, automated means of organizing biological data are required if we hope to keep abreast of the flood of data emanating from sequencing, microarray and similar high-throughput analyses. Faced with the need to validate the annotation of thousands of sequences and to generate biologically meaningful classifications based on the sequence data, we turned to statistical methods in order to automate these processes. RESULTS: An algorithm for automated classification based on evolutionary distance data was written in S. The algorithm was tested on a dataset of 1436 small subunit ribosomal RNA sequences and was able to classify the sequences according to an extant scheme, use statistical measurements of group membership to detect sequences that were misclassified within this scheme and produce a new classification. In this study, the use of the algorithm to address problems in prokaryotic taxonomy is discussed. AVAILABILITY: S-Plus is available from Insightful, Inc. An S-Plus implementation of the algorithm and the associated data are available at http://taxoweb.mmg.msu.edu/datasets

Algorithms↗

Dynamic three-dimensional echocardiography combined with semi-automated border detection offers advantages for assessment of resynchronization therapy.

Simultaneous electrical stimulation of both ventricles in patients with interventricular conduction disturbance and advanced heart failure improves hemodynamics and results in increased exercise tolerance, quality of life. We have developed a novel technique for the assessment and optimization of resynchronization therapy. Our approach is based on transthoracic dynamic three-dimensional (3D) echocardiography and allows determination of the most delayed contraction site of the left ventricle (LV) together with global LV function data. Our initial results suggest that fast reconstruction of the LV is feasible for the selection of the optimal pacing site and allows identifying LV segments with dyssynchrony.

Arrhythmias, Cardiac↗

Real time in situ microscopy for animal cell-concentration monitoring during high density culture in bioreactor.

An in situ microscope (ISM) device is utilised in this study to monitor hybridoma cells concentration in a stirred bioreactor. It generates images by using pulsed illumination of the liquid broth synchronised with the camera frame generation to avoid blur from the cell's motion. An appropriate image processing isolates the sharp objects from the blurred ones that are far from the focal plane. As image processing involves several parameters, this paper focuses on the robustness of the results of the cells counting. This stage determines the applicability of the measuring device and has seldom been tackled in the presentations of ISM devices. Calibration is secondly performed for assessing the cell-concentration from the cell automated numeration provided by the ISM. Flow cytometry and hemacytometer chamber were used as reference analytical methods. These measures and the output of the image processing allow estimating a single calibration parameter: the reference volume per image equal to 1.08 x 10(-6) mL. In these conditions, the correlation coefficient between both reference and ISM data sets becomes equal to 0.99. A saturation of this system during an ultrasonic wave perfusion phase that deeply changes the culture conditions is observed and discussed. Principal component analysis (PCA) is used to undergo the robustness study and the ISM calibration step.

Algorithms↗

SwarmPS: rapid, semi-automated single particle selection software.

Single particle analysis (SPA) coupled with high-resolution electron cryo-microscopy is emerging as a powerful technique for the structure determination of membrane protein complexes and soluble macromolecular assemblies. Current estimates suggest that approximately 10(4)-10(5) particle projections are required to attain a 3A resolution 3D reconstruction (symmetry dependent). Selecting this number of molecular projections differing in size, shape and symmetry is a rate-limiting step for the automation of 3D image reconstruction. Here, we present Swarm(PS), a feature rich GUI based software package to manage large scale, semi-automated particle picking projects. The software provides cross-correlation and edge-detection algorithms. Algorithm-specific parameters are transparently and automatically determined through user interaction with the image, rather than by trial and error. Other features include multiple image handling (approximately 10(2)), local and global particle selection options, interactive image freezing, automatic particle centering, and full manual override to correct false positives and negatives. Swarm(PS) is user friendly, flexible, extensible, fast, and capable of exporting boxed out projection images, or particle coordinates, compatible with downstream image processing suites.

Algorithms↗

Segmentation and 3D reconstruction of biological cells from serial slice images.

Our understanding of the world around us and the many objects that we encounter is based primarily on three-dimensional information. It is simply part of the environment in which we live and the intuitive nature of our interpretation of our surroundings. In the arena of biomedical imaging, the image information most often collected is in the form of two-dimensional images. In cases where serial slice information is obtained, such as MRI images, it is still difficult for the observer to mentally build and understand the three-dimensional structure of the object. Although most image rendering software packages allow for 3D views of the serial sections, they lack the ability to segment, or isolated different objects in the data set. Typically the task of segmentation is performed by knowledgeable persons who tediously outline or label the object of interest in each image slice containing the object [1,2]. It remains a difficult challenge to train a computer to understand an image and aid in this process of segmentation. This article reports of on-going work in developing a semi-automated segmentation technique. The approach uses a Leica Confocal Laser Scanning Microscope (CLSM) to collect serial slice images, image rendering and manipulating software called IMOD (Boulder Colorado), and Matlab (The Mathworks Inc.) image processing tools for development of the object segmentation routines. The initial objects are simple fluorescent microspheres (Molecular Probes), which are easily imaged and segmented. The second objects are rat enteric neurons, which provide medium complexity in shape and size. Finally, the work will be applied to the biological cells of the household .y, Musca domestica, to further understand how its vision system operates.

Algorithms↗

Automated ordering of fingerprinted clones.

MOTIVATION: A considerable amount of human intervention is currently required to produce high-quality fingerprint-based physical maps for genomic studies. RESULTS: An algorithm has been developed and implemented to automatically order fingerprinted clones within contigs. The resulting software, named CORAL (Clone ORdering ALgorithm), has been tested on maps that have previously been manually edited and on maps derived from in silico simulations. The fingerprint map and DNA sequence of the human genome has provided an additional test to CORAL. Measurements suggest that CORAL performs significantly better than the software currently used by most laboratories to order fingerprinted clones at throughputs far exceeding those that can be achieved manually.

Algorithms↗

TULIPS: the Uppsala-Linkoping Image Processing System.

The Uppsala-Linkoping Image Processing System, TULIPS, is described. TULIPS, a hardware-software system designed for cell image processing, was developed at Uppsala University Hospital in cooperation with the Department of Electrical Engineering at Linkoping University. The hardware part of the image processing system is built around a high-speed data bus with a capacity of about 40 M byte/sec connected to a PDP-11/55 host computer. An image memory, an LSI-11 microcomputer and a video interface for displaying the image memory content on a TV monitor are also connected to the high-speed bus. An automated microscope and a "Poulsen processor" for low resolution segmentation, both to be attached to the high-speed bus, are being developed. A monitor and an interpreter for an image processing language have been implemented on the host computer. This software system allows interactive, as well as batch, processing. The degree of user interaction is easily adapted to the user's needs. The image processing language is command oriented, and it is easily expanded by adding new commands. The system has been used both for studies in the field of quantitative microscopy and as a platform for development and testing of new image processing algorithms.

Computers↗

Feature-based, automated segmentation of cerebral infarct patterns using T2- and diffusion-weighted imaging.

Diffusion-weighted imaging enables the diagnosis of cerebral ischemias very early, thus supporting therapies such as thrombolysis. However, morphology and tissue-characterizing parameters (e.g. relaxation times or water diffusion) may vary strongly in ischemic regions, indicating different underlying pathologic processes. As the determination of the parameters by a supervised segmentation is very time consuming, we evaluated whether different infarct patterns may be segmented by an automated, multidimensional feature-based method using a unified segmentation procedure. Ischemias were classified into 5 characteristic patterns. For each class, a 3D histogram based on T(2)- and diffusion-weighted images as well as calculated apparent diffusion coefficients (ADC) was generated from a representative data set. Healthy and pathologic tissue classes were segmented in the histogram as separate, local density maxima with freely shaped borders. Segmentation control parameters were optimized in a 3-step procedure. The method was evaluated using synthetic images as well as results of a supervised segmentation. For the analysis of cerebral ischemias, the optimal control parameter set led to sensitivities and specificities between 1.0 and 0.9.

Algorithms↗

Multivariate statistical model for 3D image segmentation with application to medical images.

In this article we describe a statistical model that was developed to segment brain magnetic resonance images. The statistical segmentation algorithm was applied after a pre-processing stage involving the use of a 3D anisotropic filter along with histogram equalization techniques. The segmentation algorithm makes use of prior knowledge and a probability-based multivariate model designed to semi-automate the process of segmentation. The algorithm was applied to images obtained from the Center for Morphometric Analysis at Massachusetts General Hospital as part of the Internet Brain Segmentation Repository (IBSR). The developed algorithm showed improved accuracy over the k-means, adaptive Maximum Apriori Probability (MAP), biased MAP, and other algorithms. Experimental results showing the segmentation and the results of comparisons with other algorithms are provided. Results are based on an overlap criterion against expertly segmented images from the IBSR. The algorithm produced average results of approximately 80% overlap with the expertly segmented images (compared with 85% for manual segmentation and 55% for other algorithms).

Algorithms↗

PDQ Wizard: automated prioritization and characterization of gene and protein lists using biomedical literature.

SUMMARY: PDQ Wizard automates the process of interrogating biomedical references using large lists of genes, proteins or free text. Using the principle of linkage through co-citation biologists can mine PubMed with these proteins or genes to identify relationships within a biological field of interest. In addition, PDQ Wizard provides novel features to define more specific relationships, highlight key publications describing those activities and relationships, and enhance protein queries. PDQ Wizard also outputs a metric that can be used for prioritization of genes and proteins for further research. AVAILABILITY: PDQ Wizard is freely available from http://www.gti.ed.ac.uk/pdqwizard/.

Abstracting and Indexing↗

Automatic registration of multiple skin lesions by use of point pattern matching.

Computerized comparison of serial skin images is a potentially valuable tool for melanoma screening. In automating this process, matching or "registering" each lesion in a pair of images plays an important role in looking for clinically significant change. We have investigated three practical techniques--a point pattern correlation, a 2-point geometrical transformation, and a 3-point geometrical transformation--for their effectiveness in matching and identifying lesions in pairs of skin images. These techniques view the spots in each image as a point pattern to be matched from image to image. Each of these methods is shown to be quite effective as long as one or more known initial match points can be provided. Experiments performed by imaging actual patients under realistic conditions indicate that the 3-point transformation algorithm performs the best overall, achieving an average matching accuracy of 97%. The nature of these algorithms, their relative performance under a range of conditions, and possible methods for improving accuracies are discussed.

Algorithms↗

Automated protocol for evaluation of electromagnetic component separation (APECS): Application of a framework for evaluating statistical methods of blink extraction from multichannel EEG.

OBJECTIVE: We present APECS (Automated Protocol for Evaluation of Electromagnetic Component Separation), a framework for evaluating the accuracy of blind source separation algorithms in removing artifacts from EEG data. APECS applies multiple, automated procedures to quantify the extent to which blinks are removed, and the degree to which nonocular activity is left intact. METHODS: APECS was used to evaluate blink removal using three BSS algorithms: Second-Order Blind Inference (SOBI) and two Independent Component Analysis (ICA) implementations, FastICA and Infomax. The algorithms were applied to a series of blink-free EEG datasets, which were contaminated with real or simulated blinks. Extracted components were assumed to contain blink activity if correlation of their spatial projectors to a predefined blink template exceeded some threshold, and if polarity inverted above and below the eyes. Blink-related components were then subtracted to produce filtered data. The success of each data decomposition is evaluated through the use of multiple, automated metrics, to determine which decomposition best approximates the ideal solution (complete separation of blink from nonblink activity). RESULTS: The outcomes for the evaluation measures were generally congruent, but also provided different and complementary information about the quality of each data decomposition. Under our testing framework, Infomax outperformed both FastICA and SOBI. Best results were achieved when blink activity loaded onto a single component. CONCLUSIONS: Multiple metrics, both quantitative and qualitative, are important in evaluating algorithms for artifact extraction. SIGNIFICANCE: Failure to achieve complete separation of blink from nonblink activity can affect experimental outcomes, as illustrated here, using an ERP study of word-nonword discrimination. This illustrates the importance of methods for evaluation of artifact extraction results.

Algorithms↗

Tracking of left ventricular long axis from real-time three-dimensional echocardiography using optical flow techniques.

Two-dimensional echocardiography (2DE) is routinely used in clinical practice to measure left ventricular (LV) mass, dimensions, and function. The reliability of these measurements is highly dependent on the ability to obtain nonforeshortened long axis (LA) images of the left ventricle from transthoracic apical acoustic windows. Real time three-dimensional echocardiography (RT3DE) is a novel imaging technique that allows the acquisition of dynamic pyramidal data structures encompassing the entire ventricle and could potentially overcome the effects of LA foreshortening. Accordingly, the aim of this paper was to develop a nearly automated method based on optical flow techniques for the measurement of the left ventricular (LV) LA throughout the cardiac cycle from RT3DE data. The LV LA measurements obtained with the automated technique has been compared with LA measurements derived from manual selection of the LA from a volumetric display of RT3DE data. High correlation (r = .99, SEE = 1.8%, y = .94x + 5.3), no significant bias (-0.18 mm), and narrow limits of agreement (SD: 1.91 mm) were found. The comparison between the LA length derived from 2DE and RT3DE data showed significant underestimation of the 2DE based measurements. In conclusion, this study proves that RT3DE data overcome the effects of foreshortening and indicates that the method we propose allows fast and accurate quantification of LA length throughout the cardiac cycle.

Algorithms↗