| Tae-Young Kim and Yeong Gil Shin. An e#cient wavelet-based compression method for volume rendering. In Proceedings of the Seventh Pacific Conference on Computer Graphics and Applications, pages 147--156, Seoul, Korea, October 1999. |
....functions, arbitrary function values can be returned in constant time by an oracle. We also show that our data structure is nearly optimal with respect to space usage. 5.1. 2 Applications Recently, interest in lossy (volume) data compression with fast random access to decoded data has arisen [37, 46, 33, 71, 72, 4]. In Chapter 8 we show that lossy dictionaries are well suited for this purpose, providing lossy storage of the coe#cients of wavelet transformed data. Compared to the previously best methods in the literature [37, 71, 4] our lossy dictionary based volumetric compression scheme performs about ....
....a lookup table indexed by (i, j) is generated. Each entry in the table points to a runlength encoding of the coe#cients corresponding to k. If the renderer accesses the data in the k direction, e#cient rendering can be achieved. However, it is obvious that fast random access is not supported. In [46] Kim and Shin present a similar approach for fast volume rendering. The main di#erence is the way coe#cients are arranged into runs. They divide the volume into blocks that are coded separately. Each block is decomposed in a three dimensional wavelet basis. The thresholded coe#cients are then ....
[Article contains additional citation context not shown here]
Tae-Young Kim and Yeong Gil Shin. An e#cient wavelet-based compression method for volume rendering. In Proceedings of the Seventh Pacific Conference on Computer Graphics and Applications, pages 147--156, Seoul, Korea, October 1999.
....operations, such as I O s, is well known in the database community. It dates at least back to [18] which uses Bloom ltering for e cient management of di erent versions of databases. Recently, interest in lossy (volume) data compression with fast random access to decoded data has arisen [9, 11, 16, 17]. In [17] we show that lossy dictionaries are well suited for this purpose, providing lossy storage of the coe cients of wavelet transformed data. Compared to the previously best methods in the literature [9, 16] our lossy dictionary based scheme typically performs 80 better in terms of ....
Tae-Young Kim and Yeong Gil Shin. An ecient wavelet-based compression method for volume rendering. In Seventh Pacic Conference on Computer Graphics and Applications, pages 147156, 1999.
....To this end many advanced schemes, such as zero tree coding, have been developed. None of these schemes support access to a single pixel without decoding signi cant portions of the image. Recently, interest in fast random access to decoded data, accessing only a few wavelet coe cients, has arisen [8, 9, 14, 15]. In [15] we show that lossy dictionaries are well suited for this purpose. Based on our data structure for lossy dictionaries, we present a new approach to lossy storage of the coe cients of wavelet transformed data. The approach supports fast random access 0 500 1000 1500 2000 2500 3000 3500 ....
Tae-Young Kim and Yeong Gil Shin. An ecient wavelet-based compression method for volume rendering. In Seventh Pacic Conference on Computer Graphics and Applications, pages 147156, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC