Daniel N. Rockmore

Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs

Let

Quantification of artistic style through sparse coding analysis in the drawings of Pieter Bruegel the Elder.

\poly = \{P_0,\dots,P_{n-1}\}

Quantitative patterns of stylistic influence in the evolution of literature

denote a set of polynomials with complex coefficients. Let

The FFT: an algorithm the whole family can use

\pts = \{z_0,\dots,z_{n-1}\}\subset \cplx

A wreath product group approach to signal and image processing .I. Multiresolution analysis

denote any set of {\it sample points}. For any

Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II

f = (f_0,\dots,f_{n-1}) \in \cplx^n

Nonparametric Sparsification of Complex Multiscale Networks

, the {\it discrete polynomial transform} of

Mapping the similarity space of paintings: Image statistics and visual perception

f

Evolution of community structure in the world trade web

(with respect to

Cyclic renormalization and automorphism groups of rooted trees

\poly