Two algorithms for compressing noise like signals

Sos S. Agaian; Ravindranath Cherukuri; David Akopian

doi:10.1117/12.603797

25 May 2005 Two algorithms for compressing noise like signals

Sos S. Agaian, Ravindranath Cherukuri, David Akopian

Proceedings Volume 5809, Signal Processing, Sensor Fusion, and Target Recognition XIV; (2005) https://doi.org/10.1117/12.603797
Event: Defense and Security, 2005, Orlando, Florida, United States

Abstract

Compression is a technique that is used to encode data so that the data needs less storage/memory space. Compression of random data is vital in case where data where we need preserve data that has low redundancy and whose power spectrum is close to noise. In case of noisy signals that are used in various data hiding schemes the data has low redundancy and low energy spectrum. Therefore, upon compressing with lossy compression algorithms the low energy spectrum might get lost. Since the LSB plane data has low redundancy, lossless compression algorithms like Run length, Huffman coding, Arithmetic coding are in effective in providing a good compression ratio. These problems motivated in developing a new class of compression algorithms for compressing noisy signals. In this paper, we introduce a two new compression technique that compresses the random data like noise with reference to know pseudo noise sequence generated using a key. In addition, we developed a representation model for digital media using the pseudo noise signals. For simulation, we have made comparison between our methods and existing compression techniques like Run length that shows the Run length cannot compress when data is random but the proposed algorithms can compress. Furthermore, the proposed algorithms can be extended to all kinds of random data used in various applications.

Citation Download Citation

Sos S. Agaian, Ravindranath Cherukuri, and David Akopian "Two algorithms for compressing noise like signals", Proc. SPIE 5809, Signal Processing, Sensor Fusion, and Target Recognition XIV, (25 May 2005); https://doi.org/10.1117/12.603797

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
10 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Image compression

Binary data

Interference (communication)

Algorithm development

Computer simulations

Reconstruction algorithms

Neodymium

Show All Keywords

Keywords/Phrases

Search In:

Publication Years