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 595 records · Page 33Linked to original sources

Learning the topological properties of brain tumors.

This work presents a graph-based representation (a.k.a., cell-graph) of histopathological images for automated cancer diagnosis by probabilistically assigning a link between a pair of cells (or cell clusters). Since the node set of a cell-graph can include a cluster of cells as well as individual ones, it enables working with low-cost, low-magnification photomicrographs. The contributions of this work are twofold. First, it is shown that without establishing a pairwise spatial relation between the cells (i.e., the edges of a cell-graph), neither the spatial distribution of the cells nor the texture analysis of the images yields accurate results for tissue level diagnosis of brain cancer called malignant glioma. Second, this work defines a set of global metrics by processing the entire cell-graph to capture tissue level information coded into the histopathological images. In this work, the results are obtained on the photomicrographs of 646 archival brain biopsy samples of 60 different patients. It is shown that the global metrics of cell-graphs distinguish cancerous tissues from noncancerous ones with high accuracy (at least 99 percent accuracy for healthy tissues with lower cellular density level, and at least 92 percent accuracy for benign tissues with similar high cellular density level such as nonneoplastic reactive/inflammatory conditions).

Algorithms↗

Automatic detection of red lesions in digital color fundus photographs.

The robust detection of red lesions in digital color fundus photographs is a critical step in the development of automated screening systems for diabetic retinopathy. In this paper, a novel red lesion detection method is presented based on a hybrid approach, combining prior works by Spencer et al. (1996) and Frame et al. (1998) with two important new contributions. The first contribution is a new red lesion candidate detection system based on pixel classification. Using this technique, vasculature and red lesions are separated from the background of the image. After removal of the connected vasculature the remaining objects are considered possible red lesions. Second, an extensive number of new features are added to those proposed by Spencer-Frame. The detected candidate objects are classified using all features and a k-nearest neighbor classifier. An extensive evaluation was performed on a test set composed of images representative of those normally found in a screening set. When determining whether an image contains red lesions the system achieves a sensitivity of 100% at a specificity of 87%. The method is compared with several different automatic systems and is shown to outperform them all. Performance is close to that of a human expert examining the images for the presence of red lesions.

Algorithms↗

Image processing for IMRT QA dosimetry.

We have automated the determination of the placement location of the dosimetry ion chamber within intensity-modulated radiotherapy (IMRT) fields, as part of streamlining the entire IMRT quality assurance process. This paper describes the mathematical image-processing techniques to arrive at the appropriate measurement locations within the planar dose maps of the IMRT fields. A specific spot within the found region is identified based on its flatness, radiation magnitude, location, area, and the avoidance of the interleaf spaces. The techniques used include applying a Laplacian, dilation, erosion, region identification, and measurement point selection based on three parameters: the size of the erosion operator, the gradient, and the importance of the area of a region versus its magnitude. These three parameters are adjustable by the user. However, the first one requires tweaking in extremely rare occasions, the gradient requires rare adjustments, and the last parameter needs occasional fine-tuning. This algorithm has been tested in over 50 cases. In about 5% of cases, the algorithm does not find a measurement point due to the extremely steep and narrow regions within the fluence maps. In such cases, manual selection of a point is allowed by our code, which is also difficult to ascertain, since the fluence map does not yield itself to an appropriate measurement point selection.

Algorithms↗

Tagging gene and protein names in biomedical text.

MOTIVATION: The MEDLINE database of biomedical abstracts contains scientific knowledge about thousands of interacting genes and proteins. Automated text processing can aid in the comprehension and synthesis of this valuable information. The fundamental task of identifying gene and protein names is a necessary first step towards making full use of the information encoded in biomedical text. This remains a challenging task due to the irregularities and ambiguities in gene and protein nomenclature. We propose to approach the detection of gene and protein names in scientific abstracts as part-of-speech tagging, the most basic form of linguistic corpus annotation. RESULTS: We present a method for tagging gene and protein names in biomedical text using a combination of statistical and knowledge-based strategies. This method incorporates automatically generated rules from a transformation-based part-of-speech tagger, and manually generated rules from morphological clues, low frequency trigrams, indicator terms, suffixes and part-of-speech information. Results of an experiment on a test corpus of 56K MEDLINE documents demonstrate that our method to extract gene and protein names can be applied to large sets of MEDLINE abstracts, without the need for special conditions or human experts to predetermine relevant subsets. AVAILABILITY: The programs are available on request from the authors.

