IMAGE PROCESSING AND

COMPRESSION TECHNIQUES
Abstract:
An image defined in the "real world" is considered to be a
function of two real variables say x,y.
Before going to processing an image, it is converted into
a digital form. Digitization includes sampling of image and
quantization of sampled values.After converting the image into bit
information, processing is performed.his processing technique
may be,
!. "mage enhancement
#. "mage reconstruction
$. "mage compression
Image enhancement refers to accentuation, or sharpening, of
image features such as boundaries.
Image restoration is concerned with filtering the observed
image to minimize the effect of degradations.
Image compression is concerned with minimizing the no of bits
required to represent an image.
Text compression CCITT GROUP! " GROUP#
Sti$$ image compression %PEG
&i'eo image compression MPEG
Introduction:
%odern digital technology has made it possible to manipulate
multi&dimensional signals with systems that range from simple
digital circuits to advanced parallel computers. he
goal of this manipulation can be divided into three categories'
!. "mage (rocessing image in &) image out
#. "mage Analysis image in &) measurements out
$. "mage *nderstanding image in &) high&level description out
"mage processing is referred to processing of a #D picture by a
computer.
(asic 'e)initions*
An image defined in the "real world" is considered to be a
function of two real variables, for example, a+x,y, with a as the
amplitude +e.g. brightness, of the image at the real coordinate
position +x,y,.An image may be considered to contain sub&
images sometimes referred to as regions&of&interest, -."s, or
simply regions. his concept reflects the fact that images
frequently contain collections of ob/ects each of which can be the
basis for a region. "n a sophisticated image processing system it
should be possible to apply specific image processing
operations to selected regions. hus one part of an image
+region, might be processed to suppress motion blur while
another part might be processed to improve
color rendition.
Se+,ence o) image processing*
Image sta-i$i.ing ang +,anti.ing*
he most requirements for image processing of images is that
the images be available in digitized form, that is, arrays of finite
length binary words. 0or digitization, the given "mage is sampled
on a discrete grid and each sample or pixel is quantized using
a finite number of bits. he digitized image is processed by a
computer. o display a digital image, it is first converted into
analog signal, which is scanned onto a display.
Samp$ing theorem*
A bandlimited image is sampled uniformly on a rectangular grid
with spacing dx,dy can be recovered without error from the
sample values f +mdx,ndy, provided the sampling rate is greater
than nyquist rate, that is

