SEARCH · PubMed Health

Results for “Computer vision”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

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

At least 235 records · Page 13Linked to original sources

PubMed2004

Automatic identification of bacterial types using statistical imaging methods.

The objective of the current study is to develop an automatic tool to identify microbiological data types using computer-vision and statistical modeling techniques. Bacteriophage (phage) typing methods are used to identify and extract representative profiles of bacterial types out of species such as the Staphylococcus aureus. Current systems rely on the subjective reading of profiles by a human expert. This process is time-consuming and prone to errors, especially as technology is enabling the increase in the number of phages used for typing. The statistical methodology presented in this work, provides for an automated, objective and robust analysis of visual data, along with the ability to cope with increasing data volumes.

Bacteriophage Typing↗

PubMed2003

Computational models of oral and craniofacial development, growth, and repair.

This paper illustrates how biological and clinical problems stimulate research in biomedical informatics and how such research contributes to their solution. The computational models described use techniques from Logic Programming, Machine Learning, Computer Vision, and Biomathematics. They address problems in the development, growth, and repair of oral and craniofacial tissues arising in cell biology, clinical genetics, and dentistry. At the micro-level, the dynamic interaction of cells in the oral epithelium is modeled. At the macro-level, models are constructed of either the craniofacial shape of an individual or the craniofacial shape differences within and between healthy and congenitally abnormal populations. In between, in terms of scale, there are models of normal dentition and the use of computerized expert knowledge to guide the design of dental prostheses used to restore function in partially edentulous patients.

Adult↗

PubMed2005

Variational optical flow computation in real time.

This paper investigates the usefulness of bidirectional multigrid methods for variational optical flow computations. Although these numerical schemes are among the fastest methods for solving equation systems, they are rarely applied in the field of computer vision. We demonstrate how to employ those numerical methods for the treatment of variational optical flow formulations and show that the efficiency of this approach even allows for real-time performance on standard PCs. As a representative for variational optic flow methods, we consider the recently introduced combined local-global method. It can be considered as a noise-robust generalization of the Horn and Schunck technique. We present a decoupled, as well as a coupled, version of the classical Gauss-Seidel solver, and we develop several multgrid implementations based on a discretization coarse grid approximation. In contrast, with standard bidirectional multigrid algorithms, we take advantage of intergrid transfer operators that allow for nondyadic grid hierarchies. As a consequence, no restrictions concerning the image size or the number of traversed levels have to be imposed. In the experimental section, we juxtapose the developed multigrid schemes and demonstrate their superior performance when compared to unidirectional multgrid methods and nonhierachical solvers. For the well-known 316 x 252 Yosemite sequence, we succeeded in computing the complete set of dense flow fields in three quarters of a second on a 3.06-GHz Pentium4 PC. This corresponds to a frame rate of 18 flow fields per second which outperforms the widely-used Gauss-Seidel method by almost three orders of magnitude.

Algorithms↗

PubMed2004

Computerized characterization of breast masses on three-dimensional ultrasound volumes.

We are developing computer vision techniques for the characterization of breast masses as malignant or benign on radiologic examinations. In this study, we investigated the computerized characterization of breast masses on three-dimensional (3-D) ultrasound (US) volumetric images. We developed 2-D and 3-D active contour models for automated segmentation of the mass volumes. The effect of the initialization method of the active contour on the robustness of the iterative segmentation method was studied by varying the contour used for its initialization. For a given segmentation, texture and morphological features were automatically extracted from the segmented masses and their margins. Stepwise discriminant analysis with the leave-one-out method was used to select effective features for the classification task and to combine these features into a malignancy score. The classification accuracy was evaluated using the area Az under the receiver operating characteristic (ROC) curve, as well as the partial area index Az(0.9), defined as the relative area under the ROC curve above a sensitivity threshold of 0.9. For the purpose of comparison with the computer classifier, four experienced breast radiologists provided malignancy ratings for the 3-D US masses. Our dataset consisted of 3-D US volumes of 102 biopsied masses (46 benign, 56 malignant). The classifiers based on 2-D and 3-D segmentation methods achieved test Az values of 0.87+/-0.03 and 0.92+/-0.03, respectively. The difference in the Az values of the two computer classifiers did not achieve statistical significance. The Az values of the four radiologists ranged between 0.84 and 0.92. The difference between the computer's Az value and that of any of the four radiologists did not achieve statistical significance either. However, the computer's Az(0.9) value was significantly higher than that of three of the four radiologists. Our results indicate that an automated and effective computer classifier can be designed for differentiating malignant and benign breast masses on 3-D US volumes. The accuracy of the classifier designed in this study was similar to that of experienced breast radiologists.

