資源簡介
算法思想一:參照 http://wenku.baidu.com/view/aa110412a21614791711282a.html
算法思想二:參照 http://wenku.baidu.com/link?url=b1PwOhUSBhwyJee43jUOyOG45-woddl-nO6bt7LHLmlUbJu8ZQ3fGXpxARNxF5-Pa_H8vrCg6xRhllM_LSvU19OG80U0kMQbiTWO-3StUSu
算法思想三:公式 z(i,j)=∑ ∑x(m,n)y(i-m,j-n)
代碼片段和文件信息
#include?“CLConv.h“
//void?CLConv::juanji(int?x[N1][M1]int?y[N2][M2]int?z[N1+N2-1][M1+M2-1])
//{
// int?ij;
// int?nm;
// for(i=0;i // for(j=0;j // {
// int?temp=0;
// for(m=0;m // for(n=0;n // if((i-m)>=0&&(i-m)=0&&(j-n) // temp+=x[m][n]*y[i-m][j-n];
// z[i][j]=temp;
// }
//}
bool?CL2DMatrix::Conv2(CL2DMatrix?&_srcACL2DMatrix?&_srcB)
{
if(ReSize(_srcA.m_rows+_srcB.m_rows-1_srcA.m_cols+_srcB.m_cols-1)?==?false?)
return?false;
for(int?i=0;i {
for(int?j=0;j {
int?temp=0;
for(int?m=0;m<_srcA.m_rows;m++)
{
for(int?n=0;n<_srcA.m_cols;n++)
{
if((i-m)>=0&&(i-m)<_srcB.m_rows?&&?(j-n)>=0&&(j-n)<_srcB.m_cols)
{
//
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件???????7678??2016-07-06?09:46??LConv2\CLConv.cpp
?????文件???????4300??2016-07-06?09:44??LConv2\CLConv.h
?????文件????????874??2016-07-06?09:27??LConv2\Conv2.sln
?????文件???????4086??2016-07-06?09:27??LConv2\Conv2.vcproj
?????文件????????829??2016-07-06?09:46??LConv2\main.cpp
?????目錄??????????0??2016-07-06?09:46??LConv2
-----------?---------??----------?-----??----
????????????????17767????????????????????6
評論
共有 條評論