Biomedical subjects

Badrinath Roysam

Publications and source records attributed to Badrinath Roysam.

16 recordsLinked to original sources

PubMed2005

A 2-D/3-D model-based method to quantify the complexity of microvasculature imaged by in vivo multiphoton microscopy.

This paper presents model-based information-theoretic methods to quantify the complexity of tumor microvasculature, taking into account shape, textural, and structural irregularities. The proposed techniques are completely automated, and are applicable to optical slices (3-D) or projection images (2-D). Improvements upon the prior literature include: (i) measuring local (vessel segment) as well as global (entire image) vascular complexity without requiring explicit segmentation or tracing; (ii) focusing on the vessel boundaries in the complexity estimate; and (iii) added robustness to image artifacts common to tumor microvasculature images. Vessels are modeled using a family of super-Gaussian functions that are based on the superquadric modeling primitive common in computer vision. The superquadric generalizes a simple ellipsoid by including shape parameters that allow it to approximate a cylinder with elliptical cross-sections (generalized cylinder). The super-Gaussian is obtained by composing a superquadric with an exponential function giving a form that is similar to a standard Gaussian function but with the ability to produce level sets that approximate generalized cylinders. Importantly, the super-Gaussian is continuous and differentiable so it can be fit to image data using robust non-linear regression. This fitting enables quantification of the intrinsic complexity of vessel data vis-a-vis the super-Gaussian model within a minimum message length (MML) framework. The resulting measures are expressed in units of information (bits). Synthetic and real-data examples are provided to illustrate the proposed measures.

Algorithms↗

PubMed2005

Hierarchical, model-based merging of multiple fragments for improved three-dimensional segmentation of nuclei.

BACKGROUND: Automated segmentation of fluorescently labeled cell nuclei in three-dimensional confocal images is essential for numerous studies, e.g., spatiotemporal fluorescence in situ hybridization quantification of immediate early gene transcription. High accuracy and automation levels are required in high-throughput and large-scale studies. Common sources of segmentation error include tight clustering and fragmentation of nuclei. Previous region-based methods are limited because they perform merging of two nuclear fragments at a time. To achieve higher accuracy without sacrificing scale, more sophisticated yet computationally efficient algorithms are needed. METHODS: A recursive tree-based algorithm that can consider multiple object fragments simultaneously is described. Starting with oversegmented data, it searches efficiently for the optimal merging pattern guided by a quantitative scoring criterion based on object modeling. Computation is bounded by limiting the depth of the merging tree. RESULTS: The proposed method was found to perform consistently better, achieving merging accuracy in the range of 92% to 100% compared with our previous algorithm, which varied in the range of 75% to 97%, even with a modest merging tree depth of 3. The overall average accuracy improved from 90% to 96%, with roughly the same computational cost for a set of representative images drawn from the CA1, CA3, and parietal cortex regions of the rat hippocampus. CONCLUSION: Hierarchical tree model-based algorithms significantly improve the accuracy of automated nuclear segmentation without sacrificing speed.

Algorithms↗

PubMed2005

Automated image analysis methods for 3-D quantification of the neurovascular unit from multichannel confocal microscope images.

BACKGROUND: There is a need for integrative and quantitative methods to investigate the structural and functional relations among elements of complex systems, such as the neurovascular unit (NVU), that involve multiple cell types, microvasculatures, and various genomic/proteomic/ionic functional entities. METHODS: Vascular casting and selective labeling enabled simultaneous three-dimensional imaging of the microvasculature, cell nuclei, and cytoplasmic stains. Multidimensional segmentation was achieved by (i) bleed-through removal and attenuation correction; (ii) independent segmentation and morphometry for each corrected channel; and (iii) spatially associative feature computation across channels. The combined measurements enabled cell classification based on nuclear morphometry, cytoplasmic signals, and distance from vascular elements. Specific spatial relations among the NVU elements could be quantified. RESULTS: A software system combining nuclear and vessel segmentation codes and associative features was constructed and validated. Biological variability contributed to misidentified nuclei (9.3%), undersegmentation of nuclei (3.7%), hypersegmentation of nuclei (14%), and missed nuclei (4.7%). Microvessel segmentation errors occurred rarely, mainly due to nonuniform lumen staining. CONCLUSIONS: Associative features across fluorescence channels, in combination with standard features, enable integrative structural and functional analysis of the NVU. By labeling additional structural and functional entities, this method can be scaled up to larger-scale systems biology studies that integrate spatial and molecular information.