Image +,anti.ation*
he step subsequent to sampling in image digitization is
quantization. A quantizer maps a continuous variable u into a
discrete variable u!, which ta1es values from a finite set
2r!, r#3 rn4 of numbers. his mapping is generally a
staircase function 5 +,anti.ation r,$e is as follows'
Define 2t1, 16!,3,78!4 as a set of increasing transition or
decision levels with t! and t78! as minimum and maximum
values,respectively,of u. if u lies in intervals 9t1,t78!:, then it is
mapped to r1, the 1th reconstruction level.
he following quantizers are useful in image coding
techniques such as pulse code modulation +(;%,, differential
(;%, transform coding, etc., they are operate on one input
sample at a time, output value depends only on that input.
they are,
!. 77.<D&%A= >*A?"@A-
#. .("%*% %AA? B>*A-A *?"0.-% >*A?"@A-
PROCESSING TECHNIQUES:
!. "mage enhancement
#. "mage restoration
$. "mage compression etc.
/0 Image enhancement*
"t refers to accentuation, or sharpening, of image features
such as boundaries, or contrast to ma1e a graphic display more
useful for display 5 analysis. his process does not increase the
inherent information content in data."t includes gray level 5
contrast manipulation, noise reduction, edge crispening
and sharpening, filtering, interpolation and magnification,
pseudocoloring, and so on.
10 Image restoration*
"t is concerned with filtering the observed image to
minimize the effect of degradations. Affectiveness of image
restoration depends on the extent and accuracy of the
1nowledge of degradation process as well as on filter design.
"mage restoration differs from image enhancement in that the
latter is concerned with more extraction or accentuation of
image features.
Image compression*
"t is concerned with minimizing the no of bits required to
represent an image. Application of compression are in
broadcast C, remote sensing via satellite, military
communication via aircraft, radar, teleconferencing, facsimile
transmission, for educational 5 business documents,
medical images that arise in computer tomography, magnetic
resonance imaging and digital radiology, motion, pictures
,satellite images, weather maps, geological surveys and so on.
Compression Techniues:
!. 7ossless compression
#. 7ossy compression
2oss$ess compression*
"n this, data is not altered in process of compression or
decompression.Decompression generates an exact replica of an
original image. Dext compressionE is a good example.
Bpreadsheets, processor files usually contain repeated
sequence of characters. By reducing repeated characters to
count, we can reduce requirement of bits.
Frayscale5images contain repetitive information .this
repetitive graphic images and sound allows replacement of bits
by codes. "n color images, ad/acent pixels can have different
color values. hese images do not have sufficient repetitiveness
to be compressed. "n these cases, this technique is not
applicable.
7ossless compression techniques have been able to
achieve reduction in size in the range from !G!H to!GIH of
original uncompressed size.
Stan'ar's )or $oss$ess compression*
!. (ac1bit encoding +run&length encoding,
#. ;;" group $ !D
$. ;;" group $ #D
J. ;;" group J #D
I. 7empel&@iv and Kelch algorithm.
2oss3 compression*
"t is used for compressing audio, grayscale or color
images, and video ob/ects. "n this, compressing results in loss
of information. Khen a video image is decompressed, loss of
data in one frame will not perceived by the eye. "f several bits are
missing, information is still perceived in an acceptable manner
as eye fills in gaps in shading gradient.
Stan'ar's )or $oss3 compression*
!. Loint photographic experts Froup +L(AF,
#. %oving picture experts Froup +%(AF,
$. "ntel DC"
J. (MNJ video coding algorithm.
!inar" Ima#e Compression Schemes:
A binary image containing blac1 5 white pixels. A scanner
scans a document as sequential scanlines. During scanning, the
;;D array sensors of scanner capture blac1 5 white pixels
along a scanline. his process is repeated for next scanline
and so on.
Pac4-it enco'ing*
"n this, a consecutive repeated string of characters is replaced
by two bytes.
0irst byte6no of times the character is repeated.
Becond byte6character itself.
0or e.g., HHHHHH!!!!!!HHHH is represented as
Byte!, byte#, byte$3 byte?.HxHN, !xHN, HxHJ.
"n some cases, one byte is used to represent both value of
character 5 also no of times.
" "n this, one bit out of O used for representing pixel value, P
bits are for runlength. ypical compression efficiency is from
Q to!GI.
CCITT Gro,p ! /D*
Ruffman coding is used.
A$gorithm )or H,))man co'ing*
!. Arrange the symbols probabilities pi in decreasing order5
consider them as leaf nodes of a tree.
#. while there is more than one nodeS
#.!. %erge the two nodes with smallest probability to
form a new node whose
probability is the sum of two merged nodes.
#.#. Arbitrarily assign ! 5 H each pair of branches merging
into a node.
$. -ead sequentially from root to leaf node where symbol is
located. (robability of occurrence of a bit stream of length
-n is ( +n,. As a result, shorter codes were developed for less
frequent runlength.
0or e.g., from below table , runlength code for !N
white pixels is !H!H!H, while runlength code for !N blac1 pixels
is HHHHH!H!!!,since occurrence of !N white pixels is more than
that of !N blac1 pixels.
;odes greater than !PT# runlength is same for both pixels.
;;" Froup $ !D utilizes Ruffman coding to generate a set
of terminating codes 5 ma1e&up codes for given bit stream.
A.g., runlength of !$# where pixels are encoded by using,
%a1e&up code for !#O white pixels&!HH!H.
erminating code for Jwhite pixels&!H!!
Generating co'ing tree*
CCITT Gro,p ! 1D compression*
"t uses a D1&factorE where image is divided into a
several groups of 1&lines. 0irst line of every group of 1&
lines is encoded using CCITT Gro,p ! /Dcompression. A
1D scheme is used with!D scheme to encode rest of the lines.
Data )ormat )or 1D scheme*
#D&scheme uses a combination of pass code, vertical
code, and horizontal code. (ass code is HHH!.horizotal code is HH!.
Diff bGw pixel position in reference
lineAnd coding line
Certicalcode
$ HHHHH!H
# HHHH!H
! H!H
H !
&! H!!
&# HHHH!!
&$ HHHHH!!
Steps to co'e the co'ing $ine*
!. (arse the coding line and for change in pixel value.he
pixel value change if found at the location.
#. (arse the reference line and loo1 for change in pixel value.
he change is found at the b!&location.
$. 0ind the difference in locations b! 5 a!' Delta6b!&a!.
"f delta is in bGw &$ to 8$, apply vertical codes.
CCITT Gro,p # 1D compression*
"n this, first reference line is an imaginary all white line above the
top of image. he new line becomes reference for next scan line.
GRA$SCA%E&CO%OR I'AGE( STI%I'AGE
CO'PRESSION:
DCT *5 DISCRETE COSINE TRANS6ORM7
"n time domain, signal requires lots of data points to
represent the time in x&axis 5 amplitude in y&axis. .nce the
signal is converted into a frequency domain, only a few
data points are required to represent the same signal.
A color image is composed of pixelsS these pixels have -FB
values, each with its x 5 y coordinates using OMO matrixes. o
compress the gray scale in L(AF, each pixel is translated to
luminance. o compress color image, wor1 is $ times as much.
DCT8CA2CU2ATIONS*
?os in the above table represent amplitude of pixel in OMO
bloc1s. he tale# shows OMO matrixes, after applying D;. "n
table#, rowH, columnH has D; +i,/, as !P#, it is called as D;
component, others are called as A; component 5 it has largervalue
than others.
Q,anti.ation*
Baseline L(AF algorithm supports J quantization tables 5 #
Ruffman tables for
D;and A; D; coefficients.
>uantizedcoeff +i, /, 6D; +i, /,Gquantum +i, /,S
D;coefficients after quantization'
After quantization, L(AF elected to compress H values by utilizing
runlength scheme.o find no of Hs, L(AF uses zigzag manner.