An underwater acoustic data compression method based on compressed sensing

Abstract

The use of underwater acoustic data has rapidly expanded with the application of multichannel, large-aperture underwater detection arrays. This study presents an underwater acoustic data compression method that is based on compressed sensing. Underwater acoustic signals are transformed into the sparse domain for data storage at a receiving terminal, and the improved orthogonal matching pursuit (IOMP) algorithm is used to reconstruct the original underwater acoustic signals at a data processing terminal. When an increase in sidelobe level occasionally causes a direction of arrival estimation error, the proposed compression method can achieve a 10 times stronger compression for narrowband signals and a 5 times stronger compression for wideband signals than the orthogonal matching pursuit (OMP) algorithm. The IOMP algorithm also reduces the computing time by about 20% more than the original OMP algorithm. The simulation and experimental results are discussed.

Keywords

compressed sensing / underwater acoustic signal / compression ratio / improved orthogonal matching pursuit (IOMP)

References

[1] SayoodKIntroduction to data compression [M], 2006United StatesNewnes Press

[2] JainA KA fast Karhunen-Loeve transform for a random processes [M]., 1974, 24: 1023-1029

[3] TurczaP, DuplagaM. Low-Power image compression for wireless capsule endoscopy [C]//. IEEE International Workshop on Imaging Systems and Techniques-IST, 20071-4

[4] MoY B, QiuY B, LiuJ Z, LingY X. A data compression algorithm baseed on adaptive huffman code for wireless sensor networks [C]//. Intelligent Computation Technology and Automation (ICICTA), 20113-6

[5] ShenY-c, GuanY-j, WangF, LunZ-xin. The investigation of image compress coding based on wavelet transformation [C]//. International Conference on Future Information Technology and Management Engineering, 2010324-326

[6] BergerC R, ZhouS L, PreisigJ C. Sparse channel estimation for multicarrier underwater acoustic communication: From subspace methods to compressed sensing [J].. IEEE Transactions on Signal Processing, 2010, 58(3): 1708-1721

[7] DonohoD L. Compressed sensing [J].. IEEE Transactions on Information Theory, 2006, 52(4): 1289-1306

[8] TroppJ A, GilbertA C. Signal recovery from random measurements via orthogonal matching pursuit [J].. IEEE Transactions on Information Theory, 2007, 53(12): 4655-4666

[9] BoashashB, O'sheaP. A methodology for detection and classification of some underwater acoustic signals using timefrequency analysis techniques [J].. IEEE Transactions on Acoustics, Speech and Signal Processing, 1990, 38(11): 1829-1841

[10] CandesE J, TaoT. Near-optimal signal recovery from random projections: universal encoding strategies [J].. IEEE Transactions on Information Theory, 2006, 52(12): 5406-5425

[11] DavenportM A, WakinM B. Analysis of orthogonal matching pursuit using the restricted isometry property [J].. IEEE Transactions on Information Theory, 2010, 56(9): 4395-4401

[12] ZhangG-s, JiaoS-h, XuX-l, WangLan. Compressed sensing and reconstruction with bernoulli matrices [C]//. IEEE International Conference on Information and Automation, 2010455-460

[13] GanL, LiK-z, LingCong. Golay meets hadamard: Golaypaired hadamard matrices for fast compressed sensing [C]//. IEEE Information Theory Workshop, 2012637-641

[14] TangG-l, QiuY-ming. Improved least square method apply in ship performance analysis [C]//. International Conference on Advanced Computer Theory and Engineering (ICACTE), 2010594-596

[15] MarquardtD W. An algorithm for last-squares estimation of nonlinear parameters [J].. Journal of the Society for Industrial and Applied Mathematics, 1963, 11(2): 431-441

[16] LiL-z, ZouB-j, ZhuC-zhang. Improved nonconvex optimization model for low-rank matrix recovery [J].. Journal of Central South University, 2015, 22(3): 984-991