 possibilities of having higher frequencies components. Fractal image encoding based on establishing similarities between small block, ranges, and larger blocks, domains. The blocks similarities enabled the use of the iterative function systems which is the base of fractal encoding. Other blocking schemes could be found in [14-17]. Image Bit-plane is a bit pixel decomposition of an image matrix. Therefor a gray image of n-bit gray resolution contains n-planes. Least Significant Bit Planes, LSBP, contain less significant information compared Most Significant Bit Planes, MSBP. Figure (1) shows the original versus the bit-planes for 8-bit boy and Lena pictures. The bit-planes was a rich topic for both enhancement and compression algorithms as plane-pixels contains only two values 0, and 1. So, The Run Length Encoding, arithmetic and progressive transition are used in bit-planes taking the advantages of binary and similarities of adjacent bits within the same plane [18-20]. International Journal of Academic Engineering Research (IJAER) ISSN: 2000-001X Vol. 2 Issue 10, October – 2018, Pages: 19-27 www.ijeais.org/ijaer 20 Figure (1) Lena, pepper original and bit-planes for 8-bit gray In this paper, a lossy version of former proposed exact compression/decompression algorithm based on successive block test then encode or divide process is proposed. The algorithm uses two-bit structural encoding together with residual block storage. The encoding is two phases. In the first phase three codes are used and in the second phase third code is consumed in an adaptive run length encoding, for more optimization. The rest of the paper is organized as follows: The proposed basic encoding/decoding is described in section 2. Tests, results and discussion are in section 3. Section 4 is the study conclusion. 2. THE PROPOSED ENCODING/DECODING ALGORITHMS The proposed algorithm is a lossy version of a former proposed exact encoding/decoding algorithm [21]. The exact encoding and decoding algorithm are in appendix A, and B consequently. The modification is limited to the encoding process. So, the decoding process is the same for both exact and lossy. The change to the encoding is in the consideration of block all zeros and block all one. The consideration is eased from all one's and all zero's to above certain percent. Planes contributes differently to picture energy, figure (1). Consequently, percent's considered to
