美文网首页
高斯模糊

高斯模糊

作者: 中王之王 | 来源:发表于2018-08-30 15:01 被阅读24次

原文地址:https://github.com/zuiwuyuan/FastBlur_VoiceChat

private int scaleRatio =5;

private int blurRadius =5;

private void initView() {

img  = findViewById(R.id.img);

Bitmap img_bg = BitmapFactory.decodeResource(getResources(),R.mipmap.touxiang);

Bitmap scaledBitmap = Bitmap.createScaledBitmap(img_bg,

img_bg.getWidth() /scaleRatio,

img_bg.getHeight() /scaleRatio,

false);

img_bg = GaoSiMoHu.doBlur(scaledBitmap,blurRadius,true);

img.setImageBitmap(img_bg);

引用的类

public class GaoSiMoHu {

public static Bitmap doBlur(Bitmap sentBitmap,int radius,boolean canReuseInBitmap) {

Bitmap bitmap;

if (canReuseInBitmap) {

bitmap = sentBitmap;

}else {

bitmap = sentBitmap.copy(sentBitmap.getConfig(),true);

}

if (radius <1) {

return (null);

}

int w = bitmap.getWidth();

int h = bitmap.getHeight();

int[] pix =new int[w * h];

bitmap.getPixels(pix,0, w,0,0, w, h);

int wm = w -1;

int hm = h -1;

int wh = w * h;

int div = radius + radius +1;

int r[] =new int[wh];

int g[] =new int[wh];

int b[] =new int[wh];

int rsum, gsum, bsum, x, y, i, p, yp, yi, yw;

int vmin[] =new int[Math.max(w, h)];

int divsum = (div +1) >>1;

divsum *= divsum;

int dv[] =new int[256 * divsum];

for (i =0; i <256 * divsum; i++) {

dv[i] = (i / divsum);

}

yw = yi =0;

int[][] stack =new int[div][3];

int stackpointer;

int stackstart;

int[] sir;

int rbs;

int r1 = radius +1;

int routsum, goutsum, boutsum;

int rinsum, ginsum, binsum;

for (y =0; y < h; y++) {

rinsum = ginsum = binsum = routsum = goutsum = boutsum = rsum = gsum = bsum =0;

for (i = -radius; i <= radius; i++) {

p = pix[yi + Math.min(wm, Math.max(i,0))];

sir = stack[i + radius];

sir[0] = (p &0xff0000) >>16;

sir[1] = (p &0x00ff00) >>8;

sir[2] = (p &0x0000ff);

rbs = r1 - Math.abs(i);

rsum += sir[0] * rbs;

gsum += sir[1] * rbs;

bsum += sir[2] * rbs;

if (i >0) {

rinsum += sir[0];

ginsum += sir[1];

binsum += sir[2];

}else {

routsum += sir[0];

goutsum += sir[1];

boutsum += sir[2];

}

}

stackpointer = radius;

for (x =0; x < w; x++) {

r[yi] = dv[rsum];

g[yi] = dv[gsum];

b[yi] = dv[bsum];

rsum -= routsum;

gsum -= goutsum;

bsum -= boutsum;

stackstart = stackpointer - radius + div;

sir = stack[stackstart % div];

routsum -= sir[0];

goutsum -= sir[1];

boutsum -= sir[2];

if (y ==0) {

vmin[x] = Math.min(x + radius +1, wm);

}

p = pix[yw + vmin[x]];

sir[0] = (p &0xff0000) >>16;

sir[1] = (p &0x00ff00) >>8;

sir[2] = (p &0x0000ff);

rinsum += sir[0];

ginsum += sir[1];

binsum += sir[2];

rsum += rinsum;

gsum += ginsum;

bsum += binsum;

stackpointer = (stackpointer +1) % div;

sir = stack[(stackpointer) % div];

routsum += sir[0];

goutsum += sir[1];

boutsum += sir[2];

rinsum -= sir[0];

ginsum -= sir[1];

binsum -= sir[2];

yi++;

}

yw += w;

}

for (x =0; x < w; x++) {

rinsum = ginsum = binsum = routsum = goutsum = boutsum = rsum = gsum = bsum =0;

yp = -radius * w;

for (i = -radius; i <= radius; i++) {

yi = Math.max(0, yp) + x;

sir = stack[i + radius];

sir[0] = r[yi];

sir[1] = g[yi];

sir[2] = b[yi];

rbs = r1 - Math.abs(i);

rsum += r[yi] * rbs;

gsum += g[yi] * rbs;

bsum += b[yi] * rbs;

if (i >0) {

rinsum += sir[0];

ginsum += sir[1];

binsum += sir[2];

}else {

routsum += sir[0];

goutsum += sir[1];

boutsum += sir[2];

}

if (i < hm) {

yp += w;

}

}

yi = x;

stackpointer = radius;

for (y =0; y < h; y++) {

// Preserve alpha channel: ( 0xff000000 & pix[yi] )

                pix[yi] = (0xff000000 & pix[yi]) | (dv[rsum] <<16) | (dv[gsum] <<8) | dv[bsum];

rsum -= routsum;

gsum -= goutsum;

bsum -= boutsum;

stackstart = stackpointer - radius + div;

sir = stack[stackstart % div];

routsum -= sir[0];

goutsum -= sir[1];

boutsum -= sir[2];

if (x ==0) {

vmin[y] = Math.min(y + r1, hm) * w;

}

p = x + vmin[y];

sir[0] = r[p];

sir[1] = g[p];

sir[2] = b[p];

rinsum += sir[0];

ginsum += sir[1];

binsum += sir[2];

rsum += rinsum;

gsum += ginsum;

bsum += binsum;

stackpointer = (stackpointer +1) % div;

sir = stack[stackpointer];

routsum += sir[0];

goutsum += sir[1];

boutsum += sir[2];

rinsum -= sir[0];

ginsum -= sir[1];

binsum -= sir[2];

yi += w;

}

}

bitmap.setPixels(pix,0, w,0,0, w, h);

return (bitmap);

}

}

相关文章

  • Android图片高斯模糊动画

    前言 这里只讲高斯模糊动画的处理,不讨论高斯模糊的处理方式。想看高斯模糊处理的可以参考这个Android 图片高斯...

  • 快速模糊算法

    图片模糊算法有均值模糊和高斯模糊,均值模糊快速但效果不如高斯,高斯模糊效果好但效率慢。 一种快速模糊算法:算法取自...

  • Java实现高斯模糊和图像的空间卷积

    高斯模糊 高斯模糊(英语:Gaussian Blur),也叫高斯平滑,是在Adobe Photoshop、GIMP...

  • 高斯模糊(Gaussian Blur)笔记

    高斯模糊 在我的理解中高斯模糊与高斯滤波器(Gaussian Filter)和高斯平滑(Gaussian Smoo...

  • 高斯模糊

    原文地址:https://github.com/zuiwuyuan/FastBlur_VoiceChat priv...

  • 高斯模糊

    /** *创建需要的毛玻璃特效类型 */ UIBlurEffect*blurEffect = [UIBlurEff...

  • 高斯模糊

    https://blog.csdn.net/qq_34664239/article/details/7916549...

  • 高斯模糊

    参考文献:阮一峰的网络日志通常,图像处理软件会提供"模糊"(blur)滤镜,使图片产生模糊的效果。 "模糊"的算法...

  • 高斯模糊

    高斯模糊 【iOS 开发】实现毛玻璃(高斯模糊)效果 - CocoaChina_让移动开发更简单

  • 高斯模糊

    RenderScript是Android在API 11之后加入的,用于高效的图片处理,包括模糊、混合、矩阵卷积计算...

网友评论

      本文标题:高斯模糊

      本文链接:https://www.haomeiwen.com/subject/unzrwftx.html