Algorithms↗

PubMed1993

Breast cytology diagnosis with digital image analysis.

An interactive computer system has been developed for evaluating cytologic features derived directly from a digital scan of breast fine needle aspirate slides. The system uses computer vision techniques to analyze cell nuclei and classifies them using an inductive method based on linear programming. A digital scan of selected areas of the aspirate slide is done by a trained observer, while the analysis of the digitized image is done by an untrained observer. When trained and tested on 119 breast fine needle aspirates (68 benign and 51 malignant) using leave-one-out testing, 90% correctness was achieved. These results indicate that the method is accurate (good intraobserver and interobserver reproducibility) and that an untrained operator can obtain diagnostic results comparable to those achieved visually by experienced observers.

Breast Neoplasms↗

PubMed2001

Multiphase method for automatic alignment of transmission electron microscope images using markers.

In order to successfully perform the 3D reconstruction in electron tomography, transmission electron microscope images must be accurately aligned or registered. So far, the problem is solved by either manually showing the corresponding fiducial markers from the set of images or automatically using simple correlation between the images on several rotations and scales. The present solutions, however, share the problem of being inefficient and/or inaccurate. We therefore propose a method in which the registration is automated using conventional colloidal gold particles as reference markers between images. We approach the problem from the computer vision viewpoint; hence, the alignment problem is divided into several subproblems: (1) finding initial matches from successive images, (2) estimating the epipolar geometry between consecutive images, (3) finding and localizing the gold particles with subpixel accuracy in each image, (4) predicting the probable matching gold particles using the epipolar constraint and its uncertainty, (5) matching and tracking the gold beads through the tilt series, and (6) optimizing the transformation parameters for the whole image set. The results show not only the reliability of the suggested method but also a high level of accuracy in alignment, since practically all the visible gold markers can be used.

Automation↗

PubMed1993

Spatial, sequence-order-independent structural comparison of alpha/beta proteins: evolutionary implications.

We present a unique sequence-order independent approach which allows examination of three dimensional structures, searching for spatially similar substructural motifs. If the amino acids composing the motifs are contiguous in the primary chain, that is, they follow each other in the sequence, a common ancestor and a divergent evolutionary process may be implied. On the other hand, if the three-dimensional substructural motif consists of amino acids whose positions in the sequences vary between the different proteins, a convergent evolution might have taken place. Starting from different, ancient sequences, mutations may have occurred that brought about formation and conservation of a truly structural motif. Such a motif might be particularly suitable for fulfilling a specific function. Clearly, in order to be able to carry out such a task one needs a technique which allows comparisons of protein structures absolutely independent of their amino acid sequence-order. Our novel, efficient, computer vision based technique treats atoms (residues) as unconnected points in space, using strictly the atomic (either all atoms or only the C alpha atoms) coordinates. The order of the residues is completely disregarded. Detection, cataloging and analysis of "real" three-dimensional, sequence-order independent motifs in the crystallographic database is expected to be an invaluable tool for protein folding. Here we demonstrate the power of the technique by applying it to alpha/beta proteins. Our studies indicate that for some of the proteins, the "classical" structural alignments (conserving the amino acid order) are the optimal ones. Nevertheless, for others, truly spatial (out of sequential-order) amino acid equivalencing results in a better geometrical match.

Biological Evolution↗

PubMedDate not supplied

Image feature analysis and computer-aided diagnosis in digital radiography. 3. Automated detection of nodules in peripheral lung fields.

We are investigating the characteristic features of lung nodules and the surrounding normal anatomic background in order to develop an algorithm of computer vision for use as an aid in the detection of nodules in digital chest radiographs. Our technique involves an attempt to eliminate the background anatomic structures in the lung fields by means of a difference image approach. Then, feature-extraction techniques, such as tests for circularity, size, and their variation with threshold level, are applied so that suspected nodules can be isolated. Preliminary results of this automated detection scheme yielded high true-positive rates and low false-positive rates in the peripheral lung regions of the chest. This detection scheme, which can assist the final diagnosis by the clinician, has the potential to improve the early detection of lung carcinomas.

Diagnostic Errors↗

PubMed1996

