In this paper, we describe a compression scheme for volumetric video data(3D space 1D time) where each frame of the volume is decompressed and rendered in real-time. Since even one frame size of volume is very large, run-time decompression can be a bottleneck for real-time playback of time-varying volume data. To increase the run-time decompression speed and compression ratio, we decompose the ...

Compression allows scalable storage of large amounts of data and alleviates the I/O bottleneck for dataintensive applications. Over the years, a large number of compression algorithms have been developed to support various data types. Our goal is to develop a generic tool that helps quickly and accurately decide what compression scheme(s) best match the constraints and expectations of users wit...

In deep communications systems bandwidth availability, storage and computational capacity play a crucial role and represent precious, as well as limited, communications resources. Starting from this consideration, high efficient image compression coding algorithms may represent a key solution to optimize the resources employment. In this paper two possible approaches have been considered: JPEG2...

Different methods for compressing trees are surveyed and developed. Tree compression can be seen as a trade-off problem between time and space in which we can choose different strategies depending on whether we prefer better compression results or more efficient operations in the compressed structure. Of special interest is the case where space can be saved while preserving the functionality of...

Background & Importance: Primary hemifacial spasm is usually caused by microvascular compression of the facial nerve at its root exit zone at brainstem without any space-occupying pathology. Secondary or so-called symptomatic hemifacial spasm has an additional underlying pathology e.g. tumors leading to the microvascular compression. We review and discuss the pathophysiology and the literature ...

Padded-sorting is a task of placing input items in an array in a nondecreasing order, but with free space between consecutive elements allowed. For many applications, padded-sorting is as useful as sorting. Approximate compaction and compression are closely related problems. It is known that time complexity of padded-sorting on randomized CRCW PRAMs is dramatically lower than time complexity of...