JavaScript阵列的二维卷积

function convolution(input, kernel) {
  const inputRows = input.length;
  const inputCols = input[0].length;
  const kernelRows = kernel.length;
  const kernelCols = kernel[0].length;

  const output = [];

  // 遍历输入矩阵的每个元素
  for (let i = 0; i <= inputRows - kernelRows; i++) {
    const row = [];

    for (let j = 0; j <= inputCols - kernelCols; j++) {
      let sum = 0;

      // 对应位置元素相乘并求和
      for (let m = 0; m < kernelRows; m++) {
        for (let n = 0; n < kernelCols; n++) {
          sum += input[i + m][j + n] * kernel[m][n];
        }
      }

      row.push(sum);
    }

    output.push(row);
  }

  return output;
}

// 示例用法
const input = [
  [1, 2, 3, 4, 5],
  [6, 7, 8, 9, 10],
  [11, 12, 13, 14, 15]
];
const kernel = [
  [1, 1],
  [1, 1]
];
const result = convolution(input, kernel);
console.log(result);