去极限平均值+加权+递归平均滤波算法

原文链接:http://www.itdoy.com/index.php/post/22.html

头文件:itdoy_FilterData.h

C

#ifndef __ITDOY_FILTERDATA_H__
#define __ITDOY_FILTERDATA_H__

#define FilterDataNumber 5
#define RecurrenceNumber 10

typedef struct
{
  float Data[FilterDataNumber];
  float LastResult;
  float RecurrenceData[RecurrenceNumber];
  float RecurrenceState;
  float Result;
}FilterData_Struct;

extern void itdoy_FilterData(FilterData_Struct * filter_data);//组合实现:去除极限平均值+加权+递归平均数据滤波

#endif

源文件:itdoy_FilterData.c

C

#include "itdoy_FilterData.h"

float RemoveLimitAverage(FilterData_Struct * filter_data)//去除极限值并求平均值
{
	int i = 0;
	float max_data = 0;
	float min_data = 0;
	float sum = 0;
	float average = 0;
	max_data = filter_data->Data[0];
	min_data = filter_data->Data[0];
	for(i = 0; i < FilterDataNumber; i++)
	{
		if(filter_data->Data[i] > max_data) max_data = filter_data->Data[i];
		else if(filter_data->Data[i] < min_data) min_data = filter_data->Data[i];
		sum = sum + filter_data->Data[i];
	}
	sum = sum - max_data - min_data;
	average = sum / (FilterDataNumber - 2);
	return average;
}

float AddWeight(FilterData_Struct * filter_data)//依据变化幅度进行加权
{
	float temp = 0;
	float weight = 0;
	float weight_data = 0;
	temp = RemoveLimitAverage(filter_data);
	if(temp > filter_data->LastResult)
	{
		weight = (temp - filter_data->LastResult) / filter_data->LastResult;
	}
	else
	{
		weight = (filter_data->LastResult - temp) / filter_data->LastResult;
	}
	weight_data = weight * temp;
	return weight_data;
}

float RecurrenceAverage(FilterData_Struct * filter_data)//对数据进行递归平均
{
	int i =0;
	float sum = 0;
	float average = 0;
	if(RecurrenceState < (RecurrenceNumber - 1))
	{
		RecurrenceState++;
	}
	else
	{
		RecurrenceState = 0;
	}
	filter_data->RecurrenceData[RecurrenceState] = AddWeight(filter_data);
	for(i = 0; i < RecurrenceNumber; i++)
	{
		sum = sum + filter_data->RecurrenceData[i];
	}
	average = sum / RecurrenceNumber;
	return average;
}

void itdoy_FilterData(FilterData_Struct * filter_data)//组合实现:去除极限平均值+加权+递归平均数据滤波
{
	RecurrenceAverage(filter_data);
}
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值