Booz Allen Hamilton Colloquium: "Digital Signal Processing on Graphs"
Friday, October 19, 2012
3:00 p.m. Room 1110, Jeong H. Kim Engineering Bldg.
For More Information:
301 405 4471 firstname.lastname@example.org http://www.ece.umd.edu/colloquium
Booz Allen Hamilton Distinguished Colloquium in Electrical and Computer Engineering
Data, big or small, in social networks, evolutionary dynamics, the world-wide-web, or citation networks are indexed by social agents, individuals of a population, web sites, or authors all very different from time marks or image pixels. The relations among these data are captured by a graph and not as simple as with data samples in traditional time series, speech or audio signals, nor as with color samples in images, video, or other multidimensional signals. We extend the traditional concepts, tools, and algorithms in discrete signal processing (DSP), including shift, filter, impulse and frequency response, spectrum, Fourier transform and others and use them to analyze and process signals defined in graphs. Applications illustrate our framework.
(Work with Dr. Aliaksei Sandryhaila and graduate student Stephen Kruzick.)
José M. F. Moura is a University Professor at Carnegie Mellon University. His research interests are in statistical and algebraic signal processing with current projects emphasizing signal processing on graphs and distributed signal and information processing. He is the principal investigator of Spiral (www.spiral.net), an interdisciplinary project that develops a tool for automatic generation of software (codes), hardware (e.g., FPGA Verilog), or co-designed hardware/software high quality implementations of signal processing applications for the modern multicore computing architectures. He is currently IEEE Board and Division IX Director, he was President of the IEEE Signal Processing Society, and was Editor in Chief for the Transactions on Signal Processing.