Abbreviations as Topic↗

Three-dimensional computer-aided diagnosis scheme for detection of colonic polyps.

We have developed a three-dimensional (3-D) computer-aided diagnosis scheme for automated detection of colonic polyps in computed tomography (CT) colonographic data sets, and assessed its performance based on colonoscopy as the gold standard. In this scheme, a thick region encompassing the entire colonic wall is extracted from an isotropic volume reconstructed from the CT images in CT colonography. Polyp candidates are detected by first computing of 3-D geometric features that characterize polyps, folds, and colonic walls at each voxel in the extracted colon, and then segmenting of connected components corresponding to suspicious regions by hysteresis thresholding based on these geometric features. We apply fuzzy clustering to these connected components to obtain the polyp candidates. False-positive (FP) detections are then reduced by computation of several 3-D volumetric features characterizing the internal structures of the polyp candidates, followed by the application of discriminant analysis to the feature space generated by these volumetric features. The locations of the polyps detected by our computerized method were compared to the gold standard of conventional colonoscopy. The performance was evaluated based on 43 clinical cases, including 12 polyps determined by colonoscopy. Our computerized scheme was shown to have the potential to detect polyps in CT colonography with a clinically acceptable high sensitivity and a low FP rate.

Algorithms↗

Engineering stability into Escherichia coli secreted Fabs leads to increased functional expression.

The recombinant expression of immunoglobulin domains, Fabs and scFvs in particular, in Escherichia coli can vary significantly from antibody to antibody. We hypothesized that poor Fab expression is often linked to poor intrinsic stability. To investigate this further, we applied a novel approach for stabilizing a poorly expressing anti-tetanus toxoid human Fab with a predisposition for being misfolded and non-functional. Forty-five residues within the Fab were chosen for saturation mutagenesis based on residue frequency analysis and positional entropy calculations. Using automated screening, we determined the approximate midpoint temperature of thermal denaturation (TM) for over 4000 library members with a maximum theoretical diversity of 855 unique mutations. This dataset led to the identification of 11 residue positions, primarily in the Fv region, which when mutated enhanced Fab stability. By combining these mutations, the TM of the Fab was increased to 92 degrees C. Increases in Fab stability correlated with higher expressed Fab yields and higher levels of properly folded and functional protein. The mutations were selected based on their ability to increase the apparent stability of the Fab and therefore the exact mechanism behind the enhanced expression in E.coli remains undefined. The wild-type and two optimized Fabs were converted to an IgG1 format and expressed in mammalian cells. The optimized IgG1 molecules demonstrated identical gains in thermostability compared to the Fabs; however, the expression levels were unaffected suggesting that the eukaryotic secretion system is capable of correcting potential folding issues prevalent in E.coli. Overall, the results have significant implications for the bacterial expression of functional antibody domains as well as for the production of stable, high affinity therapeutic antibodies in mammalian cells.

Escherichia coli↗

Evaluation of semiautomated measurements of mesothelioma tumor thickness on CT scans.

