MEMORY EFFICIENT and LESS

COMPLEX MULTIPLE DESCRIPTIVE

CODING BASED on SET PARTITIONED
EMBEDDED BLOCK CODER for IMAGE
COMMUNICATION OVER WIRELESS
CHANNELS
[1]
Santosh Kr. Mishra,
[2]
Dr.

R.K.Singh,
[3]
N.R.Kidwai,
[1]
Research Scholar IFTM ni!ersit",Morada#ad
[2]
$ro%essor De&t. 'lectronics 'ngg, KNIT,S(ltan&(r, India
[3]
De&t.
'lectronics ) *o++. 'ngg ,Integral ni!ersit",,(c-now, India
'+ail.
[1]
s-+ishra2/201g+ail.co+,
[2]
singhra!inder231g+ail.co+
[3]
nai+-idwai1g+ail.co+
Abstract -In this paper a new design approach for
embedded block coder for image is proposed .The
proposed method is based on the set portioning
embedded block coder (SPECK) algorithm, which is
highly flexible and its compression efficiency quite
competitive with other coders. In this method MDC
algorithm based on SPECK having memory efficient
and less complex are presented, suitable for real-time
applications of image communication over wireless
channels. Multiple Description Coding (MDC) is one of
the promising solutions for the image delivery over lossy
networks. In the MDC the reconstructed quality of
image will be improved as long as more descriptions are
received ,since in this method the lost description can be
estimated at receiver In the original SPECK coder
algorithm large dynamic memory is required (i.e. for
link lists), which is not suitable for memory constrained
portable devices. The proposed algorithm does not
require any dynamic memory, which also reduces
access time and complexity of coding /decoding.
Key wordsMDC,poly-phaseSampling, SPECK, Wavelet
Transform
.
I.INTRODUCTION
Since the co++(nication s"ste+s are design %or
in%or+ation interchange relia#l". D(e to &ac-et loss
and channel %ail(res in the wireless co++(nication
s"ste+s, the relia#le co++(nication is a &ro!en
challenge. The relia#ilit" o% the co++(nication
s"ste+ can #e achie!ed e%%ecti!el" #" (sing M(lti&le
Descri&ti!e 4MD5 coding sche+e. In this +ethod
+ore than one e6(all" i+&ortant descri&tions o%
so(rce are &rod(ced and si+(ltaneo(sl" trans+itted
o!er di%%erent channels, so that !ario(s reconstr(ction
6(alities are o#tained %ro+ di%%erent descri&tions
4s(#sets5 [1,2,3,/].The MD* +ethods which are in
(se, can #e di!ided #roadl" in two categories,
7andwidth8'%%icient and Non87andwidth8'%%icient
+ethods [2].In 7andwidth8e%%icient MD encoders the
inherent red(ndanc" o% the signal is (sed to esti+ate
to lost descri&tion and no e9tra red(ndanc" #its
#etween descri&tions are introd(ced. :ere the
di%%erent descri&tions are created #" di!iding the
do+ain o% the signal #e%ore or a%ter the
trans%or+ation [2].;hile, The controlled e9tra
red(ndanc" 4red(ndanc" which is not inherent in the
signal, #(t added to it5 #etween descri&tions are
introd(ced. The di%%erent wa"s can #e (sed %or
adding e9tra red(ndanc" in non8#andwidth8e%%icient
encoders. thro(gh o!erla&&ing side 6(anti<ers
4MDS=5 [>], %ra+e e9&ansions [3], correlating
trans%or+s [1] or %orward error correction 4F'*5 [3].
Since the non8#andwidth8e%%icient MD encoders
t"&icall" need +ore #andwidth and co+&(tational
&ower than the #andwidth8e%%icient MD encoders.
The #andwidth8e%%icient encoders are +ore s(ita#le
%or error &rone wireless channels and also %or +o#ile
ter+inals ha!ing less co+&(tational &ower. So the
low co+&le9it" and high e%%icient can #e an
a&&ro&riate a&&roach %or i+&le+enting MD coders in
wireless a&&lications.
In this &a&er a new less co+&le9 and +e+or"
e%%icient +(lti&le descri&ti!e i+age encoder %or
wireless a&&lications is &resented. The rest o% this
&a&er is organi<ed as %ollows. In section II related
wor-s and in section III linear Inde9ing is
descri#ed,I?s(ggested MD i+age encoder@decoder is
descri#edA which is hel& %(ll in sa!ing the d"na+ic
+e+or" d(ring coding %inall" in section ?
concl(sion are &resented
2. Related work
2.1. Multiple description coding
In the MD* two or +ore descri&tions are generated
#" di!iding the so(rce i+age into correlated #it
strea+s. The #it strea+s are inde&endentl"
decoda#le and also +(t(all" re%ina#le.These
descri&tions are then trans+itted se&aratel", thro(gh
di%%erent networ- &aths. :ere the MD i+age coding
is &ro+ising in wireless 4error &rone channel5
trans+ission, since there are correlations #etween the
recei!ed and lost descri&tions, so the lost descri&tion
can #e esti+ated at recei!er. So, as long as one or
+ore descri&tions arri!e at the recei!er acce&ta#le
6(alit" can #e reconstr(cted. The higher 6(alit" o%
the i+age can #e achie!ed as long as +ore
descri&tions are recei!ed.B MD* sche+e does not
re6(ire retrans+ission when &ac-age losses occ(r
(nless the losing rate is e9tre+el" high. That is wh"
the MD* is so &o&(lar. s(all" MD* is (sed %or two
a&&lications. .real ti+e co++(nications and red(cing
the co+&le9 o% networ- design. For real ti+e
co++(nications, s(ch as !ideo &hone or !ideo
con%erence, retrans+ission is not allowed in those
a&&lications. MD* doesnCt need %eed#ac- and
retrans+ission, and all the &ac-ages are e6(al.
Fig. 1 shows the &er%or+ance o% MD* and other
coding +ethods (nder the sa+e losing rate. It is
o#!io(s that the MD* +ethod &er%or+s +(ch #etter
than la"ered and non8la"ered coding +ethods
The MD* coders are +ainl" %oc(s on the +(lti&le
descri&tion 6(anti<ers and trans%or+ations [081D].
:ere the so+e resid(al in%or+ation is added in the
so(rce coding and #" which #etter reconstr(ction is
achie!ed in nois" trans+ission. 7(t there are so+e
li+its d(e to their low ca&a#ilit" in co+#ining with
the standard i+age coding technolog".
Fig.1. Comparisons of MDC and other coding methods 11]
The &ractical design iss(e in MD* is how to
introd(ce the red(ndanc" in controlled a+o(nt into
the di%%erent descri&tions, so that the decoder can
(tili<e it con!enientl".There are so +an" +ethods are
&ro&osed to generate +(lti&le descri&tion coding %or
trans+ission o% i+ages o!er wireless channels. In
[11],#" (sing a central 6(anti<er and an inde9
assign+ent a +(lti&le descri&tion scalar 6(anti<er
4MDS=5 is de!elo&ed, which generates two side
6(anti<ers s(ch that each o% the+ alone &rod(ces an
acce&ta#le side distortion, whereas their co+#ination
"ields the %iner central 6(anti<er. The MDS= is
as"+&toticall" near o&ti+al [12], and has #een
e+&lo"ed in e.g., [13] and [2], a%ter the D*T or
wa!elet trans%or+. :owe!er, the MDS= inde9
assign+ent is di%%ic(lt to design and i+&le+ent, and
its red(ndanc" is not eas" to adE(st.
In [1/], a +odi%ied MDS= 4MMDS=5 with the sa+e
as"+&totical &er%or+ance as the MDS= is
de!elo&ed, in which two staggered scalar 6(anti<ers
are (sed to generate the %irst la"er o% each
descri&tion. Bnother scalar 6(anti<er is (sed to
%(rther &artition the Eoint #ins o% the %irst8la"er
6(anti<ers, and its o(t&(t is s&lit into the two
descri&tions. The MMDS= a!oids the inde9
assign+ent and can easil" adE(st the red(ndanc". It
also o(t&er%or+s other MDS=8#ased +ethods in MD
i+age coding. :owe!er, #oth MDS= and MMDS=
do not &er%or+ well at low red(ndanc" regi+e, which
is a desired &ro&ert" o% good MD* sche+es [1].
Bnother %a+il" o% MD* sche+es is #ased on the
so(rce s&litting a&&roach &ioneered #" Fa"ant in,
where a signal is s&lit into e!en and odd sa+&les, and
D$*M is (sed to encoded each descri&tion. I% one
descri&tion is lost, the +issing data are &redicted
%ro+ their neigh#ors in the other descri&tion, (sing
the so(rce correlation. :owe!er, the &rediction errors
o% the +issing data are tied to the so(rce correlation,
which cannot #e controlled. In D$*M is (sed #e%ore
s&litting, and the &rediction in the D$*M is designed
to &reser!e so+e so(rce correlations. There%ore, the
red(ndanc" #etween the descri&tions can #e adE(sted
to so+e e9tent. Bltho(gh the +ethod red(ces the
inter descri&tion &rediction error, the re+aining error
still li+its the side decoder &er%or+ance, es&eciall" at
high rates.
2.2 Poly Phase Sampling
$ol"8&hase sa+&ling is an i+age trans%or+ation
which trans%or+s one i+age into %o(r8#ased i+ages,
s(ch as 1 to /, 1 to 1> and so %orth. The
e9a+&leshown in Fig. 2 is to trans%er one i+age into
%o(r i+ages. :ere, we ta-e %o(r &i9els as a set, and
+ar- the+ n(+#er1 to n(+#er /, res&ecti!el" on
e!er" s&eci%ic &osition and &lacing the &i9els which
ha!e the sa+e n(+#er in the sa+e %ra+es as shown
in Fig.2 .
Fig.2 Four pcctures after poly-phase sampling
2.3 The merging and splitting of bit streams
In order to achie!e an" n(+#ers o% descri&tions at
will and to trans%er !ia +(lti&le channels, a #it strea+
+erging and s&litting +ethod is &ro&osed in the
&a&er. The techni6(e contains two &rocesses.
+erging &rocess in encoding side and s&litting
&rocess in the decoding side The details are shown in
Fig. 3.
Figure 3(a). The combination of two descriptions
Figure 3 (b). The combination of three descriptions
2.4. Reconstruction
Reconstr(ction is the last ste& o% decoding side to %ill
(& the losing &i9els ca(sed #" &ac-age losses. Ta-e
Fig. / as an e9a+&le, ass(+e that the #rown &i9el is
the losing &i9el. Reconstr(ction is o#tained #" ta-ing
a!erage o% 3a#o!e &i9els and %illing in the losing
&i9el. This is a si+&le #(t an e%%ecti!e +ethod.
Figure 4. Reconstruction block diagram
3. Linear Indexing
B single n(+#er is (sed to re&resent the inde9 o% a
coe%%icient instead o% two in the linear inde9ing[22].
,et R G * G 2
N
#e the n(+#er o% rows and col(+ns o%
the s6(are i+age, and let r and c #e <ero8#ased row
and col(+n indices. Re&resent the row inde9 in
#inar" as, r G [r,rH1, . . . , r1, rD], where each o% the
rnis a #it, and %or the col(+n inde9 as c G [c,rH1, . . . ,
c1, cD].The linear inde9 is de%ined #" i G [r,rH1, c,rH1, .
. . , r1, c1, rD, cD]%or an inde9 4r, c5 . The #its o% r and c
are si+&l" interlea!ed. The linear inde9 I ranges %ro+
D to I H1, where I G R*. The linear inde9ing &ro&ert"
can #e (sed in the tree #ased #loc- coders %or
coe%%icient &ositioning as. The %irst inde9 i and set
length will s&eci%" the n(+#er o% coe%%icients o% the
set, where the i and I are the %irst inde9 and set length
res&ecti!el" %or a s6(are set. The si<e o% the set is
also e+#edded in %irst inde9 o% the set to #e
&rocessed in the S$'*K. The set length is gi!en #"
the highest integer &ower o% / #" which %irst inde9 i
o% the set is co+&letel" di!isi#le as gi!en in the
e6(ation 415.So the S$'*K algorith+ can #e
i+&le+ented witho(t (se o% list or +ar-ers
Ill(stration o% the linear inde9ing %or an 0J0 i+age
with 28le!el D;T 4discrete wa!elet trans%or+5 as
gi!en in Fig.2.
+ +
= I m I
i
to Su!e"t
m
m
)
/
], / +a9[
IK
D 1 2 3 / 2 > 3
0 0 1 4 5
1
6
1
7
2
0
2
1
1 2 3 6 7
1
8
1
9
2
2
2
3
2 8 9
1
2
1
3
2
4
2
5
2
8
2
9
3
1
0
1
1
1
4
1
5
2
6
2
7
3
0
3
1
Set o% &ositi!e integers
Set of Positive Integer (1)
4
3
2
3
3
3
6
3
7
4
8
4
9
5
2
5
3
5
3
4
3
5
3
8
3
9
5
0
5
1
5
4
5
5
6
4
0
4
1
4
4
4
5
5
6
5
7
6
0
6
1
7
4
2
4
3
4
6
4
7
5
8
5
9
6
2
6
3
(a) Linear index
Resolution Resolution
Level 1 Level 2
1 2
5
3 4
6 7
(b) subbands at different resolution levels
Sub bn! 1 2 3 4 5 6 7
Liner
In!e"
Rnge
0
to
3
4
to
7
8
to
1
1
1
2
to
1
5
1
6
to
3
1
3
2
to
4
7
4
8
to
6
3
Set lengt# 4 4 4 4
1
6
1
6
1
6
(c) linear indexing of each sub band and size.
Fig. 5 Illustration of linear indexing for an 8x8
image with 2-level DWT
4. Proposed MD image Algorithm:
The &ro&osed algorith+ is a no!el i+&le+entation o%
MD* #ased on S$'*K 7loc- *oder %or I+age
co++(nication o!er wireless channels %or real ti+e
a&&lication. Since MD* is (se%(l %or the real ti+e
a&&lications li-e !ideo con%erencing where the re8
trans+ission is not allowed. D(e to ra&id growth in
handheld@&orta#le de!ices in &resent scenario a lot o%
data, we ha!e to trans+it o!er wireless channels
where retrans+ission is not allowed 4e.g. !ideo
con%erencing5. 7(t d"na+ic +e+or", #atter" &ower
and &rocessing &ower are the +ain constrain %or the
hand held @&orta#le de!ices. So the original S$'*K
with the MD* #ased i+age coding %or the real ti+e
a&&lications will not #e s(ita#le %or the I+age@!ideo
co++(nication #etween &orta#le @ hand held de!ices.
In o(r &ro&osed algorith+ the MD i+age@?ideo
coding will #e ad!antageo(s %or real ti+e
co++(nications and list less S$'*K will not onl"
red(ce the +e+or" re6(ire+ent 4since here S$'*K
is i+&le+ented witho(t (se o% list or +ar-ers5 #(t
also less co+&le9 and re6(iring less ti+e %or
&rocessing.
Conclusions:
Since +" a&&roach is to de!elo& an e%%icient +ethod
to trans+it i+ages@!ideos #etween hand held@&orta#le
+(lti+edia de!ices thro(gh error &rone wireless
channels %or that I ha!e (sed MD* to o!er co+e the
&ro#le+ o% &ac-et loss d(e to congestion in tra%%ic or
d(e to the erroneo(s en!iron+ent o% wireless
channels. 7(t I ha!e to constrained with hand
held@&orta#le +(lti +edia de!ices li-e &rocessing
&ower , &ower #ac-(& and +e+or" ca&acit" &ro#le+.
So to sa!e the +e+or" linear inde9ing +ethod #ased
S$'*K coder +(st #e i+&le+ented which does not
re6(ire r(nning +e+or" that is +ore s(ita#le %or +"
a&&lications.
R'F'R'N*'S
18 L. ;ang, M.T. Mrchard, ?.B. ?aisha+&a"an, B.R. Rei#+an,
NM(lti&le Descri&tion *oding sing $airwise *orrelating
Trans%or+sO, I''' Trans. I+age $rocessing, ?ol. 1D, No. 3,
March 2DD1.
28 S. D. Ser!etto, K. Ra+chandran, ?.B ?aisha+&a"an, NM(lti&le
Descri&tion ;a!elet 7ased I+age *odingO, I''' Trans. I+age
$rocessing, ?ol. P, No. 2, Ma" 2DDD.
38 ?. K. Qo"al, F. Ko!ace!ic, NQenerali<ed M(lti&le Descri&tion
*oding ;ith *orrelating Trans%or+sO, I''' Trans. In%or+ation
Theor", ?ol. /3, No. >, Se&te+#er 2DD1.
/8 ?. K. Qo"al, NM(lti&le Descri&tion *oding. *o+&ression Meets
the Networ-O, I''' Signal $rocessing Maga<ine, Se&te+#er 2DD1.
28 I. ?. 7aEic, F.;. ;oods, NDo+ain 7ased M(lti&le Descri&tion
*oding o% I+age and ?ideoO, I''' Trans. I+age $rocessing, ?ol.
12, No. 1D, Se& 2DD3.
>8 ?.B. ?aisha+&a"an, NDesign o% M(lti&le Descri&tion Scalar
=(anti<ers, I''' Trans. In%or+ation Theor", ?ol. 3P, &&. 0218
03/, Ma" 1PP3.
38 R. $(ri, K. Ra+chandran, NM(lti&le Descri&tion So(rce
*oding(sing Forward 'rror *orrection *odesO, in $roc.
33rdBsilo+ar*on% on Signal, S"ste+s, and *o+&(ters, $aci%ic
Qro!e, *B, Mct 1PPP.
08 S. Shirani, M. Qallant, and F. Kossentini, RM(lti&ledescri&tion
i+age coding (sing &re8 and &ost8&rocessingR,I''' International
*on%erence on In%or+ation Technolog",2DD1, ,as ?egas, N?,
SB, &&. 3283P.
P8,.;ang, M.N.S. Swa+", M.M Bh+ad, RM(lti&ledescri&tion
i+age coding (sing &i9el interlea!ing andwa!elet trans%or+R,
Midwest S"+&osi(+ on *irc(its andS"ste+s, B(g(st 2DD2,
M-laho+a, SB, &&. 2328230
1D8 L. ;ang, M. Mrchard, and B. Rei#+an, RM(lti&ledescri&tion
i+age coding %or nois" channel #" &airingtrans%or+ coe%%icientsR,
I''' ;or-sho& on M(lti+ediaSignal $rocessing, Fan(ar" 1PP3,
&&. /1P8/2/
118 ?. B. ?aisha+&a"an, NDesign o% +(lti&le descri&tion scalar
6(anti<ers,OIEEE Trans. Inf. Theory, !ol. 3P, no. 3, &&. 021S03/,
Ma"1PP3.
128 ?. B. ?aisha+&a"an and F.8*.7atllo, NBs"+&totic anal"sis o%
+(lti&le descri&tion 6(anti<ers,O IEEE Trans. Inf. Theory, !ol. //,
no. 1, &&.230S20/, Fan. 1PP0.
138 F.8*. 7atllo and ?. B. ?aisha+&a"an, NBs"+&totic
&er%or+ance o% +(lti&le descri&tion trans%or+ codes,O IEEE
Trans. Inf. Theory, !ol. /3, no. 2, &&. 3D3S3D3, Mar. 1PP3.
1/8 *. Tian and S. S. :e+a+i, NB new class o% +(lti&le
descri&tion scalar 6(anti<er and its a&&lication to i+age coding,O
IEEE Signal Pro"ess.#ett., !ol. 12, no. /, &&. 32PS332, B&r. 2DD2.