Segmentation of multispectral magnetic resonance image using penalized fuzzy competitive learning network.

Segmentation (tissue classification) of the medical images obtained from Magnetic resonance (MR) images is a primary step in most applications of computer vision to medical image analysis. This paper describes a penalized fuzzy competitive learning network designed to segment multispectral MR spin echo images. The proposed approach is a new unsupervised and winner-takes-all scheme based on a neural network using the penalized fuzzy clustering technique. Its implementation consists of the combination of a competitive learning network and penalized fuzzy clustering methods in order to make parallel implementation feasible. The penalized fuzzy competitive learning network could provide an acceptable result for medical image segmentation in parallel processing using the hardware implementation. The experimental results show that a promising solution can be obtained using the penalized fuzzy competitive learning neural network based on least squares criteria.

Adult↗

PubMed1998

Automated segmentation of muscle fiber images using active contour models.

The cross-sectional area of different fiber types is an important anatomic feature in studying the structure and function of healthy and diseased human skeletal muscles. However, such studies are hampered by the thousands of fibers involved when manual segmentation has to be used. We have developed a semiautomatic segmentation method that uses computational geometry and recent computer vision techniques to significantly reduce the time required to accurately segment the fibers in a sample. The segmentation is achieved by simply pointing to the approximate centroid of each fiber. The set of centroids is then used to automatically construct the Voronoi polygons, which correspond to individual fibers. Each Voronoi polygon represents the initial shape of one active contour model, called a snake. In the energy minimization process, which is executed in several stages, different external forces and problem-specific knowledge are used to guide the snakes to converge to fiber boundaries. Our results indicate that this approach for segmenting muscle fiber images is fast, accurate, and reproducible compared with manual segmentation performed by experts.

Adult↗

PubMed2004

Automatic tracking, feature extraction and classification of C elegans phenotypes.

This paper presents a method for automatic tracking of the head, tail, and entire body movement of the nematode Caenorhabditis elegans (C. elegans) using computer vision and digital image analysis techniques. The characteristics of the worm's movement, posture and texture information were extracted from a 5-min image sequence. A Random Forests classifier was then used to identify the worm type, and the features that best describe the data. A total of 1597 individual worm video sequences, representing wild type and 15 different mutant types, were analyzed. The average correct classification ratio, measured by out-of-bag (OOB) error rate, was 90.9%. The features that have most discrimination ability were also studied. The algorithm developed will be an essential part of a completely automated C. elegans tracking and identification system.

Algorithms↗

PubMed1997

Using 3-D shape models to guide segmentation of MR brain images.

Accurate segmentation of medical images poses one of the major challenges in computer vision. Approaches that rely solely on intensity information frequently fail because similar intensity values appear in multiple structures. This paper presents a method for using shape knowledge to guide the segmentation process, applying it to the task of finding the surface of the brain. A 3-D model that includes local shape constraints is fitted to an MR volume dataset. The resulting low-resolution surface is used to mask out regions far from the cortical surface, enabling an isosurface extraction algorithm to isolate a more detailed surface boundary. The surfaces generated by this technique are comparable to those achieved by other methods, without requiring user adjustment of a large number of ad hoc parameters.

Anatomy, Cross-Sectional↗

PubMed2004

An image analysis approach for automatically re-orienteering CT images for dental implants.

In the last decade, computerized tomography (CT) has become the most frequently used imaging modality to obtain a correct pre-operative implant planning. In this work, we present an image analysis and computer vision approach able to identify, from the reconstructed 3D data set, the optimal cutting plane specific to each implant to be planned, in order to obtain the best view of the implant site and to have correct measures. If the patient requires more implants, different cutting planes are automatically identified, and the axial and cross-sectional images can be re-oriented accordingly to each of them. In the paper, we describe the defined algorithms in order to recognize 3D markers (each one aligned with a missed tooth for which an implant has to be planned) in the 3D reconstructed space, and the results in processing real exams, in terms of effectiveness and precision and reproducibility of the measure.

Algorithms↗

PubMed2004

What energy functions can be minimized via graph cuts?

