Android實現圖片高斯模糊

來源:互聯網
上載者:User

標籤:影像處理   圖片   photoshop   軟體   android   

最近項目設計上需要用到稍微比較模糊的圖片,因此我就去百度搜了一下,處理辦法大概就是藉助神器PS(花千骨看多了,呵呵)。但是在程式猿的眼裡,代碼可以實現一切。下面我就來實現一個Android高斯模糊。

高斯模糊:高斯模糊(Gaussian Blur)是美國Adobe映像軟體公司開發的一個影像處理軟體:Adobe Photoshop(系列)中的一個濾鏡,具體的位置在:濾鏡—模糊——高斯模糊!高斯模糊的原理中,它是根據高斯曲線調節象素色值,它是有選擇地模糊映像。說得直白一點,就是高斯模糊能夠把某一點周圍的像素色值按高斯曲線統計起來,採用數學上加權平均的計算方法得到這條曲線的色值,最後能夠留下人物的輪廓,即曲線.是指當 Adobe Photoshop 將加權平均應用於像素時產生的鐘形曲線。
在PS中間,你應該知道所有的顏色不過都是數字,各種模糊不過都是演算法。把要模糊的像素色值統計,用數學上加權平均的計算方法(高斯函數)得到色值,對範圍、半徑等進行模糊,大致就是高斯模糊。

這個比較官方的解釋。

原理:所謂”模糊”,可以理解成每一個像素都取周邊像素的平均值。
高斯模糊原理的圖解

右圖中,2是中間點,周邊點都是1。
“中間點”取”周圍點”的平均值,就會變成1。在數值上,這是一種”平滑化”。在圖形上,就相當於產生”模糊”效果,”中間點”失去細節。
顯然,計算平均值時,取值範圍越大,”模糊效果”越強烈。

RenderScript類:RenderScript 是Android 平台上的一種類C指令碼語言。在我們程式上實現RenderScript 渲染功能。

Android的核心代碼:

“`
public class Blur {

private static final String TAG = "Blur";@SuppressLint("NewApi")public static Bitmap fastblur(Context context, Bitmap sentBitmap, int radius) {    if (VERSION.SDK_INT > 16) {        Bitmap bitmap = sentBitmap.copy(sentBitmap.getConfig(), true);        final RenderScript rs = RenderScript.create(context);        final Allocation input = Allocation.createFromBitmap(rs, sentBitmap, Allocation.MipmapControl.MIPMAP_NONE,                Allocation.USAGE_SCRIPT);        final Allocation output = Allocation.createTyped(rs, input.getType());        final ScriptIntrinsicBlur script = ScriptIntrinsicBlur.create(rs, Element.U8_4(rs));        script.setRadius(radius /* e.g. 3.f */);        script.setInput(input);        script.forEach(output);        output.copyTo(bitmap);        return bitmap;    }    Bitmap 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];    Log.e("pix", w + " " + h + " " + pix.length);    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;        }    }    Log.e("pix", w + " " + h + " " + pix.length);    bitmap.setPixels(pix, 0, w, 0, 0, w, h);    return (bitmap);}

}
實現原理其實就是根據高斯函數來實現的。有興趣大家可以去研究這個函數。

用法根據建構函式將相應的值傳入就可以了。

著作權聲明:本文為博主原創文章,未經博主允許不得轉載。

Android實現圖片高斯模糊

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.