RATIONALE AND OBJECTIVES: To evaluate the clinical acceptability of semiautomated methods for the measurement of mesothelioma tumor thickness in computed tomography (CT) scans. MATERIALS AND METHODS: A computer interface was developed to allow the acquisition of semiautomated mesothelioma tumor thickness measurements, which require the manual selection of a point along the outer margin of the tumor in a CT section. After application of an automated lung segmentation method, the computer automatically identifies a corresponding point along the inner margin of the tumor (as represented by the lung boundary), constructs a line segment between the manually selected outer tumor margin point and the computer-determined inner tumor margin point, and computes tumor thickness as the length of this line segment. Three radiologists and oncologists independently reviewed line segments representing the semiautomated measurements generated by three different algorithms at 134 measurement sites in the CT scans of 22 mesothelioma patients. The observers either accepted a measurement line segment or modified it through the interface. Differences between the initial semiautomated measurements and the measurements as modified by the observers were analyzed. RESULTS: The frequency with which observers accepted the semiautomated measurements without modification was as high as 86%. Of all measurements across all observers and methods (1,206 measurements), 89% were changed by 2 mm or less. CONCLUSION: We have developed semiautomated methods to measure mesothelioma tumor thickness. The potential of these methods has been demonstrated through an observer study. We expect these methods to become important tools for the efficient quantification of tumor extent.

Adult↗

A novel method for improvement of visualization of power spectra for sorting cryo-electron micrographs and their local areas.

In a context of automation of cryo-electron microscopy, we developed a novel method for improving visibility of diffraction rings in the power spectra of cryo-electron micrographs of vitreous ice (without carbon film or high concentration of diffracting material). We used these enhanced spectra to semi-automatically detect and remove micrographs and/or local areas introducing errors in the global 3D map (drifted and charged areas) or those unable to increase global signal-to-noise ratio (non-diffracting areas). Our strategy also allows a detection of micrographs/areas with a strong astigmatism. These images should be removed when using algorithms that do not correct astigmatism. Our sorting method is simple and fast since it uses the normalized cross-correlation between enhanced spectra and their copies rotated by 90 degrees. It owes its success mainly to the novel pre-processing of power spectra. The improved visibility also allows an easier visual check of accuracy of sorting. We show that our algorithm can even improve the visibility of diffraction rings of cryo-electron micrographs of pure water. Moreover, we show that this visibility depends strongly on ice thickness. This algorithm is implemented in the Xmipp (open-source image processing package) and is freely available for implementation in any other software package.

Algorithms↗

Implementation and evaluation of a new automated interactive image analysis system.

OBJECTIVE: To compare automated interactive screening using the ThinPrep Imaging System with independent manual primary screening of 12,000 routine ThinPrep slides. STUDY DESIGN: With the first 6,000 cases, the Review Scopes (RS) screening results from the 22 fields of view (FOV) only were compared to independent manual primary screening. In the next 6,000 cases, any abnormality detected in the 22 FOV resulted in full manual screening on the cytotechnologist's own microscope. Sensitivity and specificity together with their 95% CIs were calculatedfor each method. RESULTS: In the first set of 6, 000 cases, diagnostic sensitivity and specificity of the imager were 85.19% and 96.67%, respectively. The diagnostic sensitivity and specificity of manual primary screening were 89.38% and 98.42%. This highersensitivity and specificity of manual primary screening were found to be statistically significant. The second set of 6,000 cases demonstrated no significant statistical difference in sensitivity or specificity between the sets of data. CONCLUSION: The results from our study show that the sensitivity and specificity of the imager technology are equivalent to those of manual primary screening. The system is ideally suited to the rapid screening of negative cases, allowing increased laboratory productivity and greater throughput of cases on a daily basis.

Carcinoma↗

Automated contour detection in X-ray left ventricular angiograms using multiview active appearance models and dynamic programming.

This paper describes a new approach to the automated segmentation of X-ray left ventricular (LV) angiograms, based on active appearance models (AAMs) and dynamic programming. A coupling of shape and texture information between the end-diastolic (ED) and end-systolic (ES) frame was achieved by constructing a multiview AAM. Over-constraining of the model was compensated for by employing dynamic programming, integrating both intensity and motion features in the cost function. Two applications are compared: a semi-automatic method with manual model initialization, and a fully automatic algorithm. The first proved to be highly robust and accurate, demonstrating high clinical relevance. Based on experiments involving 70 patient data sets, the algorithm's success rate was 100% for ED and 99% for ES, with average unsigned border positioning errors of 0.68 mm for ED and 1.45 mm for ES. Calculated volumes were accurate and unbiased. The fully automatic algorithm, with intrinsically less user interaction was less robust, but showed a high potential, mostly due to a controlled gradient descent in updating the model parameters. The success rate of the fully automatic method was 91% for ED and 83% for ES, with average unsigned border positioning errors of 0.79 mm for ED and 1.55 mm for ES.

