Application of matrix multiplication in signal sensor image perception

Abstract

LOT wireless sensor nodes are limited by physical factors, usually have weak computing power and endurance, and wireless communication methods are very vulnerable to information theft. Therefore, it is of great significance to ensure the safe and efficient transmission of images in new application scenarios. In view of the need for an efficient image transmission, this paper combines compressed sensing technology with p-tensor product theory, applies the above theory to distributed wireless sensor networks, and uses the correlation of adjacent sensor nodes in wireless sensor networks to propose an improved a joint sparse model for measurement matrices and reduction algorithms. The feasibility is verified by simulation experiments, and the comparison between joint reconstruction and single reconstruction, and the application of various algorithms in other algorithms is carried out, and the actual completion time and storage capacity are analysed. The minimum completion time for wavelet transform is 1.29, the sparse estimated time for the selection of preliminary P waves is 0.07 and the compressed sensing time is 0.20. The maximum completion time for wavelet transform was 1.32, for sparse estimation, it is 0.62, for preliminary P-wave selection, it is 0.17, and for compressed sensing, it is 0.88. The processing time is no >3 s and the runtime is only 0.22–0.88 s. The results show that compared with the compressed sensing of a single node, the joint sparse model based on distributed compressed sensing has a smaller reconstruction error, and can achieve high-precision signal reconstruction when the measurement value is small.

Keywords

• matrix multiplication
• wireless sensor networks
• measurement matrices
• distributed compressed sensing