Fast seismic data compression based on high-efficiency SPIHT

• Published in: Electronics letters Vol. 50; no. 5; pp. 365 - 367
• Main Authors: Xie, Kai, Bai, Zhijun, Yu, Wenmao
• Format: Journal Article
• Language: English
• Published: Stevenage The Institution of Engineering and Technology 27.02.2014; Institution of Engineering and Technology; John Wiley & Sons, Inc
• Subjects: Algorithms; Applied sciences; Coding, codes; Cross sections; Data compression; Decoding; Encoding; Exact sciences and technology; fast seismic data compression; geophysical prospecting; geophysics computing; high‐efficiency SPIHT algorithm; Image and vision processing and display technology; Information, signal and communications theory; Reserves; seismic cross‐sections; seismology; Signal and communications theory; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; Teletraffic; Trees; data compression; high-efficiency SPIHT algorithm; fast seismic data compression; seismology; geophysics computing; geophysical prospecting; encoding; seismic cross-sections; decoding; Positioning; Coding; Efficiency; Conflict resolution; Earthquakes; Data compression; Network management; Experimental study
• ISSN: 0013-5194; 1350-911X; 1350-911X
• DOI: 10.1049/el.2013.3834

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.