In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are complex and highly specific to a particular energy function, graph cuts have seen limited application to date. In this paper, we give a characterization of the energy functions that can be minimized by graph cuts. Our results are restricted to functions of binary variables. However, our work generalizes many previous constructions and is easily applicable to vision problems that involve large numbers of labels, such as stereo, motion, image restoration, and scene reconstruction. We give a precise characterization of what energy functions can be minimized using graph cuts, among the energy functions that can be written as a sum of terms containing three or fewer binary variables. We also provide a general-purpose construction to minimize such an energy function. Finally, we give a necessary condition for any energy function of binary variables to be minimized by graph cuts. Researchers who are considering the use of graph cuts to optimize a particular energy function can use our results to determine if this is possible and then follow our construction to create the appropriate graph. A software implementation is freely available.

Algorithms↗

PubMed1999

An intelligent, interactive platform for ophthalmic teaching, telemedicine, and telecollaboration: design considerations and prototype construction.

The development of technologies permitting processing, compression, and transmission of digital images and image sequences enables powerful methodologies for local and remote medical teleconsultation. We are developing a slit-lamp-based ophthalmic augmented reality (image overlay) environment incorporating features to permit real-time, interactive teaching, telemedicine, and telecollaboration. A binocular slit-lamp biomicroscope interfaced to a CCD camera, framegrabber board, and PC permits acquisition and rendering of anterior segment and retinal images. Computer-vision algorithms facilitate robust tracking, registration, and near-video-rate image overlay of previously stored retinal photographic and angiographic images onto the real-time fundus image. Our algorithms facilitate shared control of pointing, drawing, and measuring functions registered with the retinal image video stream and direct audio communication between an examiner (student, generalist) and remote observer (instructor, specialist). Bandwidth and video compression considerations limit the frame rate and latency for video stream transmission. Excellent and acceptable performance are demonstrated in model eyes over a local area network and through a modem connection, respectively. These studies represent the first investigations towards the design and implementation of an intelligent platform for ophthalmic telemedicine and telecollaboration.

Algorithms↗

PubMed2004

Statistical region merging.

This paper explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions. We exhibit a particular blend of algorithmics and statistics whose segmentation error is, as we show, limited from both the qualitative and quantitative standpoints. This approach can be efficiently approximated in linear time/space, leading to a fast segmentation algorithm tailored to processing images described using most common numerical pixel attribute spaces. The conceptual simplicity of the approach makes it simple to modify and cope with hard noise corruption, handle occlusion, authorize the control of the segmentation scale, and process unconventional data such as spherical images. Experiments on gray-level and color images, obtained with a short readily available C-code, display the quality of the segmentations obtained.

Algorithms↗

PubMed2003

A flexible software for tracking of markers used in human motion analysis.

In this work, we present a software for the tracking of markers used in human motion analysis. This software is based mainly on image sequences captured by video cameras and on image processing and computer vision tools. Unlike the optoelectronic systems, which record only the coordinates of the markers, a video-based system offers more visual information and flexibility which can be exploited in different applications. However, it needs a more complex tracking procedure concerned with the extraction and identification of the used markers. The tracking module presented here is divided into the following three procedures: segmentation, matching and prediction. The segmentation consists in extracting the objects of interest (markers). The matching is used to find the correspondence between the extracted objects in two consecutive frames. The prediction is important to limit the region of processing, thus reducing the execution time. Some results of the automatic tracking are presented together with their application in human motions analysis.

Algorithms↗

PubMed2003

Recovering the X-ray projection geometry for three-dimensional tomographic reconstruction with additional sensors: attached camera versus external navigation system.

Three-dimensional tomographic reconstruction using intra-operative mobile C-arms could provide physicians with new and exciting tools for image-guided surgery. Recovery of the projection geometry of mobile X-ray systems is a crucial step for such reconstruction procedures. Recent work on medical imaging describes the use of optical or electro-magnetic sensor systems in order to navigate surgical instruments. These systems can also be used for the estimation of C-arm motion, and therefore for the recovery of the projection geometry of the X-ray C-arm. In this case, the mathematical problem that needs to be solved is equivalent to the hand-eye calibration well studied by both the computer vision and robotics community. We first study the recovery of the motion and projection geometry using five different hand-eye calibration methods proposed in the literature. The optical navigation system POLARIS from Northern Digital Inc. was used in our experiments. The results of the estimated motion and projection geometry using the five hand-eye calibration methods are compared with the same results obtained using an off-the-shelf CCD camera attached to the mobile C-arm. The experimental results include three-dimensional tomographic reconstruction results using our mobile C-arm. We show that even though the motion of the C-arm is more precisely recovered using the navigation system, the projection geometry is better estimated using the attached CCD camera.

Humans↗