Algorithms↗

ISYMOD: a knowledge warehouse for the identification, assembly and analysis of bacterial integrated systems.

MOTIVATION: Complex biological functions emerge from interactions between proteins in stable supra-molecular assemblies and/or through transitory contacts. Most of the time protein partners of the assemblies are composed of one or several domains which exhibit different biochemical functions. Thus the study of cellular process requires the identification of different functional units and their integration in an interaction network; such complexes are referred to as integrated systems. In order to exploit with optimum efficiency the increased release of data, automated bioinformatics strategies are needed to identify, reconstruct and model such systems. For that purpose, we have developed a knowledge warehouse dedicated to the representation and acquisition of bacterial integrated systems involved in the exchange of the bacterial cell with its environment. RESULTS: ISYMOD is a knowledge warehouse that consistently integrates in the same environment the data and the methods used for their acquisition. This is achieved through the construction of (1) a domain knowledge base (DKB) devoted to the storage of the knowledge about the systems, their functional specificities, their partners and how they are related and (2) a methodological knowledge base (MKB) which depicts the task layout used to identify and reconstruct functional integrated systems. Instantiation of the DKB is obtained by solving the tasks of the MKB, whereas some tasks need instances of the DKB to be solved. AROM, an object-based knowledge representation system, has been used to design the DKB, and its task manager, AROMTasks, for developing the MKB. In this study two integrated systems, ABC transporters and two component systems, both involved in adaptation processes of a bacterial cell to its biotope, have been used to evaluate the feasibility of the approach.

ATP-Binding Cassette Transporters↗

Accuracy of automated volumetry of pulmonary nodules across different multislice CT scanners.

The purpose of this study was to compare the accuracy of an automated volumetry software for phantom pulmonary nodules across various 16-slice multislice spiral CT (MSCT) scanners from different vendors. A lung phantom containing five different nodule categories (intraparenchymal, around a vessel, vessel attached, pleural, and attached to the pleura), with each category comprised of 7-9 nodules (total, n = 40) of varying sizes (diameter 3-10 mm; volume 6.62 mm(3)-525 mm(3)), was scanned with four different 16-slice MSCT scanners (Siemens, GE, Philips, Toshiba). Routine and low-dose chest protocols with thin and thick collimations were applied. The data from all scanners were used for further analysis using a dedicated prototype volumetry software. Absolute percentage volume errors (APE) were calculated and compared. The mean APE for all nodules was 8.4% (+/-7.7%) for data acquired with the 16-slice Siemens scanner, 14.3% (+/-11.1%) for the GE scanner, 9.7% (+/-9.6%) for the Philips scanner and 7.5% (+/-7.2%) for the Toshiba scanner, respectively. The lowest APEs were found within the diameter size range of 5-10 mm and volumes >66 mm(3). Nodule volumetry is accurate with a reasonable volume error in data from different scanner vendors. This may have an important impact for intraindividual follow-up studies.

Analysis of Variance↗

Toward automated segmentation of the pathological lung in CT.

Conventional methods of lung segmentation rely on a large gray value contrast between lung fields and surrounding tissues. These methods fail on scans with lungs that contain dense pathologies, and such scans occur frequently in clinical practice. We propose a segmentation-by-registration scheme in which a scan with normal lungs is elastically registered to a scan containing pathology. When the resulting transformation is applied to a mask of the normal lungs, a segmentation is found for the pathological lungs. As a mask of the normal lungs, a probabilistic segmentation built up out of the segmentations of 15 registered normal scans is used. To refine the segmentation, voxel classification is applied to a certain volume around the borders of the transformed probabilistic mask. Performance of this scheme is compared to that of three other algorithms: a conventional, a user-interactive and a voxel classification method. The algorithms are tested on 10 three-dimensional thin-slice computed tomography volumes containing high-density pathology. The resulting segmentations are evaluated by comparing them to manual segmentations in terms of volumetric overlap and border positioning measures. The conventional and user-interactive methods that start off with thresholding techniques fail to segment the pathologies and are outperformed by both voxel classification and the refined segmentation-by-registration. The refined registration scheme enjoys the additional benefit that it does not require pathological (hand-segmented) training data.