Animals↗

PubMed2005

Image change detection algorithms: a systematic survey.

Detecting regions of change in multiple images of the same scene taken at different times is of widespread interest due to a large number of applications in diverse disciplines, including remote sensing, surveillance, medical diagnosis and treatment, civil infrastructure, and underwater sensing. This paper presents a systematic survey of the common processing steps and core decision rules in modern change detection algorithms, including significance and hypothesis testing, predictive models, the shading model, and background modeling. We also discuss important preprocessing methods, approaches to enforcing the consistency of the change mask, and principles for evaluating and comparing the performance of change detection algorithms. It is hoped that our classification of algorithms into a relatively small number of categories will provide useful guidance to the algorithm designer.

Algorithms↗

PubMed2005

Automatic selection of parameters for vessel/neurite segmentation algorithms.

An automated method is presented for selecting optimal parameter settings for vessel/neurite segmentation algorithms using the minimum description length principle and a recursive random search algorithm. It trades off a probabilistic measure of image-content coverage against its conciseness. It enables nonexpert users to select parameter settings objectively, without knowledge of underlying algorithms, broadening the applicability of the segmentation algorithm, and delivering higher morphometric accuracy. It enables adaptation of parameters across batches of images. It simplifies the user interface to just one optional parameter and reduces the cost of technical support. Finally, the method is modular, extensible, and amenable to parallel computation. The method is applied to 223 images of human retinas and cultured neurons, from four different sources, using a single segmentation algorithm with eight parameters. Improvements in segmentation quality compared to default settings using 1000 iterations ranged from 4.7%-21%. Paired t-tests showed that improvements are statistically significant (p < 0.0005). Most of the improvement occurred in the first 44 iterations. Improvements in description lengths and agreement with the ground truth were strongly correlated (p = 0.78).

Algorithms↗

PubMed2004

3D-catFISH: a system for automated quantitative three-dimensional compartmental analysis of temporal gene transcription activity imaged by fluorescence in situ hybridization.

Fluorescence in situ hybridization (FISH) of neural activity-regulated, immediate-early gene (IEG) expression provides a method of functional brain imaging with cellular resolution. This enables the identification, in one brain, of which specific principal neurons were active during each of two distinct behavioral epochs. The unprecedented potential of this differential method for large-scale analysis of functional neural circuits is limited, however, by the time-intensive nature of manual image analysis. A comprehensive software tool for processing three-dimensional, multi-spectral confocal image stacks is described which supports the automation of this analysis. Nuclei counterstained with conventional DNA dyes and FISH signals indicating the sub-cellular distribution of specific, IEG RNA species are imaged using different spectral channels. The DNA channel data are segmented into individual nuclei by a three-dimensional multi-step algorithm that corrects for depth-dependent attenuation, non-isotropic voxels, and imaging noise. Intra-nuclear and cytoplasmic FISH signals are associated spatially with the nuclear segmentation results to generate a detailed tabular/database and graphic representation. Here we present a comprehensive validation of data generated by the automated software against manual quantification by human experts on hippocampal and parietal cortical regions (96.5% concordance with multi-expert consensus). The high degree of reliability and accuracy suggests that the software will generalize well to multiple brain areas and eventually to large-scale brain analysis.

Algorithms↗

PubMed2004

Predictive scheduling algorithms for real-time feature extraction and spatial referencing: application to retinal image sequences.

