中文摘要：

与体积尺寸增加，开发一个高度有效的压缩算法是必要的，它对在数据服务者和浏览的顾客之间的进步精炼合适。为三维的大卷数据，一个有效层次算法基于小浪压缩被介绍，用小浪系数的 intra 乐队相关性。第一，在适用以后，堵住明智的层次小浪分解到大卷数据，块意义地图被使用一位显示块的意义或无意义获得。第二，如果任何重要系数在它存在，系数块进一步被细分进八亚块，并且这个过程被重复导致 incompleteoctree。一位被用来显示意义或无意义，并且仅仅重要的系数在数据溪流被存储。最后，重要系数被编码的算术确定并且压缩。试验性的结果证明建议算法完成好压缩率并且适合数据块的随机的存取。结果 alsos 怎么建议算法能被用于 3D 卷数据的进步传播。

英文摘要：

With volume size increasing, it is necessary to develop a highly efficient compression algorithm, which is suitable for progressive refinement between the data server and the browsing client. For three-dimensional large volume data, an efficient hierarchical algorithm based on wavelet compression was presented, using intra-band dependencies of wavelet coefficients. Firstly, after applying blockwise hierarchical wavelet decomposition to large volume data, the block significance map was obtained by using one bit to indicate significance or insignificance of the block. Secondly, the coefficient block was further subdivided into eight sub-blocks if any significant coefficient existed in it, and the process was repeated, resulting in an incomplete octree. One bit was used to indicate significance or insignificance, and only significant coefficients were stored in the data stream. Finally, the significant coefficients were quantified and compressed by arithmetic coding. The experimental results show that the proposed algorithm achieves good compression ratios and is suited for random access of data blocks. The results also show that the proposed algorithm can be applied to progressive transmission of 3D volume data.