The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1989 vol.11)
pp: 1228-1232
ABSTRACT
<p>The authors describe a numerical procedure for solving problems involving minimization over the rotation group of quadratic forms which arise in connection with problems of computer vision. The algorithm presented is a sequential quadratic programming method which takes advantage of the special structure of the problem constraints. It is demonstrate that the method is globally convergent.</p>
INDEX TERMS
minimisation; convergence; globally convergent algorithm; rotation group; quadratic forms; computer vision; sequential quadratic programming; minimisation; quadratic programming
CITATION
C. Gurwitz, M.L. Overton, "A Globally Convergent Algorithm for Minimizing Over the Rotation Group of Quadratic Forms", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.11, no. 11, pp. 1228-1232, November 1989, doi:10.1109/34.42863
14 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool