Fast seismic data compression based on high-efficiency SPIHT

Based on the set positioning in hierarchical tree (SPIHT) algorithm, fast seismic data compression based on the high-efficiency SPIHT (HESPIHT) algorithm is presented. To verify the validity of the algorithm, 10 seismic cross-sections are selected for the experiment. The result shows that the algorithm can reserve the quality of data better, meanwhile improving the efficiency of encoding and decoding.

[1]  Sunil P. Khatri,et al.  GPU Architecture and the CUDA Programming Model , 2010 .

[2]  Wei Li,et al.  SPIHT Algorithm Combined with Huffman Encoding , 2010, 2010 Third International Symposium on Intelligent Information Technology and Security Informatics.

[3]  Wang Jun,et al.  Compressing seismic migration parameters by B-spline surface fitting , 2010, IEEE 10th INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS.

[4]  Wang Li-li,et al.  The new algorithm research of frequency sharing embedded zerotree wavelets encoding , 2010, 2010 5th International Conference on Computer Science & Education.