This is even more true for the 2D case, since it is done essentially by running an fft for each column and afterwards for each row. In the N-D case you can easily realize that the complexity grows exponentially with the dimension size (which is expected, since the algorithm must fill an exponentially large number of elements).

]]>I like the window sticker idea!

]]>Clever idea about bottle caps. They’d be good giveaways. Did he just print them on paper, glue them inside, and glue a magnet on back? I have no preference on color, though the white one looks like it’s had more than it’s share of playing with. I’ve got a sticker on the back of my laptop. Though I’ll probably need to get a new sticker since it won’t survive the trip to my new laptop I should be getting soon (i7 3rd gen, 32 gig RAM, 1.5 TB of solid state drives!). Another idea: static cling window stickers for the inside of my car – how about those? I could be a mobile MATLAB billboard.

]]>http://www.mathworks.com/matlabcentral/answers/122981-serious-problem-with-createmask-function

]]>I have one serious related problem that I already posted in our http://www.mathworks.com/matlabcentral/answers/

It is related to mask creation shift and I provided one example here:

http://www.mathworks.com/matlabcentral/answers/122981-serious-problem-with-createmask-function

Do you have any idea how to solve it?

Thank you.

Meshoo

]]>