栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 软件开发 > 后端开发 > C/C++/C#

C++计算矩阵伪逆

C/C++/C# 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

C++计算矩阵伪逆

计算伪逆1

vector> vec_jac{ {ImgJaco(0, 0), ImgJaco(0, 1), ImgJaco(0, 2), ImgJaco(0, 3), ImgJaco(0, 4), ImgJaco(0, 5)},
								  {ImgJaco(1, 0), ImgJaco(1, 1), ImgJaco(1, 2), ImgJaco(1, 3), ImgJaco(1, 4), ImgJaco(1, 5)},
								  {ImgJaco(2, 0), ImgJaco(2, 1), ImgJaco(2, 2), ImgJaco(2, 3), ImgJaco(2, 4), ImgJaco(2, 5)},
								  {ImgJaco(3, 0), ImgJaco(3, 1), ImgJaco(3, 2), ImgJaco(3, 3), ImgJaco(3, 4), ImgJaco(3, 5)},
								  {ImgJaco(4, 0), ImgJaco(4, 1), ImgJaco(4, 2), ImgJaco(4, 3), ImgJaco(4, 4), ImgJaco(4, 5)},
								  {ImgJaco(5, 0), ImgJaco(5, 1), ImgJaco(5, 2), ImgJaco(5, 3), ImgJaco(5, 4), ImgJaco(5, 5)},
								  {ImgJaco(6, 0), ImgJaco(6, 1), ImgJaco(6, 2), ImgJaco(6, 3), ImgJaco(6, 4), ImgJaco(6, 5)},
								  {ImgJaco(7, 0), ImgJaco(7, 1), ImgJaco(7, 2), ImgJaco(7, 3), ImgJaco(7, 4), ImgJaco(7, 5)}, };

	Mat mat(8, 6, CV_32FC1);
	for (int y = 0; y < 8; ++y) {
		for (int x = 0; x < 6; ++x) {
			mat.at(y, x) =  20*vec_jac[y][x];
		}
	}

	Mat vec_jac_inv;
	invert(mat, vec_jac_inv, cv::DECOMP_SVD);

	MatrixXd ImgJaco_inv(6, 8);
	for (int x = 0; x < 6; x++)
	{
		for (int y = 0; y < 8; y++)
		{
			ImgJaco_inv(x, y) = vec_jac_inv.at(x, y);
		}
	}

	cout << "jacobian矩阵的伪逆" << endl << ImgJaco_inv << endl;

计算伪逆2

MatrixXd pinv(MatrixXd  A)
{
	JacobiSVD svd(A, ComputeFullU | ComputeFullV);
	double  pinvtoler = 1.e-8; //tolerance
	int row = A.rows();
	int col = A.cols();
	int k = min(row, col);
	MatrixXd X = MatrixXd::Zero(col, row);
	MatrixXd singularValues_inv = svd.singularValues();//奇异值
	MatrixXd singularValues_inv_mat = MatrixXd::Zero(col, row);
	for (long i = 0; i < k; ++i) {
		if (singularValues_inv(i) > pinvtoler)
			singularValues_inv(i) = 1.0 / singularValues_inv(i);
		else singularValues_inv(i) = 0;
	}
	for (long i = 0; i < k; ++i)
	{
		singularValues_inv_mat(i, i) = singularValues_inv(i);
	}
	X = (svd.matrixV()) * (singularValues_inv_mat) * (svd.matrixU().transpose());

	return X;
}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/980169.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号