The three-dimensional medical information obtained from Magnetic Resonance image (MRI), X-ray Computed Tomography (CT), etc. is used for an operation-supporting image, and operations under image guidance have also bee...
详细信息
The three-dimensional medical information obtained from Magnetic Resonance image (MRI), X-ray Computed Tomography (CT), etc. is used for an operation-supporting image, and operations under image guidance have also been conducted. One of the stereoscopic methods is Integral Videography (iv), which is an animated extension of Integral Photography, reproducing a computer-generated graphical object. Though the advantage of iv has been proven in both feasibility studies and clinical applications, one of the issues still unsolved is the notable quantity of calculation that causes significant delay in rendering. Then using parallelprocessing method integrating Message Passing Interface (MPI) on High Performance Computer (HPC), we shortened the calculating time of iv picture by the shortest at about 0.2 s. Furthermore, by using socket communication, it transmitted to another portable note PC, which is for a display. Then, we achieved the fast presentation of autostereoscopic images seen from an arbitrary direction that was specified with the mouse from the note PC side at anywhere we can access to the network.
In this paper, we explore the use of motion estimation methods to restore noisy motion pictures coming from degraded film within the framework of high-performance computing environments. Specifically, we investigate h...
详细信息
In this paper, we explore the use of motion estimation methods to restore noisy motion pictures coming from degraded film within the framework of high-performance computing environments. Specifically, we investigate how the use of block-matching methods can outperform gradient-based methods (which are more sensible to little movements) also in the case of blotch detection in degraded film. Also, we show how a proposed method characterized by the use of a set of features together with multiresolution can be at the same time robust to noise and effective in motion compensated filtering, mainly concerning films that contain both large amounts of noise and fast/large motion objects in their frames. The peculiarities of the method are discussed and the model performance is assessed and compared with examples.
This paper proposes a general framework for searching large distributed repositories. Examples of such repositories include sites with music/video content, distributed digital libraries, distributed caching systems, e...
详细信息
This paper proposes a general framework for searching large distributed repositories. Examples of such repositories include sites with music/video content, distributed digital libraries, distributed caching systems, etc. The framework is based on the concept of neighborhood; each client keeps a list of the most beneficial sites according to past experience, which are visited first when the client searches for some particular content. Exploration methods continuously update the neighborhoods in order to follow changes in access patterns. Depending on the application, several variations of search and exploration processes are proposed. Experimental evaluation demonstrates the benefits of the framework in different scenarios.
We present a tomographic reconstruction algorithm based on a frequential decomposition of the data. We show that the frequential components of the attenuation function to be identified can be reconstructed from the fr...
详细信息
We present a tomographic reconstruction algorithm based on a frequential decomposition of the data. We show that the frequential components of the attenuation function to be identified can be reconstructed from the frequential decomposition of the data. Moreover, downsampling techniques added to the identification of null components and coupled to compression techniques, speed up the reconstruction time up to six compared to the classical FBP. We identify the optimal number of frequential components. We show reconstructions from real data. A parallel implementation of our new algorithm is then proposed and evaluated on two small PC clusters.
In the last decades, diagnosing medical images has heavily relied on digital imaging. As a consequence, huge amounts of data produced by modern medical instruments need to be processed, organized, and visualized in a ...
详细信息
In the last decades, diagnosing medical images has heavily relied on digital imaging. As a consequence, huge amounts of data produced by modern medical instruments need to be processed, organized, and visualized in a suitable response time. Many efforts have been devoted to the development of digital Picture Archiving and Communications Systems (PACS) which archive and distribute image information across a hospital and provide Web access to avoid the expensive deployment of a large number of such systems. On the other hand, this approach does not solve problems related to the increasing demand of high performance computing and storage facilities, which cannot be placed within a hospital. In this work we describe MedIGrid, an application that enables nuclear doctors to transparently use high performance computers and storage systems for the PET/SPECT (Positron Emission Tomography/Single Photon Emission Computed Tomography) imageprocessing, management, visualization and analysis. MedIGrid is the result of the joint efforts of a group of researchers committed to the development of a distributed application to test and deploy new reconstruction methods in clinical environments. The outcomes of this work include a set of platform independent software tools to read medical images, control the execution of computing intensive tomographic algorithms, and explore the reconstructed tomographic volumes. In the paper we describe how the collaboration among different research groups has contributed to the integration of the application into a single framework. The results of our work are discussed.
A method for the lossy compression of multivalued images using transform-based Boolean minimization is described. Blocks in bit-planes of an image are minimized, and the results of these minimizations are used to dete...
详细信息
A method for the lossy compression of multivalued images using transform-based Boolean minimization is described. Blocks in bit-planes of an image are minimized, and the results of these minimizations are used to detect and reduce noise (sandy regions) and spatial complexity in the blocks. Specifically, the techniques of "minterm uniformalization" and "minterm quantization and thresholding" are presented as methods of discarding perceptually insignificant information from a minimized representation of an image and use data readily available from minimization without the calculation of complicated measures. Experimentally, results comparable to JPEG and better than existing binary techniques can be expected. Fast algorithms may be used, no multiplications are required, and decompression is performed without an inverse transform. Therefore, an emphasis is placed on the use of these algorithms for low-complexity or very high-speed hardware implementations for communications, for distributed and parallel sensor and computing applications, as well as for database storage.
We present a new approach to isosurface visualization that we call "iso-splatting." We use point primitives for representing and rendering isosurfaces. The method consists of two steps. In the first step, po...
详细信息
We present a new approach to isosurface visualization that we call "iso-splatting." We use point primitives for representing and rendering isosurfaces. The method consists of two steps. In the first step, point samples are generated throughout the volumetric domain of a scalar function. In the second step, these points are projected onto the isosurface of interest. We render the resulting point set using a surface splatting algorithm. The method can be extended to out-of-core or parallel environments. Our results show that this method can offer much greater time and space efficiency when compared with standard triangle-based methods, thereby supporting higher levels of interactivity. Parts of the algorithm can be accelerated using graphics hardware. One key advantage of this approach is that, since extraction computations are divided into two smaller phases, work can be distributed to exploit all available resources.
Polar orbital satellites with low spatial resolution sensors, such as the AVHRR, provide global coverage with a short repetition period. The data is directly transmitted to ground stations, and can be distributed imme...
详细信息
Polar orbital satellites with low spatial resolution sensors, such as the AVHRR, provide global coverage with a short repetition period. The data is directly transmitted to ground stations, and can be distributed immediately after data acquisition. Near real time applications can be implemented if the adequate processing tools are available. One task usually needed is the geometric correction of image data. Automatic methods, based on satellite orbital parameters, can in some cases provide satisfactory results. However, the identification of Ground Control Points (GCPs) is generally required in order to achieve registration errors below the pixel size. A fully automatic method for the geometric registration of AVHRR data is proposed here. The method comprises four stages: (i) an initial image transformation based on orbital parameters, (ii) image segmentation of this image into 3 main classes (land, water, cloud) and 9 additional classes of mixed water and land at various levels, (iii) automatic GCP collection by image matching, (iv) final image production combining both orbital and GCP information. The method was tested on ten images of the Iberian Peninsula, and proved effective in accurately geo-referencing sub-sections of an AVHRR scene of medium dimension in a few minutes.
This paper describes practical implementation details for a second-order approximation to the parallel model combination (PMC) algorithm with application to large vocabulary distributed speech recognition. The propose...
详细信息
This paper describes practical implementation details for a second-order approximation to the parallel model combination (PMC) algorithm with application to large vocabulary distributed speech recognition. The proposed method is capable of simultaneously adapting to noise and channel changes. A more accurate method for computing the derivatives based on numeric integration PMC is introduced. The proposed second-order adaptation algorithm requires only twice the memory and computation of standard Jacobian Adaptation (JA). This represents a 382-fold reduction in memory and a 29-fold reduction in computation. Moreover, the proposed algorithm produces models that are much closer to the PMC-derived models than standard JA.
暂无评论