Fast Box Blur After Effects

Posted on by



  1. After Effects Lens Blur
  2. Blur Effect Online
  3. Edge Blur After Effects
  4. Fast Box Blur After Effects Download
  5. Fast Box Blur After Effect Francais

Export an After Effects project as an Adobe Premiere Pro project; Converting movies; Automated rendering and network rendering; Rendering and exporting still images and still-image sequences; Using the GoPro CineForm codec in After Effects; Working with other applications. Dynamic Link and After Effects; Working with After Effects and other.

After Effects Lens Blur

This post is similar to my previous post, but this post is about blurring an existing image, the previous post was about rendering colored rectangles.

  • Aug 01, 2005 or (multiple effects needed) Add any Blur (‘Box Blur’, ‘Fast Blur’, ‘Gaussian blur’, whatever) Add a ‘Levels’ effect where you set “Alpha Input Black” = 128; Add a “CC Composite” effect; The blurriness of your first filter takes care of the feather radius.
  • Mar 14, 2019 FAST CAMERA LENS BLUR 4.1.0 WIN FULL VERSION FOR AFTER EFFECTS AND PREMIERE PRO THE FASTEST BLUR & GLOW EFFECT IN THE WORLD FOR AFTER EFFECTS AND PREMIERE PRO. FAST AND BEAUTIFUL REALISTIC CAMERA LENS BLUR Renders realistic camera lens blur just like the native “Camera Lens Blur” effect of Adobe After Effects but faster,.
  • Blur Templates for After Effects 6 Free After Effects Templates for Blur. All of our After Effects Templates are free to download and ready to use in your next video project, under the Mixkit License.

For a game I’m creating (check out a beta at Flow) I needed a really fast way to repeatedly blur images (WriteableBitmap in this case) in Silverlight.
There are blur functions as image effects, and if that satisfies your needs then you should go with that. But I needed to generate my bitmap, blur it, update it, blur it and so on.

I’ve submitted the code below to the WriteableBitmapEx project as a contribution, but it hasn’t been accepted nor rejected yet. I’m publishing it here in case anyone needs it.

Fast box blur after effects missing

Box Blur is a very fast method for blurring (http://www.vcskicks.com/box-blur.php) but for it to be fast you must implement it as an accumulator, not a convolution loop.

Finding implementations of Box Blur, in C#, that uses convolution kernels (as in the link above) is trivial, finding one that uses an accumulator proved more difficult. The method below uses an accumulator.

Blur Effect Online

The code for using the blur method looks like this;

Fast box blur after effect francais

Edge Blur After Effects

Blur

Before Box Blur;

Fast Box Blur After Effects Download

After Box Blur (range=13);

Fast Box Blur After Effect Francais

Running BoxBlur on this 512×512 takes about 32 ms (averaged over 1000 runs) on my computer.

public static void BoxBlur(this WriteableBitmap bmp, int range) { if ((range & 1) 0) { throw new InvalidOperationException(“Range must be odd!”); } bmp.BoxBlurHorizontal(range); bmp.BoxBlurVertical(range); } public static void BoxBlurHorizontal(this WriteableBitmap bmp, int range) { int[] pixels = bmp.Pixels; int w = bmp.PixelWidth; int h = bmp.PixelHeight; int halfRange = range / 2; int index = 0; int[] newColors = new int[w]; for (int y = 0; y < h; y++) { int hits = 0; int r = 0; int g = 0; int b = 0; for (int x = -halfRange; x < w; x++) { int oldPixel = x – halfRange – 1; if (oldPixel >= 0) { int col = pixels[index + oldPixel]; if (col != 0) { r -= ((byte)(col >> 16)); g -= ((byte)(col >> 8)); b -= ((byte)col); } hits–; } int newPixel = x + halfRange; if (newPixel < w) { int col = pixels[index + newPixel]; if (col != 0) { r += ((byte)(col >> 16)); g += ((byte)(col >> 8)); b += ((byte)col); } hits++; } if (x >= 0) { int color = (255 << 24) | ((byte)(r / hits) << 16) | ((byte)(g / hits) << 8) | ((byte)(b / hits)); newColors[x] = color; } } for (int x = 0; x < w; x++) { pixels[index + x] = newColors[x]; } index += w; } } public static void BoxBlurVertical(this WriteableBitmap bmp, int range) { int[] pixels = bmp.Pixels; int w = bmp.PixelWidth; int h = bmp.PixelHeight; int halfRange = range / 2; int[] newColors = new int[h]; int oldPixelOffset = -(halfRange + 1) * w; int newPixelOffset = (halfRange) * w; for (int x = 0; x < w; x++) { int hits = 0; int r = 0; int g = 0; int b = 0; int index = -halfRange * w + x; for (int y = -halfRange; y < h; y++) { int oldPixel = y – halfRange – 1; if (oldPixel >= 0) { int col = pixels[index + oldPixelOffset]; if (col != 0) { r -= ((byte)(col >> 16)); g -= ((byte)(col >> 8)); b -= ((byte)col); } hits–; } int newPixel = y + halfRange; if (newPixel < h) { int col = pixels[index + newPixelOffset]; if (col != 0) { r += ((byte)(col >> 16)); g += ((byte)(col >> 8)); b += ((byte)col); } hits++; } if (y >= 0) { int color = (255 << 24) | ((byte)(r / hits) << 16) | ((byte)(g / hits) << 8) | ((byte)(b / hits)); newColors[y] = color; } index += w; } for (int y = 0; y < h; y++) { pixels[y * w + x] = newColors[y]; } } }