Scribd
Upload
32 views15 pages

Lossless Compression

The document proposes a novel lossless compression method for images using lifting schemes based on 2D discrete wavelet transforms. It aims to jointly remove inter-image and intra-image redundancy in the feature, spatial, and frequency domains. The method determines the prediction structure of each image collection using a feature domain distance measure and reduces disparity between images through global and local compensations in the spatial domain. It offers advantages like high throughput, less complexity, and more compression rate with higher clarity compared to existing techniques.

Uploaded by

Pradeep K
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
32 views15 pages

Lossless Compression

The document proposes a novel lossless compression method for images using lifting schemes based on 2D discrete wavelet transforms. It aims to jointly remove inter-image and intra-image redundancy in the feature, spatial, and frequency domains. The method determines the prediction structure of each image collection using a feature domain distance measure and reduces disparity between images through global and local compensations in the spatial domain. It offers advantages like high throughput, less complexity, and more compression rate with higher clarity compared to existing techniques.

Uploaded by

Pradeep K
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

OBJECTIVE

• The main objective of this project is to implement a


novel lossless compression method to further
reduce the size of a set of images.
ABSTRACT
• The proposed method jointly removes inter/intra
image redundancy in the feature, spatial, and
frequency domains. This project determine the
prediction structure of each image collection by a
feature domain distance measure The disparity
between images is then reduced by joint global and
local compensations in the spatial domain. Which is
presented in Cohen – Daubechies – Feauveau (CDF)
INTRODUCTION
• THe increasing number of digital photos on both
personal devices and the Internet has posed a big
challenge for storage. With the fast development and
prevailing use of handheld cameras, cost as well as
required photography skills are much lower than
before.
LITERATURE SURVEY
• According to Y. Tim Tsai, [1] in 1991-color image compression for Single-
Chip Cameras Single-chip cameras could be incorporated a CFA (color filter
array) on the sensor to obtain color information. Takio Kurita [2] in 1993
proposed a Method of Block Truncation Coding for Color Image
Compression. A BTC algorithm for color image compression and its mod-
ification were presented. Gaurav Sharma [3] in 1997 proposed a Digital
Color Imaging, procedure that provide, research in the area of digital color
imaging. Method proposed by A.N. Skodras [4] in 2001 was JPEG2000: The
upcoming still image compression standard With the increasing use of
multimedia technologies, image compression requires higher performance
as well as new features. S. Makrogiannis [5] in 2002 suggested Region
oriented compression of color images using fuzzy inference and fast
merging. The new region based lossy compression scheme for color
images was proposed.
DIS-ADVANTAGES
• 1. Still occupies more bandwidth
• 2. More computational time
• 3. More complexity
• 4. Can be applied for some particular group of
image's.
PROBLEM STATMEN
• The remote sensing image technology is growing for the
satellite communications. Due to huge size of the satellite
image data, there is an overhead in terms of storage capacity,
power consumption for the transmission so this is the major
challenge in this field. To overcome these issues in this work
we have proposed lifting scheme based image compression.
GENERAL ARCHITECTURE
Proposed architecture
lifting based dwt

• 2DDWT
H0 , G0
Lifting based method

consists 4 steps
• 1.decompose the data into even and odd
indexes.
• 2. Second step is to predict the correlation of
even and odd data.
• 3.After prediction step these coefficients need
to be updated which is done in third step
which is called updation.
• 4.The final step is to perform scaling on the
data.
prediction step:
Steps
• Feature domain determination of prediction
structure
• Spatial domain disparity compensation
• Frequency domain redundancy reduction
ADVANTAGES
• 1. High throughput
• 2. Less complexity
• 3. more compression rate with more clarity
APPLICATIONS
• 1. Radar
• 2. Biomedical
• 3. Telecommunications
• 4. Millitary
REFERENCES
• [1] Jian-wei Han; Jian-dong Fang, "Research on Remote Sensing Image
Compression Based on Lifting Wavelet Transform," in MultiMedia and
Information Technology, 2008.
• [2] Delaunay, X.; Chabert, M.; Charvillat, V.; Morin, G.; Ruiloba, R.,
"Satellite image compression by directional decorrelation of wavelet
coefficients," in Acoustics, Speech and Signal Processing, 2008.
• [3] Sahnoun, K.; Benabadji, N., "On-board satellite image compression
using the Fourier transform and Huffman coding," in Computer and
Information Technology (WCCIT) [4] Dawood, A.S.; Williams, J.A.; Visser,
S.J., "On-board satellite image compression using reconfigurable FPGAs,"
in Field-Programmable Technology, 2002. (FPT). Proceedings.

You might also like