Eigen库学习笔记（五）张量计算1、规约操作2、最值与索引3、按索引取值 Array of indices4、类似 where的功能，生成mask5、reshape 改变形状元素个数不变6、广播机制

104 阅读 0 评论 69 点赞

我是靠谱客的博主时尚夏天，这篇文章主要介绍Eigen库学习笔记（五）张量计算1、规约操作2、最值与索引3、按索引取值 Array of indices4、类似 where的功能，生成mask5、reshape 改变形状元素个数不变6、广播机制，现在分享给大家，希望可以做个参考。

Eigen库学习笔记（五）张量计算

1、规约操作
2、最值与索引
3、按索引取值 Array of indices
4、类似 where的功能，生成mask
5、reshape 改变形状元素个数不变
6、广播机制

1、规约操作

Eigen provides several reduction methods such as: minCoeff() , maxCoeff() , sum() , prod() , trace() *, norm() *, squaredNorm() *, all() , and any() . All reduction operations can be done matrix-wise, column-wise or row-wise . Usage example:
在这里插入图片描述

2、最值与索引

可以取到最值与最值的索引。
按行或列取最值时，只能取到行或列的最值组成列或者行，不能取到行或列最值的索引。

复制代码

#include<Eigen/Core>
#include<iostream>
#include <vector>
using namespace std;
using namespace Eigen;

int test_min_max()
{
	MatrixXd::Index maxRow, maxCol;
	MatrixXd::Index minRow, minCol;
	MatrixXd mMat(4, 4);
	mMat << 11, 10, 13, 15,
		3, 24, 56, 1,
		2, 12, 45, 0,
		8, 5, 6, 4;
	double min = mMat.minCoeff(&minRow, &minCol);
	double max = mMat.maxCoeff(&maxRow, &maxCol);
	cout << "Max = n" << max << endl;
	cout << "Min = n" << min << endl;
	cout << "minRow = " << minRow << "minCol = " << minCol << endl;
	cout << "maxRow = " << maxRow << "maxCol = " << maxCol << endl;
	return 0;
}
 
void test_reduction()
{
	Eigen::MatrixXf mat(2, 4);
	mat << 1, 2, 6, 9,
		3, 1, 7, 2;
	std::cout << "mat: " << std::endl
		<< mat << std::endl;
	std::cout << "Column's maximum: " << std::endl
		<< mat.colwise().maxCoeff() << std::endl;

}

void test_find_max_index()
{
	Eigen::MatrixXf mat(2, 4);
	mat << 1, 2, 6, 9,
		3, 1, 7, 2;
	int i, j, k;
	mat.maxCoeff(&i, &j);
	VectorXf maxindex(mat.rows());
	for (int m = 0; m < mat.rows(); m++)
	{
		VectorXf tmp = mat.row(m);
		tmp.maxCoeff(&k);
		maxindex(m) = k;
	}
	
	std::cout << "The corresponding vector is: " << std::endl;
	std::cout <<i << "t" << j << "n" << maxindex << std::endl;

}

