smt*_*tsp 1 c++ opencv matrix size-reduction
考虑一下,我有以下矩阵
0 1 2 3
4 5 6 7
8 9 10 11
12 13 14 15
Run Code Online (Sandbox Code Playgroud)
我想在不使用for循环的情况下检索偶数索引中的值(x和y索引都是偶数).
0 2
8 10
Run Code Online (Sandbox Code Playgroud)
我有大尺寸的图像(许多5000*5000 +灰度矩阵).使用for循环似乎不是最好的方法.我想听听是否有比循环更好的方法.
我尝试使用以下掩码,然后进行操作,但效率不高,因为我需要做4*n ^ 2乘法而不是n ^ 2(假设原始图像是2n*2n)
1 0 1 0
0 0 0 0
1 0 1 0
0 0 0 0
Run Code Online (Sandbox Code Playgroud)
请注意,我在矩阵上执行多个操作.任何帮助表示赞赏.
提前致谢,
您可以删除无用的行和列,并处理原始矩阵大小一半的矩阵.
您可以使用该resize函数轻松完成此操作,使用最近的插值:
#include <opencv2/opencv.hpp>
#include <iostream>
using namespace cv;
using namespace std;
int main(int argc, char **argv)
{
Mat1b mat = (Mat1b(4,4) << 0, 1, 2, 3,
4, 5, 6, 7,
8, 9, 10, 11,
12, 13, 14, 15);
Mat1b res;
resize(mat, res, Size(0, 0), 0.5, 0.5, INTER_NEAREST);
cout << "Mat:" << endl << mat << endl << endl;
cout << "Res:" << endl << res << endl;
return 0;
}
Run Code Online (Sandbox Code Playgroud)
那么值in res只是你需要的索引值:
Mat:
[0, 1, 2, 3;
4, 5, 6, 7;
8, 9, 10, 11;
12, 13, 14, 15]
Res:
[0, 2;
8, 10]
Run Code Online (Sandbox Code Playgroud)
为了将值恢复到原始位置,您可以使用合适模式的Kronecker产品(在OpenCV中不可用,但可以轻松实现).这将产生:
Mat:
[0, 1, 2, 3;
4, 5, 6, 7;
8, 9, 10, 11;
12, 13, 14, 15]
Res:
[0, 2;
8, 10]
Res Modified:
[1, 3;
9, 11]
Restored:
[1, 0, 3, 0;
0, 0, 0, 0;
9, 0, 11, 0;
0, 0, 0, 0]
Run Code Online (Sandbox Code Playgroud)
码:
#include <opencv2/opencv.hpp>
#include <algorithm>
#include <iostream>
using namespace cv;
using namespace std;
Mat kron(const Mat A, const Mat B)
{
CV_Assert(A.channels() == 1 && B.channels() == 1);
Mat1d Ad, Bd;
A.convertTo(Ad, CV_64F);
B.convertTo(Bd, CV_64F);
Mat1d Kd(Ad.rows * Bd.rows, Ad.cols * Bd.cols, 0.0);
for (int ra = 0; ra < Ad.rows; ++ra)
{
for (int ca = 0; ca < Ad.cols; ++ca)
{
Kd(Range(ra*Bd.rows, (ra + 1)*Bd.rows), Range(ca*Bd.cols, (ca + 1)*Bd.cols)) = Bd.mul(Ad(ra, ca));
}
}
Mat K;
Kd.convertTo(K, A.type());
return K;
}
int main(int argc, char **argv)
{
Mat1b mat = (Mat1b(4, 4) << 0, 1, 2, 3,
4, 5, 6, 7,
8, 9, 10, 11,
12, 13, 14, 15);
Mat1b res;
resize(mat, res, Size(0, 0), 0.5, 0.5, INTER_NEAREST);
cout << "Mat:" << endl << mat << endl << endl;
cout << "Res:" << endl << res << endl << endl;
// Work on Res
res += 1;
cout << "Res Modified:" << endl << res << endl << endl;
// Define the pattern
Mat1b pattern = (Mat1b(2,2) << 1, 0,
0, 0);
// Apply Kronecker product
Mat1b restored = kron(res, pattern);
cout << "Restored:" << endl << restored << endl << endl;
return 0;
}
Run Code Online (Sandbox Code Playgroud)