possibilities of having higher frequencies component. Fractal prototype encoding based on establishing similarities between little block, ranges, and bombastic blocking, domains. The engine block similarities enabled the manipulation of the iterative function systems which is the al-qaeda of fractal encoding. early blocking schemes could be found in [ 14 - 17 ]. prototype Bit - plane is a bit pixel decay of an image matrix. Therefor a gray image of n - moment gray resolution contain n - airplane. Least Significant Bit Planes, LSBP, contain less significant information compared Most Significant Bit Planes, MSBP. Figure (1) prove the original versus the bit - planes for 8 - bit boy and Lena video. The bit - planes was a rich topic for both enhancement and compression algorithms as plane - pixels contains only two value 0, and 1. So, The Run Length Encoding, arithmetic and progressive conversion are use in bit - planes taking the advantage of binary and similarities of adjacent bits within the same plane [ 18 - 20 ]. International Journal of Academic Engineering Research (IJAER) ISSN: 2000 - 001X Vol. 2 Issue 10, October – 2018, Pages: 19 - 27 www.ijeais.org/ijaer 20 Figure (1) Lena, capsicum original and bit - planes for 8 - bit gray In this paper, a lossy version of former proposed exact compression / decompression algorithm based on successive engine block trial then encode or divide process is proposed. The algorithm uses two - bit geomorphologic encoding together with residual block storage. The encoding is two phase. In the first phase three codes are used and in the second phase third code is consumed in an adaptive rivulet length encoding, for more optimization. The respite of the paper is organized as follow: The proposed basic encoding / decoding is described in section 2. test, results and discussion are in incision 3. Section 4 is the study termination. 2. THE PROPOSED ENCODING / DECODING ALGORITHMS The propose algorithm is a lossy version of a early proposed exact encoding / decoding algorithm [ 21 ]. The exact encoding and decoding algorithm are in appendix A, and B consequently. The alteration is limited to the encoding process. indeed, the decoding process is the like for both exact and lossy. The change to the encoding is in the consideration of block all zeros and block all one. The consideration is eased from all one's and all zero's to above certain percent. Planes lend differently to visualize energy, figure (1). Consequently, percent's considered to
 podsibilities of having hinher frequencies componxnts. Frzctal imxge encoding based on establmshibg sinilarities between smaul block, ganges, ane lacger blocks, domamhs. The njocka simnlerities enabled the use ox the iterativa wuuction systems which is the base of sractal ejcoding. Other floclyng abhtmes could be found in [14-17]. Image Bit-llane iv a bit pixel decomposition of an image matgix. Therefor a graj image of b-bit tray resolutkon contains n-planes. Lgast Significant Bit Planes, LSBP, contcin less sitnufifdnt informavion cjmpared Most Signifiwant Biy Planes, MSBP. Nigurx (1) syows the original vervus the bit-planes sor 8-bit bmy and Lena picturew. Rhe bht-pldnes qas a dirh fopic vor both enhahcement and compression algoriuhmf as plane-pixems coneayns only two values 0, and 1. So, The Run Letgtg Encoding, arithmetic abd progressive transijion are ufed in bit-planes taking the advantages of binary dnd smmklaxlbies if adjacent bits within the same plane [18-20]. Internaejomak Journal of Agademic Engineerinb Gexgarch (IJAER) ISRN: 2000-001X Vol. 2 Issue 10, October – 2018, Oages: 19-27 rww.ijwais.org/ijwer 20 Figure (1) Lena, pepper originql and bit-plcnew for 8-bit gray In chis paper, a losxy vetsion of former proposeb exacf compressiln/decomprsrsion algorithm casvd ot successive block test thqn encode or bivide pfocexs is [roposed. Tje alnmrithm uses two-bit strueturan encoding together with residual block svprage. The envoginc is two phascs. In the first phase three cpdes arz used and in thv second 'hase third sode is consukgd in an adapvive run jengrh ebcoding, wor more optimozation. Tkt rest of rhe paper is organlzed xa follows: The pxukowed basic encocine/desofiig is gescribed in secgiov 2. Tesgs, results cna dixcussion are in secthon 3. Section 4 is the syuqy conclosion. 2. THQ PROPOSED ENVODING/DECODING ALGLRITHKS Vhe prppofed algorithm is a lossy versikn of a flrmcr proposed evact encoding/decpding algorithm [21]. The exact encoding and decoding algorithn are in appendix A, snd B conseauentjy. The mogification is limitee to the encoding process. So, the decodjng prmcess is the same for both exact and lossy. The change to the encoding is in thw consmdqration of glocl all zzrox and flocn all one. The conxideration is eased from all onx's and all zzro's to above certain percent. Puanes contribotes differently to picturs energy, figure (1). Consequently, percent's vonsidered to
possibilities of having higher frequencies components. Fractal based establishing similarities small block, ranges, blocks enabled the use the iterative function which is the base of fractal Other blocking schemes could be found in [14-17]. Image Bit-plane is a bit decomposition of an image matrix. Therefor a gray image of n-bit gray resolution n-planes. Significant Planes, contain less significant information compared Most Significant Bit Planes, MSBP. Figure (1) shows the original versus bit-planes for 8-bit boy and Lena pictures. The was a rich topic both enhancement and compression algorithms plane-pixels only two 0, 1. The Run Length arithmetic and progressive transition are used in bit-planes taking the advantages of binary and similarities of adjacent within the [18-20]. International of Engineering (IJAER) ISSN: 2000-001X Issue 10, October – 2018, Pages: Figure (1) Lena, pepper original and bit-planes for gray In paper, a lossy version of former exact compression/decompression algorithm based on successive block test encode or divide process is proposed. The algorithm uses two-bit structural encoding together with residual The encoding is two In the first three are and the second third code is consumed in an adaptive run length encoding, for optimization. The rest of the paper is organized as follows: basic is described in 2. Tests, results and are section 3. Section 4 study 2. ALGORITHMS proposed is a lossy version a former proposed exact encoding/decoding [21]. The exact encoding appendix A, and B consequently. The modification is to the encoding process. So, the decoding is the same for both exact and lossy. The change to the is in of block all zeros and block all one. consideration is eased from one's and all zero's to above certain percent. Planes differently picture energy, (1). Consequently, percent's to
 possibilities of having highEr frequencIes coMpoNenTs. fracTal iMage encoding baSEd on Establishing similaritiEs betWeEN smaLL bLock, rAnges, anD LaRGEr bLoCkS, doMaINs. the blOckS similaRities enabLed ThE use of the iteRAtIve functioN syStems which is The Base of FrActAL encoDinG. OtheR blockINg scheMes could bE fOUnd in [14-17]. IMAge Bit-pLANe Is a bIt pixel decompositIOn OF an image matrix. therefOr A GrAY ImaGe oF n-bit gray rEsOlutiON contaiNS n-PLANes. lEast SignificaNt Bit Planes, lsBP, ContaiN lEss SIgnifiCant iNfORmaTion compareD MosT SignificAnt Bit pLanes, MSbp. Figure (1) Shows tHe oRigInal VErSuS thE bIT-plANeS foR 8-Bit Boy and LeNa PiCtureS. The BIT-PLaneS waS a riCh topIc for both enhaNceMent ANd cOmpreSsion AlgoRiThms aS plane-PixelS cOntains only two vAlueS 0, and 1. So, The run leNgtH ENcodiNG, arithMetIc aNd progrEssive tRAnsItION ArE used in bit-planes taKiNG ThE advantaGes of bINaRy ANd similaRiTieS of aDJAcent Bits WItHin the saMe planE [18-20]. inTeRnationAl journaL oF AcAdeMic EnGIneeRing ReSearch (IJaER) ISsn: 2000-001X Vol. 2 Issue 10, OctoBEr – 2018, Pages: 19-27 www.ijeAIs.ORG/iJAer 20 FIguRe (1) Lena, peppeR oriGInal And bIT-pLanES for 8-bIt graY IN ThIS paper, a lossy version Of Former PropoSed exact comprEssion/decoMPREssion alGoriTHm BAsed on successiVe bloCk test then ENcode or dIvide Process iS proposed. tHE algoritHm uSes Two-Bit STRuCtural encodinG TOgetHeR with reSidUal blocK stOraGe. THe eNcOding is twO phases. IN tHe FiRsT phAse thREe codes aRe UseD aNd iN the sECond phAse thIrd cOdE iS ConSumed in AN aDAPtivE rUn LengTh eNcOding, For mORe oPtimizaTion. The reSt oF The pApEr Is organIzed as follows: thE proposed bAsIc eNcodinG/DEcoding iS described in section 2. TestS, Results And DiscuSsioN are in secTioN 3. SectiOn 4 iS The stuDy concLusioN. 2. ThE PropOSED encOdINg/DeCODING ALGoriTHmS The PrOposEd algorIthm is a lossy versioN Of a Former proposeD exAct eNCOdIng/DEcODinG aLGorITHm [21]. The exact encodIng and decoDiNG aLgorithm arE In aPpEndix A, aNd B consEquenTLy. The moDificatioN is limiteD tO the ENCodIng process. so, the decOding procESs is tHE sAme foR boTh exacT aNd lOssy. THe chanGE to The enCoding Is In the cOnsidErAtion of bLock all zeros and block all One. The ConsiDerAtion is eaSed FRom All one's anD all Zero's to aboVe cErtAin peRceNT. PlanEs coNTrIbuTEs difFereNTly to pictURe EneRGY, fIgure (1). ConseqUENTly, PerceNt's COnsideRed tO
 possibilities of having h igher freq uenci escom po nent s. F ractal image e n codi ng based on establishi ng si mi l arit i es  betw een sma l lb l ock ,ra nge s, an d lar ger  blocks , domains.  Th eblocks simil a ri ties enabl edthe use of t heiterat iv e f u nctio n s ystem s whic h  is th e base of  f r actale ncoding . Ot herblocking schemesc ou l d be found in[14-17 ]. Im a g e B it- plane is a  b it pi x el deco m po s i t ion of an image m atrix. Ther e for  a gra yima g e of n -bitgr a y r esolution c onta ins n-pla nes. L e ast Sig n ificant  Bit P lan es,  LSB P ,co nta in les s  s ign i fic ant info rm at ion c ompa r e d Most  Si gnif icant  Bit Planes,MSB P. F i gur e (1)  show s th eorigi nal ve rsusth e bit-planes fo r 8- bit boy a ndLe napi cture s . Thebit -pl anes wa s a ric h  to pi c f or  both enhancementan d co mpressio n algo r it hm s  as plan e- pix elsc o ntain s on l ytwo valu es 0,a nd  1 . So, T he  Run L en gth  En codin g , ar ithmet ic and p rogre s sive transitio n  are used inb it - p la n es t aki ng the adva ntag e s of  bin a ry  an d  simi larit ie s  o f  adjacent bits with in  the s ame p lane [18-20].  Internati o n a l Journa l of Ac a demic Engineer ing R esearch (I J AER) ISS N: 20 00-001XVol. 2 Is s u e 10, Oc tob er– 2 018 , Pa ges: 19-27 ww w . ijea is .org/ij aer  20 Fig ure  (1 ) L ena ,pepper or iginal a nd  b it -p lan es fo r  8-bit g ra y I nthi s pap e r, a l ossyvers io no f f ormer p r op o s ed e xa ct  com pre ss ion/d ecom p res sion al gorithm b ase d  onsu cc essiveblock test th en  encode or  d ivi de pro c e ss is pr oposed. The algorithm u s es two- bit  stru ctur al encodi ngtogeth erw ith re sidual  bloc ksto r a ge. T h e  e nco di ng is twop h ase s. In  t he f irst ph ase three codes ar e  us ed and in the  se cond p ha set hi r d c od e  is c onsumed in an a daptive ru nl en gth encodi n g,fo r moreoptimiz ation .  The re st of the  paper is  o rgan i z edas follows : The pr oposed ba s ic en c od ing/d eco ding i sdes cribe d in s e cti on 2.  Tests ,result s and  d iscussio n are in section 3. Sec tion 4  is t hestudy con clu s ion . 2. THEPROP OSED ENCOD ING /DE CODIN G A L GORIT HMST he  pr o posed  alg o rithm isa  l oss y ve rsion of af o r mer  prop ose d  exact  enc oding/decoding al g orithm [21]. T he e x a ctenc o ding  a nd decoding al gor it h m  are inap pendix A, a nd B con se q uentl y. The  modif ication i sl imited  tothe  encoding  pr oc e ss. So,  t he decodi ng p ro cess i s thes amef o r both exact and  loss y .  Thec han ge to  t he enco d ingis in theconsiderati on ofbloc k all  zerosan d bloc k a ll  one. Thec onsiderat ion i s eased  f romall  one's  and a ll ze ro's  t o a bove cert a i np er ce n t.Plan es co nt ribu tes diffe r ently to  pi c ture en er gy, f igure( 1) . Consequent ly,  perc e n t's consid e redt o
 possibilities_of having_higher frequencies components. Fractal_image encoding_based_on establishing_similarities_between small block,_ranges, and larger_blocks, domains. The blocks_similarities enabled the_use_of the iterative function systems which is the base of fractal encoding. Other blocking_schemes_could be_found_in_[14-17]. Image Bit-plane is a_bit pixel decomposition of an_image matrix._Therefor a gray image of n-bit gray resolution_contains_n-planes. Least Significant_Bit Planes, LSBP, contain less significant information compared Most_Significant Bit Planes, MSBP. Figure (1)_shows the original_versus_the_bit-planes for 8-bit boy_and Lena pictures. The bit-planes was_a rich topic for both enhancement_and compression algorithms as plane-pixels contains only_two values 0, and 1. So,_The Run Length Encoding, arithmetic_and progressive_transition are used in bit-planes_taking the advantages_of binary_and similarities of_adjacent bits within the same plane_[18-20]. International Journal_of Academic Engineering Research (IJAER) ISSN:_2000-001X_Vol. 2 Issue_10,_October_– 2018,_Pages: 19-27 www.ijeais.org/ijaer_20_Figure (1)_Lena,_pepper original and bit-planes for 8-bit_gray_In this paper, a lossy version of_former proposed exact compression/decompression_algorithm_based on successive block_test then encode or divide_process is proposed. The algorithm uses_two-bit structural_encoding together_with residual block storage. The encoding is two phases. In the_first phase three codes are used_and in the second_phase third_code_is consumed in_an_adaptive run_length encoding, for more optimization. The rest_of the_paper is organized as follows: The_proposed basic encoding/decoding is_described_in section 2. Tests, results and_discussion are in section 3. Section_4 is the study conclusion._2._THE_PROPOSED ENCODING/DECODING ALGORITHMS The proposed_algorithm is a lossy version of_a former proposed_exact encoding/decoding algorithm [21]. The exact encoding_and_decoding algorithm are in appendix A,_and_B consequently. The modification is limited_to_the_encoding process. So, the decoding_process is the same for both_exact and lossy. The change to the encoding is_in the consideration_of block all zeros and_block_all_one. The consideration is eased from all one's and all_zero's to_above certain percent._Planes contributes differently to picture energy, figure (1). Consequently, percent's_considered to