根据很多博客和高斯函数的理论知识,高斯函数具有分离性,二维计算可以分解为两个一维高斯计算,这样分解的计算量有很大程度的减少,所以参考众多博客,使用了c++,将网上存在一些可以使用的分离版高斯滤波进行少量调整,使其真正能够使用(至少是我自己能够跑通可以出正确结果),下面将代码分享给大家:
参考自 高斯滤波(GaussianFilter)原理及C++实现_小武的博客-CSDN博客_c++实现高斯滤波
void separateGaussianFilter1(const Mat &src, Mat &dst, int ksize, double sigma)
{
//Mat src = src1.clone();
CV_Assert(src.channels() == 1 || src.channels() == 3); // 只处理单通道或者三通道图像
// 生成一维的高斯滤波模板
double *matrix = new double[ksize];
double sum = 0;
int origin = ksize / 2;
for (int i = 0; i < ksize; i++)
{
// 高斯函数前的常数可以不用计算,会在归一化的过程中给消去
double g = exp(-(i - origin) * (i - origin) / (2 * sigma * sigma));
sum += g;
matrix[i] = g;
}
// 归一化
for (int i = 0; i < ksize; i++)
matrix[i] /= sum;
// 将模板应用到图像中
int border = ksize / 2;
copyMakeBorder(src, dst, border, border, border, border, cv::BORDER_REPLICATE);
int channels = dst.channels();
int rows = dst.rows - border;
int cols = dst.cols - border;
// 水平方向
for (int i = border; i < rows; i++)
{
for (int j = border; j < cols; j++)
{
double sum[3] = { 0 };
float* ptr = dst.ptr<float>(i);
for (int k = -border; k <= border; k++)
{
int border_k = border + k;
int j_k=j+k;
if (channels == 1)
{
sum[0] += matrix[border_k] * ptr[j_k]; // 行不变,列变化;先做水平方向的卷积
}
else if (channels == 3)
{
int j_k_3 = (j_k)* 3;
sum[0] += matrix[border_k] * ptr[j_k_3];
sum[1] += matrix[border_k] * ptr[j_k_3 + 1];
sum[2] += matrix[border_k] * ptr[j_k_3 + 2];
}
}
for (int k = 0; k < channels; k++)
{
if (sum[k] < 0)
sum[k] = 0;
else if (sum[k] > 255)
sum[k] = 255;
}
if (channels == 1)
ptr[j] = static_cast<float>(sum[0]);
else if (channels == 3)
{
int j_3 = j * 3;
ptr[j_3] = static_cast<float>(sum[0]);
ptr[j_3 + 1] = static_cast<float>(sum[1]);
ptr[j_3 + 2] = static_cast<float>(sum[2]);
}
}
}
// 竖直方向
for (int i = border; i < rows; i++)
{
for (int j = border; j < cols; j++)
{
double sum[3] = { 0 };
for (int k = -border; k <= border; k++)
{
float* ptr = dst.ptr<float>(i+k);
int border_k = border + k;
if (channels == 1)
{
sum[0] += matrix[border_k] * ptr[j]; // 列不变,行变化;竖直方向的卷积
}
else if (channels == 3)
{
int j_3 = j * 3;
sum[0] += matrix[border_k] * ptr[j_3];
sum[1] += matrix[border_k] * ptr[j_3 + 1];
sum[2] += matrix[border_k] * ptr[j_3 + 2];
}
}
for (int k = 0; k < channels; k++)
{
if (sum[k] < 0)
sum[k] = 0;
else if (sum[k] > 255)
sum[k] = 255;
}
float* ptr = dst.ptr<float>(i);
if (channels == 1)
ptr[j] = static_cast<float>(sum[0]);
else if (channels == 3)
{
int j_3 = j * 3;
ptr[j_3] = static_cast<float>(sum[0]);
ptr[j_3 + 1] = static_cast<float>(sum[1]);
ptr[j_3 + 2] = static_cast<float>(sum[2]);
}
}
}
dst = dst(Rect(ksize / 2, ksize/2,src.cols,src.rows));
delete[] matrix;
}