Real-time spatial referencing is an important alternative to tracking for designing spatially aware ophthalmic instrumentation for procedures such as laser photocoagulation and perimetry. It requires independent, fast registration of each image frame from a digital video stream (1024 x 1024 pixels) to a spatial map of the retina. Recently, we have introduced a spatial referencing algorithm that works in three primary steps: 1) tracing the retinal vasculature to extract image feature (landmarks); 2) invariant indexing to generate hypothesized landmark correspondences and initial transformations; and 3) alignment and verification steps to robustly estimate a 12-parameter quadratic spatial transformation between the image frame and the map. The goal of this paper is to introduce techniques to minimize the amount of computation for successful spatial referencing. The fundamental driving idea is to make feature extraction subservient to registration and, therefore, only produce the information needed for verified, accurate transformations. To this end, the image is analyzed along one-dimensional, vertical and horizontal grid lines to produce a regular sampling of the vasculature, needed for step 3) and to initiate step 1). Tracing of the vascular is then prioritized hierarchically to quickly extract landmarks and groups (constellations) of landmarks for indexing. Finally, the tracing and spatial referencing computations are integrated so that landmark constellations found by tracing are tested immediately. The resulting implementation is an order-of-magnitude faster with the same success rate. The average total computation time is 31.2 ms per image on a 2.2-GHz Pentium Xeon processor.

Algorithms↗

PubMed2004

Model-based method for improving the accuracy and repeatability of estimating vascular bifurcations and crossovers from retinal fundus images.

A model-based algorithm, termed exclusion region and position refinement (ERPR), is presented for improving the accuracy and repeatability of estimating the locations where vascular structures branch and cross over, in the context of human retinal images. The goal is two fold. First, accurate morphometry of branching and crossover points (landmarks) in neuronal/vascular structure is important to several areas of biology and medicine. Second, these points are valuable as landmarks for image registration, so improved accuracy and repeatability in estimating their locations and signatures leads to more reliable image registration for applications such as change detection and mosaicing. The ERPR algorithm is shown to reduce the median location error from 2.04 pixels down to 1.1 pixels, while improving the median spread (a measure of repeatability) from 2.09 pixels down to 1.05 pixels. Errors in estimating vessel orientations were similarly reduced from 7.2 degrees down to 3.8 degrees.

Algorithms↗

PubMed2004

Efficient migration of complex off-line computer vision software to real-time system implementation on generic computer hardware.

This paper addresses the problem of migrating large and complex computer vision code bases that have been developed off-line, into efficient real-time implementations avoiding the need for rewriting the software, and the associated costs. Creative linking strategies based on Linux loadable kernel modules are presented to create a simultaneous realization of real-time and off-line frame rate computer vision systems from a single code base. In this approach, systemic predictability is achieved by inserting time-critical components of a user-level executable directly into the kernel as a virtual device driver. This effectively emulates a single process space model that is nonpreemptable, nonpageable, and that has direct access to a powerful set of system-level services. This overall approach is shown to provide the basis for building a predictable frame-rate vision system using commercial off-the-shelf hardware and a standard uniprocessor Linux operating system. Experiments on a frame-rate vision system designed for computer-assisted laser retinal surgery show that this method reduces the variance of observed per-frame central processing unit cycle counts by two orders of magnitude. The conclusion is that when predictable application algorithms are used, it is possible to efficiently migrate to a predictable frame-rate computer vision system.

Algorithms↗

PubMed2004

Robust model-based vasculature detection in noisy biomedical images.

This paper presents a set of algorithms for robust detection of vasculature in noisy retinal video images. Three methods are studied for effective handling of outliers. The first method is based on Huber's censored likelihood ratio test. The second is based on the use of a alpha-trimmed test statistic. The third is based on robust model selection algorithms. All of these algorithms rely on a mathematical model for the vasculature that accounts for the expected variations in intensity/texture profile, width, orientation, scale, and imaging noise. These unknown parameters are estimated implicitly within a robust detection and estimation framework. The proposed algorithms are also useful as nonlinear vessel enhancement filters. The proposed algorithms were evaluated over carefully constructed phantom images, where the ground truth is known a priori, as well as clinically recorded images for which the ground truth was manually compiled. A comparative evaluation of the proposed approaches is presented. Collectively, these methods outperformed prior approaches based on Chaudhuri et al. (1989) matched filtering, as well as the verification methods used by prior exploratory tracing algorithms, such as the work of Can et aL (1999). The Huber censored likelihood test yielded the best overall improvement, with a 145.7% improvement over the exploratory tracing algorithm, and a 43.7% improvement in detection rates over the matched filter.

