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 271 records · Page 15Linked to original sources

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↗

PubMed2005

A fourier theory for cast shadows.

Cast shadows can be significant in many computer vision applications, such as lighting-insensitive recognition and surface reconstruction. Nevertheless, most algorithms neglect them, primarily because they involve nonlocal interactions in nonconvex regions, making formal analysis difficult. However, many real instances map closely to canonical configurations like a wall, a V-groove type structure, or a pitted surface. In particular, we experiment with 3D textures like moss, gravel, and a kitchen sponge, whose surfaces include canonical configurations like V-grooves. This paper takes a first step toward a formal analysis of cast shadows, showing theoretically that many configurations can be mathematically analyzed using convolutions and Fourier basis functions. Our analysis exposes the mathematical convolution structure of cast shadows and shows strong connections to recent signal-processing frameworks for reflection and illumination.

Algorithms↗

PubMed2005

Learning from examples in the small sample case: face expression recognition.

Example-based learning for computer vision can be difficult when a large number of examples to represent each pattern or object class is not available. In such situations, learning from a small number of samples is of practical value. To study this issue, the task of face expression recognition with a small number of training images of each expression is considered. A new technique based on linear programming for both feature selection and classifier training is introduced. A pairwise framework for feature selection, instead of using all classes simultaneously, is presented. Experimental results compare the method with three others: a simplified Bayes classifier, support vector machine, and AdaBoost. Finally, each algorithm is analyzed and a new categorization of these algorithms is given, especially for learning from examples in the small sample case.

Algorithms↗

PubMed1999

Analysis of brain activation patterns using a 3-D scale-space primal sketch.

A fundamental problem in brain imaging concerns how to define functional areas consisting of neurons that are activated together as populations. We propose that this issue can be ideally addressed by a computer vision tool referred to as the scale-space primal sketch. This concept has the attractive properties that it allows for automatic and simultaneous extraction of the spatial extent and the significance of regions with locally high activity. In addition, a hierarchical nested tree structure of activated regions and subregions is obtained. The subject in this article is to show how the scale-space primal sketch can be used for automatic determination of the spatial extent and the significance of rCBF changes. Experiments show the result of applying this approach to functional PET data, including a preliminary comparison with two more traditional clustering techniques. Compared to previous approaches, the method overcomes the limitations of performing the analysis at a single scale or assuming specific models of the data.

Brain Mapping↗

PubMed2006

Engineering challenges of BioNEMS: the integration of microfluidics, micro- and nanodevices, models and external control for systems biology.

Systems biology, i.e. quantitative, postgenomic, postproteomic, dynamic, multiscale physiology, addresses in an integrative, quantitative manner the shockwave of genetic and proteomic information using computer models that may eventually have 10(6) dynamic variables with non-linear interactions. Historically, single biological measurements are made over minutes, suggesting the challenge of specifying 10(6) model parameters. Except for fluorescence and micro-electrode recordings, most cellular measurements have inadequate bandwidth to discern the time course of critical intracellular biochemical events. Micro-array expression profiles of thousands of genes cannot determine quantitative dynamic cellular signalling and metabolic variables. Major gaps must be bridged between the computational vision and experimental reality. The analysis of cellular signalling dynamics and control requires, first, micro- and nano-instruments that measure simultaneously multiple extracellular and intracellular variables with sufficient bandwidth; secondly, the ability to open existing internal control and signalling loops; thirdly, external BioMEMS micro-actuators that provide high bandwidth feedback and externally addressable intracellular nano-actuators; and, fourthly, real-time, closed-loop, single-cell control algorithms. The unravelling of the nested and coupled nature of cellular control loops requires simultaneous recording of multiple single-cell signatures. Externally controlled nano-actuators, needed to effect changes in the biochemical, mechanical and electrical environment both outside and inside the cell, will provide a major impetus for nanoscience.

Animals↗

PubMed2004

Coordinate-based versus structural approaches to brain image analysis.

A basic issue in neurosciences is to look for possible relationships between brain architecture and cognitive models. The lack of architectural information in magnetic resonance images, however, has led the neuroimaging community to develop brain mapping strategies based on various coordinate systems without accurate architectural content. Therefore, the relationships between architectural and functional brain organizations are difficult to study when analyzing neuroimaging experiments. This paper advocates that the design of new brain image analysis methods inspired by the structural strategies often used in computer vision may provide better ways to address these relationships. The key point underlying this new framework is the conversion of the raw images into structural representations before analysis. These representations are made up of data-driven elementary features like activated clusters, cortical folds or fiber bundles. Two classes of methods are introduced. Inference of structural models via matching across a set of individuals is described first. This inference problem is illustrated by the group analysis of functional statistical parametric maps (SPMs). Then, the matching of new individual data with a priori known structural models is described, using the recognition of the cortical sulci as a prototypical example.

Brain↗

PubMed2006

Unsupervised, information-theoretic, adaptive image filtering for image restoration.

Image restoration is an important and widely studied problem in computer vision and image processing. Various image filtering strategies have been effective, but invariably make strong assumptions about the properties of the signal and/or degradation. Hence, these methods lack the generality to be easily applied to new applications or diverse image collections. This paper describes a novel unsupervised, information-theoretic, adaptive filter (UINTA) that improves the predictability of pixel intensities from their neighborhoods by decreasing their joint entropy. In this way, UINTA automatically discovers the statistical properties of the signal and can thereby restore a wide spectrum of images. The paper describes the formulation to minimize the joint entropy measure and presents several important practical considerations in estimating neighborhood statistics. It presents a series of results on both real and synthetic data along with comparisons with current state-of-the-art techniques, including novel applications to medical image processing.

Algorithms↗

PubMed2004

Algorithms for matching 3D line sets.

Matching two sets of lines is a basic tool that has applications in many computer vision problems such as scene registration, object recognition, motion estimation, and others. Line sets may be composed of infinitely long lines or finite length line segments. Depending on line lengths, three basic cases arise in matching sets of lines: 1) finite-finite, 2) finite-infinite, and 3) infinite-infinite. Case 2 has not been treated in the literature. For Cases 1 and 3, existing algorithms for matching 3D line sets are not completely satisfactory in that they either solve special situations, or give approximate solutions, or may not converge, or are not invariant with respect to coordinate system transforms. In this paper, we present new algorithms that solve exactly all three cases for the general situation. The algorithms are provably convergent and invariant to coordinate transforms. Experiments with synthetic and real 3D image data are reported.

Algorithms↗