Algorithms↗

Towards a method for automated classification of 1H MRS spectra from brain tumours.

Recent studies have shown that MRS can substantially improve the non-invasive categorization of human brain tumours. However, in order for MRS to be used routinely by clinicians, it will be necessary to develop reliable automated classification methods that can be fully validated. This paper is in two parts: the first part reviews the progress that has been made towards this goal, together with the problems that are involved in the design of automated methods to process and classify the spectra. The second part describes the development of a simple prototype system for classifying 1H single voxel spectra, obtained at an echo time (TE) of 135 ms, of the four most common types of brain tumour (meningioma (MM), astrocytic (AST), oligodendroglioma (OD) and metastasis (ME)) and cysts. This system was developed in two stages: firstly, an initial database of spectra was used to develop a prototype classifier, based on a linear discriminant analysis (LDA) of selected data points. Secondly, this classifier was tested on an independent test set of 15 newly acquired spectra, and the system was refined on the basis of these results. The system correctly classified all the non-astrocytic tumours. However, the results for the the astrocytic group were poorer (between 55 and 100%, depending on the binary comparison). Approximately 50% of high grade astrocytoma (glioblastoma) spectra in our data base showed very little lipid signal, which may account for the poorer results for this class. Consequently, for the refined system, the astrocytomas were subdivided into two subgroups for comparison against other tumour classes: those with high lipid content and those without.

Brain Neoplasms↗

Predicting protein subnuclear location with optimized evidence-theoretic K-nearest classifier and pseudo amino acid composition.

The nucleus is the brain of eukaryotic cells that guides the life processes of the cell by issuing key instructions. For in-depth understanding of the biochemical process of the nucleus, the knowledge of localization of nuclear proteins is very important. With the avalanche of protein sequences generated in the post-genomic era, it is highly desired to develop an automated method for fast annotating the subnuclear locations for numerous newly found nuclear protein sequences so as to be able to timely utilize them for basic research and drug discovery. In view of this, a novel approach is developed for predicting the protein subnuclear location. It is featured by introducing a powerful classifier, the optimized evidence-theoretic K-nearest classifier, and using the pseudo amino acid composition [K.C. Chou, PROTEINS: Structure, Function, and Genetics, 43 (2001) 246], which can incorporate a considerable amount of sequence-order effects, to represent protein samples. As a demonstration, identifications were performed for 370 nuclear proteins among the following 9 subnuclear locations: (1) Cajal body, (2) chromatin, (3) heterochromatin, (4) nuclear diffuse, (5) nuclear pore, (6) nuclear speckle, (7) nucleolus, (8) PcG body, and (9) PML body. The overall success rates thus obtained by both the re-substitution test and jackknife cross-validation test are significantly higher than those by existing classifiers on the same working dataset. It is anticipated that the powerful approach may also become a useful high throughput vehicle to bridge the huge gap occurring in the post-genomic era between the number of gene sequences in databases and the number of gene products that have been functionally characterized. The OET-KNN classifier will be available at www.pami.sjtu.edu.cn/people/hbshen.

Amino Acid Sequence↗

Pores and ridges: high-resolution fingerprint matching using level 3 features.

