///////////////////////////////////////////A.CPP (blur.CPP)关键内容
#include "headers/blur.h"
#include "headers/zeros.h"
using namespace std;
// OPTIMIZATION: Pass large variable by reference
vector < vector <float> > blur(vector < vector < float> > &grid, float blurring) {
vector < vector <float> > newGrid;
newGrid = zeros(height,width);
return newGrid;
}
///////////////////////////////////////////////A.H内容
#ifndef BLUR_H
#define BLUR_H
#include <vector>
std::vector < std::vector <float> > blur(std::vector < std::vector < float> > &grid, float blurring);
#endif /* BLUR.H */
/////////////////////////////////////////////////B.H内容
#ifndef ZEROS_H
#define ZEROS_H
#include <iostream>
#include <ctime>
#include <vector>
std::vector < std::vector <float> > zeros(int height, int width);
#endif /* ZEROS.H */
/////////////////////////////////////////////////B.CPP内容
#include "headers/zeros.h"
using namespace std;
vector < vector <float> > zeros(int height, int width) {
int i, j;
// OPTIMIZATION: Reserve space in memory for vectors
vector < vector <float> > newGrid;
vector <float> newRow;
newGrid.reserve(height);
newRow.reserve(width);
// OPTIMIZATION: nested for loop not needed
// because every row in the matrix is exactly the same
for(vector < vector <float> >::iterator it=newGrid.begin();it!=newGrid.end();it++)
{
it->reserve(width);
}
newRow.clear();
for (j=0; j<width; j++) {
newRow.push_back(0.0);
}
for (i=0; i<height; i++) {
newGrid.push_back(newRow);
}
return newGrid;
}
矩阵模糊处理与初始化
本文详细介绍了使用C++实现矩阵的模糊处理(blur)及初始化(zeros)的算法过程。通过传递引用优化了大型变量的处理,避免了不必要的内存复制。同时,优化了内存分配,预先为矩阵预留空间,避免了嵌套循环的使用,提高了效率。
444

被折叠的 条评论
为什么被折叠?



