Results 1 
2 of
2
TRLE  an efficient data compression scheme for image composition of parallel volume rendering systems
 In Proceedings of the First International Symposium on Cyber Worlds (CW’02
, 2002
"... In this paper, we present an efficient data compression scheme, the template runlength encoding (TRLE) scheme, for image composition of parallel volume rendering systems. 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 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
In this paper, we present an efficient data compression scheme, the template runlength encoding (TRLE) scheme, for image composition of parallel volume rendering systems. 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 nonblank pixel, there are 16 templates in a block. To compress an image, the TRLE scheme uses the templates to encode blocks row by row. Blocks in the same row are encoded as a TRLE_sequence. By packing all TRLE_sequences in a packet, the packet is the compressed partial image that can be sent/received among processors. 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 binaryswap (BS), the parallelpipelined (PP), and the rotatetiling (RT) 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 a PC cluster. The data computation time and the data communication time are measured. The experimental results show that the TRLE data compression scheme with the RT data communication scheme outperforms other eleven image composition methods.
A RotateTiling Image Compositing Method for SortLast Parallel Volume Rendering Systems on Distributed Memory Multicomputers *
, 2003
"... The binaryswap (BS) and the parallelpipelined (PP) methods are two wellknown image compositing methods for sortlast parallel volume rendering systems. However, these two methods either restrict the number of processors to a poweroftwo or require many communication steps to transform image data ..."
Abstract
 Add to MetaCart
The binaryswap (BS) and the parallelpipelined (PP) methods are two wellknown image compositing methods for sortlast parallel volume rendering systems. However, these two methods either restrict the number of processors to a poweroftwo or require many communication steps to transform image data that results in high data communication overheads. In this paper, we present an efficient image compositing method, the rotatetiling (RT) method, for sortlast parallel volume rendering systems on distributed memory multicomputers. According to the number of initial blocks of a partial image, the number of processors, the image sizes, and the characteristics of parallel machines, the RT method can fully utilize all available processors and minimize the data communication overheads. To evaluate the performance of the RT method, both theoretical analysis and experimental test of the BS, the PP, and the RT methods are conducted. In the theoretical analysis, we derive the best performance bound of the RT method in terms of the number of initial blocks of a partial image, the number of processors, the image sizes, and the characteristics of parallel machines. In the experimental test, we implemented these three image compositing methods on an IBM SP2 parallel machine and a PC cluster. The experimental results show that the RT method outperforms the BS and the PP methods for all test samples and match the results analyzed in the theoretical analysis.