C++自定义自适应中值滤波

Mat autoMedFilter(Mat img, int filter_size,int max_filter_size) {
	//滤波器尺寸必须是奇数
	if ((filter_size % 2) != 1 || filter_size >= img.cols || filter_size >= img.rows)
	{
		printf("wrong size of the filter");
		return img;
	}
	//获取图片信息
	Mat OrignImg = img;
	Mat med_filter = Mat(img.size(), CV_8U, Scalar(0));

	int width = img.cols;
	int hight = img.rows;

	//自适应中值滤波
	for (int i = ((filter_size - 1) / 2); i < width - ((filter_size -1) / 2); i++) {
		for (int j = ((filter_size - 1) / 2); j < hight  - ((filter_size-1) / 2); j++)
		{
			uchar max_pixel = 0;
			uchar min_pixel = 255;
			 int med_pixel = 0;
			 //存储像素值
			 std::vector<uchar> filter;

			//判断选择合适大小的滤波器
			 int filter_size_l = filter_size;
			do
			{
				filter.clear();//清空滤波器
				for (int k = i - ((filter_size_l - 1) / 2); k <= i + ((filter_size_l - 1) / 2); k++)
					for (int m = j - ((filter_size_l - 1) / 2); m <= j + ((filter_size_l - 1) / 2); m++)
					{
						filter.push_back(OrignImg.at<uchar>(m, k));
					}
				//找最高最低中值像素,对滤波器内像素排序
				for (int fl_i = 0; fl_i < filter.size()-1; fl_i++)
				{
					int fl_ii = fl_i;
					while ((fl_ii >= 0 )&& (filter[fl_ii] > filter[fl_ii + 1]))
					{
						int temp = filter[fl_ii+1];
						filter[fl_ii+1] = filter[fl_ii];
						filter[fl_ii] = temp;
						fl_ii--;

					}
				}
				max_pixel = filter[filter.size() - 1];
				min_pixel = filter[0];
				med_pixel = filter[filter.size() / 2];
				filter_size_l = filter_size_l + 2;//滤波器尺寸加2
			} while (((med_pixel <= min_pixel) || (med_pixel >= max_pixel))&&((filter_size_l < max_filter_size)
				&&(filter_size_l<(2*i+1))
				&&(filter_size_l<(2*j+1)
				&&(filter_size_l < 2*(hight - j))
				&& (filter_size_l < 2*(width- i)))));
			//
			if (OrignImg.at<uchar>(j, i) == min_pixel || max_pixel == OrignImg.at<uchar>(j, i))
			{
				med_filter.at<uchar>(j, i) = med_pixel;
			}
			else
				med_filter.at<uchar>(j, i) = OrignImg.at<uchar>(j, i);
				//med_filter.at<uchar>(j, i) = med_pixel;
		}
	}
	return med_filter;
}
  • 0
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值