\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Improving Embedded Image Coding Using Zero Block -Quad Tree},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2012-03-15 (revised: 15 March 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-03-15}
\title{Improving Embedded Image Coding Using Zero Block -Quad Tree}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Ms. Daggumati  Rajani}

             \author[2]{Dr. S.China  Venkateswarlu}

             \author[3]{  V.Sridhar}

             \affil[1]{  VJIT/JNTUH}

\renewcommand\Authands{ and }

\date{\small \em Received: 10 February 2012 Accepted: 3 March 2012 Published: 15 March 2012}

\maketitle


\begin{abstract}
        


The traditional multi-bitstream approach to the heterogeneity issue is very constrained and inefficient under multi bit rate applications. The multi bitstream coding techniques allow partial decoding at a various resolution and quality levels. Several scalable coding algorithms have been proposed in the international standards over the past decade, but these former methods can only accommodate relatively limited decoding properties. To achieve efficient coding during image coding the multi resolution compression technique is been used. To exploit the multi resolution effect of image, wavelet transformations are devolved. Wavelet transformation decompose the image coefficients into their fundamental resolution, but the transformed coefficients are observed to be non-integer values resulting in variable bit stream. This transformation result in constraint bit rate application with slower operation. To overcome stated limitation, hierarchical tree based coding were implemented which exploit the relation between the wavelet scale levels and generate the code stream for transmission.

\end{abstract}


