This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Globally Convergent Algorithm for Minimizing Over the Rotation Group of Quadratic Forms
November 1989 (vol. 11 no. 11)
pp. 1228-1232

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.

[1] N. Ayache and O. D. Faugeras, "Maintaining representations of the environment of a mobile robot," inInt. Symp. Robotics Research, Santa Cruz, CA, Aug. 1987.
[2] O. D. Faugeras, F. Lustman, and G. Toscani, "Motion and structure from motion from point and line matches," inProc. First Int. Conf. Comput. Vision, 1987, pp. 25-34.
[3] R. Fletcher,Practical Methods of Optimization. New York: Wiley, 1987.
[4] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, "Software and its relationship to methods," inNumerical Optimization 1984, P. T. Boggs, R. H. Byrd, and R. B. Schnabel, Eds. Philadelphia, PA: 1985, pp. 139-159.
[5] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, "Some issues in implementing a sequential quadratic programming algorithm,"ACM Signum Newsletter, vol. 20, no. 2, pp. 13- 19, 1985.
[6] P. E. Gill, W. Murray, and M. H. Wright,Practical Optimization. New York: Academic, 1981.
[7] C. B. Gurwitz, "Sequential quadratic programming methods based on approximating a projected Hessian matrix," Ph.D. dissertation Computer Sci. Dep., New York Univ., New York, Tech. Rep. 219, 1986.
[8] S.-P. Han, "Superlinearly convergent variable metric algorithms for general nonlinear programming problems,"Math. Prog., vol. 11, pp. 263-282, 1976.
[9] D. G. Lowe, "The viewpoint consistency constraint,"Int. J. Comput. Vision, vol. 1, pp. 57-72, 1987.
[10] W. Murray, and M. H. Wright, "Computation of the search direction in constrained optimization algorithms,"Math. Prog. Study, vol. 16, pp. 62-83, 1982.
[11] J. Nocedal and M. L. Overton, "Projected Hessian updating algorithms for nonlinearly constrained optimization,"SIAM J. Num. Anal., vol. 22, pp. 821-850, 1985.
[12] M. J. D. Powell, "The convergence of variable metric methods for nonlinearly constrained optimization calculations," inNonlinear Programming 3, O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Eds. New York: Academic, 1978, pp. 27-63.
[13] J. T. Schwartz and M. Sharir, "Identification of partially obscured objects in two dimensions by matching of noisy 'characteristic curves'," Tech. Rep. 165, Robotics Rep. 46, Dep. Comput. Sci., New York Univ, June 1985.

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 and Machine Intelligence, vol. 11, no. 11, pp. 1228-1232, Nov. 1989, doi:10.1109/34.42863
Usage of this product signifies your acceptance of the Terms of Use.