• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 58
Next 10 →

Coil sensitivity encoding for fast MRI. In:

by Klaas P Pruessmann , Markus Weiger , Markus B Scheidegger , Peter Boesiger - Proceedings of the ISMRM 6th Annual Meeting, , 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract - Cited by 193 (3 self) - Add to MetaCart
, 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

Hardware Assisted Volume Rendering of Unstructured Grids by Incremental Slicing

by Roni Yagel, David M. Reed, Asish Law, Po-Wen Shih, Naeem Shareef , 1996
"... Some of the more important research results in computational science rely on the use of simulation methods that operate on unstructured grids. However, these grids, composed of a set of convex polyhedra, introduce exceptional problems with respect to data visualization. Volume rendering techniques ..."
Abstract - Cited by 72 (0 self) - Add to MetaCart
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

Parallel image component labelling with watershed transformation

by Alina N. Moga, Moncef Gabbouj - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1997
"... 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 locall ..."
Abstract - Cited by 38 (4 self) - Add to MetaCart
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

Parallelizing the ZSweep algorithm for distributed-shared memory architectures

by Ricardo Farias, Cláudio T. Silva - In to appear International Workshop on Volume Graphics , 2001
"... Abstract. In this paper we describe a simple parallelization of the ZSWEEP algorithm for rendering unstructured volumetric grids on distributed-shared memory machines, and study its performance on three generations of SGI multiprocessors, including the new Origin 3000 series. The main idea of the ZS ..."
Abstract - Cited by 11 (5 self) - Add to MetaCart
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

Using a Heterogeneous Service-oriented Grid Infrastructure for Movie Rendering

by Francesco Nerieri, Mumtaz Siddiqui, Jürgen Hofer, Alex Villazón, Radu Prodan, Thomas Fahringer
"... 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 is no ..."
Abstract - Add to MetaCart
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

Parallel variational motion estimation by domain decomposition and cluster computing

by Timo Kohlberger, Christoph Schnörr, Andrés Bruhn, Joachim Weickert - Computer Vision – ECCV 2004, volume 3024 of Lecture Notes in Computer Science , 2004
"... 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 solu ..."
Abstract - Cited by 4 (4 self) - Add to MetaCart
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

Planar Grouping for Automatic Detection of Vanishing Lines and Points

by Frederik Schaffalitzky, Andrew Zisserman - Image and Vision Computing , 2000
"... It is demonstrated that grouping together features which satisfy a geometric relationship can be used both for (automatic) detection and estimation of vanishing points and lines. We describe the geometry of three commonly occurring types of geometric grouping and present efficient grouping algorithm ..."
Abstract - Cited by 44 (1 self) - Add to MetaCart
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

Data Parallel Implementation of 3D PSPI

by Claudio Bagaini, Ernesto Bonomi, Enrico Pieroni , 1995
"... 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 - Cited by 3 (3 self) - Add to MetaCart
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

A Parallel Seismic Imaging and Volume Rendering in Oil Exploration

by German Larrazabal, Jorge Rodriguez
"... 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 impl ..."
Abstract - Add to MetaCart
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

Efficient irregular wavefront propagation algorithms on hybrid cpu-gpu machines

by George Teodoro, Tony Pan, Tahsin Kurc, Jun Kong, Lee Cooper, Joel Saltz - Parallel Computing , 2013
"... In this paper, we address the problem of efficient execution of a computation pattern, referred to here as the irregular wavefront propagation pattern (IWPP), on hybrid systems with multiple CPUs and GPUs. The IWPP is common in several image processing operations. In the IWPP, data elements in the w ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
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
Next 10 →
Results 1 - 10 of 58
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University