The algorithms used in computing the intensity axis of symmetry (IAS) for 2D and 3D medical images are described. The basic 2D algorithms, along with the algorithms needed to incorporate scale space, are described. A ...
详细信息
The algorithms used in computing the intensity axis of symmetry (IAS) for 2D and 3D medical images are described. The basic 2D algorithms, along with the algorithms needed to incorporate scale space, are described. A brief discussion of the extensions needed to work with 3D images is given. The basic approach is to treat the image as a deformable intensity surface which is contracted onto the IAS. The primitive regions of the segmentation are identified by the branches in the resulting tree-like structure. A hierarchy is produced by following the simplification of the branching through scale space. For comparison papers see ibid., p.94-101 and ibid., p.108-14.< >
In order to achieve the illusion of rotation of an object in a 3-D image (density volume), a sequence of projections of the image must be computed. A method that alleviates the need to perform a full-fledged ray-casti...
详细信息
In order to achieve the illusion of rotation of an object in a 3-D image (density volume), a sequence of projections of the image must be computed. A method that alleviates the need to perform a full-fledged ray-casting operation for each projection in the sequence when the projections are depth coded (range images) is described. The method proceeds incrementally exploiting the coherence between successive projections. The idea behind the incremental method (INC) is that speed can be gained if costly ray-casting methods are as far as possible replaced by 2-D geometric transformations of the currently visible surface points. As is shown, INC significantly reduces the number of ray-casting operations needed. Experiments indicate that a speed up factor of about 10 is achievable. Increasing the angle increment phi diminishes the coherence between successive projections, and thus more rays are required. As phi is further increased, INC gradually degenerates into full ray casting.< >
The medical image object definition method, which involves automatic computation of a region-based image description, along with a region containment directed acyclic graph (RCDAG) induced from the description by mult...
详细信息
The medical image object definition method, which involves automatic computation of a region-based image description, along with a region containment directed acyclic graph (RCDAG) induced from the description by multiscale analysis of image structures, is described. The information resulting from this computation provides the basis for interactive object definition, during which the human user inserts semantics into the image description through additions to and alteration of the automatically computed RCDAG. A tool for interactive object definition, the Image Hierarchy Editor (IHE) is also described. Design criteria and resulting design decisions for this tool are presented, followed by a discussion of preliminary image segmentation and object definition results. For comparison papers see ibid., p.94-101 and ibid., p.102-7.< >
A totally automated rule-based expert system developed for interpreting three-dimensional myocardial perfusion distributions obtained from thallium-201 tomographic images is described. Over 200 heuristic rules have be...
详细信息
A totally automated rule-based expert system developed for interpreting three-dimensional myocardial perfusion distributions obtained from thallium-201 tomographic images is described. Over 200 heuristic rules have been generated for interpreting stress perfusion defects and their characteristics. Perfusion defects are identified in terms of pixels below gender-matched normal patient distributions. Perfusion defects which reversed with time are identified in terms of pixels above gender-matched normal patient distributions. The expert system automatically calculates certainty factors from each perfusion defect to provide the relative certainty associated with the location and shape of each myocardial perfusion defect, as well as with the presence, location, and character of each coronary lesion. Results from a test using a pilot group of 20 patients are given.< >
Algorithms for computed radiography that allow a computer to recognize anatomy in medical imagery and to identify variations from normal in size, shape and density are discussed. The imagery is obtained from a Philips...
详细信息
Algorithms for computed radiography that allow a computer to recognize anatomy in medical imagery and to identify variations from normal in size, shape and density are discussed. The imagery is obtained from a Philips/Fuji computed radiography system that uses reusable photoluminescent image plates. The approach is general, allowing the use of the same system software for any modelled anatomy. Image-processing techniques are used to extract edges, regions, vertices and other relevant image features. These features trigger formation of hypotheses of the imaged bones and soft tissues. Multiple hypotheses of the size and orientation of the imaged anatomy are matched against stored 3-D models of the relevant anatomy, obtained from statistically valid population studies. A typical processing example from a normal hand is shown.< >
Methods of reducing the amount of data required to determine a clinical impression of a patient's condition are presented. The visualization of cardiac magnetic resonance images is discussed. Color functional imag...
详细信息
Methods of reducing the amount of data required to determine a clinical impression of a patient's condition are presented. The visualization of cardiac magnetic resonance images is discussed. Color functional images, calculated from quantitative analysis of the image sequences, are created to direct the physician to areas of abnormality. These images indicate regions of hyper- or hypokinesis, abnormal ejection fractions, and wall thickening. By selection of a region of abnormality from the functional images the actual image data and quantitative measurements of that particular area can be observed. This approach, going from data compressed into visual representations toward the original scans, provides an efficient method for reviewing large data sets of information without obscuring the original data or inhibiting access to information.< >
The authors propose a method for detecting and describing features in medical images by using deformable templates for the purpose of diagnostic analysis of these features. The feature of interest can be described by ...
详细信息
The authors propose a method for detecting and describing features in medical images by using deformable templates for the purpose of diagnostic analysis of these features. The feature of interest can be described by a parameterized template. A gradient maximization technique is used to change the parameters so that the template fits onto the desired anatomical feature. The final parameter values can be used as descriptors for the feature. Measurements of intensity values within a region of the template can be used as inputs to a medical diagnostic system. A picture-archive-and-communication-system-based image analysis program, which uses the technique of deformable templates to localize features in dual energy computer tomography (CT) images, is discussed. Statistical comparisons between the system and previously used manual techniques show that the performances are practically equivalent and that the system has several advantages over the human operator, for example, consistency, accuracy, and cost.< >
The authors present a ray-tracing algorithm for volume rendering designed to work efficiently when the data of interest is distributed sparsely through the volume. A simple preprocessing step identifies the voxels rep...
详细信息
ISBN:
(纸本)9780818620836
The authors present a ray-tracing algorithm for volume rendering designed to work efficiently when the data of interest is distributed sparsely through the volume. A simple preprocessing step identifies the voxels representing features of interest. Frequently this set of voxels, arbitrarily distributed in three-dimensional space, is a small fraction of the original voxel grid. A median-cut space partitioning scheme, combined with bounding volumes to prune void spaces in the resulting search structure, is used to store the voxels of interest in a k-d tree. The k-d tree is used as a data structure. The tree is then efficiently ray-traced to render the voxel data. The k-d tree is view independent, and can be used for animation sequences involving changes in positions of the viewer or positions of lights. This search structure has been applied to render voxel data from MRI, CAT scan, and electron density distributions.< >
暂无评论