OPTIMAL PERIODIC MEMORY ALLOCATION

FOR IMAGE PROCESSING WITH MULTIPLE

WINDOWS

GUIDED BY
PROF.R.R.DUBE

PRESENTED BY
DESHPANDE TANVI A.

CONTENTS:

SMALL INTRODUCTION OF PREVIOUS RESEARCH

WORK
PROPOSED METHOD IN OUR ARCHITECTURE
COMPARISION OF IT WITH PREVIOUS WORK WITH
HELP OF STEREO MATCHING VLSI PROCESSOR &
OPTICLE FLOW
FUTURE SCOPE
CONCLUSION

LOW POWER MEMORY MAPPING THROUGH

REDUCING ADDRESS BUS ACTIVITY

PROPOSED WORK:
EFFICIENT MEMORY ALLOCATION TO MINIMISATION OF
MEMORY MODULES & PEs
PARELLEL ACCES FROM MODULES
DUE TO OPTIMLE NO. OF MEMORY MODULE POWER USE
MINIMISATION
DUE TO PARELLEL ACCES TIME OPTIMISATION IS
ACHIEVED
IT IS PURPOSED FOR IMAGE PROCESSING WHICH USES
MULTIPLE WINDOWS
OPTIMISATION OF MEMORY MODULE IS DONE BY
PERIODIC FUCTION FOR MAPPING PIXEL TO MODULE
IF IT IS APPILED TO STEREOMATCHING & OPTICAL FLOW
THEN MODULES USED ARE REDUSED TO 2.7%.THAT IS
REDUSED BY 97.3% AND 90% REPT.
SEARCH TIME:1ms(PENTIUM4 AT 2GHz)

MEMORY ALLOCATION

MEMORY ALLOCATION FOR

MULTIPLE WINDOWS

Fig. 4. Memory allocation for two windows. (a)Windows. (b) Allocation1.

PERIODIC MEMORY ALLOCATION

K=Total no. Of modules(4)

Mi=module where pixel is to be stored;1< i < K,
Ni=Total no. of pixels tht wil be stored in Mi(6)
(x,y)=co-ordinates of pixel;1< j < Ni;

VECTOR PAIR

ESTIMATION OF NUMBER OF
MEMORY MODULS

BASIC ALGO FOR SEARCH METHOD:

FIRST STEP TO

FIND OUT
OPTIMAL
RECTANGLE
WHICH OCCUPY
ALL WINDOWS

SECOND STEP TO INTIALIZE VECTOR

PAIR AT MAXIMUM VALUE

EXAMPLE:

INTIALIZE Smin=NO. OF MEMORY MODULE

REQUIRED AT MAX

 FORTH STEP INITAILIZE G= ALL

POSSIBLE VECTOR PAIR

GIVE (U,V) TO CHECK_PARLLEL_ACES():

1.MEMORY ALLOCATION IS DONE AS THE
PERIODIC FUCTION
2.FOR EACH WINDOW SAY W1,W2,.Wn,WE CHECK
WHETHER ALL THE PIXEL OF IN WINDOW ARE
ALLOCATED TO DIFFERENT MEMORY MODULES
IF TRUE THEN IF(S<Smin)=TRUESmin=S
&

FURTHER IMROVEMENT IN SEARCH

ALGO :
IT CAN BE DONE BY FINDING EQUIVALENT PAIR(A,B) OF (U,V)

REDUCTION IN COMPLEXITY OF CHECK ||AL

ACEES:

PARELLEL ACCESS FOR MULTIPLE WINDOW

1:STEREO MACHTING VLSI

PROCESSOR

FOR SP=8,Q=4

2:OPTICAL FLOW

FUTURE SCOPE:

CONCLUSION:
THIS PAPER PRESENT THE OPTIMLE PERIODIC

ALLOCATION.
IT HAS ARCHRTECTURE AS SIMPLIFIED FORM
OF RECENT IMAGE PROCESSORS.
IN GPU ALSO SUCH AS RADEON X1900XT,WE
CAN IMPLIMENT THIS ALGO.
IT WILL REDUCE THE POWER COMSUMTION OF
GPU,(30 TO 100 W)

REFERENCES:
PAPER PRESENTED BY HARIYAMA &
KAMEYAMA IN IEEE TRANSATION (VLSI)IN
MARCH 2009
PAPER PRESENTED BY N.D. DUTT,PANDA &
P.RAJAN ONLOW POWER MEMORY MAPPING
THROUTH REDUSING ADDRESS BUS
ACTIVITYIEEE TRANSACTION (VLSI)
WWW.WIKIPEDIA .COM

THANK YOU