3种插值算法C++代码实现

最近邻插值算法

//最近邻插值
Vec3b INTER_NEAREST(double row, double col, const Mat& img) {
    int r = int(row + 0.5);
    int c = int(col + 0.5);
    Vec3b vec3b;
    if (r < 0 || r >= img.rows || c < 0 || c >= img.cols)
        vec3b[0] = vec3b[1] = vec3b[2] = 0;
    else
        vec3b = img.at<Vec3b>(r, c);
    return vec3b;
}

最近邻插值算法

//双线性插值
Vec3b INTER_LINEAR(double row, double col, const Mat& img) {
    Vec3b vec3b;
    double x = col, y = row;
    int x1 = int(col), y1 = int(row);
    if (y1 < 0 || y1 >= img.rows || x1 < 0 || x1 >= img.cols) {
        vec3b[0] = vec3b[1] = vec3b[2] = 0;
        return vec3b;
    }
    int x2 = min(x1 + 1, img.cols - 1), y2 = min(y1 + 1, img.rows - 1);
    Vec3b q11 = img.at<Vec3b>(y1, x1);
    Vec3b q12 = img.at<Vec3b>(y2, x1);
    Vec3b q21 = img.at<Vec3b>(y1, x2);
    Vec3b q22 = img.at<Vec3b>(y2, x2);

    for (int i = 0; i < 3; ++i) {
        double r1 = (x2 - x) * q11[i] / (x2 - x1) + (x - x1) * q21[i] / (x2 - x1);
        double r2 = (x2 - x) * q12[i] / (x2 - x1) + (x - x1) * q22[i] / (x2 - x1);
        double p = (y2 - y) * r1 / (y2 - y1) + (y - y1) * r2 / (y2 - y1);
        vec3b[i] = saturate_cast<uchar>(p);
    }
    return vec3b;
}

BiCubic插值算法

//BiCubic插值
Vec3b INTER_CUBIC(double row, double col, const Mat& img, double a) {
    Vec3b vec3b;
    int x = int(col + 0.5), y = int(row + 0.5);
    if (y < 0 || y >= img.rows || x < 0 || x >= img.cols) {
        vec3b[0] = vec3b[1] = vec3b[2] = 0;
        return vec3b;
    }

    static auto cubic_func = [&](double x)->double {
        if (abs(x) <= 1) return (a + 2) * pow(abs(x), 3) - (a + 3) * pow(abs(x), 2) + 1;
        if (abs(x) < 2) return a * pow(abs(x), 3) - 5 * a * pow(x, 2) + 8 * a * abs(x) - 4 * a;
        return 0.0;
    };

    vector<int>actions = { -1,0,1 };

    for (int k = 0; k < 3; ++k) {
        double tmp = 0;
        for (int i = 0; i < actions.size(); ++i) {
            for (int j = 0; j < actions.size(); ++j) {
                int x1 = min(max(0, x + actions[i]), img.cols);
                int y1 = min(max(0, y + actions[j]), img.rows);
                Vec3b f = img.at<Vec3b>(y1, x1);
                tmp += f[k] * cubic_func(x - x1) * cubic_func(y - y1);
            }
        }
        vec3b[k] = tmp;
    }
    return vec3b;
}