Algorithms for Fast Convolutions on Motion Groups

Applied and Computational Harmonic Analysis

Volumn 9, Issue 2, 2000, Pages 220-241

  Kyatkin, Alexander B ^a   Chirikjian, Gregory S ^a  

^a Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141845411     PISSN: 10635203     EISSN: None     Source Type: Journal    
DOI: 10.1006/acha.2000.0321     Document Type: Article

References (37)

1. Aho A. V., Hopcroft J. E., Ullman J. D. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading.
2. Borodin A., Munro I. The Computational Complexity of Algebraic and Numerical Problems. 1975;Elsevier, New York.
3. Bucci O. M., Gennarelli C., Savarese C. Fast and accurate near-field-far-field transformation by sampling interpolation of plane polar measurements. IEEE Trans. Antennas Propagation. 39:1991;48-55.
4. Chirikjian G. S., Ebert-Uphoff I. Numerical Convolution on the Euclidean group with applications to workspace generation. IEEE Trans. Robot. Automat. 14:1998;123-136.
5. G. S. Chirikjian, Conformational statistics of macromolecules using generalized convolution, Comput. Theoret. Polym. Sci, in press.
6. Chirikjian G. S., Kyatkin A. B. Engineering Applications of Noncommutative Harmonic Analysis. 2000;CRC Press, Boca Raton.
7. Choi H., Munson D. C. Direct-Fourier reconstruction in tomography and synthetic aperture radar. Int. J. Imag. Syst. Technol. 9:1998;1-13.
8. n and GL(n). 1966;Queen's University, Kingston.
9. Cooley J. W., Tukey J. An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19:1965;297-301.
10. Danielsson P.-E., Hammerin M. High-accuracy rotation of images. CVGIP: Graphical Models Image Process. 54:1992;340-344.
11. Deans S. R. The Radon Transform and Some of Its Applications. 1983;Wiley, New York.
12. Driscoll J. R., Healy D. Computing Fourier transforms and convolutions on the 2-sphere. Adv. Appl. Math. 15:1994;202-250.
13. Driscoll J. R., Healy D., Rockmore D. N. Fast discrete polynomial transform with applications to data analysis for distance transitive graphs. SIAM J. Comput. 26:1997;1066-1099.
14. Ebert-Uphoff I., Chirikjian G. S. Efficient workspace generation for binary manipulators with many actuators. J. Robot. Syst. 12:1995;383-400.
15. Elliott D. F., Rao K. R. Fast Transforms: Algorithms, Analyses, Applications. 1982;Academic Press, New York.
16. Fraser D., Schowengerdt R. A. Avoidance of additional aliasing in multipass image rotations. IEEE Trans. Image Process. 3:1994;721-735.
17. Gauthier J. P., Barnard G., Sibermann M. Motion and pattern analysis: Harmonic analysis on motion groups and their homogeneous spaces. IEEE Trans. Syst. Man Cybern. 21:1991;159-172.
18. Gurarie D. Symmetry and Laplacians. Introduction to Harmonic Analysis, Group Representations and Applications. 1992;Elsevier, Amsterdam.
19. Kyatkin A. B., Chirikjian G. S. Template matching as a correlation on the discrete motion group. Comput. Vision Image Understanding. 74:1999;22-35.
20. A. B. Kyatkin, and, G. S. Chirikjian, An operational calculus for the Euclidean motion group with applications in robotics and polymer science, J. Fourier Anal. Appl, in press.
21. Kyatkin A. B., Chirikjian G. S. Synthesis of binary manipulators using the Fourier transform on the Euclidean group. ASME J. Mech. Design. 21:1999;9-14.
22. Larkin K. G., Oldfield M. A., Klemm H. Fast Fourier method for the accurate rotation of sampled images. Opt. Commun. 139:1997;99-106.
23. Maslen D. K., Rockmore D. N. Generalized FFTs - A survey of some recent results. DIMACS Ser. Disc. Math. Theoret. Comput. Sci. 28:1997;183-237.
24. W. Miller, Lie Theory and Special Functions, Academic Press, New York, 1968; W. Miller, Some applications of the representation theory of the Euclidean group in three-space, Commun. Pure Appl. Math.171964, 527-540.
25. W. Miller, Lie Theory and Special Functions, Academic Press, New York, 1968; W. Miller, Some applications of the representation theory of the Euclidean group in three-space, Commun. Pure Appl. Math.171964, 527-540.
26. Paeth A. W. A fast algorithm for general raster rotation. Glassner A. S. Graphics Gems. 1990;179-195 Academic Press, Boston.
27. Pan S. X., Kak A. C. A computational study of reconstruction algorithms for diffraction tomography: Interpolation versus filtered back-propagation. IEEE Trans. Acoust. Speech Signal Process. ASSP-31:1983;1262-1275.
28. Pan V. How can we speed up matrix multiplication. SIAM Rev. 26:1984;393-416.
29. Pan V. How to Multiply Matrices Fast. 1984;Springer-Verlag, Berlin.
30. Speath H. Two Dimensional Spline Interpolation Algorithms. 1995;AK Peters, Wellesley.
31. Strassen V. Gaussian elimination is not optimal. Numer. Math. 13:1969;354-356.
32. Talman J. Special Functions. 1968;W. A. Benjamin, Amsterdam.
33. Unser M., Thévenaz P., Yaroslavsky L. Convolution-based interpolation for fast, high-quality rotation of images. IEEE Trans. Image Process. 4:1995;1371-1381.
34. Vilenkin N. J. Bessel functions and representations of the group of Euclidean motions. Uspekhi Mat. Nauk. 11:1956;69-112.
35. Vilenkin N. J., Klimyk A. U. Representation of Lie Group and Special Functions. 1991;Kluwer Academic, The Netherlands.
36. Winograd S. A new algorithm for inner products. IEEE Trans. Comput. C-17:1968;693-694.
37. Yaghjian A. D., Woodworth M. B. Sampling in plane-polar coordinates. IEEE Trans. Antennas Propagation. 44:1996;696-700.