Fingerprint friction ridge details are generally described in a hierarchical order at three different levels, namely, Level 1 (pattern), Level 2 (minutia points), and Level 3 (pores and ridge contours). Although latent print examiners frequently take advantage of Level 3 features to assist in identification, Automated Fingerprint Identification Systems (AFIS) currently rely only on Level 1 and Level 2 features. In fact, the Federal Bureau of Investigation's (FBI) standard of fingerprint resolution for AFIS is 500 pixels per inch (ppi), which is inadequate for capturing Level 3 features, such as pores. With the advances in fingerprint sensing technology, many sensors are now equipped with dual resolution (500 ppi/1,000 ppi) scanning capability. However, increasing the scan resolution alone does not necessarily provide any performance improvement in fingerprint matching, unless an extended feature set is utilized. As a result, a systematic study to determine how much performance gain one can achieve by introducing Level 3 features in AFIS is highly desired. We propose a hierarchical matching system that utilizes features at all the three levels extracted from 1,000 ppi fingerprint scans. Level 3 features, including pores and ridge contours, are automatically extracted using Gabor filters and wavelet transform and are locally matched using the Iterative Closest Point (ICP) algorithm. Our experiments show that Level 3 features carry significant discriminatory information. There is a relative reduction of 20 percent in the equal error rate (EER) of the matching system when Level 3 features are employed in combination with Level 1 and 2 features. This significant performance gain is consistently observed across various quality fingerprint images.

Algorithms↗

Using stacked generalization to predict membrane protein types based on pseudo-amino acid composition.

Membrane proteins are vitally important for many biological processes and have become an attractive target for both basic research and drug design. Knowledge of membrane protein types often provides useful clues in deducing the functions of uncharacterized membrane proteins. With the unprecedented increasing of newly found protein sequences in the post-genomic era, it is highly demanded to develop an automated method for fast and accurately identifying the types of membrane proteins according to their amino acid sequences. Although quite a few identifiers have been developed in this regard through various approaches, such as covariant discriminant (CD), support vector machine (SVM), artificial neural network (ANN), and K-nearest neighbor (KNN), classifier the way they operate the identification is basically individual. As is well known, wise persons usually take into account the opinions from several experts rather than rely on only one when they are making critical decisions. Likewise, a sophisticated identifier should be trained by several different modes. In view of this, based on the frame of pseudo-amino acid that can incorporate a considerable amount of sequence-order effects, a novel approach called "stacked generalization" or "stacking" has been introduced. Unlike the "bagging" and "boosting" approaches which only combine the classifiers of a same type, the stacking approach can combine several different types of classifiers through a meta-classifier to maximize the generalization accuracy. The results thus obtained were very encouraging. It is anticipated that the stacking approach may also hold a high potential to improve the identification quality for, among many other protein attributes, subcellular location, enzyme family class, protease type, and protein-protein interaction type. The stacked generalization classifier is available as a web-server named "SG-MPt_Pred" at: http://202.120.37.186/bioinf/wangsq/service.htm.

Algorithms↗

Digital stereo image analyzer for generating automated 3-D measures of optic disc deformation in glaucoma.

The major limitations of precise evaluation of retinal structures in present clinical situations are the lack of standardization, the inherent subjectivity involved in the interpretation of retinal images, and intra- as well as interobserver variability. While evaluating optic disc deformation in glaucoma, these limitations could be overcome by using advanced digital image analysis techniques to generate precise metrics from stereo optic disc image pairs. A digital stereovision system for visualizing the topography of the optic nerve head from stereo optic disc images is presented. We have developed an algorithm, combining power cepstrum and zero-mean-normalized cross correlation techniques, which extracts depth information using coarse-to-fine disparity between corresponding windows in a stereo pair. The gray level encoded sparse disparity matrix is subjected to a cubic B-spline operation to generate smooth representations of the optic cup/disc surfaces and new three-dimensional (3-D) metrics from isodisparity contours. Despite the challenges involved in 3-D surface recovery, the robustness of our algorithm in finding disparities within the constraints used has been validated using stereo pairs with known disparities. In a preliminary longitudinal study of glaucoma patients, a strong correlation is found between the computer-generated quantitative cup/disc volume metrics and manual metrics commonly used in a clinic. The computer generated new metrics, however, eliminate the subjective variability and greatly reduce the time and cost involved in manual metric generation in follow-up studies of glaucoma.

Algorithms↗