使用Levenberg Marquardt算法的同位素计算 [英] Homography computation using Levenberg Marquardt algorithm

问题描述

OpenCV中的findHomography（）函数找到两个平面之间的透视变换。使用Levenberg-Marquardt方法进一步细化计算的单应性矩阵（仅在鲁棒方法的情况下使用内点）以减少重投影误差更多。任何人都可以提供任何链接到C / C ++代码到Levenberg Marquardt算法，这是需要最小化的错误函数，因为它将帮助我理解算法背后的数学。

The findHomography() function in OpenCV finds a perspective transformation between two planes.The computed homography matrix is refined further (using inliers only in case of a robust method) with the Levenberg-Marquardt method to reduce the re-projection error even more. Can anyone provide any links to C/C++ code to the Levenberg Marquardt algorithm which is required to minimize the error function, as it will help me to understand the mathematics behind the algorithm. (Everywhere in the net ,only libraries or specific codes have been uploaded but not the detailed code to the algorithm).

推荐答案

我已经上传了图书馆或特定的代码，知道它不是C / C ++，但是Matlab文件交换的文件可能有可以帮助你的源代码：

I know it's not C/C++, but the file on the Matlab file exchange might have source code that could help you:

http://www.mathworks.com/matlabcentral/fileexchange/16063

如果你理解C / C ++，你可能没有理解Matlab的问题，特别是如果你正在寻找源代码以提高你的理解。

If you understand C/C++ you will probably have no problem understanding Matlab, especially if you're looking at source code for the purposes of furthering your understanding.

这篇关于使用Levenberg Marquardt算法的同位素计算的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！