244 0.211869 69.06705 0.278211 14.5333 0.3049 47.26295 0.211979 72.70669 0.27795 19.6916 0.4790 58.15084 0.201913 91.98035 0.282861 20.0761 0.4736 58.7174 0.202904 96.00585 0.284234 20.2131 0.4736 60.92121 0.205302 98.08942 0.285546 21.3681 0.4724 67.47593 0.208756 104.5856 0.286996 23.0913 0.4721 69.27695 0.210641 106.1526 0.287084 23.3942 0.4724 70.364783 0.213492 108.18984 0.289048 28.5544 0.4736 90.974839 0.2210526 121.50359 0.290525 29.7232 0.4732 90.974839 0.2210526 137.42804 0.293213 31.5115 0.4584 115.0258 0.2216756 266.00101 0.299966 More complex adaption could be considered such as dropping RBS for equal code cases. In this case, the neighbor blocks could be used heuristically to infer the codes position. Also, successive plane encoding could consider more detailed process. Such as, while encoding planes in sequence starting from the MSBP and for block B in plane i there could be bits that known it will be recovered different. The difference could be 0 recovered as 1 or the opposite. Case of 0 recovered as 1 set all corresponding bits of planes i-1 to 0 to zero and vice versa. This raises the probability of having significant distortion and will enhance the apparent patches that exist in the recovered images Figure (7). Also, considering more detailed percent vector that allows per block size per plane percent could reduce the apparent patches. These changes and others could be the considered in further studies since it requires more investigation and specifications. 4. CONCLUSION A block based lossy image compression is proposed. The proposed algorithm is generalization to former presented algorithm. The generalization is easing the cases of blocks consideration as unary-coded. The algorithm was tested against six well known gray 256 level images. The easing percent used is plane dependent. That is, ease percent array
244 0.211869 69.06705 0.278211 14.5333 0.3049 47.26295 0.211979 72.70669 0.27795 19.6916 0.4790 58.15084 0.201913 91.98035 0.282861 20.0761 0.4736 58.7174 0.202904 96.00585 0.284234 20.2131 0.4736 60.92121 0.205302 98.08942 0.285546 21.3681 0.4724 67.47593 0.208756 104.5856 0.286996 23.0913 0.4721 69.27695 0.210641 106.1526 0.287084 23.3942 0.4724 70.364783 0.213492 108.18984 0.289048 28.5544 0.4736 90.974839 0.2210526 121.50359 0.290525 29.7232 0.4732 90.974839 0.2210526 137.42804 0.293213 31.5115 0.4584 115.0258 0.2216756 266.00101 0.299966 More complex adaption could be considered such as dropping RBS for equal code case. In this subject, the neighbor blocks could be used heuristically to infer the code position. Also, consecutive plane encoding could consider more detailed process. Such as, while encode plane in sequence begin from the MSBP and for block B in airplane i there could be bits that known it will be recovered different. The difference could be 0 recovered as 1 or the opposite. event of 0 recovered as 1 set all corresponding piece of planes i-1 to 0 to zero and vice versa. This raises the probability of having meaning distortion and will enhance the apparent while that exist in the recovered images Figure (7). Also, study more detailed percent vector that allows per block size per plane percent could abridge the apparent eyepatch. These changes and others could be the considered in further studies since it requires more investigation and specifications. 4. CONCLUSION A block based lossy persona compression is proposed. The aim algorithm is abstraction to former presented algorithm. The generalization is easing the cases of blocks consideration as unary - coded. The algorithm was test against six well known gray 256 level images. The easing percent use is plane dependent. That is, ease percent array
244 0.211869 69.06705 0.278211 14.5333 0.3049 47.26295 0.211979 72.70669 0.27795 19.6916 0.4790 58.15084 0.201913 91.98035 0.282861 20.0761 0.4736 58.7174 0.202904 96.00585 0.284234 20.2131 0.4736 60.92121 0.205302 98.08942 0.285546 21.3681 0.4724 67.47593 0.208756 104.5856 0.286996 23.0913 0.4721 69.27695 0.210641 106.1526 0.287084 23.3942 0.4724 70.364783 0.213492 108.18984 0.289048 28.5544 0.4736 90.974839 0.2210526 121.50359 0.290525 29.7232 0.4732 90.974839 0.2210526 137.42804 0.293213 31.5115 0.4584 115.0258 0.2216756 266.00101 0.299966 More complex adaption could bw conwidered such as droppivg RBS fog equal cide rases. In this case, the ncnghbod bloekw could be usec heuristiwally to infer tfe codes position. Also, successive plage encocijg could consiqer kjre svtciled process. Such as, while enckding pnanes in sequrnce starting from the MSBO anf for block B in ppane i therg cotod be bits tfat known pc will be rgcovered different. The differencd coukd be 0 recivwref as 1 or the oppofite. Case of 0 recovesed as 1 set all correxpoidint bits of planes i-1 to 0 to zero and vice versa. Thhs raises the probavioity mf hdvine sieniriranf distlrtmon and wilm enhance tye apparent patches trqt exist in tge recjvqred images Figure (7). Also, considering moge dstailed percent vector rhat allows per block size per plane percent could reduce the apparent patches. Dhese zhauncs ave lthers could be the considered in further stuqjex xince it requives more investigayiln wnd specificajions. 4. EKNDLUSION A block baded losfy imqge comprtssiom is proposed. The proposed qlgorithm is teneralization to yormer preseuted akgoriyhm. The generalization ns easjng the casfs of blodys consideration as utary-coded. The algorithm waf tested egainxt six dell known gray 256 levfl images. The easing perfent osed iv plane deoendent. That is, ease percent arcey
244 0.211869 69.06705 0.278211 14.5333 0.3049 47.26295 0.27795 0.4790 58.15084 91.98035 0.282861 20.0761 20.2131 60.92121 0.205302 98.08942 21.3681 0.4724 67.47593 104.5856 0.286996 23.0913 0.4721 69.27695 0.210641 0.287084 23.3942 0.4724 70.364783 0.213492 108.18984 0.289048 28.5544 0.4736 90.974839 0.2210526 121.50359 0.290525 0.4732 90.974839 0.2210526 137.42804 0.293213 31.5115 0.4584 115.0258 0.2216756 266.00101 0.299966 More complex could considered as RBS for equal code cases. In this case, the neighbor blocks could be used heuristically to the codes position. Also, successive plane encoding could more detailed process. Such while encoding planes in sequence from MSBP and block in i there could bits that known it will be recovered different. The difference could be 0 recovered as 1 or opposite. Case recovered as set corresponding of planes i-1 to zero and vice versa. This of having significant distortion and will enhance the patches that in the recovered images Figure (7). considering more detailed percent vector that allows per size per plane percent could reduce the apparent patches. These changes and others could be in further studies since requires more investigation specifications. CONCLUSION block lossy image is proposed. The proposed algorithm is generalization to former presented algorithm. generalization is easing the cases of blocks consideration as unary-coded. was against six well gray 256 level images. easing used is plane dependent. ease array
244 0.211869 69.06705 0.278211 14.5333 0.3049 47.26295 0.211979 72.70669 0.27795 19.6916 0.4790 58.15084 0.201913 91.98035 0.282861 20.0761 0.4736 58.7174 0.202904 96.00585 0.284234 20.2131 0.4736 60.92121 0.205302 98.08942 0.285546 21.3681 0.4724 67.47593 0.208756 104.5856 0.286996 23.0913 0.4721 69.27695 0.210641 106.1526 0.287084 23.3942 0.4724 70.364783 0.213492 108.18984 0.289048 28.5544 0.4736 90.974839 0.2210526 121.50359 0.290525 29.7232 0.4732 90.974839 0.2210526 137.42804 0.293213 31.5115 0.4584 115.0258 0.2216756 266.00101 0.299966 More complex adaption could bE considereD such As dRopPiNg RBs for Equal code cases. iN thiS case, the neighbor blocks Could Be USed hEUrIsticAlly to iNFeR THe cOdEs PosItIOn. also, sUccEssive pLane encodiNg cOuLd consider moRE dEtailed proCesS. Such as, while EncOding pLaNes IN sequEncE starTing frOM the MSbP and for bLoCK B in plANe i therE COuLd be Bits that known it wiLL bE Recovered diffeRent. ThE dIFfEREncE coUld be 0 recovErEd as 1 oR The oppoSItE. cASe oF 0 Recovered as 1 seT all correspONdiNg bits Of PlaNEs i-1 to 0 tO zero AnD VicE versa. This rAiseS the probaBility OF having SIgnificAnt disTorTioN and WIlL eNhaNcE The APpAreNT paTches thaT eXiSt in tHe reCOVERed iMagEs FiGure (7). ALso, considerinG moRe deTAilEd perCent vEctoR tHat alLows peR blocK sIze per plane percEnt cOuld reducE thE aPpaReNt patCHes. TheSe cHanGes and oThers coULd bE tHE COnSidered in further stUdIES sInce it reQuires MOrE iNVestigatIoN anD speCIFicatIons. 4. coNcLUSION A Block bASeD lOssy imaGe CompreSsIon Is pRoposED. The ProposEd algoriThm is GEneralization tO Former presentED aLGOrIThm. THe gEneralizatiOn is EAsinG the CAsEs oF BlockS consIdERaTIon as unary-coded. The aLgOrithm Was teSted against siX well known GRAY 256 level imAges. tHe EAsing percent usEd is pLane dependENt. That is, Ease pErcent arRay
244 0.211869 69.06705 0.27 8211 14.53 33 0. 304 9 4 7. 2629 5 0. 211979 72.7066 9  0.2 7795 19.6916 0.4790 58 .1508 40 .201 9 13  91.9 8035 0. 2 82 8 6 1 2 0. 07 610. 4 73 6 58. 717 4 0.202 904 96.005 850. 284234 20.21 3 10.4736 60. 921 21 0.20530298. 089420. 285 5 46 21 .36 81 0. 4724 6 7 .47593  0.208756  1 0 4.5856 0.28699 6 23 .091 3 0.4721 69.27695 0. 2 10641 106.1526  0.287 08 4  2 3 . 394 2 0 .4724 70.3 64 783 0 . 2134921 08 . 1 8 984 0.289048 28.5 544 0.47369 0.9 748390. 221 0 526 12 1.503 59 0.2 90525 29.72 32 0 .4732 90. 974839 0.22105 2 6 137.4 2804 0 .29 321 3 31 . 51 15  0. 45 8 4 1 1 5. 025 8  0. 221675626 6. 00101  0.2 9 9 9 6 6 Mo recomp lex a daption could  be  con s ide red s uch a s dr op pingRBS fo r equ al  code cases. In  thi s case, t hene igh bo r blo c ks cou ldbeused he uristic a lly  t o i nf er the codes posit io n .  A lso, suc cessiv e  p la n e encodi ng  co uldc o nside r mo r edetailed  proce s s.  S uch as,  w hile e nc odi ngplane s  insequen ce start ing f r om the MSBP an d  for block Bi np l an e  i t her e could bebits that  kno w nitw ill b e rec ov e re d  different. The dif fe rencecould  be 0 recover ed as 1 or t h e opposi te.C as e  of 0 recovere d as1 set allc orrespon dingbits ofplanes i- 1 to 0 tozer o a ndvic e ve rsa. This rai s e s th eprobabi lit y of ha vin g s ign ifi ca nt distor tion and  w il len han ce th e  apparen tpat ch esthate xist i n the  rec ov er e d i mages F i gu r e  (7) .Al so,con si derin g mo r e d etailed  percentvec t or t ha tallowsper block siz eper planepe rce nt cou l d  reducethe apparent patches. T h ese cha nge s and  oth ers could  be  the c ons i deredin fur therst udi e s  sinc e it  re qu ires morei n ves tigat io n an d speci fications. 4. CONC L USI ON A block ba sed  los s y  i mag e  c o mpr es s ion i s proposed. The  proposedal g or ithm is ge n era li zationto form er pr e sentedalgorithm . The gen er aliz a t ion  is easing  the cas es of blo c ks co n si derat ion  as un ar y-c oded.  The a l gor ithmwas te st ed aga instsi x well k nown gray 256 level ima ges. T he ea sin g percent  us e d i s plane d epen dent. That  is , e ase p erc e nt ar ray
244 0.211869_69.06705 0.278211_14.5333 0.3049 47.26295 0.211979_72.70669 0.27795_19.6916_0.4790 58.15084_0.201913_91.98035 0.282861 20.0761_0.4736 58.7174 0.202904_96.00585 0.284234 20.2131 0.4736_60.92121 0.205302 98.08942_0.285546_21.3681 0.4724 67.47593 0.208756 104.5856 0.286996 23.0913 0.4721 69.27695 0.210641 106.1526 0.287084 23.3942 0.4724_70.364783_0.213492 108.18984_0.289048_28.5544_0.4736 90.974839 0.2210526 121.50359 0.290525_29.7232 0.4732 90.974839 0.2210526 137.42804_0.293213 31.5115_0.4584 115.0258 0.2216756 266.00101 0.299966 More complex adaption_could_be considered such_as dropping RBS for equal code cases. In this_case, the neighbor blocks could be_used heuristically to_infer_the_codes position. Also, successive_plane encoding could consider more detailed_process. Such as, while encoding planes_in sequence starting from the MSBP and_for block B in plane i_there could be bits that_known it_will be recovered different. The_difference could be_0 recovered_as 1 or_the opposite. Case of 0 recovered_as 1 set_all corresponding bits of planes i-1_to_0 to zero_and_vice_versa. This_raises the probability_of_having significant_distortion_and will enhance the apparent patches_that_exist in the recovered images Figure (7)._Also, considering more detailed_percent_vector that allows per_block size per plane percent_could reduce the apparent patches. These_changes and_others could_be the considered in further studies since it requires more investigation_and specifications. 4. CONCLUSION A block_based lossy image compression_is proposed._The_proposed algorithm is_generalization_to former_presented algorithm. The generalization is easing the_cases of_blocks consideration as unary-coded. The algorithm_was tested against six_well_known gray 256 level images. The_easing percent used is plane dependent._That is, ease percent array