MLLNAkSn AS (608) NANDAkUMAk G (613) NANDAGCAL S (612) SkLLIA V (6SS) |N!PBBUB!|BN Many Lransform codlng schemes such as !LC and MLC sLandards are based on block codlng Lechnlque lnLerpolaLlon resLoraLlon of a plurallLy of block plxels ls losL due Lo Lransmlsslon error or oLher reason 1here are many spaLlal lnLerpolaLlon Lechnlques for resLorlng mlsslng blocks of plxels ltojectloos ooto coovex sets (lOc5) meLhod depends slgnlflcanLly on Lhe resulLs of an edge orlenLaLlon deLecLor lL also llmlLs recovery of cerLaln specLral bands wlLh Lhe use of a band pass fllLer ln Lhe proposed algorlLhm vecLors are exLracLed from Lhe surroundlng nelghborhood of a mlsslng block/plxel Lo make a convex hull for Lhe reference of recovery 1he recovery vecLors conLalnlng boLh known and losL plxels are used for Lhe pro[ecLlons Lo flnd opLlmal specLrum coefflclenLs for Lhe mlsslng plxels PPBJEB!|BNS BN!B BBN\EK SE!S (PBBS) convex hull ls formed from surroundlng plxel vecLors of Lhe mlsslng plxel 1wo addlLlonal convex seLs are deflned for Lhe consLralnLs of dynamlc range and gradlenL vecLors whlch lnclude boLh known and mlsslng plxels are pro[ecLed onLo Lhe verLlces of Lhe convex hull ln Lhe uC1 domaln and onLo convex seLs ln Lhe spaLlal domaln llnally mlsslng plxels are resLored lLeraLlvely 1he algorlLhm enables resLored plxels Lo susLaln specLrum and edge sLrucLures of surroundlng blocks and consequenLly Lo have conLlnulLy slmllarlLy and smooLhness wlLh nelghborhood plxels 1he sLeps lnvolved are llne deLecLlon generaLlon of surroundlng vecLors generaLlon of recovery vecLors generaLlon of convex seLs and pro[ecLlon operaLors and flnally lLeraLlve algorlLhms for plxel lnLerpolaLlons ||NE BE!EB!|BN lL ls applled Lo deLermlne edge orlenLaLlon Llne masks are applled Lo Lhe surroundlng blocks S L S W S n S S 1he responses 8 h and 8 v are compuLed aL all l [ coordlnaLes ln Lhe block 1he llne masks L h and L v are glven by 1he magnlLudes of responses 8 h 8 v are compuLed as SUPPBUNB|NB \EB!BP Slnce Lhe surroundlng nelghborhood of a mlsslng block ls assumed Lo have specLral and spaLlal slmllarlLy wlLh Lhe mlsslng plxel Lhe nelghborhood area can be segmenLed lnLo several blocks each of whlch has lLs own spaLlal and specLral characLerlsLlcs 1he segmenLaLlon of Lhe nelghborhood and Lhe exLracLlon of vecLors are made by shlfLlng an n x n wlndow on every grld of plxels ln Lhe surroundlng nelghborhood 1hls ylelds an n x n vecLor s k on LhaL poslLlon s a resulL s k x x(l [) l [ W ls generaLed where W ls an n x n wlndow 1he posslble number of Lhe surroundlng vecLors s k ls 8n where n ls Lhe dlmenslon of Lhe mlsslng block PEBB\EP\ \EB!BP 1o resLore mlsslng blocks a recovery wlndow and vecLors r l |l12 are lnLroduced whlch lnclude boLh known and mlsslng plxels 1wo poslLlons for Lhe recovery vecLors are posslble accordlng Lo Lhe domlnaLlng llne ln Lhe surroundlng block ln each case Lwo n x n recovery vecLors are made from Lhe wlndows and each vecLor conslsLs of (n1) x n known and 1 x n mlsslng plxels fLer Lhe mlsslng plxels are resLored each recovery wlndow slldes Lowards Lhe oLher Lo recover nexL 1 x n mlsslng plxels s a resulL r k x x(l[) l[ W ls generaLed where W ls an n x n wlndow and k 12 PPBJEB!|BNS ANB BBN\EK SE!S 1he surroundlng vecLors obLalned from Lhe surroundlng blocks are used Lo form a convex hull ln an n x n space 1he recovery vecLors are Lhen pro[ecLed onLo Lhe closesL verLex of Lhe convex hull ro[ect|on Cperator 1 LeL r l and s [ (1 l 2 1 [ 8n) be Lhe recovery vecLor and surroundlng vecLor respecLlvely 1he s vecLors form a convex hull and slnce Lhere are 8n polnLs ln Lhe n 2 dlmenslonal space where n 8 each vecLor s [ becomes a verLex of Lhe convex hull 1he closesL verLex s dl |l12 of Lhe convex hull Lo Lhe recovery vecLors r l |l12 are found ln Lhe meansquare sense as d l arg mln [ || r l s [ || for 1 l 2 and 1 [ 8n 1he recovery vecLors ln Lhe uC1 domaln 8 l |l12 are orLhogonally pro[ecLed on Lo Lhe closesL verLex as 1herefore Lhe pro[ecLlon operaLor 1 ln Lhe uC1 domaln ls PPBJEB!|BNS ANB BBN\EK SE!S ro[ect|on operator 2 1he convex seL for Lhe second pro[ecLlon operaLor ls where n ls Lhe plxel lndex L ls Lhe seL of mlsslng plxelsf 0 ls Lhe orlglnal known value and l max and l mln are Lhe maxlmum and mlnlmum lnLenslLles of Lhe lmage 1herefore Lhe pro[ecLlon operaLor 2 ln Lhe uC1 domaln ls ro[ect|on operator 3 8ange consLralnL ls consldered for Lhe conLlnulLy wlLh Lhe nelghborhood of a resLored block LeL f m be Lhe vecLor of mlsslng plxels ln a recovery block f 0 be Lhe vecLor of ad[acenL plxels Lo Lhe mlsslng plxels ln Lhe same block and g be a 1 x n vecLor of Lhe form f m f 0 8y seLLlng g as a bounded slgnal wlLh a consLanL Lhe convex seL for 3 ls whoro n Is fho IxoI Indox. Honco I 3 Is |!EPA!|\E A|BBP|!HMS |BP P|KE| |N!EPPB|A!|BNS Mlsslng plxels ln recovery vecLors are resLored by lLeraLlve algorlLhm of alLernaLlve pro[ecLlons f l+1
3 f l where l ls Lhe lLeraLlon lndex f ls Lhe resLored slgnal aL lLeraLlon l and [ ls Lhe [Lh pro[ecLlon operaLor !HANK \BU|||