2014
DOI: 10.1049/el.2013.3834
|View full text |Cite
|
Sign up to set email alerts
|

Fast seismic data compression based on high‐efficiency SPIHT

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 5 publications
0
7
0
Order By: Relevance
“…The popularity of the wavelet based coding scheme could be found in its efficient data representation in the transformed domain which easily allows compressed image manipulation, e.g., by utilizing straightforward quality control scheme or progressive image decompression. One such effective coding scheme, based on set partitioning in hierarchical trees (SPIHT), was recently adopted to seismic data in [10], and also partially adopted by methods in [5].…”
Section: A Related Work On Lossy Seismic Data Compressionmentioning
confidence: 99%
See 1 more Smart Citation
“…The popularity of the wavelet based coding scheme could be found in its efficient data representation in the transformed domain which easily allows compressed image manipulation, e.g., by utilizing straightforward quality control scheme or progressive image decompression. One such effective coding scheme, based on set partitioning in hierarchical trees (SPIHT), was recently adopted to seismic data in [10], and also partially adopted by methods in [5].…”
Section: A Related Work On Lossy Seismic Data Compressionmentioning
confidence: 99%
“…To reach a solution that will not require look-up table, and thus relaxing memory requirements, we compare our newly obtained λ value with previous ones given by (10). We propose to compensate the large values of λ old when Q p > 51 and hence provide better compromise between D and R. We refer λ after we apply compensation as λ new , and we assume that it is still in the form of k * 2…”
Section: G Rate-distortion Optimization -A New Model For the Lagrangmentioning
confidence: 99%
“…With the increasing pace of people’s exploration of the objective world, the 3D seismic exploration technology is also gradually in-depth, but if the SNR of 3D seismic signal is low, it will affect the follow-up signal processing and interpretation work, which may lead to a large miscalculation. Therefore, it is of practical significance to study efficient 3D seismic signal denoising algorithm [ 12 ].…”
Section: Introductionmentioning
confidence: 99%
“…This paper proposes a new image preprocessing method named GBS and a medical invoice recognition algorithm which combines CNN and RNN together, in order to recognize medical invoices, which greatly improves the performance of medical invoice recognition, after having studied the existing achievements in signal processing and deep learning in our laboratory [50,51,52]. In the algorithm combining the Alexnet with Adam optimization algorithm, using the Adam optimization algorithm can make the network convergence fast and reduce the loss of the advantages of network training, greatly improving the recognition rate.…”
Section: Introductionmentioning
confidence: 99%