A fast hermite transform with applications to protein structure determination

Authors:
Greg Leibon;Daniel Rockmore;Gregory Chirikjian
Affiliations:
Dartmouth College, Hanover, NH;Dartmouth College, Hanover, NH;JHU, Baltimore, MD
Venue:
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Year:
2007

Citing 5
Cited 3

Numerical recipes in C: the art of scientific computing

Numerical recipes in C: the art of scientific computing
Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs

SIAM Journal on Computing
Principles of computerized tomographic imaging

Principles of computerized tomographic imaging
Tellegen's principle into practice

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Ab initio reconstruction and experimental design for cryo electron microscopy

IEEE Transactions on Information Theory

Power series composition and change of basis

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
A fast Hermite transform

Theoretical Computer Science
Accurate image rotation using Hermite expansions

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss algorithms for a fast and stable approximation of the Hermite transform of a compactly supported function on the real line, attainable via an application of a fast algebraic algorithm for computing sums associated to a three-term relation. Trade-offs between approximation in bandwidth (in the Hermite sense) and size of the support region are addressed. Generalizations to any family of orthogonal polynomials are outlined. Applications to the determination of protein structure are discussed.