i wish i didn't have to post cause i wanted to wait until i'd got something good, but i kinda need an answer on this.
i've not done math for a good few years and certainly not on this scale ... would
c(u,v) 7 7 2*x+1 2*y+1
F(u,v) = --------- * sum sum f(x,y) * cos (------- *u*PI)* cos (------ *v*PI)
4 x=0 y=0 16 16
u,v = 0,1,...,7
{ 1/2 when u=v=0
c(u,v) = { 1/sqrt(2) when u=0, v!=0
{ 1/sqrt(2) when u!=0, v=0
{ 1 otherwise
be the same as (with the given that the (u,v) and (x,y) are arrays to the bitmap points
)
Foward(u,v) = (colour(u,v)/4) * Forward(x,y) * cos((2*x+1/16)*u*Phi) * cos((2*y+1/16)*v*phi)
if u = v && v = 0 then colour(u,v) = 1/2
else
if u = 0 !! v = 0 then colour(u,v) = 1/sqrt(2)
else
if u !! 0 and v = 0 then colour(u,v) = 1/sqrt(2)
else
colour(u,v) = 1
endif
endif
endif
i really can't remember what a SUM equasion is, gonna check through some books in a mo - but i'm sure someone understands this for me. This is just cause i need this compression method working and this would be simple with quadratics, but pro doesn't have them - and i havn't a clue howto do them outside of C
its very important i get this answer'd within the day else i can't use it - i'm on a very tight time limit
Tsu'va Oni Ni Jyuuko Fiori Sei Tau!
One block follows the suit ... the whole suit of blocks is the path ... what have you found?
