, samples of distinct information content can be obtained at one time by using distinct receivers in parallel (2), implying the possibility of reducing scan time in Fourier imaging without having to travel faster in k-space. In 1988 Hutchinson and Raff (3) suggested dispensing entirely with phase encoding

method for rendering unstructured grids that is based on incremental slicing and hardware polygon rendering. For a given view direction, the grid vertices are transformed to image space using available graphics hardware. We then incrementally compute the 2D polygon-meshes that result from letting a

The parallel watershed transformation used in gray scale image segmentation is reconsidered in this paper on the basis of the component labeling problem. The main idea is to break the sequentiality of the watershed transformation and to correctly delimit the extent of all connected components

Origin 3000, we measure the L2 data cache hit rate of the tile-based ZSWEEP to be over 99%; a parallel efficiency of 83 % on 16 processors; and rendering rates of about 300 thousand tetrahedra per second for a 1024   1024 image. 1

Abstract. With the move of the Grid community towards Service-Oriented Architectures (SOA), new challenges appeared regarding the actual development, deployment, and use of Grid services. Even though the foundations for such a move are conceptually clear, applying service orientation for Grids

Abstract. We present an approach to parallel variational optical flow computation on standard hardware by domain decomposition. Using an arbitrary partition of the image plane into rectangular subdomains, the global solution to the variational approach is obtained by iteratively combining local

algorithms which exploit these geometries. The three types of grouping are : (1) a family of equally spaced coplanar parallel lines, (2) a planar pattern obtained by repeating some element by translation in the plane, and (3) a set of elements arranged in a regular planar grid. Examples of automatically

This paper essentially addresses the extrapolation step which is by far the most intense computational one. The choice of the imaging condition impacts the amplitude handling but not seriously the computational effort. If the migration velocity field has no lateral velocity variations the wavefield

Abstract. In this work, we present an efficient parallel implementation of a depth migration RTM (Reverse Time Migration) method to obtain a seismic image. This migration technique is based on the parallel solution of the acoustic wave propagation in 2D using a finite difference scheme. We have

approaches on a state-of-the-art GPU accelerated machine (equipped with 3 GPUs and 2 multicore CPUs) using the IWPP implementations of two widely used image processing opera-tions: morphological reconstruction and euclidean distance transform. Our re-sults show significant performance improvements on GPUs