A computational approach to steerable functions

We present a computational, group-theoretic approach to steerable functions. 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 constructive and leads directly to a procedural implementation. For functions that are steerable with n finite number of basis functions under a k-parameter group, the procedure is efficient and is guaranteed to return the minimum number of basis functions. If the function is not steerable, a numerical implementation of the procedure could also be used to compute basis functions that approximately steer the function over a range of transformation parameters. Examples of both applications are demonstrated