| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195 |
- /*
- * Copyright (c) 2011, Tom Distler (http://tdistler.com)
- * All rights reserved.
- *
- * The BSD License
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- * - Redistributions of source code must retain the above copyright notice,
- * this list of conditions and the following disclaimer.
- *
- * - Redistributions in binary form must reproduce the above copyright notice,
- * this list of conditions and the following disclaimer in the documentation
- * and/or other materials provided with the distribution.
- *
- * - Neither the name of the tdistler.com nor the names of its contributors may
- * be used to endorse or promote products derived from this software without
- * specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
- #include "convolve.h"
- #include <stdlib.h>
- float KBND_SYMMETRIC(const float *img, int w, int h, int x, int y, float bnd_const)
- {
- (void)bnd_const;
- if (x<0) x=-1-x;
- else if (x>=w) x=(w-(x-w))-1;
- if (y<0) y=-1-y;
- else if (y>=h) y=(h-(y-h))-1;
- return img[y*w + x];
- }
- float KBND_REPLICATE(const float *img, int w, int h, int x, int y, float bnd_const)
- {
- (void)bnd_const;
- if (x<0) x=0;
- if (x>=w) x=w-1;
- if (y<0) y=0;
- if (y>=h) y=h-1;
- return img[y*w + x];
- }
- float KBND_CONSTANT(const float *img, int w, int h, int x, int y, float bnd_const)
- {
- if (x<0) x=0;
- if (y<0) y=0;
- if (x>=w || y>=h)
- return bnd_const;
- return img[y*w + x];
- }
- static float _calc_scale(const struct _kernel *k)
- {
- int ii,k_len;
- double sum=0.0;
- if (k->normalized)
- return 1.0f;
- else {
- k_len = k->w * k->h;
- for (ii=0; ii<k_len; ++ii)
- sum += k->kernel[ii];
- if (sum != 0.0)
- return (float)(1.0 / sum);
- return 1.0f;
- }
- }
- void _iqa_convolve(float *img, int w, int h, const struct _kernel *k, float *result, int *rw, int *rh)
- {
- int x,y,kx,ky,u,v;
- int uc = k->w/2;
- int vc = k->h/2;
- int kw_even = (k->w&1)?0:1;
- int kh_even = (k->h&1)?0:1;
- int dst_w = w - k->w + 1;
- int dst_h = h - k->h + 1;
- int img_offset,k_offset;
- double sum;
- float scale, *dst=result;
- if (!dst)
- dst = img; /* Convolve in-place */
- /* Kernel is applied to all positions where the kernel is fully contained
- * in the image */
- scale = _calc_scale(k);
- for (y=0; y < dst_h; ++y) {
- for (x=0; x < dst_w; ++x) {
- sum = 0.0;
- k_offset = 0;
- ky = y+vc;
- kx = x+uc;
- for (v=-vc; v <= vc-kh_even; ++v) {
- img_offset = (ky+v)*w + kx;
- for (u=-uc; u <= uc-kw_even; ++u, ++k_offset) {
- sum += img[img_offset+u] * k->kernel[k_offset];
- }
- }
- dst[y*dst_w + x] = (float)(sum * scale);
- }
- }
- if (rw) *rw = dst_w;
- if (rh) *rh = dst_h;
- }
- int _iqa_img_filter(float *img, int w, int h, const struct _kernel *k, float *result)
- {
- int x,y;
- int img_offset;
- float scale, *dst=result;
- if (!k || !k->bnd_opt)
- return 1;
- if (!dst) {
- dst = (float*)malloc(w*h*sizeof(float));
- if (!dst)
- return 2;
- }
- scale = _calc_scale(k);
- /* Kernel is applied to all positions where top-left corner is in the image */
- for (y=0; y < h; ++y) {
- for (x=0; x < w; ++x) {
- dst[y*w + x] = _iqa_filter_pixel(img, w, h, x, y, k, scale);
- }
- }
- /* If no result buffer given, copy results to image buffer */
- if (!result) {
- for (y=0; y<h; ++y) {
- img_offset = y*w;
- for (x=0; x<w; ++x, ++img_offset) {
- img[img_offset] = dst[img_offset];
- }
- }
- free(dst);
- }
- return 0;
- }
- float _iqa_filter_pixel(const float *img, int w, int h, int x, int y, const struct _kernel *k, const float kscale)
- {
- int u,v,uc,vc;
- int kw_even,kh_even;
- int x_edge_left,x_edge_right,y_edge_top,y_edge_bottom;
- int edge,img_offset,k_offset;
- double sum;
- if (!k)
- return img[y*w + x];
- uc = k->w/2;
- vc = k->h/2;
- kw_even = (k->w&1)?0:1;
- kh_even = (k->h&1)?0:1;
- x_edge_left = uc;
- x_edge_right = w-uc;
- y_edge_top = vc;
- y_edge_bottom = h-vc;
- edge = 0;
- if (x < x_edge_left || y < y_edge_top || x >= x_edge_right || y >= y_edge_bottom)
- edge = 1;
- sum = 0.0;
- k_offset = 0;
- for (v=-vc; v <= vc-kh_even; ++v) {
- img_offset = (y+v)*w + x;
- for (u=-uc; u <= uc-kw_even; ++u, ++k_offset) {
- if (!edge)
- sum += img[img_offset+u] * k->kernel[k_offset];
- else
- sum += k->bnd_opt(img, w, h, x+u, y+v, k->bnd_const) * k->kernel[k_offset];
- }
- }
- return (float)(sum * kscale);
- }
|