Algorithms↗

PubMed2003

A hybrid 3D watershed algorithm incorporating gradient cues and object models for automatic segmentation of nuclei in confocal image stacks.

BACKGROUND: Automated segmentation of fluorescently-labeled cell nuclei in 3D confocal microscope images is essential to many studies involving morphological and functional analysis. A common source of segmentation error is tight clustering of nuclei. There is a compelling need to minimize these errors for constructing highly automated scoring systems. METHODS: A combination of two approaches is presented. First, an improved distance transform combining intensity gradients and geometric distance is used for the watershed step. Second, an explicit mathematical model for the anatomic characteristics of cell nuclei such as size and shape measures is incorporated. This model is constructed automatically from the data. Deliberate initial over-segmentation of the image data is performed, followed by statistical model-based merging. A confidence score is computed for each detected nucleus, measuring how well the nucleus fits the model. This is used in combination with the intensity gradient to control the merge decisions. RESULTS: Experimental validation on a set of rodent brain cell images showed 97% concordance with the human observer and significant improvement over prior methods. CONCLUSIONS: Combining a gradient-weighted distance transform with a richer morphometric model significantly improves the accuracy of automated segmentation and FISH analysis.

Algorithms↗

PubMed2003

Automated tracing and change analysis of angiogenic vasculature from in vivo multiphoton confocal image time series.

Automated methods are described for tracing and analysis of changes in angiogenic vasculature imaged by a multiphoton laser-scanning confocal microscope. Utilizing chronic animal window models, time series of in vivo 3-D images were acquired on approximately the same target volume of the same specimen while undergoing angiogenic change (typically every 24 h for 7 days). Objective, precise, 3-D, rapid, and fully automated vessel morphometry was performed using an adaptive tracing algorithm that is based on a generalized irregular cylinder model of the vasculature. This algorithm was found to be not only adaptive enough for tracing angiogenic vasculature, but also very efficient in its use of computer memory, and fast, taking less than 1 min to trace a 768 x 512 x 32, 8-bit/pixel 3-D image stack on a Dell Pentium III 1-GHz computer. The automatically traced centerlines were manually validated on six image stacks and the average spatial error was measured to be 2 pixels, with an average concordance of 81% between manual and automated traces on a voxel basis. The tracing output includes geometrical statistics of traced vasculature and serves as the basis of statistical change analysis. The computer methods described here are designed to be scalable to much larger hypothesis testing studies involving quantitative measurements of tumor angiogenesis, gene expression relative to known vascular structures, and impact of drug delivery.

Algorithms↗

PubMed2003

Automated three-dimensional tracing of neurons in confocal and brightfield images.

Automated three-dimensional (3-D) image analysis methods are presented for tracing of dye-injected neurons imaged by fluorescence confocal microscopy and HRP-stained neurons imaged by transmitted-light brightfield microscopy. An improved algorithm for adaptive 3-D skeletonization of noisy images enables the tracing. This algorithm operates by performing connectivity testing over large N x N x N voxel neighborhoods exploiting the sparseness of the structures of interest, robust surface detection that improves upon classical vacant neighbor schemes, improved handling of process ends or tips based on shape collapse prevention, and thickness-adaptive thinning. The confocal image stacks were skeletonized directly. The brightfield stacks required 3-D deconvolution. The results of skeletonization were analyzed to extract a graph representation. Topological and metric analyses can be carried out using this representation. A semiautomatic method was developed for reconnection of dendritic fragments that are disconnected due to insufficient dye penetration, an imaging deficiency, or skeletonization errors.

Animals↗

PubMed2003

Median-based robust algorithms for tracing neurons from noisy confocal microscope images.

