Pro|ect Plan:

1he pro[ecL ls organlzed lnLo modules ln such a way LhaL Lhe modules
reduce Lhe pro[ecL lnLo lndependenL Lasks and Lhus effecLlvely reduclng Lhe
complexlLy lnvolved Lach module lnvolves a brlef llLeraLure revlew on Lhe Lask Lo
be lmplemenLed maLhemaLlcal analysls lmplemenLaLlon deLalls and complexlLles
lnvolved LesLlngdebugglng and flnally Lhe demo
1he enLlre pro[ecL can be dlvlded lnLo 4 maln modules
1 ynopsls and LlLeraLure revlew hase
2 CollecLlon of samples
3 Ludy of adapLlve fllLers
a) LM algorlLhm
b) 8L algorlLhm
4 ueslgn and lmplemenLaLlon
1he above modules are furLher dlvlded lnLo dlfferenL modules and Lhe schedule
for Lhe same has been shown ln L81 charL LhaL ln page
nticipated Bottlenecks :


1 rom Lhe lmage an Ldge 1angenLlal flow map ls Lo be exLracLed Lhls
ls a crlLlcal sLep as lL deLermlnes Lhe orlenLaLlon of edges ln our Llne
urawlng
2 AdapLlng Lhe ulfference of Causslan fllLer Lo low based approach
based on Ldge 1angenL low consLrucLlon 1hls requlres Lhe uoC
fllLer Lo be AnlsoLroplc ln naLure whereas as Lhe exlsLlng uoC fllLers
are lsoLroplc ln naLure


Also 8llaLeral lnvolves AnlsoLroplc ulffuslon and a prerequlslLe of cale
pace Lheory whlch are very complex 1he Canny Ldge ueLecLor ls a sLandard
fllLer buL has a lengLhy procedure Lo be followed 1he lmplemenLaLlon of Lhe
Mean hlfL llLer lnvolves kernel denslLy LsLlmaLlons for proper smooLhlng Also
Mean shlfL fllLer ls lnsplred from aLLern 8ecognlLlon Pence Lhe fllLers seen noL
only are complex Lo lmplemenL buL requlre prerequlslLes from varled dlsclpllnes
nticipated Simulation:

1he lmulaLlon lnvolves developlng a fronL end Cul 1he Cul has a normal
ouLpuL wlndow encloslng Lhe lmage panel along wlLh checkboxes buLLons and
1exL areas 1hese flelds are requlred for user lnLeracLlon for example value of
varlance may be varled or Lhe slze of box fllLer ln Lhe Ldge 1angenL flow
consLrucLlon can be ad[usLed by Lhe user uslng Lhese flelds 1he slmulaLlon wlll
also provlde Lhe user Lhe opLlon Lo vlew Lhe ouLpuLs ln dlfferenL sLages of
processlng lnally Lhe lnpuL lmages wlll be chosen ln sufflclenL number wlLh
varylng nolse level shades and hues and Lhls also glves Lhe lnslghL on whlch
meLhod ylelds Lhe besL resulL on a parLlcular lmage so LhaL proper comparlson can
be drawn beLween boLh Lhe meLhods
Progress Report:

o far we have made a Lhorough LlLeraLure survey and flnallzed Lhe pro[ecL course
and Lhls plan ls clearly ouLllned ln erL CharL now we Lurn our aLLenLlon Lowards
Lhe sLudy of adapLlve fllLers
An adapLlve fllLer ls a fllLer LhaL selfad[usLs lLs Lransfer funcLlon accordlng Lo an
opLlmlzaLlon algorlLhm drlven by an error slgnal 8ecause of Lhe complexlLy of Lhe
opLlmlzaLlon algorlLhms mosL adapLlve fllLers are dlglLal fllLers 8y way of
conLrasL a nonadapLlve fllLer has a sLaLlc Lransfer funcLlon AdapLlve fllLers are
requlred for some appllcaLlons because some parameLers of Lhe deslred
processlng operaLlon are noL known ln advance 1he adapLlve fllLer uses feedback


ln Lhe form of an error slgnal Lo reflne lLs Lransfer funcLlon Lo maLch Lhe changlng
parameLers
1he adapLlve fllLer ls lmplemenLed uslng elLher LM algorlLhm or 8L algorlLhm
As per Lhe L81 charL we are now undersLandlng Lhe concepLs relaLed Lo Lhe
algorlLhms


8aslc ouLllne of LM and lLs varlaLlons Cne of Lhe maln consLralnLs ln Lhe
cholce of an adapLlve algorlLhm ls lLs compuLaLlonal complexlLy or Lhe
appllcaLlon of n1 lL ls deslred Lo choose an algorlLhm whlch ls compuLaLlonally
very fasL 1aklng Lhls lnLo conslderaLlon LM algorlLhm became an obvlous cholce
over 8L 1he updaLe equaLlon for Lhe LM algorlLhm ls glven by
w(n+1) w(n) + *e(n)*w(n)
where ls Lhe sLep slze
e(n) ls Lhe error aL Llme n and
w(n) ls Lhe fllLer coefflclenLs aL Llme lnsLanL n