\keywords{bit level scalable codecs, ezbc, image, wavelet transformations, wavelet scale.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Improving Embedded Image Coding Using Zero}]{Improving Embedded Image Coding Using Zero}\par
Block -Quad Tree S.China Venkateswarlu ? , Ms.Daggumati Rajani ? \& V.Sridhar ? Abstract -The traditional multi-bitstream approach to the heterogeneity issue is very constrained and inefficient under multi bit rate applications. The multi bitstream coding techniques allow partial decoding at a various resolution and quality levels. Several scalable coding algorithms have been proposed in the international standards over the past decade, but these former methods can only accommodate relatively limited decoding properties. To achieve efficient coding during image coding the multi resolution compression technique is been used. To exploit the multi resolution effect of image, wavelet transformations are devolved. Wavelet transformation decompose the image coefficients into their fundamental resolution, but the transformed coefficients are observed to be non-integer values resulting in variable bit stream. This transformation result in constraint bit rate application with slower operation. To overcome stated limitation, hierarchical tree based coding were implemented which exploit the relation between the wavelet scale levels and generate the code stream for transmission. This work focus on the realization of an enhanced zero tree based block-coding architecture called Embedded Zero block Coding And Context Modeling (EZBC) with low complexity and high performance. The proposed algorithm utilizes the significance state-table forming the Introduction he rapid growth of digital imaging technology in conjunction with the ever-expanding array of access technologies has lead to a new set of requirements for image compression algorithms. Not only are high quality reconstructed images required at medium-low bitrates, but as the bitrate decreases, the quality of the reconstructed image should degrade gracefully. The traditional multi-bitstream solution to the issue of widely varying user resources is both inefficient and rapidly becoming impractical. The bitlevel scalable codecs developed for this dissertation allow optimum reconstruction of an image from an arbitrary truncation point within a single bitstream. That is, the encoder is effectively isolated from the decoder and the target decode rate need not be known at encode time. The discrete wavelet transform is utilized to provide a multiresolution decomposition of an image. A wavelet coefficient's magnitude is then directly proportional to the fidelity of the reconstructed image. To exploit this in a scalable manner, a progressive bitplane transmission scheme is utilized. Each bitplane is represented by means of a significance map. It is the efficiency of representation of the significance map that this dissertation explores.An important characteristic underlying the design of image processing systems is the significant level of testing and experimentation that normally is required before arriving at an acceptable solution. This characteristic implies that the ability to formulate approaches and quickly Prototype candidate solutions generally plays a major role in reducing the cost and time required to arrive at available system implementation.\par
An image may be defined as a two-dimensional function, ( , ) f x y , where x and y are spatial coordinates, and the amplitude of f at any pair of coordinates (x,y) is called the intensity or gray level of the image at that point. When x, y, and the amplitude values of f are all finite, discrete quantities, we call the image a digital image. The field of digital image processing refers to processing digital images by means of a digital computer. A digital image is composed of a finite number of elements, each of which has a particular location and value. These elements are referred to as picture elements, image elements, pels, and pixels. Pixel is the term most widely used to denote the elements of a digital image Vision is the most advanced of our sense, so it is not surprising that images play the single most important role in human perception. However, unlike humans, who are limited to the visual band of the electromagnetic (EM) spectrum, imaging machines cover almost the entire EM spectrum, ranging from gamma to radio waves. They can operate also on images generated by sources that humans are not accustomed to associating with images. These include ultrasound, electron microscopy, and computergenerated images. Thus digital image processing encompasses a wide and varied field of applications.\par
Digital imagery has had an enormous impact on industrial, scientific and computer applications. It is no surprise that image coding has been a subject of great commercial interest in today's world. Uncompressed digital images require considerable storage capacity and transmission bandwidth. Efficient image compression solutions are becoming more critical with the recent growth of data intensive, multimedia-based web applications. 
\section[{II.}]{II.} 
\section[{Image coding algorithm}]{Image coding algorithm}\par
In the previous two chapters it has been established that the building blocks required to achieve the stated research targets include the discreet wavelet transform, bitplane progressive scalar quantization and adaptive arithmetic entropy coding. Each bitplane is represented by means of a significance map. It is the efficiency of representation of this map that determines the compression performance. Sets composing the significance maps can be classified as "Tree", "Block" or "Hybrid" based. This chapter reviews the most influential literature in each classification that has helped shape the current state-of-the-art of bitplane progressive image compression Efficient image compression solutions Image Coding Algorithm : In the section and previous it has been established that the building blocks required to achieve the stated research targets include the discreet wavelet transform, bitplane progressive scalar quantization and adaptive arithmetic entropy coding. Each bitplane is represented by means of a significance map. It is the efficiency of representation of this map that determines the compression performance. Sets composing the significance maps can be classified as "Tree", "Block" or "Hybrid" based. This chapter reviews the most influential literature in each classification that has helped shape the current state-of-the-art of bitplane progressive image compression The algorithm maintains three lists: LIP List of Insignificant Pixels.LSP List of Significant Pixels.LIS List of Insignificant Sets.The LIP and LSP contain nodes (2D matrix coordinates) of single coefficients, while the LIS contains nodes that are the roots of spatial orientation trees. The Offspring set, O (i, j), contains the direct offspring of the node at coordinates (i, j), that is the four coefficients at the same spatial location in the next level of the pyramid. Except at the highest and lowest pyramid levels, the offspring set is defined as:O(i, j) = \{(2i, 2j), (2i, 2j + 1), (2i + 1, 2j), (2i + 1, 2j + 1)\} (3.1)Nodes at the lowest level have no offspring and nodes at the highest level are grouped into 2x2 blocks whereby the upper left coefficient has no offspring. Figure  {\ref 3}.3 shows the parent-offspring relationship and the set definitions for a three level decomposition. It is essentially the same as EZW except in the way that the offspring of trees in the root subband are defined. The algorithm consists of four stages, the last three of which are repeated; initialization, sorting pass, refinement pass and quantization step update. The algorithm is initialized by adding all coe ficients in the lowest frequency subband to the LIP, and all those with offspring. EBCOT. The EBCOT algorithm introduces a number of new developments to the wavelet bitplane coding family. Compression to a specific rate is achieved as a two-tier process. The image is first compressed using a coding engine which does not consider the target bitrate, the second tier post processes the bitstream to produce a rate-distortion optimized bitstream for a specific rate. In EBCOT, each subband is partitioned into relatively small blocks of samples, called code-blocks. Each code-block is coded independently to produce an embedded bitstream for that block. Truncation points are marked in the embedded bitstream for each block and its contributions to overall distortion reduction is noted. The tier two algorithms select various truncation points from each block to construct the optimum bitstream for a given bitrate. The downside of the scheme is that for each desired embedded rate, truncation points have to be marked in each code block. EBCOT can approximate a true embedded scheme by selecting a large number, e.g. 50, truncation points for each codeblock but the overhead associated with signaling the location and contributions from each truncation point has a negative effect on performance. EBCOT is essentially a bitplane coder. Code-blocks that contain significance relative to the current threshold are identified using a conventional quadtree coding approach. The size of the code-block is decided at compile time but is typically 16 × 16. Thereafter, individual coefficients in a code-block are identified as significant/ insignificant using a combination of coding primitives and context models. A context is chosen for each coefficient considering eight neighbors. Both sign bits and refinement bits are also arithmetically coded. Fractional bitplane coding is achieved using four passes for each bitplane. This increases computation but if the target bit rate is reached mid bitplane the advantage of fractional bitplane coding is that a better performance is achieved. Image compression systems are composed of two distinct structural blocks: an encoder and a decoder. Image ( , ) f x y is fed into the encoder, which creates a set of symbols from the input data and uses them to represent the image. If we let 1 n and 2 n denote the number of information carrying units (usually bits) in the original and encoded images, respectively, the compression that is achieved can be quantified numerically via the compression ratio III. 
\section[{Embedded coding}]{Embedded coding}\par
The performance of an embedded image coding system significantly relies upon the efficiency of the entropy coder used for compression of bitplane data. The various bitplane compression algorithms in the literature can be loosely categorized into two The hierarchical set partitioning is block entropy coding scheme .The energy clustering nature of subband coefficients is exploited by joint coding of bitplane data in blocks. With large numbers of samples tested and coded in groups, this class of coders has excellent speed and compression performance. Nevertheless, ever since publication of the benchmark work SPIHT by Said and Pearlman, we have not seen any significant and consistent advancement of this technique in compression presented in the literature, to author's knowledge, despite numerous research attempts. The context-based sequential bitplane coding is a conditional entropy coding scheme. The strong statistical dependencies of subband coefficients are effectively captured by the modeling contexts. With the elaborate high-order modeling scheme, the wavelet bitplane coder proposed by Wu reports the significant PSNR improvement over the best existing setpartitioning coders in the literature. Nevertheless, unlike the set-partitioning coder, the sequential bitplane coder processes and encodes the individual bitplane data sample by sample. Every pixel typically has to be visited at least once to finish a full bitplane coding pass, hence with an implied higher computational cost. Given the distinctive features of the two embedded coding schemes, it is certainly desirable to have an image coding system which combines these two powerful techniques and takes advantage of their respective strength at the same time. The proposed EZBC algorithm was developed to answer this challenge. It also adopts the set partitioning approach in the bitplane coding framework. However, instead of the classical zerotree coding scheme, it utilizes the more recent zeroblock coding scheme for hierarchical coding of wavelet coefficients. The development of EZBC is motivated by the experimental observation that strong dependency exists not only among subbands coefficients but also among quadtree nodes from quadtree representations of the subbands. Fig.  {\ref 3}.1 displays the MSB maps (indicating the bit indexes of the MSB's of individual quadtree nodes) of the quadtrees built up from the individual subbands of the decomposed Lena image. Each quadtree node Q (i, j) is a basic zero set for grouping of insignificant coefficients and contains all coefficients from a block region as members. The value of the quadtree node is defined to be the maximal magnitude of its members. Interestingly enough, another pyramidal image description is thus provided by the individual quadtree levels, as shown in Fig.  {\ref 3}.1, in addition to the original subband pyramid generated by the wavelet transform. Self-similarity is clearly exhibited in such a multiresolution data representation across both resolution and quadtree levels. The image features, e.g., edges and contours can be easily identified in different hierarchies of the wavelet transform domain. The proposed EZBC algorithm is the first attempt to explore such rich dependency existent in quadtree representation of a decomposed image. With special care given to the design of the context modeling strategy, it is demonstrated in our experimental results that the compression performance of the set partitioning coder can be substantially improved. As it will become clear, EZBC can be thought of as a hybrid coding algorithm which aims at attaining the theoretical bound of coding bitrate (entropy rate) by joining block entropy coding and conditional entropy coding approaches.\par
The development of the EZBC image coding system is built upon several prior research works in the field of embedded wavelet image coding. The following advanced coding techniques are efficiently combined in the EZBC coding system: quadtree-based set partitioning for compact and flexible data representation,? context modeling for exploitation of statistical dependency between subband coefficients ? bitplane de-interleaving to improve rate-distortion (R-D) performance, and context-dependent de-quantization to further utilize the source statistics accumulated during the bitplane decoding phase.\par
Although many algorithms in the literature also attempted to join some of these coding tools, they either substantially increased the implementation complexity or just made limited improvement. For example, most set partitioning coders, also employ context-based arithmetic coding to further compression efficiency. However, the simple context modeling schemes utilized in these former algorithms are insufficient to accurately predict the status of a given quadtree node. The bitplane deinterleaving utilized in the conventional sequential bitplane coders is effective in improving the R-D efficiency of the embedded codestream. However, such improvement is accomplished at a cost of additional bitplane scans/passes. In EBCOT proposed by Taubman, the quadtree decomposition, run-length coding and conventional context-based bitplane coding work together for significance coding of subband coefficient. The quadtree decomposition therein only proceeds up to a pre-selected minimum sub-block size, 16 × 16 by default. The quadtree IV. 
\section[{Codestreab embedding}]{Codestreab embedding}\par
In order to have efficiently embedded codestreams, it is essential that the code data in the compressed file are ordered according to their relative efficiencies for distortion reduction. This basic concept is commonly called embedding principle. In the proposed algorithm, a fixed path for encoding of wavelet coefficient bitplane data is chosen as follows: The coding process advances in a bitplane-wise fashion from the most significant bit toward the least. In a given bitplane, the arrays of LINs are processed in an increasing order of quadtree level, as suggested by Islam and Pearlman in SPECK. That is, all the pixels in LIN[0] are processed first and all the nodes in LIN \hyperref[b0]{[1]} are then processed next, followed by the processings of LIN \hyperref[b1]{[2]}, LIN \hyperref[b2]{[3]}, and so on. In this way, the busy areas in the transformed image are updated earlier via a few quadtree splitting and coding steps, resulting in a good rate-distortion performance. The refinement of the previous significant coefficients from LSP is executed at last. In a significance test pass of a given quadtree level or a coefficient refinement pass, the subbands are visited from coarse to high resolution (as indicated in p n,l,k for providing an embedded codestream of fine granularity. However, unlike the multi-pass approach proposed in, EZBC does not need to scan the individual pixels more than once in each bitplane pass because all the involved pixels for the individual sub-pass were already organized in separate lists. Although our pre-defined data embedding order is not optimized for the best R-D performance (as compared to the algorithms), our empirical data show the resulting relative performance loss is mostly insignificant. The effectiveness of the proposed data embedding strategy is further evidenced by the smooth R-D curves shown in our actual coding simulation results. It is worth mentioning that each bitplane pass could have been divided into even more sub-bitplane passes in our data embedding scheme to further improve the R-D performance of the resulting codestream. It is simply accomplished by partitioning of the existing lists into smaller sub-lists and then processing each sub-lists via separate sub-bitplane coding passes. The resulting computational and storage costs are still the same because the total number of the nodes to be stored and processed in all the maintained lists is unchanged. For example, our empirical data show that the refinement of the significant coefficients from the previous bitplane coding pass reduces distortion more efficiently than the refinement of the significant coefficients from the other earlier bitplane coding passes (if exist). The PSNR performance can thus be slightly improved by partitioning the existing refinement pass into multiple sub-passes, each for the refinement of the significant coefficients from particular bitplane level(s). Nevertheless, it is observed that the granularity of the resulting codestream by the current algorithm is already fine enough in practical image coding applications.\par
V.  and context modeling-for efficient entropy coding of coefficient bitplane symbols. Unlike traditional zerotreebased set partition coders, we utilized the emerging quadtree-based zeroblock-coding scheme for hierarchical set-partition coding of wavelet coefficients. Exploitation of the strong statistical dependency in quadtree representation of the decomposed image is attempted in this work. Our coder has some attractive features of the traditional embedded bitplane coders such as precise rate control and multi -rate/-precision decoding. Without a zerotree spanning across different resolutions, this algorithm is ideal for resolution scalable coding. A substantial PSNR improvement over the stateof-the art algorithms in the literature is exhibited in extensive simulation results. A new algorithm for reconstruction of decoded wavelet coefficients. This technique features a context-dependent de-quantization strategy utilizing probability models dynamically accumulated in the decoding phase. Although the related PSNR improvement is not significant, it yields visually more pleasing coding results, as experimentally demonstrated the proposed-quantization algorithm is quite general and is expected to able to applied in other context-based wavelet bitplane coders, e.g., EBCOT, and ECECOW. 
\section[{Result analysis observation}]{Result analysis observation}
\begin{quote}
Original Image\end{quote}
\par
A reversible image coding system derived from the classical EZBC algorithm. The proposed coder exhibits excellent compression performance for both lossy and lossless image coding, as compared to competing a highly scalable and perceptually tuned image coding system was presented in related chapter, built upon the EZBC framework. Special care is given to modeling and coding of subbands so that the information related to desired resolution and precision levels can be efficiently retrieved from a single compressed .le. A variety of code stream formats can be easily composed from the hierarchically structured bit streams. As such, the encoding and decoding stages is allowed be effectively decoupled. Perceptual image coding is jointly addressed in a scalable coding system in this work. Unlike former research approaches adopted in the literature, the decoder or the stream parser exclusively performs "perceptual tuning" at the decoding/transmission times. Significant PSNR and visual improvements by the proposed scheme are presented in experimental results. A new embedded image coding algorithm EZBC using zeroblock coding of the subband/wavelet coefficients and context modeling was presented. With effective exploitation of context information at the individual levels of the quadtree representation of subband/wavelet coefficients, EZBC outperformed the well-known zerotree coder SPIHT and a more recent zeroblock coder SPECK in compression efficiency.\par
Our experimental results also indicate that the PSNR performance of the proposed algorithm is comparable to that of the JPEG 2000 test coder, a state-of-art image coder using context modeling and also a hybrid of pixel-and block-wise zero coding schemes. Nevertheless, EZBC adopts unified zeroblock coding framework and thus possesses the desirable lowcomplexity feature of this class of coders. \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{41}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 4 . 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{515253}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Figure 5 . 1 :Figure 5 . 2 :Figure 5 . 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{552565758}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 5 . 5 : 2 Figure 5 . 6 :Figure 5 . 7 :Figure 5 . 8 :}\end{figure}
 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Jayant and Noll ()]{b11}\label{b11} 	 		\textit{},  		 			N S Jayant 		,  		 			P Noll 		.  	 	 		\textit{Digital Coding of Waveforms. Englewood Cli.s}  		1984. Prentice-Hall.  	 
