问题描述
大家好！
目前，我面临着创建应用程序的任务，该应用程序可以解决不同投影中的相机位置.该过程严重依赖于求解n×m矩阵的最小解，其中m(高度)＞ 1. n(宽度).该解决方案是通过计算SVD获得的.目前，我在这一领域没有受过适当的教育，因此，我不确定自己开始实施它是否是一个好主意.任何人都可以提供一些伪代码或任何一种指导我的指南，以使它不会花费比必要更多的时间吗?其他选择是使用一些外部功能.我不希望我的应用程序仅依赖于jet来进行安装，因此，如果有人可以提供可以包含在项目中的库，将不胜感激.我正在使用Windows窗体应用程序C ++.提前谢谢.
Peter
Hello everybody !
Currently I am facing task of creating application that solves camera position from different projections. This process rely heavily on solving minimal solution of n x m matrix where m (height) > n (width). This solution is obtained by calculating SVD. Currently I am not properly educated in this area therefore I am not sure if it is a good idea to start implementing it on my own. Could anybody provide some pseudo code ore any kind of guideline that would lead me so that it wont take more time than necessary ? Other choice is to use some external functions. I don''t want my application to by installation dependent just jet , so if somebody could provide library that could be included in project it would be very appreciated. I am working on windows form application , c++. Thanks in advance.
Peter
推荐答案
这篇关于奇异值分解的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！