int main()
{
	//test_min_max();
	//test_reduction();
	test_find_max_index();
 
    
    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70


#include<Eigen/Core>
#include<iostream>
#include <vector>
using namespace std;
using namespace Eigen;

int test_min_max()
{
	MatrixXd::Index maxRow, maxCol;
	MatrixXd::Index minRow, minCol;
	MatrixXd mMat(4, 4);
	mMat << 11, 10, 13, 15,
		3, 24, 56, 1,
		2, 12, 45, 0,
		8, 5, 6, 4;
	double min = mMat.minCoeff(&minRow, &minCol);
	double max = mMat.maxCoeff(&maxRow, &maxCol);
	cout << "Max = n" << max << endl;
	cout << "Min = n" << min << endl;
	cout << "minRow = " << minRow << "minCol = " << minCol << endl;
	cout << "maxRow = " << maxRow << "maxCol = " << maxCol << endl;
	return 0;
}
 
void test_reduction()
{
	Eigen::MatrixXf mat(2, 4);
	mat << 1, 2, 6, 9,
		3, 1, 7, 2;
	std::cout << "mat: " << std::endl
		<< mat << std::endl;
	std::cout << "Column's maximum: " << std::endl
		<< mat.colwise().maxCoeff() << std::endl;

}

void test_find_max_index()
{
	Eigen::MatrixXf mat(2, 4);
	mat << 1, 2, 6, 9,
		3, 1, 7, 2;
	int i, j, k;
	mat.maxCoeff(&i, &j);
	VectorXf maxindex(mat.rows());
	for (int m = 0; m < mat.rows(); m++)
	{
		VectorXf tmp = mat.row(m);
		tmp.maxCoeff(&k);
		maxindex(m) = k;
	}
	
	std::cout << "The corresponding vector is: " << std::endl;
	std::cout <<i << "t" << j << "n" << maxindex << std::endl;

}

int main()
{
	//test_min_max();
	//test_reduction();
	test_find_max_index();
 
    
    return 0;
}

3、按索引取值 Array of indices

复制代码

1
2
3
4
5
6
7
8
void test_array_of_index()
{
	std::vector<int> ind{ 4,2,5,5,3 };
	MatrixXi A = MatrixXi::Random(4, 6);
	cout << "Initial matrix A:n" << A << "nn";
	cout << "A(all,ind):n" << A(all, ind) << "nn";
}

在这里插入图片描述
这个功能很好，可是我用的那个Eigen版本不认识all，所以只能另想办法。
参考：Slicing and Indexing

4、类似 where的功能，生成mask

复制代码

1
2
3
4
5
6
7
8
9
10
11
void test_matrix()
{
	MatrixXd A(4, 4);
	A << 11, 10, 13, 15,
		3, 24, 56, 1,
		2, 12, 2, 0,
		8, 5, 6, 4;
	MatrixXi indices = (A.array() < 3).cast<int>();
	cout << "indices:n" << indices << "nn";
}

输出结果：

复制代码

5、reshape 改变形状元素个数不变

比如44变成28，2D变成1D拉平。
在这里插入图片描述

参考：Reshape

6、广播机制

广播是针对vector的，将vector沿行/列重复构建一个matrix，便于后期运算。

复制代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
int main()
{
  Eigen::MatrixXf mat(2,4);
  Eigen::VectorXf v(2);
  
  mat << 1, 2, 6, 9,
         3, 1, 7, 2;
         
  v << 0,
       1;
       
  //add v to each column of m
  mat.colwise() += v;
  
  std::cout << "Broadcasting result: " << std::endl;
  std::cout << mat << std::endl;
}

输出：

复制代码

1
2
3
4
Broadcasting result: 
1 2 6 9
4 2 8 3

注意：对Array类型，*=，/=和/这些操作可以进行行/列级的操作，但不适用于Matrix，因为会与矩阵乘混淆。
结合广播和其他操作
示例：计算矩阵中哪列与目标向量距离最近。

复制代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
int main()
{
  Eigen::MatrixXf m(2,4);
  Eigen::VectorXf v(2);
  
  m << 1, 23, 6, 9,
       3, 11, 7, 2;
       
  v << 2,
       3;
  MatrixXf::Index index;
  // find nearest neighbour
  (m.colwise() - v).colwise().squaredNorm().minCoeff(&index);
  cout << "Nearest neighbour is column " << index << ":" << endl;
  cout << m.col(index) << endl;
}

输出

复制代码

1
2
3
4
Nearest neighbour is column 0:
1
3

参考：归约、迭代器和广播
参考：Reductions
参考：

二维浮点型张量计算矩阵乘积

复制代码

1
2
3
4
5
6
7
8
void test_tensor_matrix_multi(const Eigen::Tensor<float, 2> input1, const Eigen::Tensor<float, 2> input2)
{
    // Compute the traditional matrix product
    Eigen::array<Eigen::IndexPair<float>, 1> product_dims = { Eigen::IndexPair<float>(1, 0) };
    Eigen::Tensor<float, 2> AB = input1.contract(input2, product_dims);
    std::cout << "AB n" << AB << std::endl;
}