Алгоритмы линейной алгебры — это самый низший уровень любого мало-мальски значащего математического пакета. И от их эффективности в значительной мере зависит и эффективность самого пакета. Предлагаю к рассмотрению сравнение моих разработок в этой области и пакета Intel MKL, который претендует на лидерство в этой области: русскоязычная версия http://software.intel.com/ru-ru/forums/showpost.php?p=128709 англоязычная версия...
Iterative Closest Point ( ICP ) is an algorithm employed to minimize the difference between two clouds of points. ICP is often used to reconstruct 2D or 3D surfaces from different scans, to localize robots and achieve optimal path planning (especially when wheel odometry is unreliable due to slippery terrain), to co-register bone models, etc.
The algorithm is conceptually simple and is commonly used in real-time. It iteratively revises the transformation (translation, rotation) needed to minimize the distance between the points of two raw scans.
Inputs: points from two raw scans, initial estimation of the transformation, criteria for stopping the iteration.
Output: refined transformation.
Essentially the algorithm steps are :
Associate...
The algorithm is conceptually simple and is commonly used in real-time. It iteratively revises the transformation (translation, rotation) needed to minimize the distance between the points of two raw scans.
Inputs: points from two raw scans, initial estimation of the transformation, criteria for stopping the iteration.
Output: refined transformation.
Essentially the algorithm steps are :
Associate...
- « Previous
- 1
- Next »
