Continuing with my work on some “research” releated to webcam and object recognitionI got a little bit addicted to imageprocessing. You can see some of a lot of working filters here. The latest beauty is the automatic levels correction by stretching the histogram. The auto-levels takes 250ms for a 640×480 px image which is not bad. Most filters are look-up based.
Thr problem is that I can never decide what seems to be the best and fastest method. An image is of course built from a BitmapData input. First I started with a BitmapData for every color-channel (4 bitmaps for a RGBA image). I am currently using an Array for every channel, because looping through the whole image is faster and I get rid of the get-/setPixel method.
But some new ideas using native methods could speed up everything again. I am not sure, but palletteMap has the potential to make all look-up-table based filters incredible fast. I will give it a try…tomorrow maybe.
me working on a type-of-image-processor, and i use fixed length vectors for the separate channels, within a final class – accessing them through public class properties…Not get/set methods.
Drawing is done with bitmapData.setVector().
Fastest working design for me till now.
Although i would love to see, how to implement these new opcodes that come with Alchemy (without haxe, the adobe-way)…But i’m still not sure how to do that.
Parsing the web for days now. ( and most of the hits got me to Your blog :D )
cheers.
ps: i see that this is an over three years old post…of course no Flash10, no alchemy back then..