LIE GENERATORS FOR COMPUTING STEERABLE FUNCTIONS

Authors
Citation
Pc. Teo et Y. Helor, LIE GENERATORS FOR COMPUTING STEERABLE FUNCTIONS, Pattern recognition letters, 19(1), 1998, pp. 7-17
Citations number
15
Categorie Soggetti
Computer Science Artificial Intelligence","Computer Science Artificial Intelligence
Journal title
ISSN journal
01678655
Volume
19
Issue
1
Year of publication
1998
Pages
7 - 17
Database
ISI
SICI code
0167-8655(1998)19:1<7:LGFCSF>2.0.ZU;2-7
Abstract
We present a computational, group-theoretic approach to steerable func tions. The approach is group-theoretic in that the treatment involves continuous transformation groups for which elementary Lie group theory may be applied. The approach is computational in that the theory is c onstructive and leads directly to a procedural implementation. For fun ctions that are steerable with n basis functions under a k-parameter g roup, the procedure is efficient in that at most nk + 1 iterations of the procedure are needed to compute all the basis functions. Furthermo re, the procedure is guaranteed to return the minimum number of basis functions. If the function is not steerable, a numerical implementatio n of the procedure could be used to compute basis functions that appro ximately steer the function over a range of transformation parameters. Examples of both applications are described. (C) 1998 Elsevier Scienc e B.V.