By Topic

Matching schemes using the steepest-ascent/descent methods

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
P.Lie Chin Cheong ; Dept. of Electr. Eng., McGill Univ., Montreal, Que., Canada ; Morgera, S.D.

A tool is presented for solving some types of pattern matching problems using the method of steepest-descent/ascent. These matching problems can be recast as function maximization problems with the functions to be maximized being constrained over the orthogonal group. The optimization of these functions is then performed using the steepest-ascent algorithm. This is made possible by representing the orthogonal group as a Lie group and then investigating the gradient vector field associated with the function to be maximized or minimized. Since the orthogonal group includes the group of permutations as a subgroup, the proposed procedure works not only for the continuous optimization problem, but also for the combinatorial problem. The conditions for the convergence of the steepest-ascent algorithms are also shown and simulations are performed

Published in:

Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference on

Date of Conference:

14-17 Apr 1991