A DH-KSVD Algorithm for Efficient Compression of Shock Wave Data

To address low training efficiency and poor reconstruction in traditional K Singular Value Decomposition (KSVD) for compressive sensing of shock wave signals, this study proposes an improved algorithm, DH-KSVD, integrating dynamic pruning and hybrid coding. The dynamic pruning mechanism eliminates redundant atoms according to their contributions and adaptive thresholds, while incorporating residual features to enhance dictionary compactness and training efficiency. The hybrid sparse constraint integrates the sparsity of ℓ0-Orthogonal Matching Pursuit (OMP) with the noise robustness of ℓ1-Least Absolute Shrinkage and Selection Operator (LASSO), dynamically adjusting their relative weights to enhance both coding quality and reconstruction stability. Experiments on typical shock wave datasets show that, compared with Discrete Cosine Transform (DCT), KSVD, and feature-based segmented dictionary methods (termed CC-KSVD), DH-KSVD reduces average training time by 46.4%, 31%, and 13.7%, respectively. At a Compression Ratio (CR) of 0.7, the Root Mean Square Error (RMSE) decreases by 67.1%, 65.7%, and 36.2%, while the Peak Signal-to-Noise Ratio (PSNR) increases by 35.5%, 39.8%, and 11.8%, respectively. The proposed algorithm markedly improves training efficiency and achieves lower RMSE and higher PSNR under high compression ratios, providing an effective solution for compressing long-duration, transient shock wave signals.