It is now recognized in many domains that content-based image retrieval (CBIR) from a database of images cannot be carried out by using completely automated approaches. One such domain is medical radiology for which t...
详细信息
ISBN:
(纸本)0818685441
It is now recognized in many domains that content-based image retrieval (CBIR) from a database of images cannot be carried out by using completely automated approaches. One such domain is medical radiology for which the clinically useful information In an image typically consists of gray level variations in highly localized regions of the image. Currently, it is not possible to extract these regions by automatic image segmentation techniques. To address this problem, we have implemented a human-in-the-loop (a physicican-in-the-loop: more specifically) approach in which the human delineates the pathology bearing regions (PBR) and a set of anatomical landmarks of the image at the time the image is entered into the database. From rite regions thus marked, our approach applies low-level computer vision and image processing algorithms to extract features related to the variations of gray scale, texture, shape, etc. The extracted features create an index that characterizes the image. To form an image-based query the physician first marks the PBR's. The system then extracts the relevant image features, computes the distance of the query image to all image indices in the database, and retrieves the n most similar images. Our approach is based on the assumption that medical image characterization must contain features local to the PBR's. The focus of this paper is to assess the utility of localized versus global features for the domain of HRCT images of the lung, and to evaluate the system's sensitivity to physician subjectivity in delineating the PBR's.
Until recently, the application of infrared imaging to medicine has been limited by low-precision temperature measurement, low spatial resolution, a narrow field of view and the lack of image-processing ability. These...
详细信息
Until recently, the application of infrared imaging to medicine has been limited by low-precision temperature measurement, low spatial resolution, a narrow field of view and the lack of image-processing ability. These shortcomings have been overcome and now modern cameras have the ability to accumulate many sequential images, thus permitting the study of dynamic phenomena. In this article we present several examples of soft-tissue injury and breast cancer detection where the use of appropriate image-processingalgorithms substantially enhanced the diagnostic acumen of infrared imaging.
3D Active Net;which is a 3D extension of Snakes, is an energy-minimizing surface model which can extract a volume of interest from 3D volume data. It is deformable and evolves in 3D space to be attracted to salient fe...
详细信息
ISBN:
(纸本)0819427381
3D Active Net;which is a 3D extension of Snakes, is an energy-minimizing surface model which can extract a volume of interest from 3D volume data. It is deformable and evolves in 3D space to be attracted to salient features, according to its internal and image energy. The net can be fitted to the contour of a target object by defining: the image energy suitable for the contour property. We present testing results of the extraction of a muscle from the Visible Human Data by two methods: manual segmentation and the application of 3D Active Net. We apply principal component analysis, which utilizes the color information of the 3D volume data to emphasize an ill-defined contour of the muscle, and then apply 3D Active Net. We recognize that the extracted object has a smooth and natural contour in contrast with a comparable manual segmentation, proving an advantage of our approach.
At present the best methods for rotation of discrete sampled images use a combination of (fast) Fourier interpolation followed by cubic interpolation onto a rotated grid. A method is presented which uses only Fourier ...
详细信息
At present the best methods for rotation of discrete sampled images use a combination of (fast) Fourier interpolation followed by cubic interpolation onto a rotated grid. A method is presented which uses only Fourier interpolation. The new method has a similar computational complexity to the old, and is exactly reversible. The method uses the well-known decomposition of rotation into three pure shears. Each shear is performed using a 2D extension of the 1D Fourier shift theorem. This allows the fast Fourier transform (FFT) to be used, With appropriate data padding (such as zero padding) in both the real and Fourier domains, the procedure gives near perfect results and minimal loss of information in multiple rotation tests.
This paper presents efficient and portable implementations of two useful primitives in image processing algorithms, histogramming and connected components. Our general framework is a single-address space, distributed ...
详细信息
This paper presents efficient and portable implementations of two useful primitives in image processing algorithms, histogramming and connected components. Our general framework is a single-address space, distributed memory programming model. We use efficient techniques for distributing and coalescing data as well as efficient combinations of task and data parallelism. Our connected components algorithm uses a novel approach for parallel merging which performs drastically limited updating during iterative steps, and concludes with a total consistency update at the final step. The algorithms have been coded in SPLIT-C and run on a variety of platforms. Our experimental results are consistent with the theoretical analysis and provide the best known execution times for these two primitives, even when compared with machine-specific implementations. (C) 1996 Academic Press, Inc.
Many digital signal and image processing algorithms can be speeded up by executing them in parallel on multiple processors. The speed of parallel execution is limited by the need for communication and synchronization ...
详细信息
Many digital signal and image processing algorithms can be speeded up by executing them in parallel on multiple processors. The speed of parallel execution is limited by the need for communication and synchronization between processors. In this paper, we present a paradigm for parallel processing that we call the block data flow paradigm (BDFP). The goal of this paradigm-is to reduce interprocessor communication, and relax the synchronization requirements for such applications. We present the block data parallel architecture which implements this paradigm, and we present methods for mapping algorithms onto this architecture. We illustrate this methodology for several applications including two-dimensional (2-D) digital filters, the 2-D discrete cosine transform, QR decomposition of a matrix, and Cholesky factorization of a matrix. We analyze the resulting system performance for these applications with regard to speedup and efficiency as the number of processors increases. Our results demonstrate that the block data parallel architecture is a flexible, high-performance solution for numerous digital signal and image processing algorithms.
In this paper, we propose the architecture of a highly parallel DSP (HiPAR-DSP) as a flexible and programmable processor for image and video processing. The design of this processor is based on an analysis of characte...
详细信息
In this paper, we propose the architecture of a highly parallel DSP (HiPAR-DSP) as a flexible and programmable processor for image and video processing. The design of this processor is based on an analysis of characteristic properties of image processing algorithms in terms of available parallelization resources, demands on program control, and required data access mechanisms. This led to a very long instruction word (VLIW)-controlled ASIMD RISC-architecture with four or sixteen data paths, employing data-level parallelism, parallel instructions, micro-instruction pipelining, and data transfer concurrently to data processing. Common data access patterns for image processing algorithms are supported by use of a shared on-chip memory with parallel matrix type access patterns and a separate data-cache per data path, By properly balancing processing and controlling capabilities as internal and external memory bandwidth, this approach is optimized to make best use of currently available silicon resources. A high clock frequency is achieved by implementation of classic RISC features. The architecture fully supports high level language programming. With the 16 data path version at 100 MHz clock, a sustained performance of more than 2 billion arithmetic operations per second (GOPS) is achieved for a wide range of algorithms. Given examples show the parallel implementation of image processing algorithms like histogramming, Hough transform, or search in a sorted list with efficient use of the processor resources. A prototype of the architecture with four parallel data paths will be available in the second quarter of 1996, using a 0.6 mu m CMOS technology.
Most image and signal processingalgorithms are local algorithms, regardless of the specific physical nature of the images and signals. Because of the strong correlation of operations required to determine two neighbo...
详细信息
Most image and signal processingalgorithms are local algorithms, regardless of the specific physical nature of the images and signals. Because of the strong correlation of operations required to determine two neighboring elements, imageprocessing can be substantially accelerated by using fast algorithms. Some considerations regarding the construction of such algorithms on the basis of recursive computation have been examined in this paper. The development of specific algorithms for fast local imageprocessing requires further work, because we still do not have the explicit form of the algorithm for the determination of a general local function.
This paper presents a high-speed multifunction chip for performing one of four nonlinear operations: 1) square root, 2) reciprocal, 3) sine/cosine, and 4) arctangent. Each of these functions is evaluated with one ROM ...
详细信息
This paper presents a high-speed multifunction chip for performing one of four nonlinear operations: 1) square root, 2) reciprocal, 3) sine/cosine, and 4) arctangent. Each of these functions is evaluated with one ROM access, two additions, and one major and one minor multiplication, yielding a new result every two clock cycles. Its performance signifies an estimated three-to-four-fold increase in speed (for comparable technologies and minimum feature size) over existing approaches. Furthermore, since all four functions are performed on the same cell, a silicon-area advantage of approximately three is realized when the application demands multiple functions. In wafer scale integration (WSI) of signal and image processing algorithms, several such functions are usually needed, while defect tolerance dictates the use of just one or two types of cells. Thus the new component is ideally suited for monolithic WSI. However, it can also be used as a co-processor/accelerator for commercial DSP chips in hybrid WSI implementation of signal processingalgorithms. The underlying principle, which has made the combined goals of high-speed and multifunctionality possible, is second-order interpolation of very small ROM tables. Two versions am presented: a 24-b chip, and a 16-b chip, both fabricated in 2.0-mum CMOS technology. As an application example, a rapid prototyping wafer scale architecture is described.
An image processing algorithm to reduce chemical shift artifacts in MRI (magnetic resonance imaging) with time-varying gradients and to obtain the chemical shift images without increasing the imaging time is presented...
详细信息
An image processing algorithm to reduce chemical shift artifacts in MRI (magnetic resonance imaging) with time-varying gradients and to obtain the chemical shift images without increasing the imaging time is presented. It is known that when both gradients in two directions of the imaging plane are time-varying, such as in the spiral-type scanning MRI, the chemical shift artifacts appear as a blurred image. The artifacts cannot be neglected, since the total power of the out-of-focus point spread function (PSF) for the blurred image equals that of the in-focus PSF. The proposed algorithm separates the chemical shift images by iteratively estimating the artifacts under an a priori constraint that the original images should have a real and nonnegative value. Computer simulation results show that the average amplitude of the artifacts can be reduced significantly after several iterations, and that the algorithm works well even when the observation noise exists.
暂无评论