C#实现Savitzky - Golay滤波器:完整代码、详细说明与注意事项
Savitzky-Golay滤波器是一种常用于数据平滑处理的数字滤波器,它通过局部多项式回归来平滑数据。以下是一个用C#实现的Savitzky-Golay滤波器的示例代码: ```csharp using System; using System.Linq; public class SavitzkyGolayFilter { private int windowSize; private int polynomialOrder; private double[] coefficients; public SavitzkyGolayFilter(int windowSize, int polynomialOrder) { if (windowSize % 2 == 0) throw new ArgumentException("Window size must be odd."); if (polynomialOrder >= windowSize) throw new ArgumentException("Polynomial order must be less than window size."); this.windowSize = windowSize; this.polynomialOrder = polynomialOrder; this.coefficients = CalculateCoefficients(); } private double[] CalculateCoefficients() { int halfWindow = windowSize / 2; var A = new double[windowSize, polynomialOrder + 1]; for (int i = -halfWindow; i <= halfWindow; i++) { for (int j = 0; j <= polynomialOrder; j++) { A[i + halfWindow, j] = Math.Pow(i, j); } } var AT = TransposeMatrix(A); var ATA = MultiplyMatrices(AT, A); var ATAInverse = InvertMatrix(ATA); var ATAInverseAT = MultiplyMatrices(ATAInverse, AT); return ATAInverseAT.GetRow(halfWindow); } public double[] ApplyFilter(double[] data) { int halfWindow = windowSize / 2; var smoothedData = new double[data.Length]; for (int i = 0; i < data.Length; i++) { double sum = 0; for (int j = -halfWindow; j <= halfWindow; j++) { int index = i + j; if (index < 0) index = 0; if (index >= data.Length) index = data.Length - 1; sum += coefficients[j + halfWindow] * data[index]; } smoothedData[i] = sum; } return smoothedData; } private double[,] TransposeMatrix(double[,] matrix) { int rows = matrix.GetLength(0); int cols = matrix.GetLength(1); var result = new double[cols, rows]; for (int i = 0; i < rows; i++) { for (int j = 0; j < cols; j++) { result[j, i] = matrix[i, j]; } } return result; } private double[,] MultiplyMatrices(double[,] matrix1, double[,] matrix2) { int rows1 = matrix1.GetLength(0); int cols1 = matrix1.GetLength(1); int rows2 = matrix2.GetLength(0); int cols2 = matrix2.GetLength(1); if (cols1 != rows2) throw new ArgumentException("Matrix dimensions do not match for multiplication."); var result = new double[rows1, cols2]; for (int i = 0; i < rows1; i++) { for (int j = 0; j < cols2; j++) { for (int k = 0; k < cols1; k++) { result[i, j] += matrix1[i, k] * matrix2[k, j]; } } } return result; } private double[,] InvertMatrix(double[,] matrix) { int n = matrix.GetLength(0); var result = new double[n, n]; var identity = new double[n, n]; for (int i = 0; i < n; i++) { identity[i, i] = 1; } for (int i = 0; i < n; i++) { double pivot = matrix[i, i]; for (int j = 0; j < n; j++) { matrix[i, j] /= pivot; identity[i, j] /= pivot; } for (int k = 0; k < n; k++) { if (k != i) { double factor = matrix[k, i]; for (int j = 0; j < n; j++) { matrix[k, j] -= factor * matrix[i, j]; identity[k, j] -= factor * identity[i, j]; } } } } return identity; } } public static class MatrixExtensions { public static double[] GetRow(this double[,] matrix, int row) { int cols = matrix.GetLength(1); var result = new double[cols]; for (int i = 0; i < cols; i++) { result[i] = matrix[row, i]; } return result; } } class Program { static void Main() { var data = new double[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }; var filter = new SavitzkyGolayFilter(5, 2); var smoothedData = filter.ApplyFilter(data); Console.WriteLine("Smoothed Data:"); foreach (var value in smoothedData) { Console.WriteLine(value); } } } ``` 代码说明: 1. SavitzkyGolayFilter类:这是Savitzky-Golay滤波器的主要实现类。它包含计算滤波器系数和应用滤波器的方法。 2. CalculateCoefficients方法:计算Savitzky-Golay滤波器的系数矩阵。 3. ApplyFilter方法:应用滤波器到输入数据上,返回平滑后的数据。 4. 矩阵操作:包括矩阵转置、矩阵乘法和矩阵求逆等辅助方法。 注意事项: 1. 窗口大小:窗口大小必须是奇数,以确保滤波器对称。 2. 多项式阶数:多项式阶数必须小于窗口大小,以避免过拟合。 3. 边界处理:在应用滤波器时,边界点的处理需要特别注意,通常通过镜像或截断来处理边界数据。 ######[AI写代码神器 | 1378点数解答 | 2025-03-01 14:38:11]
- Verilog 实现 8 位无符号二阶 7 点Savitzky - Golay 光谱曲线平滑滤波及注意要点 (字节豆包 | 404点数解答 | 2025-05-14 16:28:03)168
- 基于 Savitzky - Golay 滤波的光谱曲线处理:计算红边位置、幅值与面积(讯飞星火 | 927点数解答 | 2024-11-13 13:10:27)596
- Python 实现 Savitzky - Golay 滤波的详细过程及注意要点(字节豆包 | 319点数解答 | 2024-12-20 14:16:01)206
- Python 实现球类:精准计算半径、表面积与体积,附输入验证与异常处理!(阿里通义 | 261点数解答 | 2024-11-28 21:19:39)371
- 缜密逻辑,全新无名杀“风餐”技能代码精心打造与深度解析 (字节豆包 | 469点数解答 | 2025-04-05 11:37:06)266
- C++ 实现我的世界基岩版:从简单框架到开发要点揭秘(字节豆包 | 182点数解答 | 2025-02-22 15:53:11)212
- C++ 实现完整斗地主:含洗牌、发牌与手牌展示,可按需扩展!(字节豆包 | 1028点数解答 | 2026-01-10 08:02:37)54
- Verilog 实现二次多项式 Savitzky - Golay 滤波:代码示例、解释与注意要点(字节豆包 | 829点数解答 | 2025-07-29 09:52:39)115
- 51 单片机:定时器 0 实现 8 个 LED 循环点亮,附代码及优化建议(字节豆包 | 1193点数解答 | 2024-12-27 15:10:29)342
- Java:设计圆类与圆柱体类并计算属性及体积表面积(字节豆包 | 470点数解答 | 2024-10-20 10:03:11)193
- Java 实现矩形与长方体类,精准计算底面积与体积(字节豆包 | 319点数解答 | 2024-10-20 10:25:46)301
- Java 实现矩形与长方体类,轻松计算底面积和体积(字节豆包 | 308点数解答 | 2024-10-20 10:34:27)284