Abstract
Data compression is a well-known method to improve the image composition time of parallel volume rendering on distributed memory multicomputers. In this paper, we propose an efficient data compression scheme, the template run-length encoding (TRLE) scheme, for image composition. Given an image with 2n×2n pixels, in the TRLE scheme, the image is treated as n×n blocks and each block has 2×2 pixels. Since a pixel can be a blank or non-blank pixel, there 16 templates in a block. To compress an image, the TRLE scheme encodes an image block by block similar to the run-length encoding scheme. However, the TRLE scheme can filter out or use small space to encode blocks whose four pixels are blank pixels, that is, the TRLE scheme can encode a partial image according to the shape of non-blank pixels. To evaluate the performance of the TRLE scheme, we compare the proposed scheme with the BR, the RLE, and the BRLC schemes. Since a data compression scheme needs to cooperate with some data communication schemes, in the implementation, the binary-swap, the parallel-pipelined, and the rotate-tiling data communication schemes are used. By combining the four data compression schemes with the three data communication schemes, we have twelve image composition methods. These twelve methods are implemented on an IBM SP2 parallel machine. Four volume datasets are used as test samples. The data computation time and the data communication time are measured. The experimental results show that the TRLE data compression scheme with the rotate-tiling data communication scheme outperforms other eleven image composition methods for all test samples.
Similar content being viewed by others
References
Ahrens J, Painter J (1998) Efficient sort-last rendering using compression-based image compositing. In: Proceedings of the second eurographics workshop on parallel graphics and visualization, 1998, pp 145–151
Cox M, Hanrahan P (1993) Pixel merging for object-parallel rendering: a distributed snooping algorithm. In: Proceedings of 1993 parallel rendering symposium (PRS’93), San Jose, Oct 1993, pp 49–56
Drebin RA, Carpenter L, Hanrahan P (1988) Volume rendering. In: Proceedings of SIGGRAPH’88 22(4):65–74, Atlanta
Foley JD, Van Dam A, Feiner SK, Hughes JF (1990) Computer graphics: principles and practice, 2nd edn. Addison-Wesley, Reading
Groeller E, Purgathofer W (1995) Coherence in computer graphics. Technical Reports TR-186-2-95-04, Institute of Computer Graphics 186-2, Technical University of Vienna, March 1995
Hsu WM (1993) Segmented ray casting for data parallel volume rendering. In: Proceedings of 1993 parallel rendering symposium (PRS’93), San Jose, USA, Oct 1993, pp 7–14
IBM, IBM AIX parallel environment, Parallel Programming Subroutine Reference
Kaufman A (1991) Volume visualization. IEEE Computer Society Press
Lacroute P (1995) Fast volume rendering using a shear-warp factorization of the viewing transformation. PhD dissertation, Stanford University
Lacroute P (1995) Real-time volume rendering on shared memory multiprocessors using the shear-warp factorization. In: Proceedings of 1995 parallel rendering symposium (PRS’95), Atlanta, Oct 1995, pp 15–22
Lacroute P (1996) Analysis of a parallel volume rendering system based on the shear-warp factorization. IEEE Trans Vis Comput Graph 2(3):218–231
Lacroute P, Levoy M (1994) Fast volume rendering using a shear-warp factorization of the viewing transformation. In: Proceedings of SIGGRAPH’94, Orlando, July 1994, pp 451–458
Lee TY, Raghavendra CS, Nicholas JB (1996) Image composition schemes for sort-last polygon rendering on 2D mesh multicomputers. IEEE Trans Vis Comput Graph 2(3):202–217
Laur D, Hanrahan P (1991) Hierarchical splatting: a progressive refinement algorithm for volume rendering. In: Proceedings of SIGGRAPH’91, Las Vegas, July 1991, vol 25, pp 285–288
Levoy M (1990) Efficient ray tracing of volume data. ACM Trans Graph 9(3):245–261
Lin CF, Chung YC, Yang DL (2002) Parallel shear-warp factorization volume rendering using efficient 1-D and 2-D partitioning schemes on distributed memory multicomputers. J Supercomput 22(3):277–302
Lin CF, Liao SK, Chung YC, Yang DL (2004) A rotate-tiling image composition method for parallel volume rendering on distributed memory multicomputers. J Inf Sci Eng 20(4):643–664
Ma KL, Painter JS, Hansen CD, Krogh MF (1993) A data distributed, parallel algorithm for ray-traced volume rendering. In: Proceedings of 1993 parallel rendering symposium (PRS’93), San Jose, Oct 1993, pp 15–22
Ma KL, Painter JS, Hansen CD, Krogh MF (1994) Parallel volume rendering using binary-swap composition. IEEE Comput Graph Appl 14(4):59–68
MPI Forum. MPI: A Message-Passing Interface Standard, May 1994
Porter T, Duff T (1984) Composition digital images. In: Proceedings of SIGGRAPH’84, Jul 1984, vol 18, pp 253–259
Sano K, Kitajima H, Kobayasi H, Nakamura T (1997) Parallel processing of the shear-warp factorization with the binary-swap scheme on a distributed-memory multiprocessor system. In: Proceedings of 1997 parallel rendering symposium (PRS’97), Oct 1997, pp 87–94
Singh JP, Gupta A, Levoy M (1994) Parallel visualization algorithms: performance and architectural implications. Comput 27(7):45–55
Upson C, Keeler M (1988) V-BUFFER: visible volume rendering. In: Proceedings of SIGGRAPH’88, Atlanta, 1988, vol 22, issue 4, pp 59–64
Westover L (1990) Footprint evaluation for volume rendering. In: Proceedings of SIGGRAPH’90, Dallas, 1990, vol 24, pp 367–376
Wilhelms J, Van Gelder A (1991) A coherent projection approach for direct volume rendering. In: Proceedings of SIGGRAPH’91, Jul 1991, vol 25, issue 4, pp 275–283
Wittenbrink CM, Somani AK (1993) Permutation warping for data parallel volume rendering. In: Proceedings of 1993 parallel rendering symposium (PRS’93), San Jose, USA, Oct 1993, pp 57–60
Wittenbrink CM (1998) Extensions to permutation warping for parallel volume rendering. Parallel Comput 24(9–10):1385–1406
Yoo TS, Neumann U, Fuchs H, Pizer SM, Cullip T, Rhoades J, Whitaker R (1992) Direct visualization of volume data. IEEE Comput Graph Appl 12(4):63–71
Yang DL, Yu JC, Chung YC (2001) Efficient compositing schemes for the sort-last-sparse parallel volume rendering system on distributed memory multicomputers. J Supercomput 18(2):201–220
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this work was appeared in IPDPS’01.
Rights and permissions
About this article
Cite this article
Lin, CF., Chung, YC. & Yang, DL. TRLE—an efficient data compression scheme for image composition of volume rendering on distributed memory multicomputers. J Supercomput 39, 321–345 (2007). https://doi.org/10.1007/s11227-006-0012-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-006-0012-5