\bibitem[Vetterli et al. ()]{b8}\label{b8} 	 		\textit{},  		 			M Vetterli 		,  		 			J Kovacevic 		,  		 			Wavelets 		,  		 			Subband Coding 		.  		1995. Englewood Cliffs.NJ: Prentice-Hall.  	 
\bibitem[Pearlman ()]{b0}\label{b0} 	 		‘A new, fast, and efficient image codec based on set partitioning in hierarchical trees’.  		 			Said Pearlman 		.  	 	 		\textit{IEEE Trans. Circuits Syst. Video Technol}  		1996. 6  (3)  p. .  	 
\bibitem[Rabbani and Joshi ()]{b2}\label{b2} 	 		‘An overview of the JPEG 2000 still image compression standard’.  		 			M Rabbani 		,  		 			R Joshi 		.  	 	 		\textit{Signal Processing: Image Communication},  				2002. 17 p. .  	 
\bibitem[Hsiang and Woods (2000)]{b3}\label{b3} 	 		‘Embedded image coding using zeroblocks and of subband/wavelet coefficients and context modeling’.  		 			S.-T Hsiang 		,  		 			J W Woods 		.  	 	 		\textit{Proc. IEEE ISCAS'00},  				 (IEEE ISCAS'00Geneva, Switzerland)  		may 2000. 3 p. .  	 
\bibitem[Shapiro (1993)]{b4}\label{b4} 	 		‘Embedded image coding using zerotrees of wavelet coefficients’.  		 			J M Shapiro 		.  	 	 		\textit{IEEE Trans. on signal processing}  		Dec.1993. 41 p. .  	 
\bibitem[Taubman ()]{b1}\label{b1} 	 		‘High Performance scalable image compression with EBCOT’.  		 			D Taubman 		.  	 	 		\textit{IEEE Trans. Image processing}  		2000. 9  (7)  p. .  	 
\bibitem[Hsiang and Woods (2002)]{b10}\label{b10} 	 		‘Highly scalable and perceptually tuned embedded subband/wavelet image coding’.  		 			S.-T Hsiang 		,  		 			J W Woods 		.  	 	 		\textit{SPIE Conference on VisualCommunications and Image Processing},  				 (San Jose, CA)  		Jan. 2002. 4671 p. .  	 
\bibitem[Antonini et al. (1992)]{b9}\label{b9} 	 		‘Image coding using wavelet transform’.  		 			M M Antonini 		,  		 			P Barlaud 		,  		 			I Mathieu 		,  		 			Daubechies 		.  	 	 		\textit{IEE Trans. Image Processing}  		April 1992. 1 p. .  	 
\bibitem[Jain ()]{b12}\label{b12} 	 		 			A K Jain 		.  		\textit{Fundamentals of Digital Image Processing},  				 (Englewood Cli.s, NJ)  		1989. Prentice-Hall.  	 
\bibitem[Pennebaker and Mitchell]{b6}\label{b6} 	 		\textit{JPEG Still Image Data Compression Standard},  		 			W P Pennebaker 		,  		 			J L Mitchell 		.  		New York: Van Nostrand Reinhold.  	 
\bibitem[Wallace (1991)]{b5}\label{b5} 	 		‘The JPEG still picture compression standard’.  		 			G K Wallace 		.  	 	 		\textit{Communications of the ACM}  		April 1991. 34 p. .  	 
\bibitem[Woods ()]{b7}\label{b7} 	 		 			J Woods 		.  		\textit{Subband Image Coding},  				1991. Kluwer Academic Publishers.  	 
\end{bibitemlist}
 			 		 	 
\end{document}