This paper presents a method to exploit rank statistics to improve fully automatic tracing of neurons from noisy digital confocal microscope images. Previously proposed exploratory tracing (vectorization) algorithms work by recursively following the neuronal topology, guided by responses of multiple directional correlation kernels. These algorithms were found to fail when the data was of lower quality (noisier, less contrast, weak signal, or more discontinuous structures). This type of data is commonly encountered in the study of neuronal growth on microfabricated surfaces. We show that by partitioning the correlation kernels in the tracing algorithm into multiple subkernels, and using the median of their responses as the guiding criterion improves the tracing precision from 41% to 89% for low-quality data, with a 5% improvement in recall. Improved handling was observed for artifacts such as discontinuities and/or hollowness of structures. The new algorithms require slightly higher amounts of computation, but are still acceptably fast, typically consuming less than 2 seconds on a personal computer (Pentium III, 500 MHz, 128 MB). They produce labeling for all somas present in the field, and a graph-theoretic representation of all dendritic/axonal structures that can be edited. Topological and size measurements such as area, length, and tortuosity are derived readily. The efficiency, accuracy, and fully-automated nature of the proposed method makes it attractive for large-scale applications such as high-throughput assays in the pharmaceutical industry, and study of neuron growth on nano/micro-fabricated structures. A careful quantitative validation of the proposed algorithms is provided against manually derived tracing, using a performance measure that combines the precision and recall metrics.

Algorithms↗

PubMed2003

The dual-bootstrap iterative closest point algorithm with application to retinal image registration.

Motivated by the problem of retinal image registration, this paper introduces and analyzes a new registration algorithm called Dual-Bootstrap Iterative Closest Point (Dual-Bootstrap ICP). The approach is to start from one or more initial, low-order estimates that are only accurate in small image regions, called bootstrap regions. In each bootstrap region, the algorithm iteratively: 1) refines the transformation estimate using constraints only from within the bootstrap region; 2) expands the bootstrap region; and 3) tests to see if a higher order transformation model can be used, stopping when the region expands to cover the overlap between images. Steps 1): and 3), the bootstrap steps, are governed by the covariance matrix of the estimated transformation. Estimation refinement [Step 2)] uses a novel robust version of the ICP algorithm. In registering retinal image pairs, Dual-Bootstrap ICP is initialized by automatically matching individual vascular landmarks, and it aligns images based on detected blood vessel centerlines. The resulting quadratic transformations are accurate to less than a pixel. On tests involving approximately 6000 image pairs, it successfully registered 99.5% of the pairs containing at least one common landmark, and 100% of the pairs containing at least one common landmark and at least 35% image overlap.

Algorithms↗

PubMed2002

Rapid automated three-dimensional tracing of neurons from confocal image stacks.

Algorithms are presented for fully automatic three-dimensional (3-D) tracing of neurons that are imaged by fluorescence confocal microscopy. Unlike previous voxel-based skeletonization methods, the present approach works by recursively following the neuronal topology, using a set of 4 x N2 directional kernels (e.g., N = 32), guided by a generalized 3-D cylinder model. This method extends our prior work on exploratory tracing of retinal vasculature to 3-D space. Since the centerlines are of primary interest, the 3-D extension can be accomplished by four rather than six sets of kernels. Additional modifications, such as dynamic adaptation of the correlation kernels, and adaptive step size estimation, were introduced for achieving robustness to photon noise, varying contrast, and apparent discontinuity and/or hollowness of structures. The end product is a labeling of all somas present, graph-theoretic representations of all dendritic/axonal structures, and image statistics such as soma volume and centroid, soma interconnectivity, the longest branch, and lengths of all graph branches originating from a soma. This method is able to work directly with unprocessed confocal images, without expensive deconvolution or other preprocessing. It is much faster that skeletonization, typically consuming less than a minute to trace a 70-MB image on a 500-MHz computer. These properties make it attractive for large-scale automated tissue studies that require rapid on-line image analysis, such as high-throughput neurobiology/angiogenesis assays, and initiatives such as the Human Brain Project.

Algorithms↗